Automata, Languages and Programming

Fernando Orejas

ISBN 10: 3540422870 / ISBN 13: 9783540422877

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2001, 2001

About this Item

Neuware -The 28th International Colloquium on Automata, Languages and Programming (ICALP 2001) was held July 8-12, 2001 in the Aldemar-Knossos Royal Village near Hersonissos on Crete, Greece. This volume contains all contributed papers presented at ICALP 2001, together with the invited lectures by Ahmed Bou- jani (Paris), Martin Gro e-Rhode (Berlin), Mogens Nielsen (Aarhus), and Ingo Wegener (Dortmund) and two of the keynote lectures, by Christos Papadimitriou and Boris Trakhtenbrot. For almost 30 years now, ICALP has been the main annual event of the European Association for Theoretical Computer Science (EATCS). The ICALP program currently consists of track A: Algorithms, Automata, Complexity, and Games and track B: Logic, Semantics, and Theory of Programming. In response to the Call for Papers, the program committee received 208 s- missions: 162 for track A, 46 for track B. The committee met on March 23/24, 2001 in Barcelona and selected 80 papers for inclusion into the scienti c program.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 1104 pp. Englisch.

Seller Inventory # 9783540422877

Bibliographic Details

• Title: Automata, Languages and Programming
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Jun 2001
• Publication Date: 2001
• Language: English
• ISBN 10: 3540422870
• ISBN 13: 9783540422877
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 59D millimeters 235 millimeters width by 155 millimeters height by 59 millimeters depth
• Weight: 1632 grams

About this title

Synopsis

This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. The 80 revised papers presented together with two keynote contributions and four invited papers were carefully reviewed and selected from a total of 208 submissions. The papers are organized in topical sections on algebraic and circuit complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity.