Automata, Languages and Programming

37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I

ISBN: 978-3-642-14164-5 (Print) 978-3-642-14165-2 (Online)

Table of contents (62 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-17

      Local Search: Simple, Successful, But Sometimes Sluggish

    2. No Access

      Book Chapter

      Pages 18-18

      When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability

  3. Session 1-Track A. Combinatorial Optimization

    1. No Access

      Book Chapter

      Pages 19-30

      Plane Spanners of Maximum Degree Six

    2. No Access

      Book Chapter

      Pages 31-42

      The Positive Semidefinite Grothendieck Problem with Rank Constraint

    3. No Access

      Book Chapter

      Pages 43-54

      Cycle Detection and Correction

    4. No Access

      Book Chapter

      Pages 55-66

      Decomposition Width of Matroids

  4. Session 2-Track A1. Game Theory

    1. No Access

      Book Chapter

      Pages 67-78

      The Cooperative Game Theory Foundations of Network Bargaining Games

    2. No Access

      Book Chapter

      Pages 79-89

      On the Existence of Pure Nash Equilibria in Weighted Congestion Games

    3. No Access

      Book Chapter

      Pages 90-101

      On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions

    4. No Access

      Book Chapter

      Pages 102-113

      Mean-Payoff Games and Propositional Proofs

  5. Session 2-Track A2. Security

    1. No Access

      Book Chapter

      Pages 114-126

      Online Network Design with Outliers

    2. No Access

      Book Chapter

      Pages 127-139

      Efficient Completely Non-malleable Public Key Encryption

    3. No Access

      Book Chapter

      Pages 140-151

      Polynomial-Space Approximation of No-Signaling Provers

    4. No Access

      Book Chapter

      Pages 152-163

      From Secrecy to Soundness: Efficient Verification via Secure Computation

  6. Session 3-Track A1. Data Structures

    1. No Access

      Book Chapter

      Pages 164-175

      Mergeable Dictionaries

    2. No Access

      Book Chapter

      Pages 176-187

      Faster Algorithms for Semi-matching Problems (Extended Abstract)

    3. No Access

      Book Chapter

      Pages 188-200

      Clustering with Diversity

    4. No Access

      Book Chapter

      Pages 201-212

      New Data Structures for Subgraph Connectivity

  7. Session 3-Track A2. Sorting & Hashing

    1. No Access

      Book Chapter

      Pages 213-225

      Tight Thresholds for Cuckoo Hashing via XORSAT

    2. No Access

      Book Chapter

      Pages 226-237

      Resource Oblivious Sorting on Multicores

previous Page of 4