Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 85
Volume 85, Number 1, 1991
- Jie Wang:
On p-Creative Sets and p-Completely Creative Sets. 1-31 - Jeanne Devolder, Igor Litovsky:
Finitely Generated bi-omega-Languages. 33-52 - Oscar H. Ibarra, Hui Wang:
Parallel Parsing on a One-Way Linear Array of Finite-State Machines. 53-74 - Steven Lindell:
An Analysis of Fixed-Point Queries on Binary Trees. 75-95 - Pieter Hendrik Rodenburg:
Algebraic Specifiability of Data Types with minimal Computable Parameters. 97-116 - Wojciech Szpankowski:
A Characterization of Digital Search Trees from the Successful Search Viewpoint. 117-134 - Miroslaw Kutylowski:
Multihead One-Way Finite Automata. 135-153 - Ingo Wegener:
The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits. 155-170 - Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli:
QRT FIFO Automata, Breath-First Grammars and Their Relations. 171-203 - Pascal Michel:
An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine. 205-212
Volume 85, Number 2, 1991
- Marta Cialdea
:
Resolution for Some First-Order Modal Systems. 213-229 - Narjes Doggaz, Claude Kirchner:
Completion for Unification. 231-251 - Éric Sopena:
Hypermap Rewriting: A Combinatorial Approach. 253-281 - Robert D. Tennent, J. K. Tobin:
Continuations in Possible-World Semantics. 283-303 - Jürgen Kämper:
Nonuniform Proof Systems: A New Framework to Describe Nonuniform and Probabilistic Complexity Classes. 305-331 - Shigeki Goto:
Proof Normalization with Nonstandard Objects. 333-351 - Inge Bethke:
Coherence Spaces are Untopological. 353-357
a service of 
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-05-09 23:46 CEST 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:
