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=34
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
Bounded-depth Frege lower bounds for weaker pigeonhole principles
Joshua Buresh-Oppenheim
,
Paul Beame
,
Toniann Pitassi
,
Ran Raz
,
Ashish Sabharwal
SIAM Journal on Computing
34
(2), 2004-2005, pp. 261-276
A complete characterization of the algebras of minimal bilinear complexity
Markus Bläser
SIAM Journal on Computing
34
(2), 2004-2005, pp. 277-298
Nonindependent randomized rounding and an application to digital halftoning
Benjamin Doerr
SIAM Journal on Computing
34
(2), 2004-2005, pp. 299-317
Instability of FIFO at arbitrarily low rates in the adversarial queueing model
Rajat Bhattacharjee
,
Ashish Goel
,
Zvi Lotker
SIAM Journal on Computing
34
(2), 2004-2005, pp. 318-332
Generalized irreducibility of consensus and the equivalence of
t
-resilient and wait-free implementations of consensus
Tushar Chandra
,
Vassos Hadzilacos
,
Prasad Jayanti
,
Sam Toueg
SIAM Journal on Computing
34
(2), 2004-2005, pp. 333-357
Approximation algorithms for the
0
-extension problem
Gruia Calinescu
,
Howard Karloff
,
Yuval Rabani
SIAM Journal on Computing
34
(2), 2004-2005, pp. 358-372
An optimal algorithm for the maximum-density segment problem
Kai-min Chung
,
Hsueh-I Lu
SIAM Journal on Computing
34
(2), 2004-2005, pp. 373-387
New approximation techniques for some linear ordering problems
Satish Rao
,
Andréa W. Richa
SIAM Journal on Computing
34
(2), 2004-2005, pp. 388-404
Quick
k
-median,
k
-center, and facility location for sparse graphs
Mikkel Thorup
SIAM Journal on Computing
34
(2), 2004-2005, pp. 405-432
Online scheduling to minimize average stretch
S. Muthukrishnan
,
Rajmohan Rajaraman
,
Anthony Shaheen
,
Johannes E. Gehrke
SIAM Journal on Computing
34
(2), 2004-2005, pp. 433-452
Traveling with a Pez dispenser (or, routing issues in MPLS)
Anupam Gupta
,
Amit Kumar
,
Rajeev Rastogi
SIAM Journal on Computing
34
(2), 2004-2005, pp. 453-474
The simplex algorithm in dimension three
Volker Kaibel
,
Rafael Mechtel
,
Micha Sharir
,
Günter M. Ziegler
SIAM Journal on Computing
34
(2), 2004-2005, pp. 475-497
Temporal reasoning about two concurrent sequences of events
Yasunori Ishihara
,
Shin Ishii
,
Hiroyuki Seki
,
Minoru Ito
SIAM Journal on Computing
34
(2), 2004-2005, pp. 498-513
Top-down analysis of path compression
Raimund Seidel
,
Micha Sharir
SIAM Journal on Computing
34
(3), 2005, pp. 515-525
Seiten 1
2
3
>