Volume 88,
Number 1,
1991
- Ricard Gavaldà, José L. Balcázar:
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets.
1-14 BibTeX
- Kim Guldstrand Larsen, Bent Thomsen:
Partial Specifications and Compositional Verification.
15-32 BibTeX
- Satoru Miyano:
Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems.
33-57 BibTeX
- Maxime Crochemore, Wojciech Rytter:
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.
59-82 BibTeX
- Max H. Garzon, Yechezkel Zalcstein:
The Complexity of Grigorchuk Groups with Application to Cryptography.
83-98 BibTeX
- Sang Cho, Dung T. Huynh:
Finite-Automaton Aperiodicity is PSPACE-Complete.
99-116 BibTeX
- Priti Shankar, B. S. Adiga:
A Graph-Based Regularity Test for Deterministic Context-free Languages.
117-125 BibTeX
- Arto Salomaa:
A Deterministic Algorithm for Modular Knapsack Problems.
127-138 BibTeX
- Joost Engelfriet:
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic.
139-150 BibTeX
- Kunio Aizawa, Akira Nakamura:
Graph Grammars with Path-Controlled Embedding.
151-170 BibTeX
- Salah Labhalla, Henri Lombardi:
Représentations des nombres réels par développements en base entière et complexité.
171-182 BibTeX
- Samir Khuller, Vijay V. Vazirani:
Planar Graph Coloring is not Self-Reducible, Assuming P != NP.
183-189 BibTeX
Volume 88,
Number 2,
1991
- Hiroyuki Seki, T. Matsumura, Mamoru Fujii, Tadao Kasami:
On Multiple Context-Free Grammars.
191-229 BibTeX
- Ulrich Huckenbeck:
A Result about the Power of Geometric Oracle Machines.
231-251 BibTeX
- Zoltán Fülöp:
A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes.
253-268 BibTeX
- L. Peeva:
Equivalence, Reduction and Minimization of Finite Automata over Semirings.
269-285 BibTeX
- Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Note on Real-Time One-Way Alternating Multicounter Machines.
287-296 BibTeX
- A. Bebják, Ivana Stefáneková:
Separation of Deterministic, Nondeterministic and Alternating Complexity Classes.
297-311 BibTeX
- W. Baur:
On the Algebraic Complexity of Rational Iteration Procedures.
313-324 BibTeX
- Andreas Weber, Helmut Seidl:
On the Degree of Ambiguity of Finite Automata.
325-349 BibTeX
- H. Yoo, Kosaburo Hashiguchi:
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1).
351-363 BibTeX
- Patrice Séébold:
Fibonacci Morphisms and Sturmian Words.
365-384 BibTeX
Copyright © Sun May 17 00:24:05 2009
by Michael Ley (ley@uni-trier.de)
