Advertisement

Automata, Languages, and Programming

39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II

  • Artur Czumaj
  • Kurt Mehlhorn
  • Andrew Pitts
  • Roger Wattenhofer

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

Table of contents

  1. Front Matter
  2. Invited Talks

    1. Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
      Pages 1-12
    2. David Harel
      Pages 16-22
    3. Kohei Honda
      Pages 23-23
    4. Berthold Vöcking
      Pages 27-29
  3. Track B – Logic Semantics, Automata and Theory of Programming

    1. Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
      Pages 30-41
    2. Rajeev Alur, Loris D’Antoni
      Pages 42-53
    3. Pablo Arrighi, Gilles Dowek
      Pages 54-66
    4. Michael Benedikt, Pierre Bourhis, Pierre Senellart
      Pages 79-91
    5. Mikołaj Bojańczyk, Sławomir Lasota
      Pages 92-103
    6. Mikołaj Bojańczyk, Thomas Place
      Pages 116-127
    7. Patricia Bouyer, Nicolas Markey, Ocan Sankur
      Pages 128-140
    8. Tomáš Brázdil, Antonín Kučera, Petr Novotný, Dominik Wojtczak
      Pages 141-152
    9. Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
      Pages 165-176
    10. Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
      Pages 177-188
    11. Maribel Fernández, Albert Rubio
      Pages 201-213
    12. Marcelo Fiore
      Pages 214-226
    13. Tomáš Gavenčiak, Daniel Král, Sang-il Oum
      Pages 239-250
    14. Anuj Dawar, Bjarki Holm
      Pages 251-262
    15. Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Michael Zakharyaschev
      Pages 263-274
    16. Manfred Kufleitner, Alexander Lauser
      Pages 275-286
    17. Denis Kuperberg, Michael Vanden Boom
      Pages 287-298
    18. Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder
      Pages 299-311
    19. Andrzej S. Murawski, Nikos Tzevelekos
      Pages 312-324
    20. C. -H. Luke Ong, Takeshi Tsukada
      Pages 325-336
    21. Uday S. Reddy, Brian P. Dunphy
      Pages 337-350
    22. Grigore Roşu, Andrei Ştefănescu
      Pages 351-363
    23. Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt
      Pages 364-376
  4. Track C – Foundations of Networked Computation

    1. Leonid Barenboim
      Pages 403-415
    2. Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz
      Pages 416-427
    3. Andrew Berns, James Hegeman, Sriram V. Pemmaraju
      Pages 428-439
    4. Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma
      Pages 440-451
    5. Nishanth Chandran, Juan Garay, Rafail Ostrovsky
      Pages 452-463
    6. Ning Chen, Xiaotie Deng, Hongyang Zhang, Jie Zhang
      Pages 464-475
    7. Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
      Pages 476-487
    8. Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos, Yaron Singer
      Pages 488-499
    9. A QPTAS for Open image in new window-Envy-Free Profit-Maximizing Pricing on Line Graphs
      Khaled Elbassioni
      Pages 513-524
    10. Fedor V. Fomin, Petr Golovach, Jesper Nederlof, Michał Pilipczuk
      Pages 525-536
    11. Ran Gelles, Rafail Ostrovsky, Kina Winoto
      Pages 537-548
    12. Michael T. Goodrich, Michael Mitzenmacher
      Pages 549-560

Other volumes

  1. 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I
  2. Automata, Languages, and Programming
    39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II

About these proceedings

Introduction

This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012.
The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

Keywords

approximation computational complexity dynamical networks multi-party computation regular expressions

Editors and affiliations

  • Artur Czumaj
    • 1
  • Kurt Mehlhorn
    • 2
  • Andrew Pitts
    • 3
  • Roger Wattenhofer
    • 4
  1. 1.Department of Computer Science and Centre for Discrete Mathematics and its ApplicationsUniversity of WarwickWarwickUK
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany
  3. 3.Computer Laboratory,University of CambridgeUK
  4. 4.ETH ZurichSwitzerland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-31585-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31584-8
  • Online ISBN 978-3-642-31585-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site