Automata, Languages, and Programming

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

  • Artur Czumaj
  • Kurt Mehlhorn
  • Andrew Pitts
  • Roger Wattenhofer
Conference proceedings ICALP 2012

DOI: 10.1007/978-3-642-31594-7

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

Table of contents (71 papers)

  1. Front Matter
  2. Track A – Algorithms, Complexity and Games

    1. Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
      Dimitris Achlioptas, Ricardo Menchaca-Mendez
      Pages 1-12
    2. The NOF Multiparty Communication Complexity of Composed Functions
      Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen
      Pages 13-24
    3. Quantum Strategies Are Better Than Classical in Almost Any XOR Game
      Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitrijs Kravčenko, Raitis Ozols, Juris Smotrovs et al.
      Pages 25-37
    4. Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
      László Babai, Paolo Codenotti, Youming Qiao
      Pages 51-62
    5. Clustering under Perturbation Resilience
      Maria Florina Balcan, Yingyu Liang
      Pages 63-74
    6. Secretary Problems with Convex Costs
      Siddharth Barman, Seeun Umboh, Shuchi Chawla, David Malec
      Pages 75-87
    7. Nearly Simultaneously Resettable Black-Box Zero Knowledge
      Joshua Baron, Rafail Ostrovsky, Ivan Visconti
      Pages 88-99
    8. On Quadratic Programming with a Ratio Objective
      Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan
      Pages 109-120
    9. De-amortizing Binary Search Trees
      Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman
      Pages 121-132
    10. Efficient Sampling Methods for Discrete Distributions
      Karl Bringmann, Konstantinos Panagiotou
      Pages 133-144
    11. Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
      Niv Buchbinder, Joseph (Seffi) Naor, R. Ravi, Mohit Singh
      Pages 145-156
    12. Testing Coverage Functions
      Deeparnab Chakrabarty, Zhiyi Huang
      Pages 170-181
    13. Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs
      Chandra Chekuri, Alina Ene, Ali Vakilian
      Pages 206-217

Other volumes

  1. Automata, Languages, and Programming
    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 LaboratoryUniversity of CambridgeUK
  4. 4.ETH ZurichSwitzerland

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31593-0
  • Online ISBN 978-3-642-31594-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349