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=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Type 2 computational complexity of functions on Cantor's space
Klaus Weihrauch
,
Christoph Kreitz
Theoretical Computer Science
82
, 1991, pp. 1-18
Periodicity and ultimate periodicity of DOL systems
Barbara Lando
Theoretical Computer Science
82
, 1991, pp. 19-33
An algorithm for distinguishing efficiently bit-strings by their subsequences
Jean-Jacques Hebrard
Theoretical Computer Science
82
, 1991, pp. 35-49
On adaptive versus nonadaptive bounded query machines
Ker-I Ko
Theoretical Computer Science
82
, 1991, pp. 51-69
On the number of factors of Sturmian words
Filippo Mignosi
Theoretical Computer Science
82
, 1991, pp. 71-84
Size-depth trade-offs for monotone arithmetic circuits
Marc Snir
Theoretical Computer Science
82
, 1991, pp. 85-93
Nonterminal separation in graph grammars
Joost Engelfriet
,
George Leih
,
Grzegorz Rozenberg
Theoretical Computer Science
82
, 1991, pp. 95-111
The complexity of matrix transposition on one-tape off-line Turing machines
Martin Dietzfelbinger
,
Wolfgang Maass
,
Georg Schnitger
Theoretical Computer Science
82
, 1991, pp. 113-129
Decidability of structural equivalence of EOL grammars
Kai Salomaa
,
Sheng Yu
Theoretical Computer Science
82
, 1991, pp. 131-139
An
O(T\log T)
reduction from RAM computations to satisfiability
J.M. Robson
Theoretical Computer Science
82
, 1991, pp. 141-149
Determining and stationary sets for some classes of partial recursive functions
Cristian Calude
,
Gabrial Istrate
Theoretical Computer Science
82
, 1991, pp. 151-155
Area complexity of merging
Vladimir Palko
,
Ondrej Sýkora
,
Imrich Vrt̑o
Theoretical Computer Science
82
, 1991, pp. 157-163
A general context-free parsing algorithm running in linear time on every
LR(k)
grammar without using lookahead
Joop M.I.M. Leo
Theoretical Computer Science
82
, 1991, pp. 165-176
Infinite hypergraphs I. Basic properties
Michel Bauderon
Theoretical Computer Science
82
, 1991, pp. 177-214
Closure functions and general iterates as reflectors
G.M. Germano
,
S. Mazzanti
Theoretical Computer Science
82
, 1991, pp. 215-252
The existence of refinement mappings
Martín Abadi
,
Leslie Lamport
Theoretical Computer Science
82
, 1991, pp. 253-284
Recursive process definitions with the state operator
J.C.M. Baeten
,
J.A. Bergstra
Theoretical Computer Science
82
, 1991, pp. 285-302
A formal framework for independence with respect to transactions in the universal relation model
Axel Lukassen
,
Gottfried Vossen
Theoretical Computer Science
82
, 1991, pp. 303-327
On Horn spectra
Wieslaw Szwast
Theoretical Computer Science
82
, 1991, pp. 329-339
A taxonomy of fairness and temporal logic problems for Petri nets
Rodney R. Howell
,
Louis E. Rosier
,
Hsu-Chun Yen
Theoretical Computer Science
82
, 1991, pp. 341-372
An abstract framework for environment machines
P.-L. Curien
Theoretical Computer Science
82
, 1991, pp. 389-402
On guarded recursion
Eric Badouel
,
Philippe Darondeau
Theoretical Computer Science
82
, 1991, pp. 403-408
Weakly expressive models for Hoare logic
R. Hoofman
Theoretical Computer Science
82
, 1991, pp. 409-418