Abstract is missing.
- Program Result Checking: A New Approach to Making Programs More ReliableManuel Blum. 1-14
- Dynamic Interpolation Search in o(log log n) TimeArne Andersson, Christer Mattsson. 15-27
- Searching among Intervals and Compact Routing TablesGreg N. Frederickson. 28-39
- The Approximation of Maximum Subgraph ProblemsCarsten Lund, Mihalis Yannakakis. 40-51
- Polynomially Bounded Minimization Problems which are Hard to ApproximateViggo Kann. 52-63
- Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set CoverNaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis. 64-75
- The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi. 76-87
- Problems on Pairs of Trees and the Four Colour Problem of Planar GraphsArtur Czumaj, Alan Gibbons. 88-101
- Constructing Competitive Tours From Local InformationBala Kalyanasundaram, Kirk Pruhs. 102-113
- Treewidth and Pathwidth of Permutation GraphsHans Leo Bodlaender, Ton Kloks, Dieter Kratsch. 114-125
- A Theory of Even Functionals and Their Algorithmic ApplicationsJerzy W. Jaromczyk, Grzegorz Swiatek. 126-136
- Exact Asymptotics of Divide-and-Conquer RecurrencesPhilippe Flajolet, Mordecai J. Golin. 137-149
- Optimal Bounds for the Change-Making ProblemDexter Kozen, Shmuel Zaks. 150-161
- The Complexity of N-body SimulationJohn H. Reif, Stephen R. Tate. 162-176
- A Simple Method for Resolving Degeneracies in Delaunay TriangulationsMichael B. Dillencourt, Warren D. Smith. 177-188
- Fault-Tolerance and Complexity (Extended Abstract)Lane A. Hemachandra. 189-202
- Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing MachinesHiroaki Yamamoto. 203-214
- On the Computational Power of Discrete Hopfield NetsPekka Orponen. 215-226
- On Randomized Versus Deterministic ComputationMarek Karpinski, Rutger Verbeek. 227-240
- Lower Bounds for One-way Probabilistic Communication ComplexityFarid M. Ablayev. 241-252
- Maintaining Discrete Probability Distributions OptimallyTorben Hagerup, Kurt Mehlhorn, J. Ian Munro. 253-264
- Secure and Efficient Off-Line Digital Money (Extended Abstract)Matthew K. Franklin, Moti Yung. 265-276
- Computational Depth and Reducibility (Extended Abstract)David W. Juedes, James I. Lathrop, Jack H. Lutz. 277-288
- Learnability: Admissible, Co-finite, and Hypersimple LanguagesGanesh Baliga, John Case. 289-300
- Inclusion is Undecidable for Pattern LanguagesTao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu. 301-312
- New Decidability Results Concerning Two-way Counter Machines and ApplicationsOscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang. 313-324
- Cobham s Ttheorem seen through Büchi s TheoremChristian Michaux, Roger Villemaire. 325-334
- Logical Definability on Infinite TracesWerner Ebinger, Anca Muscholl. 335-346
- Algebras for Classifying Regular Tree Languages and an Application to Frontier TestabilityThomas Wilke. 347-358
- Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract)Arvind Gupta. 359-370
- On Distributed Algorithms in a Broadcast DomainDanny Dolev, Dalia Malki. 371-387
- Sparse Networks Supporting Efficient Reliable BroadcastingBogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc. 388-397
- Strongly Adaptive Token DistributionFriedhelm Meyer auf der Heide, Brigitte Oesterdiekhoff, Rolf Wanka. 398-409
- Fast Parallel Computation of Characteristic Polynomials by Leverrier s POwer Sum Method Adapted to Fields of Finite CharacteristicArnold Schönhage. 410-417
- Fast Parallel Constraint SatisfactionLefteris M. Kirousis. 418-429
- The Product of Rational LanguagesImre Simon. 430-444
- On Regular Compatibility of Semi-CommutationsEdward Ochmanski, Pierre-André Wacrenier. 445-456
- Algebraic Aspects of B-regular SeriesPhilippe Dumas. 457-468
- Products of Finite State Machines with Full CoverageDavid M. Cohen, Michael L. Fredman. 469-477
- An Effective Version of Stallings Theorem in the Case of Context-Free GroupsGéraud Sénizergues. 478-495
- On the Power of Periodic Iteration of MorphismsArto Lepistö. 496-506
- If a D0L Language is k-Power Free then it is CircularFilippo Mignosi, Patrice Séébold. 507-518
- Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report)Lalita Jategaonkar, Albert R. Meyer. 519-531
- Timed Testing of Concurrent SystemsWalter Vogler. 532-543
- The Fork CalculusKlaus Havelund, Kim Guldstrand Larsen. 544-557
- Extended Transition Systems for Parametric BisimulationPaola Inverardi, Corrado Priami, Daniel Yankelevich. 558-569
- Temporal Logic and Categories of Petrie NetsCarolyn Brown, Doug Gurr. 570-581
- Decidability of a Partial Order Based Temporal LogicKamal Lodaya, P. S. Thiagarajan. 582-592
- Local Model Checking for Context-Free ProcessesHardi Hungar, Bernhard Steffen. 593-605
- Computing on StructuresSerge Abiteboul, Victor Vianu. 606-620
- A Partial Solution for D-Unification Based on a Reduction to AC1-UnificationEvelyne Contejean. 621-632
- Efficient Analysis of Concurrent Constraint Logic ProgramsMichael Codish, Moreno Falaschi, Kim Marriott, William H. Winsborough. 633-644
- A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal ObjectRoberto Di Cosmo, Delia Kesner. 645-656
- Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omegaFranco Barbanera, Maribel Fernández. 657-668
- From Domains to Automata with ConcurrencyFelipe Bracho, Manfred Droste. 669-681
- What is a Universal Higher-Order Programming Language?Ramarao Kanneganti, Robert Cartwright. 682-695