Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

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

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Samson Abramsky

    1. Oxford University Computing Laboratory, Oxford, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Cyril Gavoille

    1. Université de Bordeaux (LaBRI) & INRIA, 351, cours de la Libération, Talence Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Claude Kirchner

    1. INRIA, Centre de Recherche Bordeaux – Sud-Ouest, 351 cours de la Libération, Talence Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Friedhelm Meyer auf der Heide

    1. Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Paul G. Spirakis

    1. University of Patras and RACTI, Patras, Greece

    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 6198)

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

Included in the following conference series:

Conference proceedings info: ICALP 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (62 papers)

  1. Session 3-Track A2. Sorting & Hashing

    1. Resource Oblivious Sorting on Multicores

      • Richard Cole, Vijaya Ramachandran
      Pages 226-237

    2. Interval Sorting

      • Rosa M. Jiménez, Conrado Martínez
      Pages 238-249

  2. Session 4-Track A. Graphs, Nets and Optimization

    1. Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

      • Nikhil Bansal, Subhash Khot
      Pages 250-261

    2. Thresholded Covering Algorithms for Robust and Max-min Optimization

      • Anupam Gupta, Viswanath Nagarajan, R. Ravi
      Pages 262-274

    3. Graph Homomorphisms with Complex Values: A Dichotomy Theorem

      • Jin-Yi Cai, Xi Chen, Pinyan Lu
      Pages 275-286

    4. Metrical Task Systems and the k-Server Problem on HSTs

      • Nikhil Bansal, Niv Buchbinder, Joseph (Seffi) Naor
      Pages 287-298

  3. Session 5-Track A1. Scheduling

    1. Scheduling Periodic Tasks in a Hard Real-Time Environment

      • Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
      Pages 299-311

    2. Scalably Scheduling Power-Heterogeneous Processors

      • Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
      Pages 312-323

    3. Better Scalable Algorithms for Broadcast Scheduling

      • Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan
      Pages 324-335

    4. Max-min Online Allocations with a Reordering Buffer

      • Leah Epstein, Asaf Levin, Rob van Stee
      Pages 336-347

  4. Session 5-Track A2. Graphs & Hypergraphs

    1. Orientability of Random Hypergraphs and the Power of Multiple Choices

      • Nikolaos Fountoulakis, Konstantinos Panagiotou
      Pages 348-359

    2. On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs

      • Venkatesan Guruswami, Rishi Saket
      Pages 360-371

    3. Dynamic Programming for Graphs on Surfaces

      • Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos
      Pages 372-383

    4. Interval Graphs: Canonical Representation in Logspace

      • Johannes Köbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky
      Pages 384-395

  5. Session 6-Track A. Best Paper Award

    1. Approximating the Partition Function of the Ferromagnetic Potts Model

      • Leslie Ann Goldberg, Mark Jerrum
      Pages 396-407

  6. Session 7-Track A. Algebraic Problems

    1. On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

      • Amir Shpilka, Ilya Volkovich
      Pages 408-419

    2. On Sums of Roots of Unity

      • B. Litow
      Pages 420-425

    3. Exponential Time Complexity of the Permanent and the Tutte Polynomial

      • Holger Dell, Thore Husfeldt, Martin Wahlén
      Pages 426-437

    4. On Approximate Horn Formula Minimization

      • Amitava Bhattacharya, Bhaskar DasGupta, Dhruv Mubayi, György Turán
      Pages 438-450

  7. Session 8-Track A. Networks & Communication Complexity

    1. Choosing, Agreeing, and Eliminating in Communication Complexity

      • Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
      Pages 451-462
Back to top

Other volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Keywords

Editors and Affiliations

  • Oxford University Computing Laboratory, Oxford, UK

    Samson Abramsky

  • Université de Bordeaux (LaBRI) & INRIA, 351, cours de la Libération, Talence Cedex, France

    Cyril Gavoille

  • INRIA, Centre de Recherche Bordeaux – Sud-Ouest, 351 cours de la Libération, Talence Cedex, France

    Claude Kirchner

  • Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany

    Friedhelm Meyer auf der Heide

  • University of Patras and RACTI, Patras, Greece

    Paul G. Spirakis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation