Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$125.69
Used and New from Other Sellers
Used and New from Other Sellers
from $117.56
Usually ships in 1-2 business days
(Save 34%)
Other sellers (Paperback)
  • All (9) from $117.56   
  • New (6) from $117.56   
  • Used (3) from $135.73   

More About This Textbook

Overview

The two-volume set LNCS 6198 and LNCS 6199 constitutes the refereed proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, held in Bordeaux, France, in July 2010.
The 106 revised full papers (60 papers for track A, 30 for track B, and 16 for track C) presented together with 6 invited talks were carefully reviewed and selected from a total of 389 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management. LNCS 6198 contains 60 contributions of track A selected from 222 submissions as well as 2 invited talks.

Read More Show Less

Product Details

Table of Contents

Invited Talks

Local Search: Simple, Successful, But Sometimes Sluggish 1

When Conflicting Constraints Can be ResolvedThe Lovasz Local Lemma and Satisfiability (Abstract) Tobias Tscheuschner Tscheuschner, Tobias 18

Session 1-Track A Combinatorial Optimization Emo Welzl Welzl, Emo

Plane Spanners of Maximum Degree Six Emo Welzl Welzl, Emo 19

The Positive Semidefinite Grothendieck Problem with Rank Constraint Ljubomir Perkovic Perkovic, Ljubomir 31

Cycle Detection and Correction Frank Vallentin Vallentin, Frank 43

Decomposition Width of Matroids Natalie Shapira Shapira, Natalie 55

Session 2-Track A1 Game Theory Daniel KrÂnl' KrÂnl', Daniel

The Cooperative Game Theory Foundations of Network Bargaining Games Daniel KrÂnl' KrÂnl', Daniel 67

On the Existence of Pure Nash Equilibria in Weighted Congestion Games Hamid Mahini Mahini, Hamid 79

On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions Max Klimm Klimm, Max 90

Mean-Payoff Games and Propositional Proofs Brendan Lucier Lucier, Brendan 102

Session 2-Track A2 Security Elitza Maneva Maneva, Elitza

Online Network Design with Outliers Elitza Maneva Maneva, Elitza 114

Efficient Completely Non-malleable Public Key Encryption Piotr Sankowski Sankowski, Piotr 127

Polynomial-Space Approximation of No-Signaling Provers Moti Yung Yung, Moti 140

From Secrecy to Soundness: Efficient Verification via Secure Computation (Extended Abstract) Tsuyoshi Ito Ito, Tsuyoshi 152

Session 3-Track A1 Data Structures Eyal Kushilevitz Kushilevitz, Eyal

Mergeable Dictionaries Eyal Kushilevitz Kushilevitz, Eyal 164

Faster Algorithms for Semi-matching Problems (Extended Abstract) ®zg�r ®zkan ®zkan, ®zg�r 176

Clustering with Diversity Danupon Nanongkai Nanongkai, Danupon 188

New Data Structures for Subgraph Connectivity Qin Zhang Qin, Zhang 201

Session 3-Track A2 Sorting & Hashing Ran Duan Ran, Duan

Tight Thresholds for Cuckoo Hashing via XORSAT (Extended Abstract) Ran Duan Ran, Duan 213

Resource Oblivious Sorting on Multicores Michael Rink Rink, Michael 226

Interval Sorting Vijaya Ramachandran Ramachandran, Vijaya 238

Session 4-Track A Graphs, Nets and Optimization Conrado Martinez Martinez, Conrado

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems Conrado Martinez Martinez, Conrado 250

Thresholded Covering Algorithms for Robust and Max-min Optimization Subhash Khot Khot, Subhash 262

Graph Homomorphisms with Complex Values: A Dichotomy Theorem (Extended Abstract) R. Ravi Ravi, R. 275

Metrical Task Systems and the k-Server Problem on HSTs Pinyan Lu Lu, Pinyan 287

Session 5-Track A1 Scheduling Joseph (Seffi) Naor Naor, Joseph (Seffi)

Scheduling Periodic Tasks in a Hard Real-Time Environment Joseph (Seffi) Naor Naor, Joseph (Seffi) 299

Scalably Scheduling Power-Heterogeneous Processors Andreas Wiese Wiese, Andreas 312

Better Scalable Algorithms for Broadcast Scheduling Kirk Pruhs Pruhs, Kirk 324

Max-min Online Allocations with a Reordering Buffer Viswanath Nagarajan Nagarajan, Viswanath 336

Session 5-Track A2 Graphs & Hypergraphs Rob van Stee van Stee, Rob

Orientability of Random Hypergraphs and the Power of Multiple Choices Rob van Stee van Stee, Rob 348

On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs Konstantinos Panagiotou Panagiotou, Konstantinos 360

Dynamic Programming for Graphs on Surfaces Rishi Saket Saket, Rishi 372

Interval Graphs: Canonical Representation in Logspace Dimitrios M. Thilikos Thilikos, Dimitrios M. 384

Session 6-Track A Best Paper Award Oleg Verbitsky Verbitsky, Oleg

Approximating the Partition Function of the Ferromagnetic Potts Model Oleg Verbitsky Verbitsky, Oleg 396

Session 7-Track A Algebraic Problems Mark Jerrum Jerrum, Mark

On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors Mark Jerrum Jerrum, Mark 408

On Sums of Roots of Unity Ilya Volkovich Volkovich, Ilya 420

Exponential Time Complexity of the Permanent and the Tutte Polynomial (Extended Abstract) Bruce Litow Litow, Bruce 426

On Approximate Horn Formula Minimization Martin WahlÃun WahlÃun, Martin 438

Session 8-Track A Networks & Communication Complexity Gyîrgy TurÂnn TurÂnn, Gyîrgy

Choosing, Agreeing, and Eliminating in Communication Complexity Gyîrgy TurÂnn TurÂnn, Gyîrgy 451

Additive Spanners in Nearly Quadratic Time Enav Weinreb Weinreb, Enav 463

Composition Theorems in Communication Complexity David P. Woodruff Woodruff, David P. 475

Network Design via Core Detouring for Problems without a Core Shengyu Zhang Zhang, Shengyu 490

Session 9-Track A1 Complexity & Automata Thomas Rothvoà RothvoÃ, Thomas

Weak Completeness Notions for Exponential Time Thomas Rothvoà RothvoÃ, Thomas 503

Efficient Evaluation of Nondeterministic Automata Using Factorization Forests Timur Bakibayev Bakibayev, Timur 515

On the Complexity of Searching in Trees: Average-Case Minimization Pawel Parys Parys, Pawel 527

Session 9-Track A2 Finding & Testing Marco Molinaro Molinaro, Marco

Finding Is as Easy as Detecting for Quantum Walks Marco Molinaro Molinaro, Marco 540

Improved Constructions for Non-adaptive Threshold Group Testing JÃurÃumie Roland Roland, JÃurÃumie 552

Testing Non-uniform k-Wise Independent Distributions over Product Spaces (Extended Abstract) Mandi Cheraghchi Cheraghchi, Mandi 565

Session 10-Track A1 Approximations Ning Xie Ning, Xie

A Sublogarithmic Approximation for Highway and Tollbooth Pricing Ning Xie Ning, Xie 582

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm Danny Segev Segev, Danny 594

Cell Probe Lower Bounds and Approximations for Range Mode Maxim Sviridenko Sviridenko, Maxim 605

SDP Gaps for 2-to-1 and Other Label-Cover Variants Jakob Truelsen Truelsen, Jakob 617

Session 10-Track A2 Streaming & Preprocessing Yi Wu Yi, Wu

Data Stream Algorithms for Codeword Testing (Extended Abstract) Yi Wu Yi, Wu 629

Streaming Algorithms for Independent Sets Steve Uurtamo Uurtamo, Steve 641

Preprocessing of Min Ones Problems: A Dichotomy Mario Szegedy Szegedy, Mario 653

Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems Magnus Wahlstrîm Wahlstrîm, Magnus 666

Session 11-Track A1 Adaptive, Knowledge & Optimality Mingji Xia Xia, Mingji

Optimal Trade-Offs for Succinct String Indexes Mingji Xia Xia, Mingji 678

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems Rajeev Raman Raman, Rajeev 690

Concurrent Knowledge Extraction in the Public-Key Model R. Ravi Ravi, R. 702

Session 11-Track A2 Covering, Graphs & Independence Yunlei Zhao Zhao, Yunlei

On the k-Independence Required by Linear Probing and Minwise Independence Yunlei Zhao Zhao, Yunlei 715

Covering and Packing in Linear Space Mikkel Thorup Thorup, Mikkel 727

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs Mikko Koivisto Koivisto, Mikko 738

Author Index Loukas Georgiadis Georgiadis, Loukas 751

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)