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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast universalization of investment strategies
Karhan Akcoglu
,
Petros Drineas
,
Ming-Yang Kao
SIAM Journal on Computing
34
(1), 2004, pp. 1-22
Labeling schemes for flow and connectivity
Michal Katz
,
Nir A. Katz
,
Amos Korman
,
David Peleg
SIAM Journal on Computing
34
(1), 2004, pp. 23-40
A characterization of universal stability in the adversarial queuing model
Carme Àlvarez
,
Maria Blesa
,
Maria Serna
SIAM Journal on Computing
34
(1), 2004, pp. 41-66
Pseudorandom generators in propositional proof complexity
Michael Alekhnovich
,
Eli Ben-Sasson
,
Alexander A. Razborov
,
Avi Wigderson
SIAM Journal on Computing
34
(1), 2004, pp. 67-88
Algorithms for RH mapping: New ideas and improved analysis
Lars Ivansson
,
Jens Lagergren
SIAM Journal on Computing
34
(1), 2004, pp. 89-108
Perfectness is an elusive graph property
Stefan Hougardy
,
Annegret Wagler
SIAM Journal on Computing
34
(1), 2004, pp. 109-117
Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor
Daniele Micciancio
SIAM Journal on Computing
34
(1), 2004, pp. 118-169
Small spans in scaled dimension
John M. Hitchcock
SIAM Journal on Computing
34
(1), 2004, pp. 170-194
Random walks on truncated cubes and sampling
0-1
knapsack solutions
Ben Morris
,
Alistair Sinclair
SIAM Journal on Computing
34
(1), 2004, pp. 195-226
Balanced-replication algorithms for distribution trees
Edith Cohen
,
Haim Kaplan
SIAM Journal on Computing
34
(1), 2004, pp. 227-247
Multiembedding of metric spaces
Yair Bartal
,
Manor Mendel
SIAM Journal on Computing
34
(1), 2004, pp. 248-259
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection
Refael Hassin
,
Asaf Levin
SIAM Journal on Computing
33
(2), 2004, pp. 261-268
Shape fitting with outliers
Sariel Har-Peled
,
Yusu Wang
SIAM Journal on Computing
33
(2), 2004, pp. 269-285
New stability results for adversarial queuing
Zvi Lotker
,
Boaz Patt-Shamir
,
Adi Rosén
SIAM Journal on Computing
33
(2), 2004, pp. 286-303
On identifying codes in the triangular and square grids
Iiro Honkala
,
Tero Laihonen
SIAM Journal on Computing
33
(2), 2004, pp. 304-312
A bound on the capacity of backoff and acknowledgment-based protocols
Leslie Ann Goldberg
,
Mark Jerrum
,
Sampath Kannan
,
Mike Paterson
SIAM Journal on Computing
33
(2), 2004, pp. 313-331
Stackelberg scheduling strategies
Tim Roughgarden
SIAM Journal on Computing
33
(2), 2004, pp. 332-350
Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width
Georg Gottlob
,
Reinhard Pichler
SIAM Journal on Computing
33
(2), 2004, pp. 351-378
The minimum all-ones problem for trees
William Y.C. Chen
,
Xueliang Li
,
Chao Wang
,
Xiaoyan Zhang
SIAM Journal on Computing
33
(2), 2004, pp. 379-392
Scheduling with AND/OR precedence constraints
Rolf H. Möhring
,
Martin Skutella
,
Frederik Stork
SIAM Journal on Computing
33
(2), 2004, pp. 393-415
The complexity of choosing an
H
-coloring (nearly) uniformly at random
Leslie Ann Goldberg
,
Steven Kelk
,
Mike Paterson
SIAM Journal on Computing
33
(2), 2004, pp. 416-432
The potential of the approximation method
Kazuyuki Amano
,
Akira Maruoka
SIAM Journal on Computing
33
(2), 2004, pp. 433-447
Algorithms for data migration with cloning
Samir Khuller
,
Yoo-Ah Kim
,
Yung-Chun (Justin) Wan
SIAM Journal on Computing
33
(2), 2004, pp. 448-461
An optimal competitive strategy for walking in streets
Christian Icking
,
Rolf Klein
,
Elmar Langetepe
,
Sven Schuierer
,
Ines Semrau
SIAM Journal on Computing
33
(2), 2004, pp. 462-486
Learning a hidden matching
Noga Alon
,
Richard Beigel
,
Simon Kasif
,
Steven Rudich
,
Benny Sudakov
SIAM Journal on Computing
33
(2), 2004, pp. 487-501
Seiten 1
2
3
>