Abstract is missing.
- Philosophical Issues in Kolmogorov ComplexityMing Li, Paul M. B. Vitányi. 1-15
- Circuit Complexity and the Expressive Power of Generalized First-Order FormulasHoward Straubing. 16-27
- One-Message Statistical Zero-Knowledge Proofs and Space-Bounded VerifierAlfredo De Santis, Giuseppe Persiano, Moti Yung. 28-40
- Abelian Squares are Avoidable on 4 LettersVeikko Keränen. 41-52
- Polynomial Size Test Sets for Context-Free LanguagesJuhani Karhumäki, Wojciech Plandowski, Wojciech Rytter. 53-64
- Quasi-Deterministic 0L SystemsTaishin Y. Nishida. 65-76
- On Growing Context-Sensitive LanguagesGerhard Buntrock, Krzysztof Lorys. 77-88
- Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract)Jeffrey Shallit. 89-100
- The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is UndecidableDaniel Krob. 101-112
- Semi-Commutations and Rational ExpressionsMireille Clerbout, Yves Roos, Wieslaw Zielonka. 113-125
- New Results Concerning Synchronized Finite AutomataOscar H. Ibarra, Nicholas Q. Trân. 126-137
- A Greibach Normal Form for Context-free Graph GrammarsJoost Engelfriet. 138-149
- On Reverse and General Definite Tree Languages (Extended Abstract)Pierre Péladeau, Andreas Podelski. 150-161
- Reductions to Sets of Low Information ContentVikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf. 162-173
- UP and the Low and High Hierarchies: A Relativized SeparationMing-Jye Sheu, Timothy J. Long. 174-185
- Analytic Analysis of AlgorithmsPhilippe Flajolet. 186-210
- How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related ProblemsPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. 211-222
- The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture EffectsUlrich Schmid. 223-234
- Polynomial Hash Functions Are Reliable (Extended Abstract)Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger. 235-246
- Adaptive Pattern MatchingR. C. Sekar, R. Ramesh, I. V. Ramakrishnan. 247-260
- Randomized Interpolation and Approximation of Sparse PolynomialsYishay Mansour. 261-272
- Two Strikes Against Perfect PhylogenyHans Leo Bodlaender, Michael R. Fellows, Tandy Warnow. 273-283
- Disjunctive Systems and L-DomainsGuo-Qiang Zhang. 284-295
- Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract)Alberto Apostolico, Dany Breslauer, Zvi Galil. 296-307
- Near-perfect Token DistributionAndrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli Upfal. 308-317
- Fast Integer Merging on the EREW PRAMTorben Hagerup. 318-329
- Approximation Algorithms for Graph AugmentationSamir Khuller, Ramakrishna Thurimella. 330-341
- Fast Incremental Planarity TestingJeffery Westbrook. 342-353
- Maintenance of Triconnected Components of Graphs (Extended Abstract)Johannes A. La Poutré. 354-365
- Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)Vijay V. Vazirani, Mihalis Yannakakis. 366-377
- Gröbner Bases: An IntroductionBruno Buchberger. 378-379
- Buchberger s Algorithm: The Term Rewriter s Point of View (Extended Abstract)Reinhard Bündgen. 380-391
- Completion of Rewrite Systems with Membership ConstraintsHubert Comon. 392-403
- A New Metric Between Polygons and How to Compute itGünter Rote. 404-415
- On Nearest-Neighbor GraphsMike Paterson, F. Frances Yao. 416-426
- A Tail Estimate for Mulmuley s Segment Intersection AlgorithmJirí Matousek, Raimund Seidel. 427-438
- Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer MachineBernard Chazelle, Burton Rosenberg. 439-449
- Infinitary Logic for Computer SciencePhokion G. Kolaitis, Moshe Y. Vardi. 450-473
- Characterization of Temporal Property ClassesEdward Y. Chang, Zohar Manna, Amir Pnueli. 474-486
- Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract)C.-H. Luke Ong. 487-498
- Logic Programming Semantics Made EasyEls Laenens, Dirk Vermeir, Carlo Zaniolo. 499-508
- On the Complexity of Dataflow Analysis of Logic ProgramsSaumya K. Debray. 509-520
- Comparison of Abstract InterpretationsAgostino Cortesi, Gilberto Filé, William H. Winsborough. 521-532
- A Proposed Categorial Semantics for Pure MLWesley Phoa, Michael P. Fourman. 533-544
- What Good Are Digital Clocks?Thomas A. Henzinger, Zohar Manna, Amir Pnueli. 545-558
- Behavioural Abstraction in TCCSFaron Moller, Chris M. N. Tofts. 559-570
- Timing Petri Nets CategoricallyCarolyn Brown, Doug Gurr. 571-582
- Asynchronous Cellular Automata for Infinite TracesPaul Gastin, Antoine Petit. 583-594
- A Trace Semantics for Petri Nets (Extended Abstract)P. W. Hoogers, H. C. M. Kleijn, P. S. Thiagarajan. 595-604
- Asynchronous Communication of Petri Nets and the Refinement of TransitionsWalter Vogler. 605-616
- A Parametric Approach to LocalitiesUgo Montanari, Daniel Yankelevich. 617-628
- Proved TreesPierpaolo Degano, Corrado Priami. 629-640
- Interfaces between Languages for Communicating SystemsErnst-Rüdiger Olderog. 641-655
- Towards Formal Development of Programs from Algebraic Specifications: Model-Theoretic FoundationsDonald Sannella, Andrzej Tarlecki. 656-671
- Program Composition via UnificationLimor Fix, Nissim Francez, Orna Grumberg. 672-684
- Barbed BisimulationRobin Milner, Davide Sangiorgi. 685-695
- Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract)Alexander Moshe Rabinovich. 696-707
- Testing Preorders for Probabilistic ProcessesRance Cleaveland, Scott A. Smolka, Amy E. Zwarico. 708-719