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=93
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the expressive power of finitely typed and universally polymorphic recursive procedures
A.J. Kfoury
,
J. Tiuryn
,
P. Urzyczyn
Theoretical Computer Science
93
, 1992, pp. 1-41
Top-down tree transducers with two-way tree walking look-ahead
Sándor Vágvölgyi
Theoretical Computer Science
93
, 1992, pp. 43-74
A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem
Gyŏrgy E. Révész
Theoretical Computer Science
93
, 1992, pp. 75-89
A new approach to recursion removal
Peter G. Harrison
,
Hessam Khoshnevisan
Theoretical Computer Science
93
, 1992, pp. 91-113
Paraconsistent disjunctive deductive databases
V.S. Subrahmanian
Theoretical Computer Science
93
, 1992, pp. 115-141
Stable neighbourhoods
Guo-Qiang Zhang
Theoretical Computer Science
93
, 1992, pp. 143-157
Unrestricted resolution versus N-resolution
Andreas Goerdt
Theoretical Computer Science
93
, 1992, pp. 159-167
Logically defined subsets of
N^k
Pierre Péladeau
Theoretical Computer Science
93
, 1992, pp. 169-183
On structural conditions for weak persistency and semilinearity of Petri nets
Kunihiko Hiraishi
,
Atsunobu Ichikawa
Theoretical Computer Science
93
, 1992, pp. 185-199
Dynamic algorithms in D.E. Knuth's model: A probabilistic analysis
G. Louchard
,
B. Randrianarimanana
,
R. Schott
Theoretical Computer Science
93
, 1992, pp. 201-225
On automata on infinite trees
P. Bonizzoni
,
G. Mauri
Theoretical Computer Science
93
, 1992, pp. 227-244
Optimal parallel algorithms for forest and term matching
Zvi M. Kedem
,
Krishna V. Palem
Theoretical Computer Science
93
, 1992, pp. 245-264
Restricted relativizations of probabilistic polynomial time
Seinosuke Toda
Theoretical Computer Science
93
, 1992, pp. 265-277
Testing the optimality of alphabetic trees
Prakash Ramanan
Theoretical Computer Science
93
, 1992, pp. 279-301
An arithmetic model of computation equivalent to threshold circuits
Joan Boyar
,
Gudmund Frandsen
,
Carl Sturtivant
Theoretical Computer Science
93
, 1992, pp. 303-319
A criterion for proving noetherianity of a relation
Patrick Dehornoy
Theoretical Computer Science
93
, 1992, pp. 321-325
On a kind of Fatou property of context-free groups
Thomas Herbst
Theoretical Computer Science
93
, 1992, pp. 327-331