Document - eBookmela
Loading...

Automata, languages and programming : 28th International Colloquium, ICALP 2001, Crete, Greece, July 8 12, 200 | International Colloquium on Automata, Languages, and Programming (28th : 2001 : Crete, Greece), Orejas, F. (Fernando), Spirakis, P. G. (Paul G.), 1955-, Leeuwen, J. van (Jan)

Likes0
Telegram icon Share on Telegram

Automata, languages and programming : 28th International Colloquium, ICALP 2001, Crete, Greece, July 8 12, 200

User Rating: Be the first one!

Author: International Colloquium on Automata, Languages, and Programming (28th : 2001 : Crete, Greece), Orejas, F. (Fernando), Spirakis, P. G. (Paul G.), 1955-, Leeuwen, J. van (Jan)

Added by: sketch

Added Date: 2015-12-30

Publication Date: 2001

Language: eng

Subjects: Computer science, Machine theory, Programming languages (Electronic computers)

Publishers: Berlin ; London : Springer

Collections: folkscanomy miscellaneous, folkscanomy, additional collections

ISBN Number: 3540422870

Pages Count: 300

PPI Count: 300

PDF Count: 1

Total Size: 556.53 MB

PDF Size: 10.21 MB

Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc

Edition: [Elektronische Ressource]

Archive Url

Downloads: 678

Views: 728

Total Files: 18

Media Type: texts

Description

Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings
Author: 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-5

Table 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
eBookmela
Logo
Register New Account