28. ICALP 2001:
Heraklion,
Crete,
Greece
Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen (Eds.):
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings.
Lecture Notes in Computer Science 2076 Springer 2001, ISBN 3-540-42287-0 BibTeX
@proceedings{DBLP:conf/icalp/2001,
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Automata, Languages and Programming, 28th International Colloquium,
ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2076},
year = {2001},
isbn = {3-540-42287-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Keynote Papers
Invited Papers
Algebraic and Circuit Complexity
Algorithm Analysis
- Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter:
A Framework for Index Bulk Loading and Dynamization.
115-127
Electronic Edition (Springer LINK) BibTeX
- Gianfranco Bilardi, Enoch Peserico:
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies.
128-139
Electronic Edition (Springer LINK) BibTeX
- Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin:
The Complexity of Constructing Evolutionary Trees Using Experiments.
140-151
Electronic Edition (Springer LINK) BibTeX
- Philippe Flajolet, Yves Guivarc'h, Wojciech Szpankowski, Brigitte Vallée:
Hidden Pattern Statistics.
152-165
Electronic Edition (Springer LINK) BibTeX
- Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama:
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence.
166-177
Electronic Edition (Springer LINK) BibTeX
- Alexandre Tiskin:
All-Pairs Shortest Paths Computation in the BSP Model.
178-189
Electronic Edition (Springer LINK) BibTeX
Approximation and Optimization
Complexity
- Jochen Alber, Henning Fernau, Rolf Niedermeier:
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems.
261-272
Electronic Edition (Springer LINK) BibTeX
- Liming Cai, David W. Juedes:
Subexponential Parameterized Algorithms Collapse the W-Hierarchy.
273-284
Electronic Edition (Springer LINK) BibTeX
- Amit Chakrabarti, Subhash Khot:
Improved Lower Bounds on the Randomized Complexity of Graph Properties.
285-296
Electronic Edition (Springer LINK) BibTeX
- Yevgeniy Dodis:
New Imperfect Random Source with Applications to Coin-Flipping.
297-309
Electronic Edition (Springer LINK) BibTeX
- Joel Friedman, Andreas Goerdt:
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.
310-321
Electronic Edition (Springer LINK) BibTeX
- Martin Fürer:
Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations.
322-333
Electronic Edition (Springer LINK) BibTeX
- Oded Goldreich, Salil P. Vadhan, Avi Wigderson:
On Interactive Proofs with a Laconic Prover.
334-345
Electronic Edition (Springer LINK) BibTeX
- Peter Høyer, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.
346-357
Electronic Edition (Springer LINK) BibTeX
- Pranab Sen, Srinivasan Venkatesh:
Lower Bounds in the Quantum Cell Probe Model.
358-369
Electronic Edition (Springer LINK) BibTeX
Concurrency
Efficient Datastructures
Graph Algorithms
Language Theory,
Codes,
and Automata
- Volker Diekert, Anca Muscholl:
Solvability of Equations in Free Partially Commutative Groups Is Decidable.
543-554
Electronic Edition (Springer LINK) BibTeX
- Manfred Droste, Guo-Qiang Zhang:
Rational Transformations of Formal Power Series.
555-566
Electronic Edition (Springer LINK) BibTeX
- Sébastien Ferenczi, Charles Holton, Luca Q. Zamboni:
Combinatorics of Three-Interval Exchanges.
567-578
Electronic Edition (Springer LINK) BibTeX
- Tero Harju, Oscar H. Ibarra, Juhani Karhumäki, Arto Salomaa:
Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.
579-590
Electronic Edition (Springer LINK) BibTeX
- Daniel Kirsten:
The Star Problem in Trace Monoids: Reductions Beyond C4.
591-602
Electronic Edition (Springer LINK) BibTeX
- Michal Kunc:
The Trace Coding Problem Is Undecidable.
603-614
Electronic Edition (Springer LINK) BibTeX
- Eric Rivals, Sven Rahmann:
Combinatorics of Periods in Strings.
615-626
Electronic Edition (Springer LINK) BibTeX
- Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan:
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct.
627-638
Electronic Edition (Springer LINK) BibTeX
Model Checking and Protocol Analysis
- Parosh Aziz Abdulla, Luc Boasson, Ahmed Bouajjani:
Effective Lossy Queue Languages.
639-651
Electronic Edition (Springer LINK) BibTeX
- Michael Benedikt, Patrice Godefroid, Thomas W. Reps:
Model Checking of Unrestricted Hierarchical State Machines.
652-666
Electronic Edition (Springer LINK) BibTeX
- Michele Boreale:
Symbolic Trace Analysis of Cryptographic Protocols.
667-681
Electronic Edition (Springer LINK) BibTeX
- Hubert Comon, Véronique Cortier, John Mitchell:
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols.
682-693
Electronic Edition (Springer LINK) BibTeX
- Kousha Etessami, Thomas Wilke, Rebecca A. Schuller:
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata.
694-707
Electronic Edition (Springer LINK) BibTeX
- Georg Gottlob, Reinhard Pichler:
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.
708-719
Electronic Edition (Springer LINK) BibTeX
- Anca Muscholl, Doron Peled:
From Finite State Communication Protocols to High-Level Message Sequence Charts.
720-731
Electronic Edition (Springer LINK) BibTeX
Networks and Routing
Reasoning and Verification
Scheduling
Secure Computation
Specification and Deduction
Structural Complexity
- Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban:
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.
1005-1016
Electronic Edition (Springer LINK) BibTeX
- Harry Buhrman, John Tromp, Paul M. B. Vitányi:
Time and Space Bounds for Reversible Simulation.
1017-1027
Electronic Edition (Springer LINK) BibTeX
- Jack Jie Dai, James I. Lathrop, Jack H. Lutz, Elvira Mayordomo:
Finite-State Dimension.
1028-1039
Electronic Edition (Springer LINK) BibTeX
- Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner:
The Complexity of Computing the Size of an Interval.
1040-1051
Electronic Edition (Springer LINK) BibTeX
- Tomasz Jurdzinski, Miroslaw Kutylowski:
Communication Gap for Finite Memory Devices.
1052-1064
Electronic Edition (Springer LINK) BibTeX
- Rocco A. Servedio:
Separating Quantum and Classical Learning.
1065-1080
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:16:06 2009
by Michael Ley (ley@uni-trier.de)
