Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings

  • Conference proceedings
  • © 2007

Access provided by Autonomous University of Puebla

Download book PDF

Overview

Editors:
  1. Lars Arge
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christian Cachin
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tomasz Jurdziński
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Andrzej Tarlecki
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4596)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICALP 2007.

Buy print copy

Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Keywords

Table of contents (81 papers)

  1. Front Matter

    Download chapter PDF

  3. Session A1

    1. Competitive Algorithms for Due Date Scheduling

      • Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
      Pages 28-39
      Download chapter PDF

    2. Mechanism Design for Fractional Scheduling on Unrelated Machines

      • George Christodoulou, Elias Koutsoupias, Annamária Kovács
      Pages 40-52
      Download chapter PDF

  4. Session A2

    1. Estimating Sum by Weighted Sampling

      • Rajeev Motwani, Rina Panigrahy, Ying Xu
      Pages 53-64
      Download chapter PDF

    2. Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima

      • Johannes Blömer, Stefanie Naewe
      Pages 65-77
      Download chapter PDF

  6. Session A4

    1. Unbounded-Error One-Way Classical and Quantum Communication Complexity

      • Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
      Pages 110-121
      Download chapter PDF

    2. A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

      • Ashley Montanaro, Andreas Winter
      Pages 122-133
      Download chapter PDF

    3. Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity

      • Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
      Pages 134-145
      Download chapter PDF

  7. Session A5

    1. An Optimal Decomposition Algorithm for Tree Edit Distance

      • Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
      Pages 146-157
      Download chapter PDF

    2. On Commutativity Based Edge Lean Search

      • Dragan Bošnački, Edith Elkind, Blaise Genest, Doron Peled
      Pages 158-170
      Download chapter PDF

    3. Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems

      • Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
      Pages 171-182
      Download chapter PDF

  8. Session A6

    1. On the Complexity of Hard-Core Set Constructions

      • Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
      Pages 183-194
      Download chapter PDF

    2. Approximation by DNF: Examples and Counterexamples

      • Ryan O’Donnell, Karl Wimmer
      Pages 195-206
      Download chapter PDF
Back to top

Other volumes

  1. Automata, Languages and Programming

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation