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=Theory of Computing Systems AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On approximation scheme preserving reducibility and its applications
P. Crescenzi
,
L. Trevisan
Theory of Computing Systems
33
(1), 2000, pp. 1-16
Learning monotone log-term DNF formulas under the uniform distribution
Y. Sakai
,
A. Maruoka
Theory of Computing Systems
33
(1), 2000, pp. 17-33
Team learning of computable languages
S. Jain
,
A. Sharma
Theory of Computing Systems
33
(1), 2000, pp. 35-58
Spinal-formed context-free tree grammars
A. Fujiyoshi
,
T. Kasai
Theory of Computing Systems
33
(1), 2000, pp. 59-83
The characterization of data-accumulating algorithms
S.D. Bruda
,
S.G. Akl
Theory of Computing Systems
33
(1), 2000, pp. 85-96
An efficient algorithm for generating Prüfer codes from labelled trees
H.-C. Chen
,
Y.-L. Wang
Theory of Computing Systems
33
(1), 2000, pp. 97-105
Modeling time-bounded prefix Kolmogorov complexity
D.W. Juedes
,
J.H. Lutz
Theory of Computing Systems
33
(2), 2000, pp. 111-123
Linear time solvable optimization problems on graphs of bounded clique-width
B. Courcelle
,
J.A. Makowsky
,
U. Rotics
Theory of Computing Systems
33
(2), 2000, pp. 125-150
Resource-bounded measure and learnability
W. Lindner
,
R. Schuler
,
O. Watanabe
Theory of Computing Systems
33
(2), 2000, pp. 151-170
Efficient scheduling of strict multithreaded computations
P. Fatourou
,
P. Spirakis
Theory of Computing Systems
33
(3), 2000, pp. 173-232
A superlogarithmic lower bound for shuffle-unshuffle sorting networks
C.G. Plaxton
,
T. Suel
Theory of Computing Systems
33
(3), 2000, pp. 233-254
Tree adjoining languages and multipushdown languages
A. Cherubini
,
P. San Pietro
Theory of Computing Systems
33
(4), 2000, pp. 257-293
On multidimensional curves with Hilbert property
J. Alber
,
R. Niedermeier
Theory of Computing Systems
33
(4), 2000, pp. 295-312
An improved hierarchy result for partitioned BDDs
M. Sauerhoff
Theory of Computing Systems
33
(4), 2000, pp. 313-329
Efficient communication strategies for ad hoc wireless networks
M. Adler
,
C. Scheideler
Theory of Computing Systems
33
(5-6), 2000, pp. 337-391
On the flattest common supersequence method for deadlock-free routing in arbitrary networks
A.K. Laing
,
R. Cypher
,
C.A. Duncan
Theory of Computing Systems
33
(5-6), 2000, pp. 393-426
Robust parallel computations through randomization
S.C. Kontogiannis
,
G.E. Pantziou
,
P.G. Spirakis
,
M. Yung
Theory of Computing Systems
33
(5-6), 2000, pp. 427-464
Recovery time of dynamic allocation processes
A. Czumaj
Theory of Computing Systems
33
(5-6), 2000, pp. 465-487
On scheduling parallel tasks at twilight
H. Bast
Theory of Computing Systems
33
(5-6), 2000, pp. 489-563