Abstract is missing.
- Randomized Complexity of Linear Arrangements and PolyhedraMarek Karpinski. 1-12 [doi]
- Tile Transition Systems as Structured CoalgebrasAndrea Corradini, Reiko Heckel, Ugo Montanari. 13-38 [doi]
- Caesar and DNA. Views on CryptologyArto Salomaa. 39-53 [doi]
- Automata and Their Interaction: Definitional SuggestionsBoris A. Trakhtenbrot. 54-89 [doi]
- Axiomatising Asynchronous Process Calculi (abstract)Matthew Hennessy. 90 [doi]
- A Polynomial Time Approximation Scheme for Dense MIN 2SATCristina Bazgan, Wenceslas Fernandez de la Vega. 91-99 [doi]
- Decidable Classes of the Verification Problem in a Timed Predicate LogicDanièle Beauquier, Anatol Slissenko. 100-111 [doi]
- Interpretations of Extensible Objects and TypesViviana Bono, Michele Bugliesi. 112-123 [doi]
- Restrictive Acceptance Suffices for Equivalence ProblemsBernd Borchert, Lane A. Hemaspaandra, Jörg Rothe. 124-135 [doi]
- Grammar Systems as Language Analyzers and Recursively Enumerable LanguagesHenning Bordihn, Jürgen Dassow, György Vaszil. 136-147 [doi]
- An Interpretation of Extensible ObjectsGérard Boudol, Silvano Dal-Zilio. 148-160 [doi]
- Modeling Operating Systems Schedulers with Multi-Stack-Queue GrammarsLuca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini. 161-172 [doi]
- Iterative Arrays with a Wee Bit AlternationThomas Buchholz, Andreas Klein, Martin Kutrib. 173-184 [doi]
- Secret Sharing Schemes with Detection of Cheaters for a General Access StructureSergio Cabello, Carles Padró, Germán Sáez. 185-194 [doi]
- Constructive Notes on Uniform and Locally Convex SpacesLuminita Dediu, Douglas S. Bridges. 195-203 [doi]
- Graph Automorphisms with Maximal Projection DistancesH. N. de Ridder, Hans Leo Bodlaender. 204-214 [doi]
- Kleene Theorems for Event-Clock AutomataCatalin Dima. 215-225 [doi]
- Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed LanguagesPál Dömösi, Manfred Kudlek. 226-233 [doi]
- Exponential Output Size of Top-Down Tree TransducersFrank Drewes. 234-245 [doi]
- On Recognizable Languages in Divisibility MonoidsManfred Droste, Dietrich Kuske. 246-257 [doi]
- Expressiveness of Point-to-Point versus Broadcast CommunicationsCristian Ene, Traian Muntean. 258-268 [doi]
- On Relative Loss Bounds in Generalized Linear RegressionJürgen Forster. 269-280 [doi]
- Generalized P-SystemsRudolf Freund. 281-292 [doi]
- Optimal, Distributed Decision-Making: The Case of No CommunicationStavros Georgiades, Marios Mavronicolas, Paul G. Spirakis. 293-303 [doi]
- Generalized PCP Is Decidable for Marked MorphismsVesa Halava, Tero Harju, Mika Hirvensalo. 304-315 [doi]
- On Time-Constructible Functions in One-Dimensional Cellular AutomataChuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai. 316-326 [doi]
- Dichotomy Theorem for the Generalized Unique Satisfiability ProblemLaurent Juban. 327-337 [doi]
- A General Categorical Connection between Local Event Structures and Local TracesH. C. M. Kleijn, Rémi Morin, Brigitte Rozoy. 338-349 [doi]
- Correct Translation of Mutually Recursive Function Systems into TOL Collage GrammarsRenate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger. 350-361 [doi]
- Synchronized Product of Linear Bounded MachinesTeodor Knapik, Étienne Payet. 362-373 [doi]
- On Maximal Repetitions in WordsRoman M. Kolpakov, Gregory Kucherov. 374-385 [doi]
- Axiomatization of the Coherence Property for Categories of SymmetriesDorel Lucanu. 386-397 [doi]
- Sewing GrammarsCarlos Martín-Vide, Alexandru Mateescu. 398-408 [doi]
- State and Transition Complexity of Watson-Crick Finite AutomataAndrei Paun, Mihaela Paun. 409-420 [doi]
- A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-PointCatherine Pilière. 421-432 [doi]
- delta-Uniformly Decidable Sets and Turing MachinesAdriana Popovici, Dan Popovici. 433-440 [doi]
- A Parallel Context-Free Derivation HierarchyKlaus Reinhardt. 441-450 [doi]
- Generalized Synchronization LanguagesIsabelle Ryl, Yves Roos, Mireille Clerbout. 451-462 [doi]
- A Generalization of Dijkstra s Calculus to Typed Program SpecificationsKlaus-Dieter Schewe, Bernhard Thalheim. 463-474 [doi]
- Homomorphisms and Concurrent Term RewritingFranck Seynhaeve, Sophie Tison, Marc Tommasi. 475-487 [doi]
- On Two-Sided Infinite Fixed Points of MorphismsJeffrey Shallit, Ming-wei Wang. 488-499 [doi]
- Tiling Multi-dimensional ArraysJonathan P. Sharp. 500-511 [doi]
- Modeling Interaction by Sheaves and Geometric LogicViorica Sofronie-Stokkermans, Karel Stokkermans. 512-523 [doi]
- The Operators minCh and maxCh on the Polynomial HierarchyHolger Spakowski, Jörg Vogel. 524-535 [doi]
- The Kolmogorov Complexity of Real NumbersLudwig Staiger. 536-546 [doi]
- A Partial Order Method for the Verification of Time Petri NetsIrina Virbitskaite, E. Pokozy. 547-558 [doi]
- Deriving Formulas for Domination Numbers of Fasciagraphs and RotagraphsJanez Zerovnik. 559-568 [doi]