×
Loading...

Automata, languages and programming : 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 : proceedings by International Colloquium on Automata, La...

Book Information

TitleAutomata, languages and programming : 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001 : proceedings
CreatorInternational Colloquium on Automata, Languages, and Programming (28th : 2001 : Crete, Greece), Orejas, F. (Fernando), Spirakis, P. G. (Paul G.), 1955-, Leeuwen, J. van (Jan)
Year2001
PPI300
PublisherBerlin ; London : Springer
LanguageEnglish
Mediatypetexts
SubjectComputer science, Machine theory, Programming languages (Electronic computers)
ISBN3540422870
Collectionfolkscanomy_miscellaneous, folkscanomy, additional_collections
Uploadersketch
Identifierspringer_10.1007-3-540-48224-5
Telegram icon Share on Telegram
Download Now

Description

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