Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany

3142

Josep Díaz Juhani Karhumäki Arto Lepistö Donald Sannella (Eds.)

Automata, Languages and Programming 31st International Colloquium, ICALP 2004 Turku, Finland, July 12-16, 2004 Proceedings

13

Volume Editors Josep Díaz Universitat Politècnica de Catalunya Departament de Llenguatges i Sistemes Informatics 08034 Barcelona, Spain E-mail: [email protected] Juhani Karhumäki Arto Lepistö University of Turku, Department of Mathematics 20014 Turku, Finland E-mail: [email protected], [email protected] Donald Sannella University of Edinburgh Laboratory for Foundations of Computer Science Edinburgh EH9 3JZ, UK E-mail: [email protected]

Library of Congress Control Number: 2004109916 CR Subject Classification (1998): F, D, C.2-3, G.1-2, I.3, E.1-2 ISSN 0302-9743 ISBN 3-540-22849-7 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer-Verlag is a part of Springer Science+Business Media springeronline.com © Springer-Verlag Berlin Heidelberg 2004 Printed in Germany Typesetting: Camera-ready by author, data conversion by PTP-Berlin, Protago-TeX-Production GmbH Printed on acid-free paper SPIN: 11312789 06/3142 543210

Preface

The 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004) was held from July 12 to July 16 in Turku, Finland. This volume contains all contributed papers presented at ICALP 2004, together with the invited lectures by Philippe Flajolet (INRIA), Robert Harper (Carnegie Mellon), Monika Henzinger (Google), Martin Hofmann (Munich), Alexander Razborov (Princeton and Moscow), Wojciech Rytter (Warsaw and NJIT), and Mihalis Yannakakis (Stanford). ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS). The first ICALP took place in 1972 and the ICALP program currently consists of track A (focusing on algorithms, automata, complexity, and cryptography) and track B (focusing on databases, logics, semantics, and principles of programming). In response to the call for papers, the program committee received 379 papers, 272 for track A and 107 for track B. This is the highest number of submitted papers in the history of ICALP conferences. The program committees selected 97 papers for inclusion into the scientific program. The program committee for track A met on March 27 and 28 in Barcelona and selected 69 papers from track A. The program committee for track B selected 28 papers from track B in the course of an electronic discussion lasting for two weeks in the second half of March. The selections were based on originality, quality, and relevance to theoretical computer science. We wish to thank all authors who submitted extended abstracts for consideration, the program committee for its hard work, and all referees who assisted the program committee in the evaluation process. The EATCS best paper award for track A was given to the paper “Quantum Query Complexity of Some Graph Problems” by Christoph D¨ urr, Mark Heiligman, Peter Høyer, and Mehdi Mhalla, and the award for track B was given to the paper “Tree-Walking Automata Cannot Be Determinized” by Mikolaj Bojanczyk and Thomas Colcombet. Ryan Williams received the best student paper award for track A for his contribution “A New Algorithm for Optimal Constraint Satisfaction and Its Implications”, and the best student paper award for track B was given to Olivier Serre for his paper “Games with Winning Conditions of High Borel Complexity”. ICALP 2004 was held in conjunction with the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004). ICALP 2004 was also notable as, for the first time, ICALP returned to the same town: Turku also hosted ICALP 1977. The ICALP 2004 webpages can be found at http://www.math.utu.fi/icalp04/. During ICALP 2004 the following special events also took place: A colloquium in honor of Academician Arto Salomaa on the occasion of his 70th birthday was organized on July 11, and the EATCS award was given to Arto Salomaa. The following workshops were held as satellite events of ICALP 2004 and LICS 2004

VI

Preface

with Mika Hirvensalo as the coordinator: 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS), Workshop on Discrete Models for Complex Systems (DMCS), Workshop on Foundations of Computer Security (FCS), Workshop on Intersection Types and Related Systems (ITRS), 6th International Workshop on Logic and Computational Complexity (LCC), Workshop on Logics for Resources, Processes, and Programs (LRPP), Workshop on Logic and Systems Biology (LSB), 2nd International Workshop on Quantum Programming Languages (QPL), Workshop on Word Avoidability, Complexity and Morphisms (WACAM), Workshop on Logical Foundations of an Adaptive Security Infrastructure (WOLFASI), and Workshop on Synchronizing Automata (WSA). We thank the sponsors and the Turku University Mathematics Department and Turku Centre for Computer Science for hosting ICALP 2004. We are also grateful to the Turku University Congress Office, organizing committee, and to the local automata theory group: Vesa Halava, Tero Harju, Jarkko Kari, Elisa Mikkola, Kalle Saari, Petri Salmela, Magnus Steinby, and, in particular, Mika Hirvensalo.

April 2004

Josep Diaz Juhani Karhum¨ aki Arto Lepist¨o Donald Sannella

Organization

VII

Program Committee Track A A. Atserias G. Brodal J. Cassaigne J. Diaz, Chair R. Fleischer H. Gabow L. Goldberg J. Hromkovic G. Italiano T. Jiang C. Kaklamanis J. Kari C. Moore P. Pudlak P. Raghavan M. Santha B. Voecking G. Woeginger M. Yung

Barcelona, Spain Aarhus, Denmark Marseille, France Barcelona, Spain Hong Kong, China Boulder, USA Warwick, UK Aachen, Germany Rome, Italy Riverside, USA Patras, Greece Turku, Finland Santa Fe, USA Prague, Czech Republic Verity, Stanford, USA Paris, France Dortmund, Germany Twente, The Netherlands Columbia University, USA

Track B R.-J. Back P.-L. Curien A. Gordon S. Hayashi T. Henzinger M. Hofmann B. Jacobs E. Moggi J. Parrow C. Palamidessi B. Pierce A. Rabinovich D. Sannella, Chair W. Thomas I. Walukiewicz

Turku, Finland Paris, France Microsoft, Cambridge, UK Kobe, Japan Berkeley, USA Munich, Germany Nijmegen, The Netherlands Genoa, Italy Uppsala, Sweden University Park, PA, USA Philadelphia, USA Tel Aviv, Israel Edinburgh, UK Aachen, Germany Bordeaux, France

VIII

Organization

Organizing Committee J. Karhum¨ aki, Conference Chair T. J¨arvi, Co-chair (ICALP) L. Hella, Co-chair (LICS) V. Halava M. Hirvensalo I. Petre P. Sibelius T. Knuutila

Organization

IX

List of Referees Scott Aaronson, Mart´ın Abadi, Parosh Abdulla, Andreas Abel, Dimitris Achlioptas, Susanne Albers, J¨ urgen Albert, Jean-Paul Allouche, Noga Alon, Jan-Hendrik Altenbernd, Thorsten Altenkirch, Carme Alvarez, Andris Ambainis, Torben Amtoft, Davide Ancona, Suzana Andova, Nicola Apollonio, Lars Arge, Andr´e Arnold, V. Arvind, Eugene Asarin, David Aspinall, Robert Atkey, Arnon Avron, Patrick Baillot, Steffen van Bakel, Meenakshi Balasubramanian, Michael Baldamus, Howard Barnum, Yair Bartal, Peter Bartlett, Paul Beame, Daniele Beauquier, Moritz Becker, Eli Ben-Sasson, Nick Benton, Stefano Berardi, Petra Berenbrink, Martin Berger, Lennart Beringer, Ron Berman, Julien Bernat, Dietmar Berwanger, Guy Blelloch, Achim Blumensath, Hans Bodlaender, HansJoachim Boeckenhauer, Bernard Boigelot, Miko´laj Boja´ nczyk, Dirk Bongartz, Johannes Borgstr¨ om, Victor Bos, Ahmed Bouajjani, Alexis-Julien Bouquet, Claus Brabrand, Julian Bradfield, Cees-Bart Breunesse, Fran¸cois Bry, Adam Buchsbaum, Yann Bugeaud, Michele Bugliesi, Stefan Burkhardt, Jesper Byskov, Cristiano Calcagno, Manuel Campagnolo, Ran Canetti, Alberto Caprara, Arnaud Carayol, Marco Carbone, S´ebastien Carlier, Rafel Cases, Paul Caspi, Chandra Chekuri, Bogdan Chlebus, Hana Chockler, Christian Choffrut, Marek Chrobak, Gabriel Ciobanu, Aaron Clauset, Bruno Codenotti, Christopher Colby, Richard Cole, Murray Cole, Adriana Compagnoni, Vince Conitzer, Matthew Cook, Mario Coppo, Graham Cormode, Felix Costa, Nadia Creignou, Claude Crepeau, Mary Cryan, Felipe Cuker, Thomas Cusick, Eugen Czeizler, Artur Czumaj, Mads Dam, Vincent Danos, Mayur Datar, Anuk Dawar, Giorgio Delzanno, Yuxin Deng, Yvo Desmedt, Nikhil Devanur, Mariangiola Dezani, Martin Dietzfelbinger, Yevgeniy Dodis, Jaques Duparc, Bruno Durand, Christophe Durr, Peter Dybjer, Martin Dyer, David Eichmann, Cindy Eisner, Edith Elkind, Lars Engebretsen, Leah Epstein, Thomas Erlebach, William S. Evans, Marco Faella, Rolf Fagerberg, Wenfei Fan, Sandor Fekete, Jon Feldman, Fabrice Le Fessant, Jiri Fiala, Amos Fiat, Alain Finkel, Philippe Flajolet, Fedor Fomin, Lance Fortnow, Dimitris Fotakis, C´edric Fournet, Gudmund Skovbjerg Frandsen, Katalin Friedl, Alain Frisch, Murdoch Gabbay, Peter Gacs, Fabio Gadducci, Anna Gal, Shmuel Gal, Vladimir Gapeyev, Naveen Garg, Luisa Gargano, Pablo Garralda, Leszek Gasieniec, Ricard Gavalda, Simon Gay, Herman Geuvers, Pablo Giambiagi, Raffaele Giancarlo, Anna Gilbert, Jean-Yves Girard, Rob van Glabbeek, Andrew Goldberg, Paul Goldberg, Massimiliano Goldwurm, Mordechai Golin, Clemens Grabmayer, Erich Graedel, Etienne Grandjean, Vladimir Grebinski, M. Greenwald, Roberto Grossi, Stefano Guerrini, S. Guha, Anupam Gupta, Claudio Gutierrez, Peter Habermehl, Esfandiar Haghverdi, Masami Hagiya, P´eter Hajnal, Vesa Halava, Joe Hallett, Jiri Hanika, Tero Harju, James Harland, Sariel Har-Peled, Robert Harper, Alan Hartman, Fr´ed´eric Herbreteau, Miki Hermann, Holger Hermanns, Andreas Herzig, Jane Hillston, Peter Hines, Hiromi Hiraishi, Daniel Hirschkoff, Yoram Hirshfeld, Mika Hirvensalo, John M. Hitchcock, JaapHenk Hoepman, Juha Honkala, Furio Honsell, Han Hoogeveen, Peter Hoyer, Engelbert Hubbers, Jesse Hughes, Cor Hurkens, Martin Hyland, John Iacono,

X

Organization

