Abstract is missing.
- Region Analysis and a pi-Calculus wiht GroupsSilvano Dal-Zilio, Andrew D. Gordon. 1-20 [doi]
- Abstract Data Types in Computer AlgebraJames H. Davenport. 21-35 [doi]
- What Do We Learn from Experimental Algorithmics?Camil Demetrescu, Giuseppe F. Italiano. 36-51 [doi]
- And/Or Hierarchies and Round AbstractionRadu Grosu. 52-63 [doi]
- Computational Politics: Electoral SystemsEdith Hemaspaandra, Lane A. Hemaspaandra. 64-83 [doi]
- 0-1 Laws for Fragments of Existential Second-Order Logic: A SurveyPhokion G. Kolaitis, Moshe Y. Vardi. 84-98 [doi]
- On Algorithms and InteractionJan van Leeuwen, Jirí Wiedermann. 99-113 [doi]
- On the Use of Duality and Geometry in Layouts for ATM NetworksShmuel Zaks. 114-131 [doi]
- On the Lower Bounds for One-Way Quantum AutomataFarid M. Ablayev, Aida Gainutdinova. 132-140 [doi]
- Axiomatizing Fully Complete Models for ML Polymorphic TypesSamson Abramsky, Marina Lenisa. 141-151 [doi]
- Measure Theoretic Completeness Notions for the Exponential Time ClassesKlaus Ambos-Spies. 152-161 [doi]
- Edge-Bisection of Chordal RingsLali Barrière, Josep Fàbrega. 162-171 [doi]
- Equation Satisfiability and Program Satisfiability for Finite MonoidsDavid A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien. 172-181 [doi]
- XML GrammarsJean Berstel, Luc Boasson. 182-191 [doi]
- Simplifying Flow NetworksTherese C. Biedl, Brona Brejová, Tomás Vinar. 192-201 [doi]
- Balanced ::::k::::-ColoringsTherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. 202-211 [doi]
- A Compositional Model for Confluent Dynamic Data-Flow NetworksFrank S. de Boer, Marcello M. Bonsangue. 212-221 [doi]
- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer MultiplicationBeate Bollig. 222-231 [doi]
- Expressiveness of Updatable Timed AutomataPatricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit. 232-242 [doi]
- Iterative Arrays with Small Time BoundsThomas Buchholz, Andreas Klein, Martin Kutrib. 243-252 [doi]
- Embedding Fibonacci Cubes into Hypercubes with ::::Omega::::(2:::::::cn:::::::) Faulty NodesRostislav Caha, Petr Gregor. 253-263 [doi]
- Periodic-Like WordsArturo Carpi, Aldo de Luca. 264-274 [doi]
- The Monadic Theory of Morphic Infinite Words and GeneralizationsOlivier Carton, Wolfgang Thomas. 275-284 [doi]
- Optical Routing of Uniform Instances in ToriFrancesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny. 285-294 [doi]
- Factorizing Codes and Schützenberger ConjecturesClelia de Felice. 295-303 [doi]
- Compositional Characterizations of lambda-Terms Using Intersection TypesMariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama. 304-313 [doi]
- Time and Message Optimal Leader Election in Asynchronous Oriented Complete NetworksStefan Dobrev. 314-322 [doi]
- Subtractive Reductions and Complete Problems for Counting Complexity ClassesArnaud Durand, Miki Hermann, Phokion G. Kolaitis. 323-332 [doi]
- On the Autoreducibility of Random SequencesTodd Ebert, Heribert Vollmer. 333-342 [doi]
- Iteration Theories of Boolean FunctionsZoltán Ésik. 343-352 [doi]
- An Algorithm Constructing the Semilinear Post:::*::: for 2-Dim Reset/Transfer VASSAlain Finkel, Grégoire Sutre. 353-362 [doi]
- NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar GraphsDimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. 363-372 [doi]
- Explicit FusionsPhilippa Gardner, Lucian Wischik. 373-382 [doi]
- State Space Reduction Using Partial tau-ConfluenceJan Friso Groote, Jaco van de Pol. 383-393 [doi]
- Reducing the Number of Solutions of NP FunctionsLane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung. 394-404 [doi]
- Regular Collections of Message Sequence ChartsJesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan. 405-414 [doi]
- Alternating and Empty Alternating Auxiliary Stack AutomataMarkus Holzer, Pierre McKenzie. 415-425 [doi]
- Conter Machines: Decidable Properties and Applications to Verification ProblemsOscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer. 426-435 [doi]
- A Family of NFA s Which Need 2:::n::: -::::alpha:::: Deterministic StatesKazuo Iwama, Akihiro Matsuura, Mike Paterson. 436-445 [doi]
- Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph ColoringKlaus Jansen, Lorant Porkolab. 446-455 [doi]
- Matching Modulo Associativity and Idempotency Is NP-CompleteOndrej Klíma, Jirí Srba. 456-466 [doi]
- On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP ProblemsSven Kosub. 467-476 [doi]
- Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their GeneralizationDaniel Král. 477-487 [doi]
- Formal Series over AlgebrasWerner Kuich. 488-496 [doi]
- µ-Calculus SynthesisOrna Kupferman, Moshe Y. Vardi. 497-507 [doi]
- The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set TheoryGrégory Lafitte, Jacques Mazoyer. 508-517 [doi]
- Timed Automata with Monotonic ActivitiesRuggero Lanotte, Andrea Maggiolo-Schettini. 518-527 [doi]
- On a Generalization of Bi-Complement Reducible GraphsVadim V. Lozin. 528-538 [doi]
- Automatic Graphs and Graph ::::D::::0::::L::::-SystemsOlivier Ly. 539-548 [doi]
- Bilinear Functions and Trees over the (max, +) SemiringSabrina Mantaci, Vincent D. Blondel, Jean Mairesse. 549-558 [doi]
- Derivability in Locally Quantified Modal Logics via Translation in Set TheoryAngelo Montanari, Alberto Policriti, Matteo Slanina. 559-568 [doi]
- pi-Calculus, Structured Coalgebras, and Minimal HD-AutomataUgo Montanari, Marco Pistore. 569-578 [doi]
- Informative Labeling Schemes for GraphsDavid Peleg. 579-588 [doi]
- Separation Results for Rebound AutomataHolger Petersen. 589-598 [doi]
- Unary Pushdown Automata and Auxiliary Space Lower BoundsGiovanni Pighizzini. 599-608 [doi]
- Binary Decision Diagrams by Shard RewritingJaco van de Pol, Hans Zantema. 609-618 [doi]
- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOLLeonor Prensa Nieto, Javier Esparza. 619-628 [doi]
- Why so Many Temporal Logics Climb up the Trees?Alexander Moshe Rabinovich, Shahar Maoz. 629-639 [doi]
- Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction ProblemsSteffen Reith, Heribert Vollmer. 640-649 [doi]
- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity NondeterminismPetr Savický, Detlef Sieling. 650-659 [doi]
- On Diving in TreesThomas Schwentick. 660-669 [doi]
- Abstract Syntax and Variable Binding for Linear BindersMiki Tanaka. 670-679 [doi]
- Regularity of Congruential GraphsTanguy Urvoy. 680-689 [doi]
- Sublinear AmbiguityKlaus Wich. 690-698 [doi]
- An Automata-Based Recognition Algorithm for Semi-extended Regular ExpressionsHiroaki Yamamoto. 699-708 [doi]