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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A polynomial time approximation scheme for general multiprocessor job scheduling
Jianer Chen
,
Antonio Miranda
SIAM Journal on Computing
31
(1), 2001, pp. 1-17
A decomposition theorem for maximum weight bipartite matchings
Ming-Yang Kao
,
Tak-Wah Lam
,
Wing-Kin Sung
,
Hing-Fung Ting
SIAM Journal on Computing
31
(1), 2001, pp. 18-26
Traveling Salesman-based curve reconstruction in polynomial time
Ernst Althaus
,
Kurt Mehlhorn
SIAM Journal on Computing
31
(1), 2001, pp. 27-66
Tree search on an atomic model for message passing
Pangfeng Liu
,
William Aiello
,
Sandeep Bhatt
SIAM Journal on Computing
31
(1), 2001, pp. 67-85
On-line randomized call control revisited
Stefano Leonardi
,
Alberto Marchetti-Spaccamela
,
Alessio Presciutti
,
Adi Rosén
SIAM Journal on Computing
31
(1), 2001, pp. 86-112
Fixed-parameter tractability, definability, and model-checking
Jörg Flum
,
Martin Grohe
SIAM Journal on Computing
31
(1), 2001, pp. 113-145
Approximation techniques for average completion time scheduling
C. Chekuri
,
R. Motwani
,
B. Natarajan
,
C. Stein
SIAM Journal on Computing
31
(1), 2001, pp. 146-166
Markov chain algorithms for planar lattice structures
Michael Luby
,
Dana Randall
,
Alistair Sinclair
SIAM Journal on Computing
31
(1), 2001, pp. 167-192
There are no sparse
NP_w
-hard sets
Felipe Cucker
,
Dima Grigoriev
SIAM Journal on Computing
31
(1), 2001, pp. 193-198
Randomness and recursive enumerability
Antonín Kuc̑era
,
Theodore A. Slaman
SIAM Journal on Computing
31
(1), 2001, pp. 199-211
Treewidth and minimum fill-in: Grouping the minimal separators
Vincent Bouchitté
,
Ioan Todinca
SIAM Journal on Computing
31
(1), 2001, pp. 212-232
The accommodating function: A generalization of the competitive ratio
Joan Boyar
,
Kim S. Larsen
,
Morten N. Nielsen
SIAM Journal on Computing
31
(1), 2001, pp. 233-258
Generating bracelets in constant amortized time
Joe Sawada
SIAM Journal on Computing
31
(1), 2001, pp. 259-268
Disjunctions of Horn theories and their cores
Thomas Eiter
,
Toshihide Ibaraki
,
Kazuhisa Makino
SIAM Journal on Computing
31
(1), 2001, pp. 269-288
A fully dynamic algorithm for recognizing and representing proper interval graphs
Pavol Hell
,
Ron Shamir
,
Roded Sharan
SIAM Journal on Computing
31
(1), 2001, pp. 289-305
Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets
Miklós Cs\Hurös
,
Ming-Yang Kao
SIAM Journal on Computing
31
(1), 2001, pp. 306-322
Proportion extend sort
Jing-Chao Chen
SIAM Journal on Computing
31
(1), 2001, pp. 323-330
Approximating the throughput of multiple machines in real-time scheduling
Amotz Bar-Noy
,
Sudipto Guha
,
Joseph (Seffi) Naor
,
Baruch Schieber
SIAM Journal on Computing
31
(2), 2001, pp. 331-352
Low redundancy in static dictionaries with constant query time
Rasmus Pagh
SIAM Journal on Computing
31
(2), 2001, pp. 353-363
Maintaining minimum spanning forests in dynamic graphs
Monika R. Henzinger
,
Valerie King
SIAM Journal on Computing
31
(2), 2001, pp. 364-374
Evolutionary trees can be learned in polynomial time in the two-state general Markov model
Mary Cryan
,
Leslie Ann Goldberg
,
Paul W. Goldberg
SIAM Journal on Computing
31
(2), 2001, pp. 375-397
The complexity of counting in sparse, regular, and planar graphs
Salil P. Vadhan
SIAM Journal on Computing
31
(2), 2001, pp. 398-427
Matchings meeting quotas and their impact on the blow-up lemma
Vojtech Rödl
,
Andrzej Rucińnski
,
Michelle Wagner
SIAM Journal on Computing
31
(2), 2001, pp. 428-446
Optimal buy-and-hold strategies for financial markets with bounded daily returns
Gen-Huey Chen
,
Ming-Yang Kao
,
Yuh-Dauh Lyuu
,
Hsing-Kuo Wong
SIAM Journal on Computing
31
(2), 2001, pp. 447-459
Quantum formulas: A lower bound and simulation
Vwani P. Roychowdhury
,
Farrokh Vatan
SIAM Journal on Computing
31
(2), 2001, pp. 460-476
Seiten 1
2
3
>