Automata, Languages and Programming

34th International Colloquium, ICALP 2007, Wrocław, Poland, July 9-13, 2007. Proceedings

ISBN: 978-3-540-73419-2 (Print) 978-3-540-73420-8 (Online)

Table of contents (81 chapters)

previous Page of 5
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-1

      Ushering in a New Era of Algorithm Design

    2. No Access

      Book Chapter

      Pages 2-11

      A “proof-reading” of Some Issues in Cryptography

    3. No Access

      Book Chapter

      Pages 12-14

      Credentials-Based Authorization: Evaluation and Implementation

    4. No Access

      Book Chapter

      Pages 15-27

      Subexponential Parameterized Algorithms

  3. Session A1

    1. No Access

      Book Chapter

      Pages 28-39

      Competitive Algorithms for Due Date Scheduling

    2. No Access

      Book Chapter

      Pages 40-52

      Mechanism Design for Fractional Scheduling on Unrelated Machines

  4. Session A2

    1. No Access

      Book Chapter

      Pages 53-64

      Estimating Sum by Weighted Sampling

    2. No Access

      Book Chapter

      Pages 65-77

      Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima

  5. Session A3

    1. No Access

      Book Chapter

      Pages 78-89

      Low Distortion Spanners

    2. No Access

      Book Chapter

      Pages 90-101

      Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

    3. No Access

      Book Chapter

      Pages 102-109

      Labeling Schemes for Vertex Connectivity

  6. Session A4

    1. No Access

      Book Chapter

      Pages 110-121

      Unbounded-Error One-Way Classical and Quantum Communication Complexity

    2. No Access

      Book Chapter

      Pages 122-133

      A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

    3. No Access

      Book Chapter

      Pages 134-145

      Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity

  7. Session A5

    1. No Access

      Book Chapter

      Pages 146-157

      An Optimal Decomposition Algorithm for Tree Edit Distance

    2. No Access

      Book Chapter

      Pages 158-170

      On Commutativity Based Edge Lean Search

    3. No Access

      Book Chapter

      Pages 171-182

      Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems

  8. Session A6

    1. No Access

      Book Chapter

      Pages 183-194

      On the Complexity of Hard-Core Set Constructions

    2. No Access

      Book Chapter

      Pages 195-206

      Approximation by DNF: Examples and Counterexamples

    3. No Access

      Book Chapter

      Pages 207-218

      Exotic Quantifiers, Complexity Classes, and Complete Problems

previous Page of 5