default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 88
Volume 88, Number 1, 1991
- Ricard Gavaldà
, José L. Balcázar:
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. 1-14 - Kim Guldstrand Larsen, Bent Thomsen:
Partial Specifications and Compositional Verification. 15-32 - Satoru Miyano:
Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems. 33-57 - Maxime Crochemore, Wojciech Rytter:
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. 59-82 - Max H. Garzon, Yechezkel Zalcstein:
The Complexity of Grigorchuk Groups with Application to Cryptography. 83-98 - Sang Cho, Dung T. Huynh:
Finite-Automaton Aperiodicity is PSPACE-Complete. 99-116 - Priti Shankar, B. S. Adiga:
A Graph-Based Regularity Test for Deterministic Context-free Languages. 117-125 - Arto Salomaa:
A Deterministic Algorithm for Modular Knapsack Problems. 127-138 - Joost Engelfriet:
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. 139-150 - Kunio Aizawa, Akira Nakamura:
Graph Grammars with Path-Controlled Embedding. 151-170 - Salah Labhalla, Henri Lombardi:
Représentations des nombres réels par développements en base entière et complexité. 171-182 - Samir Khuller, Vijay V. Vazirani:
Planar Graph Coloring is not Self-Reducible, Assuming P != NP. 183-189
Volume 88, Number 2, 1991
- Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, Tadao Kasami:
On Multiple Context-Free Grammars. 191-229 - Ulrich Huckenbeck:
A Result about the Power of Geometric Oracle Machines. 231-251 - Zoltán Fülöp:
A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes. 253-268 - L. Peeva:
Equivalence, Reduction and Minimization of Finite Automata over Semirings. 269-285 - Katsushi Inoue, Akira Ito, Itsuo Takanami:
A Note on Real-Time One-Way Alternating Multicounter Machines. 287-296 - Andrej Bebják, Ivana Stefáneková:
Separation of Deterministic, Nondeterministic and Alternating Complexity Classes. 297-311 - Walter Baur:
On the Algebraic Complexity of Rational Iteration Procedures. 313-324 - Andreas Weber, Helmut Seidl:
On the Degree of Ambiguity of Finite Automata. 325-349 - H. Yoo, Kosaburo Hashiguchi:
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1). 351-363 - Patrice Séébold:
Fibonacci Morphisms and Sturmian Words. 365-384
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
