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=68
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the balance property of Patricia tries: External path length viewpoint
Peter Kirschenhofer
,
Helmut Prodinger
,
Wojciech Szpankowski
Theoretical Computer Science
68
, 1989, pp. 1-17
Efficient simulations of simple models of parallel computation by time-bounded ATMs and space-bounded TMs
Jik H. Chang
,
Oscar H. Ibarra
,
Michael A. Palis
Theoretical Computer Science
68
, 1989, pp. 19-36
Event structures and domains
Manfred Droste
Theoretical Computer Science
68
, 1989, pp. 37-47
Left ideals and reachability in machines
Gerhard Hofer
Theoretical Computer Science
68
, 1989, pp. 49-56
Worst-case analysis of the set-union problem with extended backtracking
Giorgio Gambosi
,
Giuseppe F. Italiano
,
Maurizio Talamo
Theoretical Computer Science
68
, 1989, pp. 57-70
Euclidian geometry in terms of automata theory
Ulrich Huckenbeck
Theoretical Computer Science
68
, 1989, pp. 71-87
An NC algorithm for Brooks' theorem
Howard J. Karloff
Theoretical Computer Science
68
, 1989, pp. 89-103
The semantics of lazy functional languages
Mark B. Josephs
Theoretical Computer Science
68
, 1989, pp. 105-111
A hierarchy of propositional Horn formulas
Bogdan S. Chlebus
Theoretical Computer Science
68
, 1989, pp. 113-119
On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas
V. Arvind
,
S. Biswas
Theoretical Computer Science
68
, 1989, pp. 123-134
Paraconsistent logic programming
Howard A. Blair
,
V.S. Subrahmanian
Theoretical Computer Science
68
, 1989, pp. 135-154
On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs
Andrzej Lingas
,
Andrzej Proskurowski
Theoretical Computer Science
68
, 1989, pp. 155-173
Submodule construction as equation solving in CCS
Joachim Parrow
Theoretical Computer Science
68
, 1989, pp. 175-202
Semantics of distributed definite clause programs
R. Ramanujam
Theoretical Computer Science
68
, 1989, pp. 203-220
Categories of embeddings
Thierry Coquand
Theoretical Computer Science
68
, 1989, pp. 221-237
A transformation system for generating description languages of chain code pictures
Roger Gutbrod
Theoretical Computer Science
68
, 1989, pp. 239-252
Codes engendrant certains systèmes sofiques
F. Blanchard
Theoretical Computer Science
68
, 1989, pp. 253-265
Relativizing relativized computations
Neil Immerman
,
Stephen R. Mahaney
Theoretical Computer Science
68
, 1989, pp. 267-276
Hoare's logic for nondeterministic regular programs: A nonstandard approach
M. Teresa Hortalá-González
,
Mario Rodríguez-Artalejo
Theoretical Computer Science
68
, 1989, pp. 277-302
Continuously generated fixed points
Felipe Bracho
Theoretical Computer Science
68
, 1989, pp. 303-317
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
Paliath Narendran
,
Friedrich Otto
Theoretical Computer Science
68
, 1989, pp. 319-332
A typed calculus based on a fragment of linear logic
Ugo Solitro
Theoretical Computer Science
68
, 1989, pp. 333-342
On separating the EREW and CREW PRAM models
Eli Gafni
,
Joseph Naor
,
Prabhakar Ragde
Theoretical Computer Science
68
, 1989, pp. 343-346
Comment on a remark of Forys
C.P. Rupert
Theoretical Computer Science
68
, 1989, pp. 347-348