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="Kane, Daniel M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sparser Johnson-Lindenstrauss transforms
Daniel M. Kane
,
Jelani Nelson
Journal of the ACM
61
(1), 2014, pp. 4: 1-23
A short implicant of a CNF formula with many satisfying assignments
Daniel M. Kane
,
Osamu Watanabe
Lecture Notes in Computer Science
8889
, 2014, pp. 273-284
A PRG for Lipschitz functions of polynomials with applications to sparsest cut
Daniel M. Kane
,
Raghu Meka
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 1-10
Counting arbitrary subgraphs in data streams
Daniel M. Kane
,
Kurt Mehlhorn
,
Thomas Sauerwald
,
He Sun
Lecture Notes in Computer Science
7392
, 2012, pp. 598-609
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