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 Volume=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the dynamic finger conjecture for splay trees. Part I: Splay sorting log
n
-block sequences
Richard Cole
,
Bud Mishra
,
Jeanette Schmidt
,
Alan Siegel
SIAM Journal on Computing
30
(1), 2000, pp. 1-43
On the dynamic finger conjecture for splay trees. Part II: The proof
Richard Cole
SIAM Journal on Computing
30
(1), 2000, pp. 44-85
On RAM priority queues
Mikkel Thorup
SIAM Journal on Computing
30
(1), 2000, pp. 86-109
Robot navigation with distance queries
Dana Angluin
,
Jeffery Westbrook
,
Wenhong Zhu
SIAM Journal on Computing
30
(1), 2000, pp. 110-144
Preemptive scheduling of parallel jobs on multiprocessors
Xiaotie Deng
,
Nian Gu
,
Tim Brecht
,
Kaicheng Lu
SIAM Journal on Computing
30
(1), 2000, pp. 145-160
Nonuniform discretization for kinodynamic motion planning and its applications
John H. Reif
,
Hongyan Wang
SIAM Journal on Computing
30
(1), 2000, pp. 161-190
Allocating bandwidth for bursty connections
Jon Kleinberg
,
Yuval Rabani
,
Éva Tardos
SIAM Journal on Computing
30
(1), 2000, pp. 191-217
Motion planning of legged robots
Jean-Daniel Boissonnat
,
Olivier Devillers
,
Sylvain Lazard
SIAM Journal on Computing
30
(1), 2000, pp. 218-246
Tight fault locality
Shay Kutten
,
David Peleg
SIAM Journal on Computing
30
(1), 2000, pp. 247-268
Convergence criteria for genetic algorithms
David Greenhalgh
,
Stephen Marshall
SIAM Journal on Computing
30
(1), 2000, pp. 269-282
A more efficient approximation scheme for tree alignment
Lusheng Wang
,
Tao Jiang
,
Dan Gusfield
SIAM Journal on Computing
30
(1), 2000, pp. 283-299
Beyond competitive analysis
Elias Koutsoupias
,
Christos H. Papadimitriou
SIAM Journal on Computing
30
(1), 2000, pp. 300-317
On the difficulty of designing good classifiers
Michelangelo Grigni
,
Vincent Mirelli
,
Christos H. Papadimitriou
SIAM Journal on Computing
30
(1), 2000, pp. 318-323
Two-prover protocols - Low error at affordable rates
Uriel Feige
,
Joe Kilian
SIAM Journal on Computing
30
(1), 2000, pp. 324-346
Message multicasting in heterogeneous networks
Amotz Bar-Noy
,
Sudipto Guha
,
Joseph (Seffi) Naor
,
Baruch Schieber
SIAM Journal on Computing
30
(2), 2000, pp. 347-358
Complexity of some problems concerning varieties and quasi-varieties of algebras
Clifford Bergman
,
Giora Slutzki
SIAM Journal on Computing
30
(2), 2000, pp. 359-382
An algorithm for Heilbronn's problem
Claudia Bertram-Kretzberg
,
Thomas Hofmeister
,
Hanno Lefmann
SIAM Journal on Computing
30
(2), 2000, pp. 383-390
Nonmalleable cryptography
Danny Dolev
,
Cynthia Dwork
,
Moni Naor
SIAM Journal on Computing
30
(2), 2000, pp. 391-437
Time and space lower bounds for nonblocking implementations
Prasad Jayanti
,
King Tan
,
Sam Toueg
SIAM Journal on Computing
30
(2), 2000, pp. 438-456
Efficient search for approximate nearest neighbor in high dimensional spaces
Eyal Kushilevitz
,
Rafail Ostrovsky
,
Yuval Rabani
SIAM Journal on Computing
30
(2), 2000, pp. 457-474
When Hamming meets Euclid: The approximability of geometric TSP and Steiner tree
Luca Trevisan
SIAM Journal on Computing
30
(2), 2000, pp. 475-485
Self-stabilization by counter flushing
George Varghese
SIAM Journal on Computing
30
(2), 2000, pp. 486-510
The power of migration in multiprocessor scheduling of real-time systems
Gilad Koren
,
Emanuel Dar
,
Amihood Amir
SIAM Journal on Computing
30
(2), 2000, pp. 511-527
Approximating minimum-size
k
-connected spanning subgraphs via matching
Joseph Cheriyan
,
Ramakrishna Thurimella
SIAM Journal on Computing
30
(2), 2000, pp. 528-560
Random sampling, halfspace range reporting, and construction of
(\le k)
-levels in three dimensions
Timothy M. Chan
SIAM Journal on Computing
30
(2), 2000, pp. 561-575
Seiten 1
2
3
4
>