Table of Contents

• Graphical Calculi for Interaction (Abstract)Robin Milner. 1
• NP-Completeness: A RetrospectiveChristos H. Papadimitriou. 2-6
• The LEDA Platform of Combinatorial and Geometric ComputingKurt Mehlhorn, Stefan Näher, Christian Uhrig. 7-16
• The Wadge-Wagner Hierarchy of omega-Rational SetsOlivier Carton, Dominique Perrin. 17-35
• From Chaotic Iteration to Constraint PropagationKrzysztof R. Apt. 36-55
• DNA²DNA Computations: A Potential Killer App ?Laura F. Landweber, Richard J. Lipton. 56-64
• Tilings and QuasiperiodicityBruno Durand. 65-75
• Enumerative Sequences of Leaves in Rational TreesFrédérique Bassino, Marie-Pierre Béal, Dominique Perrin. 76-86
• A Completion Algorithm for Codes with Bounded Synchronization DelayVéronique Bruyère. 87-97
• The Expressibility of Languages and Relations by Word EquationsJuhani Karhumäki, Wojciech Plandowski, Filippo Mignosi. 98-109
• Finite Loops Recognize Exactly the Regular Open LanguagesMartin Beaudry, François Lemieux, Denis Thérien. 110-120
• An Abstract Data Type for Real NumbersPietro Di Gianantonio. 121-131
• Recursive Computational DepthJames I. Lathrop, Jack H. Lutz. 132-142
• Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract)Olivier Bournez. 143-153
• Monadic Simultaneous Rigid E-Unification and Related ProblemsYuri Gurevich, Andrei Voronkov. 154-165
• Computability on the Probability Measures on the Borel Sets of the Unit IntervalKlaus Weihrauch. 166-176
• Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-OffsAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. 177-187
• Results on Resource-Bounded MeasureHarry Buhrman, Stephen A. Fenner, Lance Fortnow. 188-194
• Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching ProgramsFarid M. Ablayev. 195-202
• Checking Properties of Polynomials (Extended Abstract)Bruno Codenotti, Funda Ergün, Peter Gemmell, Ravi Kumar. 203-213
• Exact Analysis of Dodgson Elections: Lewis Carroll s 1876 Voting System is Complete for Parallel Access to NPEdith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe. 214-224
• Game Theoretic Analysis of Call-by-Value ComputationKohei Honda, Nobuko Yoshida. 225-236
• On Modular Properties of Higher Order Extensional Lambda CalculiRoberto Di Cosmo, Neil Ghani. 237-247
• On Explicit Substitution and Names (Extended Abstract)Eike Ritter, Valeria de Paiva. 248-258
• On the Dynamics of Sharing GraphsAndrea Asperti, Cosimo Laneve. 259-269
• Minimizing Diameters of Dynamic TreesStephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup. 270-280
• Improving Spanning Trees by Upgrading NodesSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. 281-291
• Dynamic Algorithms for Graphs of Bounded TreewidthTorben Hagerup. 292-302
• The Name Discipline of Uniform Receptiveness (Extended Abstract)Davide Sangiorgi. 303-313
• On Confluence in the pi-CalculusAnna Philippou, David Walker. 314-324
• A Proof Theoretical Approach to CommunicationYuxi Fu. 325-335
• Solving Trace Equations Using Lexicographical Normal FormsVolker Diekert, Yuri Matiyasevich, Anca Muscholl. 336-346
• Star-Free Picture Expressions are Strictly Weaker Than First-Order LogicThomas Wilke. 347-357
• An Algebra-Based Method to Associate Rewards with EMPA TermsMarco Bernardo. 358-368
• A Semantically Sound Actor TranlsationIan A. Mason, Carolyn L. Talcott. 369-378
• Periodic and Non-periodic Min-Max EquationsUwe Schwiegelshohn, Lothar Thiele. 379-389
• Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSPEdson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song. 390-400
• Upper Bound on Communication Complexity of Private Information RetrievalAndris Ambainis. 401-407
• Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version)David Harel, Eli Singerman. 408-418
• Model Checking the Full Modal Mu-Calculus for Infinite Sequential ProcessesOlaf Burkart, Bernhard Steffen. 419-429
• Symbolic Model Checking for Probabilistic ProcessesChristel Baier, Edmund M. Clarke, Vassili Hartonas-Garmhausen, Marta Z. Kwiatkowska, Mark Ryan. 430-440
• On the Concentration of the Height of Binary Search TreesJohn Michael Robson. 441-448
• An Improved Master Theorem for Divide-and-Conquer RecurrencesSalvador Roura. 449-459
• Bisimulation for Probabilistic Transition Systems: A Coalgebraic ApproachErik P. de Vink, Jan J. M. M. Rutten. 460-470
• Distributed Processes and Location Failures (Extended Abstract)James Riely, Matthew Hennessy. 471-481
• Basic Observables for ProcessesMichele Boreale, Rocco De Nicola, Rosario Pugliese. 482-492
• Constrained Bipartite Edge Coloring with Applications to Wavelength RoutingChristos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen. 493-504
• Colouring Paths in Directed Symmetric Trees with Applications to WDM RoutingLuisa Gargano, Pavol Hell, Stephane Perennes. 505-515
• On-Line Routing in All-Optical NetworksYair Bartal, Stefano Leonardi. 516-526
• A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)Tamar Eilam, Michele Flammini, Shmuel Zaks. 527-537
• Efficiency of Asynchronous Systems and Read Arcs in Petri NetsWalter Vogler. 538-548
• Bisimulation Equivalence is Decidable for One-Counter ProcessesPetr Jancar. 549-559
• Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract)Ahmed Bouajjani, Peter Habermehl. 560-570
• Axiomatizations for the Perpetual Loop in Process AlgebraWan Fokkink. 571-581
• Discrete-Time Control for Rectangular Hybrid AutomataThomas A. Henzinger, Peter W. Kopke. 582-593
• Maintaining Minimum Spanning Trees in Dynamic GraphsMonika Rauch Henzinger, Valerie King. 594-604
• Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)Roberto Grossi, Giuseppe F. Italiano. 605-615
• Efficient Array PartitioningSanjeev Khanna, S. Muthukrishnan, Steven Skiena. 616-626
• Constructive Linear Time Algorithms for BranchwidthHans Leo Bodlaender, Dimitrios M. Thilikos. 627-637
• The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are ConfluentPaliath Narendran, Friedrich Otto. 638-648
• The Geometry of Orthogonal Reduction SpacesZurab Khasidashvili, John R. W. Glauert. 649-659
• The Theory of VaccinesMassimo Marchiori. 660-670
• The Equivalence Problem for Deterministic Pushdown Automata is DecidableGéraud Sénizergues. 671-681
• On Recognizable and Rational Formal Power Series in Partially Commuting VariablesManfred Droste, Paul Gastin. 682-692
• On a Conjecture of J. ShallitJulien Cassaigne. 693-704
• On Characterization of Escrow Encryption SchemesYair Frankel, Moti Yung. 705-715
• Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract)Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano. 716-726
• Approximation Results for the Optimum Cost Partition ProblemKlaus Jansen. 727-737
• The Minimum Color Sum of Bipartite GraphsAmotz Bar-Noy, Guy Kortsarz. 738-748
• A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal PropertiesToshihiro Fujito. 749-759
• Independent Sets in Asteroidal Triple-Free GraphsHajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller. 760-770
• Refining and Compressing Abstract DomainsRoberto Giacobazzi, Francesco Ranzato. 771-781
• Labelled Reductions, Runtime Errors and Operational SubsumptionLaurent Dami. 782-793
• A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Z::m::Giovanni Manzini, Luciano Margara. 794-804
• Recognizability Equals Definability for Partial k-PathsValentine Kabanets. 805-815
• Molecular Computing, Bounded Nondeterminism, and Efficient RecursionRichard Beigel, Bin Fu. 816-826
• Constructing Big Trees from Short SequencesPéter L. Erdös, Mike A. Steel, László A. Székely, Tandy Warnow. 827-837
• Termination of Constraint Logic ProgramsSalvatore Ruggieri. 838-848
• The Expressive Power of Unique Total Stable Model SemanticsFrancesco Buccafurri, Sergio Greco, Domenico Saccà. 849-859