Abstract is missing.
- Saturation-Based Theorem Proving (Abstract)Harald Ganzinger. 1-3
- Bandwidth Efficient Parallel ComputationAbhiram G. Ranade. 4-23
- Variable-Length Maximal CodesVéronique Bruyère, Michel Latteux. 24-47
- Lower Bounds for Propositional Proofs and Independence Results in Bounded ArithmeticAlexander A. Razborov. 48-62
- Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like StructuresXiao Jun Chen, Rocco De Nicola. 63-74
- Fast Asynchronous Systems in Dense TimeLars Jenner, Walter Vogler. 75-86
- A Hierarchy Theorem for the µ-CalculusGiacomo Lenzi. 87-97
- An Effective Tableau System for the Linear Time µ-CalculusJulian C. Bradfield, Javier Esparza, Angelika Mader. 98-109
- Characterizing Fairness Implementability for Multiparty InteractionYuh-Jzer Joung. 110-121
- Termination of Context-Sensitive Rewriting by RewritingSalvador Lucas. 122-133
- A Complete Gentzen-Style Axiomatization for Set ConstraintsAllan Cheng, Dexter Kozen. 134-145
- Fatal Errors in Conditional Expressions (Extended Abstract)Michel Billaud. 146-157
- Different Types of Arrow Between Logical FrameworksTill Mossakowski. 158-169
- Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract)John C. Mitchell, Ramesh Viswanathan. 170-181
- Regularity for a Large Class of Context-Free Processes is DecidableD. J. B. Bosscher, W. O. David Griffioen. 182-193
- On Infinite Transition Graphs Having a Decidable Monadic TheoryDidier Caucal. 194-205
- Semi-Groups Acting on Context-Free GraphsGéraud Sénizergues. 206-218
- Hard Sets Method and Semilinear Reservoir Method with ApplicationsLeonid P. Lisovik. 219-231
- Random Polynomials and Polynomial FactorizationPhilippe Flajolet, Xavier Gourdon, Daniel Panario. 232-243
- Optimal Gröbner Base Algorithms for Binomial IdealsUlla Koppenhagen, Ernst W. Mayr. 244-255
- Minimum Fill-In on Circle and Circular-Arc GraphsTon Kloks, Dieter Kratsch, C. K. Wong. 256-267
- Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free GraphsZhi-Zhong Chen. 268-279
- Searching a Fixed GraphElias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis. 280-289
- Improved Sampling with Applications to Dynamic Graph AlgorithmsMonika Rauch Henzinger, Mikkel Thorup. 290-299
- The Expressive Power of Existential First Order Sentences of Büchi s Sequential CalculusJean-Eric Pin. 300-311
- Fixpoints for Rabin Tree Automata Make Complementation EasyRoope Kaivola. 312-323
- New Upper Bounds to the Limitedness of Distance AutomataKosaburo Hashiguchi. 324-335
- Recognizing Regular Expressions by Means of Dataflow NetworksPascal Raymond. 336-347
- On the Power of Randomized Branching ProgramsFarid M. Ablayev, Marek Karpinski. 348-356
- Hitting Sets Derandomize BPPAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. 357-368
- On Type-2 Probabilistic QuantifiersRonald V. Book, Heribert Vollmer, Klaus W. Wagner. 369-380
- Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation ResultsJirí Wiedermann. 381-392
- On /omega-Generators and CodesSandrine Julia. 393-402
- On Standard Sturmian MorphismsAldo de Luca. 403-415
- Constructions and Bounds for Visual CryptographyGiuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson. 416-428
- On Capital InvestmentYossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén. 429-441
- Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No MultiplicationPeter Bro Miltersen. 442-453
- Lower Bounds for Row Minima Searching (Extended Abstract)Phillip G. Bradford, Knut Reinert. 454-465
- On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard Edwin Stearns. 466-477
- Deciding Finiteness of Petri Nets Up To BisimulationPetr Jancar, Javier Esparza. 478-489
- Mobile Processes with a Distributed EnvironmentChiara Bodei, Pierpaolo Degano, Corrado Priami. 490-501
- The Meaning of Negative Premises in Transition System Specifications IIRob J. van Glabbeek. 502-513
- Average Case Analyses of List Update Algorithms, with Applications to Data CompressionSusanne Albers, Michael Mitzenmacher. 514-525
- Self-Organizing Data Structures with Dependent AccessesFrank Schulz, Elmar Schömer. 526-537
- Lopsided Trees: Analyses, Algorithms, and ApplicationsVicky Siu-Ngan Choi, Mordecai J. Golin. 538-549
- Optimal Logarithmic Time Randomized Suffix Tree ConstructionMartin Farach, S. Muthukrishnan. 550-561
- Improved Parallel Approximation of a Class of Integer Programming Programming ProblemsNoga Alon, Aravind Srinivasan. 562-573
- Efficient Collective Communication in Optical NetworksJean-Claude Bermond, Luisa Gargano, Stephane Perennes, Adele A. Rescigno, Ugo Vaccaro. 574-585
- Shared-Memory Simulations on a Faulty-Memory DMMBogdan S. Chlebus, Anna Gambin, Piotr Indyk. 586-597
- Fast Deterministic Backtrack SearchKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. 598-609
- Agent Rendezvous: A Dynamic Symmetry-Breaking ProblemXiangdong Yu, Moti Yung. 610-621
- Efficient Asynchronous Consensus with the Value-Oblivious Adversary SchedulerYonatan Aumann, Michael A. Bender. 622-633
- A Formal Framework for Evaluating Heuristic ProgramsLenore Cowen, Joan Feigenbaum, Sampath Kannan. 634-645
- Improved Scheduling Algorithms for Minsum CriteriaSoumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein. 646-657
- On the Complexity of String FoldingMike Paterson, Teresa M. Przytycka. 658-669
- A Polynomial-Time Algorithm for Near-Perfect PhylogenyDavid Fernández-Baca, Jens Lagergren. 670-680