Abstract is missing.
- Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of AlgorithmsRichard M. Karp. 1-2
- Distributed Online Frequency Assignment in Cellular NetworksJeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil M. Shende. 3-13
- Floats, Integers, and Single Source Shortest PathsMikkel Thorup. 14-24
- A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and AutomataMichel Habib, Christophe Paul, Laurent Viennot. 25-38
- Simplifying the Modal Mu-Calculus Alternation HierarchyJulian C. Bradfield. 39-49
- On Disguised Double Horn Functions and ExtensionsThomas Eiter, Toshihide Ibaraki, Kazuhisa Makino. 50-60
- The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)Stéphane Demri, Ph. Schnoebelen. 61-72
- Searching Constant Width Mazes Captures the AC:::0::: HierarchyDavid A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum. 73-83
- Nearly Optimal Language Compression Using ExtractorsLance Fortnow, Sophie Laplante. 84-93
- Random Sparse Bit Strings at the Threshold of AdjacencyJoel Spencer, Katherine St. John. 94-104
- Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract)Martin Sauerhoff. 105-115
- Inducing an Order on Cellular Automata by a Grouping OperationJacques Mazoyer, Ivan Rapaport. 116-127
- Attractors of D-dimensional Linear Cellular AutomataGiovanni Manzini, Luciano Margara. 128-138
- Optimal Simulations Between Unary AutomataCarlo Mereghetti, Giovanni Pighizzini. 139-149
- Shuffle of omega-Words: Algebraic Aspects (Extended Abstract)Alexandru Mateescu. 150-160
- A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss. 161-171
- The Complexity of Modular Graph AutomorphismVikraman Arvind, Richard Beigel, Antoni Lozano. 172-182
- Unary Quantifiers, Transitive Closure, and Relations of Large DegreeLeonid Libkin, Limsoon Wong. 183-193
- On the Structure of Valiant s Complexity ClassesPeter Bürgisser. 194-204
- On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)Detlef Sieling. 205-215
- Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan. 216-226
- Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable OrderingJan Behrens, Stephan Waack. 227-237
- Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract)Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav. 238-248
- Provable Security for Block Ciphers by DecorrelationSerge Vaudenay. 249-275
- On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract)Cristina Bazgan, Miklos Santha, Zsolt Tuza. 276-286
- The Mutual Exclusion Scheduling Problem for Permutation and Comparability GraphsKlaus Jansen. 287-297
- Massaging a Linear Programming Solution to Give a 2-Approximation for a Generalization of the Vertex Cover ProblemNader H. Bshouty, Lynn Burroughs. 298-308
- Partially Persistent Search Trees with Transcript OperationsKim S. Larsen. 309-319
- Relating Hierarchies of Word and Tree AutomataDamian Niwinski, Igor Walukiewicz. 320-331
- Languages Defined With Modular Counting Quantifiers (Extended Abstract)Howard Straubing. 332-343
- Hierarchies of Principal Twist-Closed TriosMatthias Jantzen. 344-355
- Radix Representations of Algebraic Number Fields and Finite AutomataTaoufik Safer. 356-365
- Sorting and Searching on the Word RAMTorben Hagerup. 366-398
- Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi DiagramMohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin. 399-409
- On Batcher s Merge Sorts as Parallel Sorting AlgorithmsChristine Rüb. 410-420
- Minimum Spanning Trees for Minor-Closed Graph Classes in ParallelJens Gustedt. 421-431
- Optimal Broadcasting in Almost Trees and Partial k-treesAnders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto. 432-443
- Local Normal Forms for First-Order Logic with Applications to Games and AutomataThomas Schwentick, Klaus Barthelmann. 444-454
- Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract)Zoltán Ésik. 455-465
- A Logical Characterization of Systolic LanguagesAngelo Monti, Adriano Peron. 466-476
- Optimal Proof Systems for Propositional Logic and Complete SetsJochen Meßner, Jacobo Torán. 477-487
- The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer ProgrammingMaria J. Serna, Luca Trevisan, Fatos Xhafa. 488-498
- Interactive Protocols on the RealsSergei Ivanov, Michel de Rougemont. 499-510
- Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round ProtocolsGiovanni Di Crescenzo, Kouichi Sakurai, Moti Yung. 511-521
- Bounded Size Dictionary Compression: SC:::k:::-Completeness and NC AlgorithmsSergio De Agostino, Riccardo Silvestri. 522-532
- Expressive Completeness of LTrL on Finite Traces: An Algebraic ProofRaphaël Meyer, Antoine Petit. 533-543
- On Uniform DOL WordsAnna E. Frid. 544-554
- Series-Parallel Posets: Algebra, Automata and LanguagesKamal Lodaya, Pascal Weil. 555-565
- On the Expected Number of Nodes at Level k in 0-balanced TreesRainer Kemp. 566-576
- Cell Flipping in Permutation DiagramsMartin Charles Golumbic, Haim Kaplan. 577-586
- Construction of Non-intersecting Colored Flows Through a Planar Cellular FigureMarius Dorkenoo, Marie-Christine Eglin-Leclerc, Eric Rémila. 587-595
- Recursively Enumerable Reals and Chaitin Omega NumbersCristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang. 596-606
- Uniformly Defining Complexity Classes of FunctionsSven Kosub, Heinz Schmitz, Heribert Vollmer. 607-617
- Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-WidthDenis Lapoire. 618-628