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="Meka, Raghu"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast pseudorandomness for independence and load balancing
Raghu Meka
,
Omer Reingold
,
Guy N. Rothblum
,
Ron D. Rothblum
Lecture Notes in Computer Science
8572
, 2014, pp. 859-870
Pseudorandom generators for combinatorial shapes
Parikshit Gopalan
,
Raghu Meka
,
Omer Reingold
,
David Zuckerman
SIAM Journal on Computing
42
(3), 2013, pp. 1051-1076
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
Pseudorandom generators for polynomial threshold functions
Raghu Meka
,
David Zuckerman
SIAM Journal on Computing
42
(3), 2013, pp. 1275-1301
An invariance principle for polytopes
Prahladh Harsha
,
Adam Klivans
,
Raghu Meka
Journal of the ACM
59
(6), 2012, pp. 29: 1-25
Pseudorandom generators for combinatorial shapes
Parikshit Gopalan
,
Raghu Meka
,
Omer Reingold
,
David Zuckerman
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 253-262
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Ilias Diakonikolas
,
Prahladh Harsha
,
Adam Klivans
,
Raghu Meka
,
Prasad Raghavendra
,
Rocco A. Servedio
,
Li-Yang Tan
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 533-542
An invariance principle for polytopes
Prahladh Harsha
,
Adam Klivans
,
Raghu Meka
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 543-552
Pseudorandom generators for polynomial threshold functions
Raghu Meka
,
David Zuckerman
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 427-436