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="Woodruff, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Low rank approximation and regression in input sparsity time
Kenneth L. Clarkson
,
David P. Woodruff
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 81-90
How robust are linear sketches to adaptive inputs?
Moritz Hardt
,
David P. Woodruff
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 121-130
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
Arnab Bhattacharyya
,
Elena Grigorescu
,
Madhav Jha
,
Kyomin Jung
,
Sofya Raskhodnikova
,
David P. Woodruff
SIAM Journal on Discrete Mathematics
26
(2), 2012, pp. 618-646
Transitive-closure spanners
Arnab Bhattacharyya
,
Elena Grigorescu
,
Kyomin Jung
,
Sofya Raskhodnikova
,
David P. Woodruff
SIAM Journal on Computing
41
(6), 2012, pp. 1380-1425
Sublinear optimization for machine learning
Kenneth L. Clarkson
,
Elad Hazan
,
David P. Woodruff
Journal of the ACM
59
(5), 2012, pp. 23: 1-49
Tight bounds for distributed functional monitoring
David P. Woodruff
,
Qin Zhang
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 941-960
Steiner transitive-closure spanners of low-dimensional posets
Piotr Berman
,
Arnab Bhattacharyya
,
Elena Grigorescu
,
Sofya Raskhodnikova
,
David P. Woodruff
,
Grigory Yaroslavtsev
Lecture Notes in Computer Science
6755
, 2011, pp. 760-772
Epistemic privacy
Alexandre Evfimievski
,
Ronald Fagin
,
David Woodruff
Journal of the ACM
58
(1), 2011, pp. 2: 1-45
Fast moment estimation in data streams in optimal space
Daniel M. Kane
,
Jelani Nelson
,
Ely Porat
,
David P. Woodruff
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 745-754
Tolerant algorithms
Rolf Klein
,
Rainer Penninger
,
Christian Sohler
,
David P. Woodruff
Lecture Notes in Computer Science
6942
, 2011, pp. 736-747
Subspace embeddings for the
L_1
-norm with applications
Christian Sohler
,
David P. Woodruff
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 755-764
Near-optimal private approximation protocols via a black box transformation
David P. Woodruff
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 735-744
Additive spanners in nearly quadratic time
David P. Woodruff
Lecture Notes in Computer Science
6198
, 2010, pp. 463-474
Numerical linear algebra in the streaming model
Kenneth L. Clarkson
,
David P. Woodruff
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 205-214
A geometric approach to information-theoretic private information retrieval
David Woodruff
,
Sergey Yekhanin
SIAM Journal on Computing
37
(4), 2007, pp. 1046-1056
Optimal approximations of the frequency moments of data streams
Piotr Indyk
,
David Woodruff
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 202-208
Steiner transitive-closure spanners of low-dimensional posets
Piotr Berman
,
Arnab Bhattacharyya
,
Elena Grigorescu
,
Sofya Raskhodnikova
,
David P. Woodruff
,
Grigory Yaroslavtsev
Combinatorica
34
(3), 2003, pp. 255-277