Automata, Languages, and Programming

41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I

  • Javier Esparza
  • Pierre Fraigniaud
  • Thore Husfeldt
  • Elias Koutsoupias
Conference proceedings ICALP 2014

DOI: 10.1007/978-3-662-43948-7

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

Table of contents (89 papers)

  1. Front Matter
  2. Invited Talks

  3. Track A: Algorithms, Complexity, and Games

    1. Weak Parity
      Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian
      Pages 26-38
    2. Consequences of Faster Alignment of Sequences
      Amir Abboud, Virginia Vassilevska Williams, Oren Weimann
      Pages 39-51
    3. Distance Labels with Optimal Local Stretch
      Ittai Abraham, Shiri Chechik
      Pages 52-63
    4. Time-Expanded Packings
      David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen
      Pages 64-76
    5. Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM
      Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis
      Pages 77-88
    6. The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average
      Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert
      Pages 89-100
    7. Tighter Relations between Sensitivity and Other Complexity Measures
      Andris Ambainis, Mohammad Bavarian, Yihan Gao, Jieming Mao, Xiaoming Sun, Song Zuo
      Pages 101-113
    8. On Hardness of Jumbled Indexing
      Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein
      Pages 114-125
    9. Morphing Planar Graph Drawings Optimally
      Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli
      Pages 126-137
    10. Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
      Surender Baswana, Shahbaz Khan
      Pages 138-149
    11. On the Role of Shared Randomness in Simultaneous Communication
      Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito
      Pages 150-162
    12. Short PCPs with Projection Queries
      Eli Ben-Sasson, Emanuele Viola
      Pages 163-173
    13. Star Partitions of Perfect Graphs
      René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier et al.
      Pages 174-185
    14. Coordination Mechanisms for Selfish Routing over Time on a Tree
      Sayan Bhattacharya, Janardhan Kulkarni, Vahab Mirrokni
      Pages 186-197
    15. On Area-Optimal Planar Graph Drawings
      Therese Biedl
      Pages 198-210
    16. Shortest Two Disjoint Paths in Polynomial Time
      Andreas Björklund, Thore Husfeldt
      Pages 211-222
    17. Listing Triangles
      Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, Uri Zwick
      Pages 223-234

Other volumes

  1. Automata, Languages, and Programming
    41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I
  2. Automata, Languages, and Programming
    41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II

About these proceedings

Introduction

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

Keywords

approximation algorithms cellular automata computational complexity cryptography dynamic programming fault-tolerance mobile agents number theory algorithms pattern matching proof systems state compexity

Editors and affiliations

  • Javier Esparza
    • 1
  • Pierre Fraigniaud
    • 2
  • Thore Husfeldt
    • 3
  • Elias Koutsoupias
    • 4
  1. 1.Institut für InformatikTechnische Universität MünchenMünchenGermany
  2. 2.LIAFAUniversité Paris Diderot-Paris 7, Case 7014Paris Cedex 13France
  3. 3.IT University of CopenhagenCopenhagenDenmark
  4. 4.Department Computer ScienceUniversity of OxfordOxfordUK

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2014
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-43947-0
  • Online ISBN 978-3-662-43948-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349