Automata, Languages and Programming

the long version

Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings<br />Author: Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42287-7<br /> DOI: 10.1007/3-540-48224-5<br /><br />Table of Contents:<p></p><ul><li>Algorithms, Games, and the Internet </li><li>Automata, Circuits, and Hybrids: Facets of Continuous Time </li><li>Languages, Rewriting Systems, and Verification of Infinite-State Systems </li><li>Integrating Semantics for Object—Oriented System Models </li><li>Modelling with Partial Orders — Why and Why Not? </li><li>Theoretical Aspects of Evolutionary Algorithms </li><li>Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical </li><li>On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities </li><li>Division Is In Uniform TC0 </li><li>A Framework for Index Bulk Loading and Dynamization </li><li>A Characterization of Temporal Locality and Its Portability across Memory Hierarchies </li><li>The Complexity of Constructing Evolutionary Trees Using Experiments </li><li>Hidden Pattern Statistics </li><li>Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence </li><li>All-Pairs Shortest Paths Computation in the BSP Model </li><li>Approximating the Minimum Spanning Tree Weight in Sublinear Time </li><li>Approximation Hardness of TSP with Bounded Metrics </li><li>The RPR </li><li>Approximation Algorithms for Partial Covering Problems </li><li>On the Online Bin Packing Problem</li></ul>