Abstract is missing.
- Theory of 2-StructuresAndrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg. 1-14
- A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract)Volker Diekert, Paul Gastin. 15-26
- Nonfinite Axiomatizability of the Equational Theory of ShuffleZoltán Ésik, Michael Bertol. 27-38
- The Algebraic Equivalent of AFL TheoryWerner Kuich. 39-50
- Finite State Transformations of ImagesKarel Culik II, Jarkko Kari. 51-62
- Post Correspondence Problem: Words Possible as Primitive SolutionsMarjo Lipponen. 63-74
- Computing the Closure of Sets of Words Under Partial CommutationsYves Métivier, Gwénaël Richomme, Pierre-André Wacrenier. 75-86
- Intervalizing k-Colored GraphsHans Leo Bodlaender, Babette de Fluiter. 87-98
- NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing StringsZhi-Zhong Chen. 99-110
- On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and ApplicationsRaffaele Giancarlo, Roberto Grossi. 111-122
- How to Use the Minimal Separators of a Graph for its Chordal TriangulationAndreas Parra, Petra Scheffler. 123-134
- Fast Gossiping by Short MessagesJean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro. 135-146
- Break Finite Automata Public Key CryptosystemFeng Bao, Yoshihide Igarashi. 147-158
- Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected TimeSotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung. 159-170
- On the Number of Random Bits in Totally Private ComputationCarlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro. 171-182
- Lower Time Bounds for Randomized ComputationRusins Freivalds, Marek Karpinski. 183-195
- New Collapse Consequences of NP Having Small CircuitsJohannes Köbler, Osamu Watanabe. 196-207
- The Complexity of Searching Succinctly Represented GraphsJosé L. Balcázar. 208-219
- Optimal Shooting: Characterizations and ApplicationsFrank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia. 220-231
- Placing Resources in a Tree: Dynamic and Static AlgorithmsVincenzo Auletta, Domenico Parente, Giuseppe Persiano. 232-243
- Shortest Path Queries in Digraphs of Small TreewidthShiva Chaudhuri, Christos D. Zaroliagis. 244-255
- A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter CostsMordecai J. Golin, Günter Rote. 256-267
- Parallel Algorithms with Optimal Speedup for Bounded TreewidthHans Leo Bodlaender, Torben Hagerup. 268-279
- Approximating Minimum Cuts under InsertionsMonika Rauch Henzinger. 280-291
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. 292-302
- On-line Resource Management with Applications to Routing and SchedulingStefano Leonardi, Alberto Marchetti-Spaccamela. 303-314
- Alternation in Simple DevicesH. Petersen. 315-323
- Hybrid Automata with Finite BisimulatioinsThomas A. Henzinger. 324-335
- Generalized Sturmian LanguagesLuis-Miguel Lopez, Philippe Narbel. 336-347
- Polynomial Closure and Unambiguous ProductJean-Eric Pin, Pascal Weil. 348-359
- Lower Bounds on Algebraic Random Access Machines (Extended Abstract)Amir M. Ben-Amram, Zvi Galil. 360-371
- Improved Deterministic PRAM Simulation on the MeshAndrea Pietracaprina, Geppino Pucci. 372-383
- On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract)Klaus Ambos-Spies. 384-392
- Weakly Useful SequencesStephen A. Fenner, Jack H. Lutz, Elvira Mayordomo. 393-404
- Graph Connectivity, Monadic NP and Built-in Relations of Moderate DegreeThomas Schwentick. 405-416
- The Expressive Power of ClocksThomas A. Henzinger, Peter W. Kopke, Howard Wong-Toi. 417-428
- Grammar Systems: A Grammatical Approach to Distribution and CooperationGheorghe Paun. 429-443
- Compactness of Systems of Equations in SemigroupsTero Harju, Juhani Karhumäki, Wojciech Plandowski. 444-454
- Sensing Versus Nonsensing AutomataPavol Duris, Zvi Galil. 455-463
- New Upper Bounds for Generalized Intersection Searching ProblemsPanayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis. 464-474
- OKFDDs versus OBDDs and OFDDsBernd Becker, Rolf Drechsler, Michael Theobald. 475-486
- Bicriteria Network Design ProblemsMadhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. 487-498
- On Determining Optimal Strategies in Pursiut Games in the PlaneNgoc-Minh Lê. 499-510
- Extension OrderingsAlbert Rubio. 511-522
- The PushDown Method to Optimize Chain Logic Programs (Extended Abstract)Sergio Greco, Domenico Saccà, Carlo Zaniolo. 523-534
- Automatic Synthesis of Real Time SystemsJørgen H. Andersen, Kåre J. Kristoffersen, Kim Guldstrand Larsen, Jesper Niedermann. 535-546
- Self-Correcting for Function Fields Transcendental DegreeManuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian. 547-557
- Measure, Category and Learning TheoryLance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan. 558-569
- A Characterization of the Existence of Energies for Neural NetworksMichel Cosnard, Eric Goles Ch.. 570-580
- Variable-Length Codes for Error CorrectionHelmut Jürgensen, Stavros Konstantinidis. 581-592
- Graphbots: Mobility in Discrete SpacesSamir Khuller, Ehud Rivlin, Azriel Rosenfeld. 593-604
- Solving Recursive Net EquationsEike Best, Maciej Koutny. 605-623
- Implicit Definability and Infinitary Logic in Finite Model TheoryAnuj Dawar, Lauri Hella, Phokion G. Kolaitis. 624-635
- The Limit of Split_n-Language EquivalenceWalter Vogler. 636-647
- Divergence and Fair TestingV. Natarajan, Rance Cleaveland. 648-659
- Causality for Mobile ProcessesPierpaolo Degano, Corrado Priami. 660-671
- Internal Mobility and Agent-Passing CalculiDavide Sangiorgi. 672-683