Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=85
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On p-creative sets and p-completely creative sets
Jie Wang
Theoretical Computer Science
85
, 1991, pp. 1-31
Finitely generated bi-
\omega
-languages
J. Devolder
,
I. Litovsky
Theoretical Computer Science
85
, 1991, pp. 33-52
Parallel parsing on a one-way linear array of finite-state machines
Oscar H. Ibarra
,
Tao Jiang
,
Hui Wang
Theoretical Computer Science
85
, 1991, pp. 53-74
An analysis of fixed-point queries on binary trees
Steven Lindell
Theoretical Computer Science
85
, 1991, pp. 75-95
Algebraic specificability of data types with minimal computable parameters
P.H. Rodenburg
Theoretical Computer Science
85
, 1991, pp. 97-116
A characterization of digital search trees from the successful search viewpoint
Wojciech Szpankowski
Theoretical Computer Science
85
, 1991, pp. 117-134
Multihead one-way finite automata
Mirosƚaw Kutyƚowski
Theoretical Computer Science
85
, 1991, pp. 135-153
The complexity of the parity function in unbounded fan-in, unbounded depth circuits
Ingo Wegener
Theoretical Computer Science
85
, 1991, pp. 155-170
QRT FIFO automata, breadth-first grammars and their relations
Alessandra Cherubini
,
Claudio Citrini
,
Stefano Crespi Reghizzi
,
Dino Mandrioli
Theoretical Computer Science
85
, 1991, pp. 171-203
An NP-complete language accepted in linear time by a one-tape Turing machine
Pascal Michel
Theoretical Computer Science
85
, 1991, pp. 205-212
Resolution for some first-order modal systems
Marta Cialdea
Theoretical Computer Science
85
, 1991, pp. 213-229
Completion for unification
Narjes Doggaz
,
Claude Kirchner
Theoretical Computer Science
85
, 1991, pp. 231-251
Hypermap rewriting: A combinatorial approach
Eric Sopena
Theoretical Computer Science
85
, 1991, pp. 253-281
Continuations in possible-world semantics
R.D. Tennent
,
J.K. Tobin
Theoretical Computer Science
85
, 1991, pp. 283-303
Nonuniform proof systems: a new framework to describe nonuniform and probabilistic complexity classes
Jürgen Kämper
Theoretical Computer Science
85
, 1991, pp. 305-331
Proof normalization with nonstandard objects
Shigeki Goto
Theoretical Computer Science
85
, 1991, pp. 333-351
Coherence spaces are untopological
Inge Bethke
Theoretical Computer Science
85
, 1991, pp. 353-357