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: Author="Seiden, Steve"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New bounds for randomized busing
Steven S. Seiden
,
Peter P. Chen
,
R.F. Lax
,
J. Chen
,
Guoli Ding
Theoretical Computer Science
332
(1-3), 2005, pp. 63-81
Linear time approximation schemes for vehicle scheduling problems
John E. Augustine
,
Steven Seiden
Theoretical Computer Science
324
(2-3), 2004, pp. 147-160
Combining request scheduling with web caching
Tomás Feder
,
Rajeev Motwani
,
Rina Panigrahy
,
Steve Seiden
,
Rob van Stee
,
An Zhu
Theoretical Computer Science
324
(2-3), 2004, pp. 201-218
New results for online page replication
Rudolf Fleischer
,
Wƚodzimierz Gƚazek
,
Steve Seiden
Theoretical Computer Science
324
(2-3), 2004, pp. 219-251
Online companion caching
M. Mendel
,
Steven S. Seiden
Theoretical Computer Science
324
(2-3), 2004, pp. 183-200
New bounds for variable-sized online bin packing
Steven S. Seiden
,
Rob van Stee
,
Leah Epstein
SIAM Journal on Computing
32
(2), 2003, pp. 455-469
New bounds for multidimensional packing
Steven S. Seiden
,
Rob van Stee
Algorithmica
36
(3), 2003, pp. 261-293
Linear time approximation schemes for vehicle scheduling
John E. Augustine
,
Steven S. Seiden
Lecture Notes in Computer Science
2368
, 2002, pp. 30-39
New bounds for variable-sized and resource augmented online bin packing
Leah Epstein
,
Steve Seiden
,
Rob van Stee
Lecture Notes in Computer Science
2380
, 2002, pp. 306-317
Online companion caching
Amos Fiat
,
Manor Mendel
,
Steven S. Seiden
Lecture Notes in Computer Science
2461
, 2002, pp. 499-511
A faster off-line algorithm for the TCP acknowledgement problem
John Noga
,
Steve Seiden
,
Gerhard J. Woeginger
Information Processing Letters
81
(2), 2002, pp. 71-73
A general decomposition theorem for the
k
-server problem
Steven S. Seiden
Information and Computation
174
(2), 2002, pp. 193-202
On the online bin packing problem
Steven S. Seiden
Journal of the ACM
49
(5), 2002, pp. 640-671
A manifesto for the computational method
Steve Seiden
Theoretical Computer Science
282
(2), 2002, pp. 381-395
Buying a constant competitive ratio for paging
János Csirik
,
Csanád Imreh
,
John Noga
,
Steve S. Seiden
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
2161
, 2001, pp. 98-108
An optimal online algorithm for scheduling two machines with release times
John Noga
,
Steven S. Seiden
Theoretical Computer Science
268
(1), 2001, pp. 133-143
On the online bin packing problem
Steven S. Seiden
Lecture Notes in Computer Science
2076
, 2001, pp. 237-248
A general decomposition theorem for the
k
-server problem
Steven S. Seiden
Lecture Notes in Computer Science
2161
, 2001, pp. 86-97
An optimal online algorithm for bounded space variable-sized bin packing
Steven S. Seiden
SIAM Journal on Discrete Mathematics
14
(4), 2001, pp. 458-470
Preemptive multiprocessor scheduling with rejection
Steven S. Seiden
Theoretical Computer Science
262
(1-2), 2001, pp. 437-458
An optimal online algorithm for bounded space variable-sized bin packing
Steven S. Seiden
Lecture Notes in Computer Science
1853
, 2000, pp. 283-295
A guessing game and randomized online algorithms
Steven S. Seiden
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 592-601
Randomized online scheduling on two uniform machines
Leah Epstein
,
John Noga
,
Steve Seiden
,
Jiȓí Sgall
,
Gerhard Woeginger
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 317-326
Scheduling two machines with release times
John Noga
,
Steve Seiden
Lecture Notes in Computer Science
1610
, 1999, pp. 391-399
Unfair problems and randomized algorithms for metrical task systems
Steve Seiden
Information and Computation
148
(2), 1999, pp. 219-240
Seiten 1
2
>