- Email: [email protected]
38th International Colloquium on Automata, Languages and Programming
Information and Computation 222 (2013) 1
Contents lists available at SciVerse ScienceDirect
Information and Computation www.elsevier.com/locate/yinco
Preface
38th International Colloquium on Automata, Languages and Programming This special issue is devoted to selected papers from the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), which took place from the 4th to the 8th of July 2011 in Zürich, Switzerland. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science. It is one of the main conferences for the presentation of research on all aspects of theoretical computer science. ICALP 2011 had three tracks. Track A was devoted to Algorithms, Complexity and Games and saw the presentation of 68 papers. The theme for track B was Logic, Semantics, Automata and Theory of Programming; 29 papers were selected for this track. Track C focused on Foundations of Networked Computation: Models, Algorithms and Information Management and accepted 17 papers. Out of these 114 papers, 19 were selected for this special issue (10 for track A, 6 for track B and 3 for track C). Amongst these submissions, the first four contributions of this issue received best paper awards at ICALP 2011:
• Malte Beecken, Johannes Mittmann and Nitin Saxena. Algebraic Independence and Blackbox Identity Testing. Best paper for track A.
• Martin Hoefer. Local Matching Dynamics in Social Networks. Best paper for track C. • Shiri Chechik. Fault-Tolerant Compact Routing Schemes for General Graphs. Best student paper for track C. • Shi Li. A 1.488-Approximation Algorithm for the Uncapacitated Facility Location Problem. Best student paper for track A. The submissions for this special issue underwent a new and thorough reviewing and revision process, in accordance with the high standards of Information and Computation. We thank the authors for contributing to this special issue and the anonymous reviewers for all the hard work they put in reviewing the submitted papers. Last, but not least, we are grateful to Albert Meyer for agreeing to devote a special issue of Information and Computation to selected papers from ICALP 2011 and for giving us the opportunity to act as guest editors for it.
Guest Editors Luca Aceto Reykjavik, Iceland Monika Henzinger Wien, Austria Jiˇrí Sgall Prague, Czech Republic Available online 6 November 2012
0890-5401/$ – see front matter © 2012 Published by Elsevier Inc. http://dx.doi.org/10.1016/j.ic.2012.11.002
Contents lists available at SciVerse ScienceDirect
Information and Computation www.elsevier.com/locate/yinco
Preface
38th International Colloquium on Automata, Languages and Programming This special issue is devoted to selected papers from the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), which took place from the 4th to the 8th of July 2011 in Zürich, Switzerland. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science. It is one of the main conferences for the presentation of research on all aspects of theoretical computer science. ICALP 2011 had three tracks. Track A was devoted to Algorithms, Complexity and Games and saw the presentation of 68 papers. The theme for track B was Logic, Semantics, Automata and Theory of Programming; 29 papers were selected for this track. Track C focused on Foundations of Networked Computation: Models, Algorithms and Information Management and accepted 17 papers. Out of these 114 papers, 19 were selected for this special issue (10 for track A, 6 for track B and 3 for track C). Amongst these submissions, the first four contributions of this issue received best paper awards at ICALP 2011:
• Malte Beecken, Johannes Mittmann and Nitin Saxena. Algebraic Independence and Blackbox Identity Testing. Best paper for track A.
• Martin Hoefer. Local Matching Dynamics in Social Networks. Best paper for track C. • Shiri Chechik. Fault-Tolerant Compact Routing Schemes for General Graphs. Best student paper for track C. • Shi Li. A 1.488-Approximation Algorithm for the Uncapacitated Facility Location Problem. Best student paper for track A. The submissions for this special issue underwent a new and thorough reviewing and revision process, in accordance with the high standards of Information and Computation. We thank the authors for contributing to this special issue and the anonymous reviewers for all the hard work they put in reviewing the submitted papers. Last, but not least, we are grateful to Albert Meyer for agreeing to devote a special issue of Information and Computation to selected papers from ICALP 2011 and for giving us the opportunity to act as guest editors for it.
Guest Editors Luca Aceto Reykjavik, Iceland Monika Henzinger Wien, Austria Jiˇrí Sgall Prague, Czech Republic Available online 6 November 2012
0890-5401/$ – see front matter © 2012 Published by Elsevier Inc. http://dx.doi.org/10.1016/j.ic.2012.11.002