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
[1]
Hilfe
Suche: Author="Karger, David R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximations for multiprocessor scheduling under uncertainty
Christopher Y. Crutchfield
,
Zoran Dzunic
,
Jeremy T. Fineman
,
David R. Karger
,
Jacob H. Scott
Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2008 (Munich, Germany, June 14-16, 2008)
, 2008, pp. 246-255
Approximation algorithms for orienteering and discounted-reward TSP
Avrim Blum
,
Shuchi Chawla
,
David R. Karger
,
Terran Lane
,
Adam Meyerson
,
Maria Minkoff
SIAM Journal on Computing
37
(2), 2007, pp. 653-670
Subjective-cost policy routing
Joan Feigenbaum
,
David R. Karger
,
Vahab S. Mirrokni
,
Rahul Sami
Theoretical Computer Science
378
(2), 2007, pp. 175-189
Simple efficient load-balancing algorithms for peer-to-peer systems
David R. Karger
,
Matthias Ruhl
Theory of Computing Systems
39
(6), 2006, pp. 787-804
Decoding turbo-like codes via linear programming
Jon Feldman
,
David R. Karger
Journal of Computer and System Sciences
68
(4), 2004, pp. 733-752
Simple efficient load balancing algorithms for peer-to-peer systems
David R. Karger
,
Matthias Ruhl
Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2004 (Barcelona, Spain, June 27-30, 2004)
, 2004, pp. 36-43
Techniques for scheduling with rejection
Daniel W. Engels
,
David R. Karger
,
Stavros G. Kolliopoulos
,
Sudipta Sengupta
,
R.N. Uma
,
Joel Wein
Journal of Algorithms
49
(1), 2003, pp. 175-191
Decoding turbo-like codes via linear programming
Jon Feldman
,
David R. Karger
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 251-260
Random sampling in residual graphs
David R. Karger
,
Matthew S. Levine
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 63-66
Finding nearest neighbors in growth-restricted metrics
David R. Karger
,
Matthias Ruhl
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 741-750
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
David R. Karger
SIAM Review
43
(3), 2001, pp. 499-522
Augmenting undirected edge connectivity in
{\tilde{O}}(n^2)
time
András A. Benczúr
,
David R. Karger
Journal of Algorithms
37
(1), 2000, pp. 2-36
Minimum cuts in near-linear time
David R. Karger
Journal of the ACM
47
(1), 2000, pp. 46-76
Dynamic graph algorithms with applications
Mikkel Thorup
,
David R. Karger
Lecture Notes in Computer Science
1851
, 2000, pp. 1-9
Rounding algorithms for a geometric embedding of minimum multiway cut
David R. Karger
,
Philip Klein
,
Cliff Stein
,
Mikkel Thorup
,
Neal E. Young
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 668-678
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
David R. Karger
SIAM Journal on Computing
29
(2), 1999, pp. 492-514
Augmenting undirected edge connectivity in
\tilde{O}(n^2)
time
András A. Benczúr
,
David R. Karger
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 500-509
Techniques for scheduling with rejection
Daniel W. Engels
,
David R. Karger
,
Stavros G. Kolliopoulos
,
Sudipta Sengupta
,
R.N. Uma
,
Joel Wein
Lecture Notes in Computer Science
1461
, 1998, pp. 490-501
Finding maximum flows in undirected graphs seems easier than bipartite matching
David R. Karger
,
Matthew S. Levine
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 69-78
Fast connected components algorithms for the EREW PRAM
David R. Karger
,
Noam Nisan
,
Michal Parnas
SIAM Journal on Computing
28
(3), 1998-1999, pp. 1021-1034
Better random sampling algorithms for flows in undirected graphs
David R. Karger
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 490-499
Experimental study of minimum cut algorithms
Chandra S. Chekuri
,
Andrew V. Goldberg
,
David R. Karger
,
Matthew S. Levine
,
Cliff Stein
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 324-333
(De)randomized construction of small sample spaces in
NC
David R. Karger
,
Daphne Koller
Journal of Computer and System Sciences
55
(3), 1997, pp. 402-413
An
NC
algorithm for minimum cuts
David R. Karger
,
Rajeev Motwani
SIAM Journal on Computing
26
(1), 1997, pp. 255-272
Implementing a fully polynomial time approximation scheme for all terminal network reliability
David R. Karger
,
Ray P. Tai
Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97 (New Orleans, Louisiana, January 5-7, 1997)
, 1997, pp. 334-343
Seiten 1
2
>