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="Spielman, Daniel A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Twice-Ramanujan sparsifiers
Joshua Batson
,
Daniel A. Spielman
,
Nikhil Srivastava
SIAM Review
56
(2), 2014, pp. 315-334
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
42
(1), 2013, pp. 1-26
Twice-Ramanujan sparsifiers
Joshua Batson
,
Daniel A. Spielman
,
Nikhil Srivastava
SIAM Journal on Computing
41
(6), 2012, pp. 1704-1721
Algorithms, graph theory, and the solution of Laplacian linear equations
Daniel A. Spielman
Lecture Notes in Computer Science
7392
, 2012, pp. 24-26
Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano
,
Jonathan A. Kelner
,
Aleksander Ma̧dry
,
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 273-281
Graph sparsification by effective resistances
Daniel A. Spielman
,
Nikhil Srivastava
SIAM Journal on Computing
40
(6), 2011, pp. 1913-1926
Spectral sparsification of graphs
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
40
(4), 2011, pp. 981-1025
Twice-Ramanujan sparsifiers
Joshua D. Batson
,
Daniel A. Spielman
,
Nikhil Srivastava
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 255-262
Faster approximate lossy generalized flow via interior point algorithms
Samuel I. Daitch
,
Daniel A. Spielman
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 451-460
Lower-stretch spanning trees
Michael Elkin
,
Yuval Emek
,
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
38
(2), 2008, pp. 608-628
Graph sparsification by effective resistances
Daniel A. Spielman
,
Nikhil Srivastava
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 563-568
A randomized polynomial-time simplex algorithm for linear programming
Jonathan A. Kelner
,
Daniel A. Spielman
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 51-60
Lower-stretch spanning trees
Michael Elkin
,
Yuval Emek
,
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 494-503
Time complexity of practical parallel Steiner point insertion algorithms
Daniel A. Spielman
,
Shang-Hua Teng
,
Alper Üngör
Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2004 (Barcelona, Spain, June 27-30, 2004)
, 2004, pp. 267-268
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Daniel A. Spielman
,
Shang-Hua Teng
Journal of the ACM
51
(3), 2004, pp. 385-463
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, STOC'2004 (Chicago, Illinois, USA, June 13-15, 2004)
, 2004, pp. 81-90
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs
,
Richard Cleve
,
Enrico Deotto
,
Edward Farhi
,
Sam Gutmann
,
Daniel A. Spielman
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 59-68
Smoothed analysis - Motivation and discrete models
Daniel A. Spielman
,
Shang-Hua Teng
Lecture Notes in Computer Science
2748
, 2003, pp. 256-270
Min-max-boundary domain decomposition
Marcos Kiwi
,
Daniel A. Spielman
,
Shang-Hua Teng
Theoretical Computer Science
261
(2), 2001, pp. 253-266
Randomness efficient identity testing of multivariate polynomials
Adam R. Klivans
,
Daniel A. Spielman
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 216-223
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Daniel A. Spielman
,
Shang-Hua Teng
Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, STOC'2001 (Hersonissos, Crete, Greece, July 6-8, 2001)
, 2001, pp. 296-305
Min-max-boundary domain decomposition
Marcos Kiwi
,
Daniel A. Spielman
,
Shang-Hua Teng
Lecture Notes in Computer Science
1449
, 1998, pp. 137-146
Analysis of low density codes and improved designs using irregular graphs
Michael G. Luby
,
Michael Mitzenmacher
,
M. Amin Shokrollahi
,
Daniel A. Spielman
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 249-258
Models of computation in coding theory
Daniel A. Spielman
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 120-120
Practical loss-resilient codes
Michael G. Luby
,
Michael Mitzenmacher
,
M. Amin Shokrollahi
,
Daniel A. Spielman
,
Volker Stemann
Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97 (El Paso, Texas, May 4-6, 1997)
, 1997, pp. 150-159
Seiten 1
2
>