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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of edge labelings for trees
Y. Perl
,
S. Zaks
Theoretical Computer Science
19
, 1982, pp. 1-16
On the complexity of simple arithmetic expressions
O.H. Ibarra
,
B.S. Leininger
,
S. Moran
Theoretical Computer Science
19
, 1982, pp. 17-28
On infinite words obtained by iterating morphisms
K. Culik II
,
A. Salomaa
Theoretical Computer Science
19
, 1982, pp. 29-38
Additive complexity in directed computations
D.Yu. Grigoriev
Theoretical Computer Science
19
, 1982, pp. 39-67
Pebble games for studying storage sharing
R. Sethi
Theoretical Computer Science
19
, 1982, pp. 69-84
Partitioning a graph in
O(|A|\log^2|V|)
A. Cardon
,
M. Chrochemore
Theoretical Computer Science
19
, 1982, pp. 85-98
On the holonomy decomposition of transformation semigroups (Note)
M. Holcombe
Theoretical Computer Science
19
, 1982, pp. 99-104
On universality of concurrent expressions with synchronization primitives (Note)
T. Ito
,
Y. Nishitani
Theoretical Computer Science
19
, 1982, pp. 105-115
Graph grammars and operational semantics
P. Padawitz
Theoretical Computer Science
19
, 1982, pp. 117-141
A universal formalism to express decompositions, functional dependencies and other constraints in a relational database
J. Paredaens
Theoretical Computer Science
19
, 1982, pp. 143-160
Symmetric space-bounded computation
Harry R. Lewis
,
Christos H. Papadimitriou
Theoretical Computer Science
19
, 1982, pp. 161-187
On the relationship between the biconnectivity augmentation and travelling salesman problems
G.N. Frederickson
,
J. Ja'Ja
Theoretical Computer Science
19
, 1982, pp. 189-201
On the time-space tradeoff for sorting with linear queries
A.C.-C. Yao
Theoretical Computer Science
19
, 1982, pp. 203-218
2DST mappings on languages and related problems (Note)
O.H. Ibarra
Theoretical Computer Science
19
, 1982, pp. 219-227
Monadic Thue systems
R.V. Book
,
M. Jantzen
,
C. Wrathall
Theoretical Computer Science
19
, 1982, pp. 231-251
A fast implementation of a multidimensional storage into a tree storage
K.R. Reischuk
Theoretical Computer Science
19
, 1982, pp. 253-266
Inclusion and equivalence between relational database schemata
P. Atzeni
,
G. Ausiello
,
C. Batini
,
M. Moscarini
Theoretical Computer Science
19
, 1982, pp. 267-285
Reductions on
NP
and
P
-selective sets
A.L. Selman
Theoretical Computer Science
19
, 1982, pp. 287-304
Time-optimal solution of the firing-squad-synchronization problem for
N
-dimensional rectangles with the general at an arbitrary position
H. Szwerinski
Theoretical Computer Science
19
, 1982, pp. 305-320
Comparisons between linear functions can help
M. Snir
Theoretical Computer Science
19
, 1982, pp. 321-330
On direct products of automaton decidable theories (Note)
B.R. Hodgson
Theoretical Computer Science
19
, 1982, pp. 331-335
Is binary encoding appropriate for the problem-language relationship? (Note)
N. Megiddo
Theoretical Computer Science
19
, 1982, pp. 337-341