default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 47
Volume 47, 1986
- Zoltán Ésik, Pál Dömösi:
Complete Classes of Automata for the alpha-0-Product. 1-14 - Karel Culík II, Sheng Yu:
Real-Time, Pseudo Real-Time, and Linear-Time ITA. 15-26 - Paliath Narendran, Friedrich Otto:
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems. 27-38 - J. Howard Johnson:
Rational Equivalence Relations. 39-60 - Andrzej Pelc:
Lie Patterns in Search Procedures. 61-69 - Karel Culík II, Juhani Karhumäki:
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. 71-84 - Leslie G. Valiant, Vijay V. Vazirani:
NP is as Easy as Detecting Unique Solutions. 85-93 - Jean-Pierre Pécuchet:
On the Complementation of Büchi Automata. 95-98 - Joos Heintz:
On Polynomials with Symmetric Galois Group which Are Easy to Compute. 99-105 - Piotr Wyrostek:
On the Size of Unambiguous Context-Free Grammars. 107-110 - Patrick W. Dymond:
On Nondeterminism in Parallel Computation. 111-120 - Pekka Orponen
:
A Classification of Complexity Core Lattices. 121-130 - Klaus W. Wagner:
Some Observations on the Connection Between Counting an Recursion. 131-147 - Marek Chrobak:
Finite Automata and Unary Languages. 149-158 - V. Rajkumar Dare, Rani Siromoney:
Subword Topology. 159-168 - Steven Homer:
On Simple and Creative Sets in NP. 169-180 - Jean-Claude Spehner:
Le Calcul Rapide des Melanges de Deux Mots. 171-203 - Lefteris M. Kirousis, Christos H. Papadimitriou:
Searching and Pebbling. 205-218 - Rainer Parchmann, Jürgen Duske:
Self-Embedding Indexed Grammars. 219-223 - Friedrich Otto:
The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems. 225-232 - Mauricio Karchmer:
Two Time-Space Tradeoffs for Element Distinctness. 237-246 - Yael Maon, Amiram Yehudai:
Balance of Many-Valued Transductions and Equivalence Problems. 247-262 - Ker-I Ko, Timothy J. Long, Ding-Zhu Du:
On One-Way Functions and Polynomial-Time Isomorphisms. 263-276 - Yael Maon, Baruch Schieber, Uzi Vishkin:
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs. 277-298 - Ker-I Ko:
On the Continued Fraction Representation of Computable Real Numbers. 299-313 - Wojciech Rytter:
On the Complexity of Parallel Parsing of General Context-Free Languages. 315-321 - J. W. Hong, Q. Zuo:
Lower Bounds on Communication Overlap of Networks. 323-328 - Andrzej Szalas:
Concerning the Semantic Consequence Relation in First-Order Temporal Logic. 329-334 - Jean-Luc Deleage, Laurent Pierre:
The Rational Index of the Dyck Language D'*-1. 335-343 - Luis Fariñas del Cerro, Ewa Orlowska:
Corrigendum: DAL-A Logic for Data Analysis. 345
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 2025-01-15 20:35 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:
