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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A strange application of Kolmogorov complexity
D. Hammer
,
A. Shen
Theory of Computing Systems
31
(1), 1998, pp. 1-4
Computing with time-varying data: Sequential complexity and parallel speed-up
F. Luccio
,
L. Pagli
Theory of Computing Systems
31
(1), 1998, pp. 5-26
Isolating an odd number of elements and applications in complexity theory
S. Gupta
Theory of Computing Systems
31
(1), 1998, pp. 27-39
Potential function analysis of greedy hot-potato routing
A. Ben-Dor
,
S. Halevi
,
A. Schuster
Theory of Computing Systems
31
(1), 1998, pp. 41-61
Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube
F.K. Hwang
,
Y.C. Yao
Theory of Computing Systems
31
(1), 1998, pp. 63-66
Frobeniu's degree formula and Toda's polynomials
J.-Y. Cai
Theory of Computing Systems
31
(1), 1998, pp. 67-75
Functions computable with nonadaptive queries to
NP
H. Buhrman
,
J. Kadin
,
T. Thierauf
Theory of Computing Systems
31
(1), 1998, pp. 77-92
The chain method to separate counting classes
K. Cronauer
,
U. Hertrampf
,
H. Vollmer
,
K.W. Wagner
Theory of Computing Systems
31
(1), 1998, pp. 93-108
Greedy numeration systems and regularity
M. Hollander
Theory of Computing Systems
31
(2), 1998, pp. 111-133
An experimental analysis of parallel sorting algorithms
G.E. Blelloch
,
C.E. Leiserson
,
B.M. Maggs
,
C.G. Plaxton
,
S.J. Smith
,
M. Zagha
Theory of Computing Systems
31
(2), 1998, pp. 135-167
A generalization of Cobham's theorem
F. Durand
Theory of Computing Systems
31
(2), 1998, pp. 169-185
Sharply bounded alternation and quasilinear time
S.A. Bloch
,
J.F. Buss
,
J. Goldsmith
Theory of Computing Systems
31
(2), 1998, pp. 187-214
A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
L. Staiger
Theory of Computing Systems
31
(3), 1998, pp. 215-229
Expressiveness and complexity of generic graph machines
M. Gemis
,
J. Paredaens
,
P. Peelman
,
J. van den Bussche
Theory of Computing Systems
31
(3), 1998, pp. 231-249
Don't be too clever: Routing BMMC permutations on the MasPar MP-2
T.H. Cormen
,
K. Bruhl
Theory of Computing Systems
31
(3), 1998, pp. 251-278
Embedding complete binary trees into star and pancake graphs
A. Bouabdallah
,
M.C. Heydemann
,
J. Opatrny
,
D. Sotteau
Theory of Computing Systems
31
(3), 1998, pp. 279-305
R_{1-tt}^{\cal SN}(NP)
distinguishes robust many-one and Turing completeness
E. Hemaspaandra
,
L.A. Hemaspaandra
,
H. Hempel
Theory of Computing Systems
31
(3), 1998, pp. 307-325
First- and second-order diffusive methods for rapid, coarse, distributed load balancing
S. Muthukrishnan
,
B. Ghosh
,
M.H. Schultz
Theory of Computing Systems
31
(4), 1998, pp. 331-354
Verification of cache coherence protocols by aggregation of distributed transactions
S. Park
,
D.L. Dill
Theory of Computing Systems
31
(4), 1998, pp. 355-376
Asynchronous shared memory search structures
M. Adler
Theory of Computing Systems
31
(4), 1998, pp. 377-401
A steady state analysis of diffracting trees
N. Shavit
,
E. Upfal
,
A. Zemach
Theory of Computing Systems
31
(4), 1998, pp. 403-423
Universal continuous routing strategies
C. Scheideler
,
B. Vöcking
Theory of Computing Systems
31
(4), 1998, pp. 425-449
Scope consistency: A bridge between release consistency and entry consistency
L. Iftode
,
J.P. Singh
,
K. Li
Theory of Computing Systems
31
(4), 1998, pp. 451-473
A tight layout of the butterfly network
A. Avior
,
T. Calamoneri
,
S. Even
,
A. Litman
,
A.L. Rosenberg
Theory of Computing Systems
31
(4), 1998, pp. 475-487
Competitive analysis of on-line disk scheduling
Tzuoo-Hawn Yeh
,
Cheng-Ming Kuo
,
Chin-Laung Lei
,
Hsu-Chun Yen
Theory of Computing Systems
31
(5), 1998, pp. 491-506
Seiten 1
2
>