Abstract is missing.
- Causal and Distributed Semantics for Concurrent Processes (Abstract)Ilaria Castellani. 1
- The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS 93 (Editorial Note)Klaus W. Wagner. 2-4
- Alternation for Two-way Machines with Sublogarithmic SpaceBurchard von Braunmühl. 5-15
- Separating the Lower Levels of the Sublogarithmic Space HierarchyMaciej Liskiewicz, Rüdiger Reischuk. 16-27
- Locating P/poly Optimally in the Extended Low HierarchyJohannes Köbler. 28-37
- Measure, Stochasticity, and the Density of Hard LanguagesJack H. Lutz, Elvira Mayordomo. 38-47
- Halting Problem of One Binary Horn Clause is UndecidablePhilippe Devienne, Patrick Lebègue, Jean-Christophe Routier. 48-57
- Decidability and Undecidability Results for Duration CalculusZhou Chaochen, Michael R. Hansen, Peter Sestoft. 58-68
- The Complexity of Logic-Based AbductionThomas Eiter, Georg Gottlob. 70-79
- Treewidth of Bipartite GraphsTon Kloks, Dieter Kratsch. 80-89
- On Paths in Networks with ValvesUlrich Huckenbeck. 90-99
- Scheduling Interval Ordered Tasks in ParallelSivaprakasam Sunder, Xin He. 100-109
- On O(sqrt(n))-Worst-Case-Time Solution to the Granularity ProblemAndrea Pietracaprina, Franco P. Preparata. 110-119
- The Synthesis Problem of Petri NetsJörg Desel, Wolfgang Reisig. 120-129
- General Refinement and Recursion Operators for the Petri Box CalculusEike Best, Raymond R. Devillers, Javier Esparza. 130-140
- On Fairness in Distributed Automated DeductionMaria Paola Bonacina, Jieh Hsiang. 141-152
- Divide-and-Conquer Algorithms on the HypercubeErnst W. Mayr, Ralph Werchner. 153-162
- A First-Order Isomorphism TheoremEric Allender, José L. Balcázar, Neil Immerman. 163-174
- Splittings, Robustness and Structure of Complete SetsHarry Buhrman, Albrecht Hoene, Leen Torenvliet. 175-184
- Defying Upward and Downward SeparationLane A. Hemachandra, Sudhir K. Jha. 185-195
- Counting, Selecting, adn Sorting by Query-Bounded MachinesAlbrecht Hoene, Arfst Nickelsen. 196-205
- Cancellation on Context-Free Languages: Enrichment by ReductionMatthias Jantzen, Holger Petersen. 206-215
- Counting Overlap-Free Binary WordsJulien Cassaigne. 216-225
- The Limit Set of Recognizable Substitution SystemsPhilippe Narbel. 226-236
- Partially Commutative Lyndon WordsDaniel Krob, Pierre Lalonde. 237-246
- Parallel Architectures: Design and Efficient UseBurkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling. 247-269
- Weighted Closest PairsMichael Formann. 270-281
- Rectilinear Path Queries in a Simple Rectilinear PolygonSven Schuierer. 282-293
- Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract)Artur Czumaj. 294-305
- Multi-List Ranking: Complexity and ApplicationsAnders Dessmark, Andrzej Lingas, Anil Maheshwari. 306-316
- Exact Algorithms for a Geometric Packing Problem (Extended Abstract)Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker. 317-322
- A Decomposition Theorem for Probabilistic Transition SystemsOded Maler. 323-332
- Local Automata and CompletionRosa Montalbano. 333-342
- Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like DataKarel Culik II, Simant Dube. 343-353
- On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded LanguagesOscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang. 354-364
- Computability Properties of Low-dimensional Dynamical SystemsMichel Cosnard, Max H. Garzon, Pascal Koiran. 365-373
- Fixed-Parameter Intractability II (Extended Abstract)Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows. 374-385
- Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict ResolutionFaith E. Fich, Russell Impagliazzo, Bruce M. Kapron, Valerie King, Miroslaw Kutylowski. 386-397
- On Using Oracles That Compute ValuesStephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman. 398-407
- Multicounter Automata with Sublogarithmic Reversal BoundsRomain Gengler. 408-417
- Structured Operational Semantics for Concurrency and HierarchyAndrew C. Uselton. 418-427
- The Complexity of Verifying Functional ProgramsHardi Hungar. 428-439
- Towards the Formal Design of Self-Stabilizing Distributed AlgorithmsP. J. A. Lentfert, S. Doaitse Swierstra. 440-451
- Axiomatizations of Temporal Logics on Trace SystemsWojciech Penczek. 452-462
- Capabilities and Complexity of Computations with Integer DivisionKatharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide. 463-472
- Extended Locally Definable Acceptance Types (Extended Abstract)Rolf Niedermeier, Peter Rossmanith. 473-483
- Gap-Definability as a Closure PropertyStephen A. Fenner, Lance Fortnow, Lide Li. 484-493
- On the Logical Definability of Some Rational Trace LanguagesChristian Choffrut, Leucio Guerra. 494-504
- Solving Systems of Set Constraints using Tree AutomataRémi Gilleron, Sophie Tison, Marc Tommasi. 505-514
- Complement Problems and Tree Automata in AC-like Theories (Extended Abstract)Denis Lugiez, J. L. Moysset. 515-524
- Transparent (Holographic) ProofsLászló Babai. 525-534
- Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY GateZhi-Li Zhang, David A. Mix Barrington, Jun Tarui. 535-544
- Threshold Circuits for Iterated Multiplication: Using AC0 for FreeAlexis Maciel, Denis Thérien. 545-565
- A Non-Probabilistic Switching Lemma for the Sipser FunctionSorin Istrail, Dejan Zivkovic. 566-575
- Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching ProgramsJordan Gergov, Christoph Meinel. 576-585
- On Syntactic Congruences for Omega-LanguagesOded Maler, Ludwig Staiger. 586-594
- Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular LanguagesStefano Varricchio. 595-606
- Locally Threshold Testable Languages of Infinite WordsThomas Wilke. 607-616
- Deterministic Asynchronous Automata for Infinite TracesVolker Diekert, Anca Muscholl. 617-628
- Recursive Automata on Infinite WordsLudwig Staiger. 629-639
- A Complexity Theoretic Approach to Incremental ComputationSairam Sairam, Jeffrey Scott Vitter, Roberto Tamassia. 640-649
- Precise Average Case ComplexityRüdiger Reischuk, Christian Schindelhauer. 650-661
- The Bit Probe Complexity Measure RevisitedPeter Bro Miltersen. 662-671
- Language Learning With Some Negative InformationGanesh Baliga, John Case, Sanjay Jain. 672-681
- Language Learning with a Bounded Number of Mind ChangesSteffen Lange, Thomas Zeugmann. 682-691
- Efficient Sharing of Many SecretsCarlo Blundo, Alfredo De Santis, Ugo Vaccaro. 692-703
- The KIV System: A Tool for Formal Program DevelopmentRainer Drexler, Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel, Werner Stephan, Andreas Wolpers. 704-705
- 1st Grade - A System for Implementation, Testing and Animation of Graph AlgorithmsFranz Höfting, Egon Wanke, Aurel Balmosan, Curd Bergmann. 706-707
- The Program Verifier TatzelwurmThomas Käufl. 708-709
- LEDA: A Library of Efficient Data Types and AlgorithmsStefan Näher. 710-711
- Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing RelationPhilippe de Groote. 712-723