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=SIAM J. Comput. AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial-time approximation scheme for minimum routing cost spanning trees
Bang Ye Wu
,
Giuseppe Lancia
,
Vineet Bafna
,
Kun-Mao Chao
,
R. Ravi
,
Chuan Yi Tang
SIAM Journal on Computing
29
(3), 1999-2000, pp. 761-778
Complexity of deciding sense of direction
Paolo Boldi
,
Sebastiano Vigna
SIAM Journal on Computing
29
(3), 1999-2000, pp. 779-789
Rigorous time/space trade-offs for inverting functions
Amos Fiat
,
Moni Naor
SIAM Journal on Computing
29
(3), 1999-2000, pp. 790-803
Bubbles: Adaptive routing scheme for high-speed dynamic networks
Shlomi Dolev
,
Evangelos Kranakis
,
Danny Krizanc
,
David Peleg
SIAM Journal on Computing
29
(3), 1999-2000, pp. 804-833
Randomly sampling molecules
Leslie Ann Goldberg
,
Mark Jerrum
SIAM Journal on Computing
29
(3), 1999-2000, pp. 834-853
Computational sample complexity
Scott E. Decatur
,
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
29
(3), 1999-2000, pp. 854-879
A faster and simpler algorithm for sorting signed permutations by reversals
Haim Kaplan
,
Ron Shamir
,
Robert E. Tarjan
SIAM Journal on Computing
29
(3), 1999-2000, pp. 880-892
Compression of low entropy strings with Lempel-Ziv algorithms
S. Rao Kosaraju
,
Giovanni Manzini
SIAM Journal on Computing
29
(3), 1999-2000, pp. 893-911
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Pankaj K. Agarwal
,
Alon Efrat
,
Micha Sharir
SIAM Journal on Computing
29
(3), 1999-2000, pp. 912-953
A
2\frac{1}{2}
-approximation algorithm for shortest superstring
Z. Sweedyk
SIAM Journal on Computing
29
(3), 1999-2000, pp. 954-986
On the structure of logspace probabilistic complexity classes
Ioan I. Macarie
SIAM Journal on Computing
29
(3), 1999-2000, pp. 987-1007
Approximation algorithms for the orthogonal
Z
-oriented three-dimensional packing problem
F.K. Miyazawa
,
Y. Wakabayashi
SIAM Journal on Computing
29
(3), 1999-2000, pp. 1008-1029
Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree
Dan E. Willard
SIAM Journal on Computing
29
(3), 1999-2000, pp. 1030-1049
Near-optimal parallel prefetching and caching
Tracy Kimbrel
,
Anna R. Karlin
SIAM Journal on Computing
29
(4), 2000, pp. 1051-1082
Complexity results for first-order two-variable logic with counting
Leszek Pacholski
,
Wiesƚaw Szwast
,
Lidia Tendera
SIAM Journal on Computing
29
(4), 2000, pp. 1083-1117
Making nondeterminism unambiguous
Klaus Reinhardt
,
Eric Allender
SIAM Journal on Computing
29
(4), 2000, pp. 1118-1131
A combinatorial consistency lemma with application to proving the
PCP
theorem
Oded Goldreich
,
Shmuel Safra
SIAM Journal on Computing
29
(4), 2000, pp. 1132-1154
Verification of identities
Sridhar Rajagopalan
,
Leonard J. Schulman
SIAM Journal on Computing
29
(4), 2000, pp. 1155-1163
Exploring unknown environments
Susanne Albers
,
Monika R. Henzinger
SIAM Journal on Computing
29
(4), 2000, pp. 1164-1188
Reducibility and completeness in private computations
Joe Kilian
,
Eyal Kushilevitz
,
Silvio Micali
,
Rafail Ostrovsky
SIAM Journal on Computing
29
(4), 2000, pp. 1189-1208
Lower bounds for
(MOD_p - MOD_m)
circuits
Vince Grolmusz
,
Gábor Tardos
SIAM Journal on Computing
29
(4), 2000, pp. 1209-1222
Shortest path queries among weighted obstacles in the rectilinear plane
Danny Z. Chen
,
Kevin S. Klenk
,
Hung-Yi T. Tu
SIAM Journal on Computing
29
(4), 2000, pp. 1223-1246
Reducing randomness via irrational numbers
Zhi-Zhong Chen
,
Ming-Yang Kao
SIAM Journal on Computing
29
(4), 2000, pp. 1247-1256
On the power of logic resynthesis
Wei-Liang Lin
,
Amir H. Farrahi
,
M. Sarrafzadeh
SIAM Journal on Computing
29
(4), 2000, pp. 1257-1289
Application-controlled paging for a shared cache
Rakesh D. Barve
,
Edward F. Grove
,
Jeffrey Scott Vitter
SIAM Journal on Computing
29
(4), 2000, pp. 1290-1303
Seiten
<
1
2
3
4
5
6
>