Automata, Languages and Programming: 27th International Colloquium, ICALP 2000 Geneva, Switzerland, July 9–15, 2000 ProceedingsAuthor: Ugo Montanari, José D. P. Rolim, Emo Welzl Published by Springer Berlin Heidelberg ISBN: 978-3-540-67715-4 DOI: 10.1007/3-540-45022-XTable of Contents:Game Semantics: Achievements and Prospects Clique Is Hard to Approximate within n Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming A Statically Allocated Parallel Functional Language An Optimal Minimum Spanning Tree Algorithm Improved Shortest Paths on the Word RAM Improved Algorithms for Finding Level Ancestors in Dynamic Trees Lax Logical Relations Reasoning about Idealized ALGOL Using Regular Languages The Measurement Process in Domain Theory Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model Evolution Monotone Proofs of the Pigeon Hole Principle Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models Algebraic Models for Contextual Nets Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems Measures of Nondeterminism in Finite Automata LTL Is Expressively Complete for Mazurkiewicz Traces An Automata-Theoretic Completeness Proof for Interval Temporal Logic Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?, "... 27th International Colloquium on Automata, Languages and Programming"