Russell Impagliazzo, Sandy Irani, G´ abor Ivanyos, Paul Jackson, Riko Jacob, Jens Jaegerskuepper, Radha Jagadeesan, David Janin, Klaus Jansen, Wojciech Jawor, Ole Hoegh Jensen, Mark Jerrum, Bengt Jonsson, Tibor Jordan, Stasys Jukna, Marcin Jurdzinski, Eija Jurvanen, Haim Kaplan, Marek Karpinski, Mikhail Kats, Shin-ya Katsumata, Jonathan Katz, David Kempe, Julia Kempe, Delia Kesner, Assaf Kfoury, S. Khanna, Joe Kiniry, Christian Kirkegaard, Lefteris Kirousis, Jyrki Kivinen, Felix Klaedtke, Bettina Klinz, Jan Willem Klop, Hirotada Kobayashi, Pascal Koiran, Petr Kolman, Beata Konikowska, Swastik Kopparty, Vaclav Koubek, Elias Koutsoupias, Lukasz Kowalik, Jan Krajicek, Daniel Kral, Robert Krauthgamer, Pavel Krcal, Marc van Kreveld, Jean-Louis Krivine, Andrei Krokhin, Antonin Kucera, Manfred Kufleitner, Joachim Kupke, Maciej Kurowski, Dietrich Kuske, Jyrki Lahtonen, Linas Laibinis, Jim Laird, Cosimo Laneve, Martin Lange, Sophie Laplante, Oukseh Lee, James Leifer, Marina Lenisa, Stefano Leonardi, Arto Lepist¨ o, Martin Leucker, Asaf Levin, Michael Levin, Jing Li, Johan Lilius, Christof Loeding, John Longley, Lazlo Lovatz, Chi-Jen Lu, Ga’bor Lugosi, Olivier Ly, Rune Bang Lyngs, Kenneth MacKenzie, Rupak Majumdar, Henning Makholm, Christos Makris, Oded Maler, David Manlove, Yishay Mansour, Russ Martin, Conrado Martinez, Yossi Matias, Ralph Matthes, Marios Mavronicolas, Dominic Mayers, Elvira Mayordomo, Richard Mayr, Jacques Mazoyer, Paul-Andr´e Melli`es, Michael Mendler, Marino Miculan, Dale Miller, Peter Bro Miltersen, Michael Mislove, Michael Mitzenmacher, Faron Moller, Michael Molloy, Alberto Momigliano, T. Monteil, Remi Morin, Christian Worm Mortensen, Gabriel Moruz, Michele Mosca, Haiko Mueller, Tetsuya Murai, Andrzej Murawski, Anca Muscholl, Muthu Muthukrishnan, Jerzy Mycka, Hiroshi Nakano, Francesco Zappa Nardelli, Ashwin Nayak, Rolf Niedermeier, Mogens Nielsen, Damian Niwinski, Thomas Noll, Antje Nowack, Dirk Nowotka, Satoshi Obana, Mizuhito Ogawa, Atsushi Ohori, Mitsuhiro Okada, Roberto Oliveira, Nicolas Ollinger, Luke Ong, Martijn Oostdijk, Gianpaolo Oriolo, Pekka Orponen, Masanao Ozawa, Rasmus Pagh, Jens Palsberg, Christos Papadimitriou, Anargyros Papageorgiou, Kunsoo Park, Mike Paterson, Dirk Pattinson, Wojciech Peczek, Christian N.S. Pedersen, Rudi Pendavingh, Thomas Perst, Ion Petre, Elena Petre, Anna Philippou, Pierre Philipps, Jean-Eric Pin, David Pisinger, Marco Pistore, Andrew Pitts, Erik Poll, Enrico Pontelli, Ivan Porres, Fran¸cois Pottier, John Power, James Propp, Kirk Pruhs, Tomasz Radzik, Nasir Rajpoot, Sergio Rajsbaum, Rajeev Raman, Dana Randall, Srinivasa Rao, Ivan Rapaport, Julian Rathke, Ran Raz, Oded Regev, Laurent Regnier, Ari Renvall, Tamara Rezk, Yossi Richter, James Riely, Noam Rinetzky, Liam Roditty, Vojtech Rodl, Philipp Rohde, Dana Ron, Amir Ronen, Giuseppe Rosolini, Michel de Rougemont, Tim Roughgarden, Salvador Roura, James Royer, Ronitt Rubinfeld, Alexander Russell, Wojciech Rytter, Morten Sørensen, Andrei Sabelfeld, Amr Sabry, Cenk Sahinalp, Jared Saia, Chiaki Sakama, Saeed Salehi, Arto Salomaa, Davide Sangiorgi, Vishal Sanwalani, Vladimiro Sassone, Alexis Saurin, Petr Savicky, Vladimir Sazonov, Nicolas Schabanel, Gilles Schaeffer, Christian Scheideler, Philippe Schnoebelen, Peter Schuster, Eric Schwabe, Michael Schwartzbach, Nicole Schweikardt, Thomas Schwentick, Roberto Segala, Sebastian Seibert,

Organization

XI

Helmut Seidl, Kaisa Sere, Maria Serna, Peter Sewell, Jiri Sgall, Hadas Shachnai, Cosma Shalizi, John Shawe-Taylor, Patrick Sibelius, J´erome Simeon, Alex Simpson, Rene Sitters, Martin Skutella, Michiel Smid, Christian Sohler, Paul Spirakis, Bas Spitters, Jiri Srba, Aravind Srinivasa, Jesssica Staddon, Ian Stark, Sam Staton, Rob van Stee, Gheorghe Stefanescu, Cliff Stein, Magnus Steinby, Colin Stirling, Marielle Stoelinga, Viggo Stoltenberg-Hansen, Leen Stougie, M. Strauss, Thomas Streicher, Zhendong Su, Benny Sudakov, Gr´egoire Sutre, Maxim Sviridenko, Yasuhiro Takahashi, Jean-Marc Talbot, Arie Tamir, Alain Tapp, Dennis Therien, Dimitris Thilikos, Ferucio Laurentiu Tiplea, Alwen Tiu, Jacobo Tor´ an, Salvatore La Torre, Luca Trevisan, Stavros Tripakis, Costas Tsichlas, Gene Tsudik, Walter Unger, Christian Urban, Pawel Urzyczyn, Patchrawat Uthaisombut, Phil Wadler, Frank Valencia, David Walker, John Watrous, Joseph Vanderwaart, Daniele Varacca, Kasturi Varadarajan, Martijn Warnier, Vasco Vasconcelos, Pascal Weil, Joe Wells, Yves Verhoeven, Joannes Vermorel, Bj¨ orn Victor, Maria Grazia Vigliotti, David Williamson, Glynn Winskel, Lucian Wischik, Stefan Woehrle, Walter Vogler, Ronald de Wolf, Pierre Wolper, Nick Wormald, Joakim von Wright, Laurent Vuillon, Jens Vygen, Akihiro Yamamoto, Amiram Yehudai, Greta Yorsh, Neal Young, Shoji Yuen, Stanislav Zak, Steve Zdancewic, Jie Zheng, Wieslaw Zielonka, Silvano Dal Zilio, Pascal Zimmer, David Zuckerman, Uri Zwick

XII

Organization

Sponsors Academy of Finland City of Turku Finnair Finnish Academy of Sciences and Letters - V¨ais¨al¨a Foundation - Mathematics Foundation Finnish Cultural Foundation Fujitsu-Siemens IBM MasterPlanet Nokia Nordea Sampo Life insurance Company Limited Stiftelsen f¨or ˚ Abo Akademi Turku Centre for Computer Science (TUCS) Turku University Foundation Turun Seudun Osuuspankki University of Turku

Table of Contents

Invited Talks Self-Adjusting Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Robert Harper

1

The Past, Present, and Future of Web Search Engines . . . . . . . . . . . . . . . . . Monika Henzinger

3

What Do Program Logics and Type Systems Have in Common? . . . . . . . . Martin Hofmann

4

Feasible Proofs and Computations: Partnership and Fusion . . . . . . . . . . . . . Alexander A. Razborov

8

Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wojciech Rytter

15

Testing, Optimizaton, and Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Mihalis Yannakakis

28

Contributed Papers Deciding Knowledge in Security Protocols Under Equational Theories . . . Mart´ın Abadi, V´eronique Cortier

46

Representing Nested Inductive Types Using W-Types . . . . . . . . . . . . . . . . . Michael Abbott, Thorsten Altenkirch, Neil Ghani

59

Algorithms for Multi-product Pricing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gagan Aggarwal, Tom´ as Feder, Rajeev Motwani, An Zhu

72

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson

84

Linear and Branching Metrics for Quantitative Transition Systems . . . . . . Luca de Alfaro, Marco Faella, Mari¨elle Stoelinga

97

Learning a Hidden Subgraph . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 110 Noga Alon, Vera Asodi Optimal Reachability for Weighted Timed Games . . . . . . . . . . . . . . . . . . . . . 122 Rajeev Alur, Mikhail Bernadsky, P. Madhusudan

XIV

Table of Contents

Wavelength Assignment in Optical Networks with Fixed Fiber Capacity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 Matthew Andrews, Lisa Zhang External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146 Lars Arge, Ulrich Meyer, Laura Toma A λ-Calculus for Resource Separation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158 Robert Atkey The Power of Verification for One-Parameter Agents . . . . . . . . . . . . . . . . . . 171 Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano Group Spreading: A Protocol for Provably Secure Distributed Name Service . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 183 Baruch Awerbuch, Christian Scheideler Further Improvements in Competitive Guarantees for QoS Buffering . . . . . 196 Nikhil Bansal, Lisa K Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko Competition-Induced Preferential Attachment . . . . . . . . . . . . . . . . . . . . . . . . 208 N. Berger, C. Borgs, J.T. Chayes, R.M. D’Souza, R.D. Kleinberg Approximating Longest Directed Paths and Cycles . . . . . . . . . . . . . . . . . . . . 222 Andreas Bj¨ orklund, Thore Husfeldt, Sanjeev Khanna Definitions and Bounds for Self-Healing Key Distribution Schemes . . . . . . 234 Carlo Blundo, Paolo D’Arco, Alfredo De Santis Tree-Walking Automata Cannot Be Determinized . . . . . . . . . . . . . . . . . . . . . 246 Miko
laj Boja´ nczyk, Thomas Colcombet Projecting Games on Hypercoherences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 257 Pierre Boudes An Analog Characterization of Elementarily Computable Functions over the Real Numbers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269 Olivier Bournez, Emmanuel Hainry Model Checking with Multi-valued Logics . . . . . . . . . . . . . . . . . . . . . . . . . . . . 281 Glenn Bruns, Patrice Godefroid The Complexity of Partition Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294 Andrei Bulatov, Martin Grohe Comparing Recursion, Replication, and Iteration in Process Calculi . . . . . 307 Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro

Table of Contents

XV

Dynamic Price Sequence and Incentive Compatibility . . . . . . . . . . . . . . . . . . 320 Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao The Complexity of Equivariant Unification . . . . . . . . . . . . . . . . . . . . . . . . . . . 332 James Cheney Coordination Mechanisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 345 George Christodoulou, Elias Koutsoupias, Akash Nanavati Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 358 Marek Chrobak, Wojciech Jawor, Jiˇr´ı Sgall, Tom´ aˇs Tich´y Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 371 Bruno Codenotti, Kasturi Varadarajan Coloring Semirandom Graphs Optimally . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383 Amin Coja-Oghlan Sublinear-Time Approximation for Clustering Via Random Sampling . . . . 396 Artur Czumaj, Christian Sohler Solving Two-Variable Word Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408 Robert D¸abrowski, Wojtek Plandowski Backtracking Games and Inflationary Fixed Points . . . . . . . . . . . . . . . . . . . . 420 Anuj Dawar, Erich Gr¨ adel, Stephan Kreutzer A PTAS for Embedding Hypergraph in a Cycle . . . . . . . . . . . . . . . . . . . . . . . 433 Xiaotie Deng, Guojun Li Towards an Algebraic Theory of Typed Mobile Processes . . . . . . . . . . . . . . 445 Yuxin Deng, Davide Sangiorgi Ecological Turing Machines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457 Bruno Durand, Andrei Muchnik, Maxim Ushakov, Nikolai Vereshchagin Locally Consistent Constraint Satisfaction Problems . . . . . . . . . . . . . . . . . . . 469 Zdenˇek Dvoˇra ´k, Daniel Kr´ al’, Ondˇrej Pangr´ ac Quantum Query Complexity of Some Graph Problems . . . . . . . . . . . . . . . . . 481 Christoph D¨ urr, Mark Heiligman, Peter Høyer, Mehdi Mhalla A Domain Theoretic Account of Picard’s Theorem . . . . . . . . . . . . . . . . . . . . 494 A. Edalat, D. Pattinson Interactive Observability in Ludics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 506 Claudia Faggian

XVI

Table of Contents

Easily Refutable Subformulas of Large Random 3CNF Formulas . . . . . . . . 519 Uriel Feige, Eran Ofek On Graph Problems in a Semi-streaming Model . . . . . . . . . . . . . . . . . . . . . . . 531 Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 544 Lisa Fleischer Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 555 J¨ org Flum, Martin Grohe, Mark Weyer Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In . . . . . 568 Fedor V. Fomin, Dieter Kratsch, Ioan Todinca Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581 Fedor V. Fomin, Dimitrios M. Thilikos Selfish Unsplittable Flows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 593 Dimitris Fotakis, Spyros Kontogiannis, Paul Spirakis A General Technique for Managing Strings in Comparison-Driven Data Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 606 Gianni Franceschini, Roberto Grossi Greedy Regular Expression Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 618 Alain Frisch, Luca Cardelli 1− 1

A 2O(n d log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 630 Bin Fu, Wei Wang Nash Equilibria in Discrete Routing Games with Convex Latency Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 645 Martin Gairing, Thomas L¨ ucking, Marios Mavronicolas, Burkhard Monien, Manuel Rode Improved Results for Data Migration and Open Shop Scheduling . . . . . . . . 658 Rajiv Gandhi, Magn´ us M. Halld´ orsson, Guy Kortsarz, Hadas Shachnai Deterministic M2M Multicast in Radio Networks . . . . . . . . . . . . . . . . . . . . . . 670 Leszek Ga˛sieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin

Table of Contents

XVII

Syntactic Control of Concurrency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 683 D.R. Ghica, A.S. Murawski, C.-H.L. Ong Linear-Time List Decoding in Error-Free Settings . . . . . . . . . . . . . . . . . . . . . 695 Venkatesan Guruswami, Piotr Indyk A Categorical Model for the Geometry of Interaction . . . . . . . . . . . . . . . . . . 708 Esfandiar Haghverdi, Philip Scott Testing Monotonicity over Graph Products . . . . . . . . . . . . . . . . . . . . . . . . . . . 721 Shirley Halevy, Eyal Kushilevitz The Minimum-Entropy Set Cover Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . 733 Eran Halperin, Richard M. Karp Communication Versus Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 745 Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, S. Venkatesh Optimal Website Design with the Constrained Subtree Selection Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 757 Brent Heeringa, Micah Adler Simple Permutations Mix Well . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 770 Shlomo Hoory, Avner Magen, Steven Myers, Charles Rackoff Closest Pair Problems in Very High Dimensions . . . . . . . . . . . . . . . . . . . . . . . 782 Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat Universality in Quantum Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 793 Emmanuel Jeandel Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design . . . . . . . . . . . . . . . . . . . . . 805 Raja Jothi, Balaji Raghavachari Fairness to All While Downsizing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 819 Bala Kalyanasundaram, Mahe Velauthapillai A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 831 Shin-ya Katsumata A Faster Algorithm for Minimum Cycle Basis of Graphs . . . . . . . . . . . . . . . 846 Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch The Black-Box Complexity of Nearest Neighbor Search . . . . . . . . . . . . . . . . 858 Robert Krauthgamer, James R. Lee

XVIII Table of Contents

Regular Solutions of Language Inequalities and Well Quasi-orders . . . . . . . 870 Michal Kunc A Calculus of Coroutines . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 882 J. Laird Almost Optimal Decentralized Routing in Long-Range Contact Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 894 Emmanuelle Lebhar, Nicolas Schabanel Word Problems on Compressed Words . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 906 Markus Lohrey Complexity of Pseudoknot Prediction in Simple Models . . . . . . . . . . . . . . . . 919 Rune B. Lyngsø Property Testing of Regular Tree Languages . . . . . . . . . . . . . . . . . . . . . . . . . . 932 Fr´ed´eric Magniez, Michel de Rougemont Entropy as a Fixed Point . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 945 Keye Martin Transparent Long Proofs: A First PCP Theorem for NPR . . . . . . . . . . . . . . 959 K. Meer A Time Lower Bound for Satisfiability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 971 Dieter van Melkebeek, Ran Raz Some Results on Effective Randomness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 983 Wolfgang Merkle, Nenad Mihailovi´c, Theodore A. Slaman A Polynomial Quantum Query Lower Bound for the Set Equality Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 996 Gatis Midrij¯ anis Succinct Representations of Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1006 J. Ian Munro, S. Srinivasa Rao A Note on Karr’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1016 Markus M¨ uller-Olm, Helmut Seidl The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 1029 S. Nikoletseas, C. Raptopoulos, P. Spirakis Efficient Consistency Proofs for Generalized Queries on a Committed Database . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1041 Rafail Ostrovsky, Charles Rackoff, Adam Smith

Table of Contents

XIX

A 2 18 -Approximation Algorithm for Rectangle Tiling . . . . . . . . . . . . . . . . . . 1054 Katarzyna Paluch Extensional Theories and Rewriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1066 Grigore Ro¸su Hardness of String Similarity Search and Other Indexing Problems . . . . . . 1080 S. Cenk Sahinalp, Andrey Utis A Syntactic Characterization of Distributive LTL Queries . . . . . . . . . . . . . . 1099 Marko Samer, Helmut Veith Online Scheduling with Bounded Migration . . . . . . . . . . . . . . . . . . . . . . . . . . 1111 Peter Sanders, Naveen Sivadasan, Martin Skutella On the Expressive Power of Monadic Least Fixed Point Logic . . . . . . . . . . 1123 Nicole Schweikardt Counting in Trees for Free . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1136 Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl Games with Winning Conditions of High Borel Complexity . . . . . . . . . . . . . 1150 Olivier Serre Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1163 Alan Skelley LA, Permutations, and the Haj´ os Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . 1176 Michael Soltys A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1188 Michael Toftdal Efficiently Computing Succinct Trade-Off Curves . . . . . . . . . . . . . . . . . . . . . 1201 Sergei Vassilvitskii, Mihalis Yannakakis On Randomization Versus Synchronization in Distributed Systems . . . . . . 1214 Hagen V¨ olzer A New Algorithm for Optimal Constraint Satisfaction and Its Implications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1227 Ryan Williams On the Power of Ambainis’s Lower Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . 1238 Shengyu Zhang

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1251