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="Plotkin, Serge"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cost-Distance
: Two metric network design
Adam Meyerson
,
Kamesh Munagala
,
Serge Plotkin
SIAM Journal on Computing
38
(4), 2008, pp. 1648-1659
An online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Journal of Algorithms
55
(1), 2005, pp. 1-20
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Journal of Algorithms
48
(2), 2003, pp. 314-332
Competitive routing of virtual circuits with unknown duration
Baruch Awerbuch
,
Yossi Azar
,
Serge Plotkin
,
Orli Waarts
Journal of Computer and System Sciences
62
(3), 2001, pp. 385-397
Combining fairness with throughput: Online routing with multiple objectives
Ashish Goel
,
Adam Meyerson
,
Serge Plotkin
Journal of Computer and System Sciences
63
(1), 2001, pp. 62-79
A sublinear parallel algorithm for stable matching
Tomás Feder
,
Nimrod Megiddo
,
Serge A. Plotkin
Theoretical Computer Science
233
(1-2), 2000, pp. 297-308
Combining fairness with throughput: Online with multiple objectives
Ashish Goel
,
Adam Meyerson
,
Serge Plotkin
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)
, 2000, pp. 670-679
Time-lapse snapshots
Cynthia Dwork
,
Maurice Herlihy
,
Serge Plotkin
,
Orli Waarts
SIAM Journal on Computing
28
(5), 1999, pp. 1848-1874
Scheduling data transfers in a network and the set scheduling problem
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
,
Eva Tardos
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 189-197
Online throughput-competitive algorithm for multicast routing and admission control
Ashish Goel
,
Monika R. Henzinger
,
Serge Plotkin
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 97-106
An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
Andrew V. Goldberg
,
Jeffrey D. Oldham
,
Serge Plotkin
,
Cliff Stein
Lecture Notes in Computer Science
1412
, 1998, pp. 338-352
Routing and admission control in general topology networks with poisson arrivals
Anil Kamath
,
Omri Palmon
,
Serge Plotkin
Journal of Algorithms
27
(2), 1998, pp. 236-258
On-line routing of virtual circuits with applications to load balancing and machine scheduling
James Aspnes
,
Yossi Azar
,
Amos Fiat
,
Serge Plotkin
,
Orli Waarts
Journal of the ACM
44
(3), 1997, pp. 486-504
On-line load balancing of temporary tasks
Yossi Azar
,
Bala Kalyanasundaram
,
Serge Plotkin
,
Kirk R. Pruhs
,
Orli Waarts
Journal of Algorithms
22
(1), 1997, pp. 93-110
Approximation algorithms for Steiner and directed multicuts
Philip N. Klein
,
Serge A. Plotkin
,
Satish Rao
,
Éva Tardos
Journal of Algorithms
22
(2), 1997, pp. 241-269
An improved lower bound for load balancing of tasks with unknown duration
Yuan Ma
,
Serge Plotkin
Information Processing Letters
62
(6), 1997, pp. 301-303
Local management of a global resource in a communication network
Yehuda Afek
,
Baruch Awerbuch
,
Serge Plotkin
,
Michael Saks
Journal of the ACM
43
(1), 1996, pp. 1-19
Routing and admission control in general topology networks with posson arrivals
Anil Kamath
,
Omri Palmon
,
Serge Plotkin
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 269-278
Routing and admission control in general topology networks
Rainer Gawlick
,
Anil Kamath
,
Serge Plotkin
,
K.G. Ramakrishnan
Technical Report (STAN-CS-TR-1548), 1995, April
Fast approximation algorithm for minimum cost multicommodity flow
Anil Kamath
,
Omri Palmon
,
Serge Plotkin
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 493-501
Adding multiple cost constraints to combinatorial optimization problems, with applications to the multicommodity flows
David Karger
,
Serge Plotkin
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 18-25
Fast approximation algorithms for multicommodity flow problems
Tom Leighton
,
Fillia Makedon
,
Serge Plotkin
,
Clifford Stein
,
Éva Tardos
,
Spyros Tragoudas
Journal of Computer and System Sciences
50
(2), 1995, pp. 228-243
Improved bounds on the max-flow min-cut ratio for multicommodity flows
Serge Plotkin
,
éva Tardos
Combinatorica
15
(3), 1995, pp. 425-434
Competitive routing of virtual circuits with unknown duration
Baruch Awerbuch
,
Yossi Azar
,
Serge Plotkin
,
Orli Waarts
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 321-327
A sublinear parallel algorithm for stable matching
Tomás Feder
,
Nimrod Megiddo
,
Serge A. Plotkin
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 632-637
Seiten 1
2
>