TDG
Scholar
Committed to research!
Version 1.7
Home
|
Bibliography
|
Writers
|
Journals
|
Conferences
|
Publishers
Help
|
News
Bibliography
Refine on click
|
Report
|
Share
A total of 64 records were found in 0.266 seconds
Fetch
|
Report
|
Google
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem
Jan Hazla
,
Thomas Holenstein
,
Anup Rao
CoRR
,
abs/1604.05757
,
2016
Fetch
|
Report
|
Google
A Direct-Sum Theorem for Read-Once Branching Programs
Anup Rao
,
Makrand Sinha
APPROX-RANDOM
,
44:1-44:15
,
2016
Fetch
|
Report
|
Google
Almost-Linear-Time Algorithms for Markov Chains and New Spectral Primitives for Directed Graphs
Michael B. Cohen
,
Jonathan A. Kelner
,
John Peebles
,
Richard Peng
,
Anup Rao
,
Aaron Sidford
,
Adrian Vladu
CoRR
,
abs/1611.00755
,
2016
Fetch
|
Report
|
Google
New Randomized Data Structure Lower Bounds for Dynamic Graph Connectivity
Sivaramakrishnan Natarajan Ramamoorthy
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
23167
,
2016
Fetch
|
Report
|
Google
Fast, Provable Algorithms for Isotonic Regression in all $\ell_{p}$-norms
Rasmus Kyng
,
Anup Rao
,
Sushant Sachdeva
CoRR
,
abs/1507.00710
,
2015
Fetch
|
Report
|
Google
Fast, Provable Algorithms for Isotonic Regression in all L_p-norms
Rasmus Kyng
,
Anup Rao
,
Sushant Sachdeva
NIPS
,
2719-2727
,
2015
Fetch
|
Report
|
Google
Algorithms for Lipschitz Learning on Graphs
Rasmus Kyng
,
Anup Rao
,
Sushant Sachdeva
,
Daniel A. Spielman
COLT
,
1190-1223
,
2015
Fetch
|
Report
|
Google
Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery
Peter Chin
,
Anup Rao
,
Van Vu
COLT
,
391-423
,
2015
Fetch
|
Report
|
Google
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA
Naveen Garg
,
Klaus Jansen
,
Anup Rao
,
José D. P. Rolim
ISBN: 978-3-939897-89-740
,
2015
Fetch
|
Report
|
Google
Simplified Separation of Information and Communication
Anup Rao
,
Makrand Sinha
Electronic Colloquium on Computational Complexity (ECCC)
,
2257
,
2015
Fetch
|
Report
|
Google
On Parallelizing Streaming Algorithms
Anup Rao
,
Makrand Sinha
Electronic Colloquium on Computational Complexity (ECCC)
,
2239
,
2015
Fetch
|
Report
|
Google
How to Compress Asymmetric Communication
Sivaramakrishnan Natarajan Ramamoorthy
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
2255
,
2015
Fetch
|
Report
|
Google
Algorithms for Lipschitz Learning on Graphs
Rasmus Kyng
,
Anup Rao
,
Sushant Sachdeva
,
Daniel A. Spielman
CoRR
,
abs/1505.00290
,
2015
Fetch
|
Report
|
Google
Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery
Peter Chin
,
Anup Rao
,
Van Vu
CoRR
,
abs/1501.05021
,
2015
Fetch
|
Report
|
Google
Circuits with Medium Fan-In
Pavel Hrubes
,
Anup Rao
Conference on Computational Complexity
,
381-391
,
2015
Fetch
|
Report
|
Google
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
Anup Rao
,
Amir Yehudayoff
Conference on Computational Complexity
,
88-101
,
2015
Fetch
|
Report
|
Google
How to Compress Asymmetric Communication
Sivaramakrishnan Natarajan Ramamoorthy
,
Anup Rao
Conference on Computational Complexity
,
102-123
,
2015
Fetch
|
Report
|
Google
Toward Coding for Maximum Errors in Interactive Communication
Mark Braverman
,
Anup Rao
IEEE Trans. Information Theory
,
60(11):7248-7255
,
2014
Fetch
|
Report
|
Google
Information Equals Amortized Communication
Mark Braverman
,
Anup Rao
IEEE Trans. Information Theory
,
60(10):6058-6069
,
2014
Fetch
|
Report
|
Google
Preconditioning in Expectation
Michael B. Cohen
,
Rasmus Kyng
,
Jakub W. Pachocki
,
Richard Peng
,
Anup Rao
CoRR
,
abs/1401.6236
,
2014
Fetch
|
Report
|
Google
Circuits with Medium Fan-In
Pavel Hrubes
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
2120
,
2014
Fetch
|
Report
|
Google
Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
Anup Rao
,
Amir Yehudayoff
Electronic Colloquium on Computational Complexity (ECCC)
,
2160
,
2014
Fetch
|
Report
|
Google
Pseudorandom Generators for Regular Branching Programs
Mark Braverman
,
Anup Rao
,
Ran Raz
,
Amir Yehudayoff
SIAM J. Comput.
,
43(3):973-986
,
2014
Fetch
|
Report
|
Google
Solving SDD linear systems in nearly
m
log
1/2
n
time
Michael B. Cohen
,
Rasmus Kyng
,
Gary L. Miller
,
Jakub W. Pachocki
,
Richard Peng
,
Anup Rao
,
Shen Chen Xu
STOC
,
343-352
,
2014
Fetch
|
Report
|
Google
Direct Products in Communication Complexity
Mark Braverman
,
Anup Rao
,
Omri Weinstein
,
Amir Yehudayoff
FOCS
,
746-755
,
2013
Fetch
|
Report
|
Google
Direct product via round-preserving compression
Mark Braverman
,
Anup Rao
,
Omri Weinstein
,
Amir Yehudayoff
Electronic Colloquium on Computational Complexity (ECCC)
,
2035
,
2013
Fetch
|
Report
|
Google
Direct Product via Round-Preserving Compression
Mark Braverman
,
Anup Rao
,
Omri Weinstein
,
Amir Yehudayoff
ICALP (1)
,
232-243
,
2013
Fetch
|
Report
|
Google
How to Compress Interactive Communication
Boaz Barak
,
Mark Braverman
,
Xi Chen
,
Anup Rao
SIAM J. Comput.
,
42(3):1327-1363
,
2013
Fetch
|
Report
|
Google
Formulas Resilient to Short-Circuit Errors
Yael Tauman Kalai
,
Allison B. Lewko
,
Anup Rao
FOCS
,
490-499
,
2012
Fetch
|
Report
|
Google
Restriction access
Zeev Dvir
,
Anup Rao
,
Avi Wigderson
,
Amir Yehudayoff
ITCS
,
19-33
,
2012
Fetch
|
Report
|
Google
Direct Products in Communication Complexity
Mark Braverman
,
Anup Rao
,
Omri Weinstein
,
Amir Yehudayoff
Electronic Colloquium on Computational Complexity (ECCC)
,
19143
,
2012
Fetch
|
Report
|
Google
Special Issue "Conference on Computational Complexity 2011" Guest Editor's Foreword
Anup Rao
Computational Complexity
,
21(2):193-195
,
2012
Fetch
|
Report
|
Google
Spherical cubes: optimal foams from computational hardness amplification
Guy Kindler
,
Anup Rao
,
Ryan O'Donnell
,
Avi Wigderson
Commun. ACM
,
55(10):90-97
,
2012
Fetch
|
Report
|
Google
Information Equals Amortized Communication
Mark Braverman
,
Anup Rao
CoRR
,
abs/1106.3595
,
2011
Fetch
|
Report
|
Google
Deterministic extractors for small-space sources
Jesse Kamp
,
Anup Rao
,
Salil P. Vadhan
,
David Zuckerman
J. Comput. Syst. Sci.
,
77(1):191-220
,
2011
Fetch
|
Report
|
Google
Parallel Repetition in Projection Games and a Concentration Bound
Anup Rao
SIAM J. Comput.
,
40(6):1871-1891
,
2011
Fetch
|
Report
|
Google
Towards coding for maximum errors in interactive communication
Mark Braverman
,
Anup Rao
STOC
,
159-166
,
2011
Fetch
|
Report
|
Google
Restriction Access
Zeev Dvir
,
Anup Rao
,
Avi Wigderson
,
Amir Yehudayoff
Electronic Colloquium on Computational Complexity (ECCC)
,
18160
,
2011
Fetch
|
Report
|
Google
Information Equals Amortized Communication
Mark Braverman
,
Anup Rao
FOCS
,
748-757
,
2011
Fetch
|
Report
|
Google
Pseudorandom Generators for Regular Branching Programs
Mark Braverman
,
Anup Rao
,
Ran Raz
,
Amir Yehudayoff
FOCS
,
40-47
,
2010
Fetch
|
Report
|
Google
How to compress interactive communication
Boaz Barak
,
Mark Braverman
,
Xi Chen
,
Anup Rao
STOC
,
67-76
,
2010
Fetch
|
Report
|
Google
Longitudinal changes in medial temporal cortical thickness in normal subjects with the APOE-4 polymorphism
Markus Donix
,
Alison C. Burggren
,
Nanthia A. Suthana
,
Prabha Siddarth
,
Arne D. Ekstrom
,
Allison K. Krupa
,
Michael Jones
,
Anup Rao
,
Laurel Martin-Harris
,
Linda M. Ercoli
,
Karen J. Miller
,
Gary W. Small
,
Susan Y. Bookheimer
NeuroImage
,
53(1):37-43
,
2010
Fetch
|
Report
|
Google
Pseudorandom Generators for Regular Branching Programs
Mark Braverman
,
Anup Rao
,
Ran Raz
,
Amir Yehudayoff
Electronic Colloquium on Computational Complexity (ECCC)
,
1735
,
2010
Fetch
|
Report
|
Google
Towards Coding for Maximum Errors in Interactive Communication
Mark Braverman
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
17166
,
2010
Fetch
|
Report
|
Google
Efficient Communication Using Partial Information
Mark Braverman
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
1783
,
2010
Fetch
|
Report
|
Google
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
Anup Rao
SIAM J. Comput.
,
39(1):168-194
,
2009
Fetch
|
Report
|
Google
Extractors for Low-Weight Affine Sources
Anup Rao
IEEE Conference on Computational Complexity
,
95-101
,
2009
Fetch
|
Report
|
Google
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Yael Tauman Kalai
,
Xin Li 0006
,
Anup Rao
FOCS
,
617-626
,
2009
Fetch
|
Report
|
Google
Direct Sums in Randomized Communication Complexity
Boaz Barak
,
Mark Braverman
,
Xi Chen
,
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
1644
,
2009
Fetch
|
Report
|
Google
Strong Parallel Repetition Theorem for Free Projection Games
Boaz Barak
,
Anup Rao
,
Ran Raz
,
Ricky Rosen
,
Ronen Shaltiel
APPROX-RANDOM
,
352-365
,
2009
Fetch
|
Report
|
Google
Parallel Repetition in Projection Games and a Concentration Bound
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
15(013)
,
2008
Fetch
|
Report
|
Google
Extractors for Low-Weight Affine Sources
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
15(015)
,
2008
Fetch
|
Report
|
Google
A 2-Source Almost-Extractor for Linear Entropy
Anup Rao
APPROX-RANDOM
,
549-556
,
2008
Fetch
|
Report
|
Google
Extractors for Three Uneven-Length Sources
Anup Rao
,
David Zuckerman
APPROX-RANDOM
,
557-570
,
2008
Fetch
|
Report
|
Google
Network Extractor Protocols
Yael Tauman Kalai
,
Xin Li 0006
,
Anup Rao
,
David Zuckerman
FOCS
,
654-663
,
2008
Fetch
|
Report
|
Google
Spherical Cubes and Rounding in High Dimensions
Guy Kindler
,
Ryan O'Donnell
,
Anup Rao
,
Avi Wigderson
FOCS
,
189-198
,
2008
Fetch
|
Report
|
Google
Rounding Parallel Repetitions of Unique Games
Boaz Barak
,
Moritz Hardt
,
Ishay Haviv
,
Anup Rao
,
Oded Regev
,
David Steurer
FOCS
,
374-383
,
2008
Fetch
|
Report
|
Google
Parallel repetition in projection games and a concentration bound
Anup Rao
STOC
,
1-10
,
2008
Fetch
|
Report
|
Google
An Exposition of Bourgain's 2-Source Extractor
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
14(034)
,
2007
Fetch
|
Report
|
Google
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
Boaz Barak
,
Anup Rao
,
Ronen Shaltiel
,
Avi Wigderson
STOC
,
671-680
,
2006
Fetch
|
Report
|
Google
Deterministic extractors for small-space sources
Jesse Kamp
,
Anup Rao
,
Salil P. Vadhan
,
David Zuckerman
STOC
,
691-700
,
2006
Fetch
|
Report
|
Google
Extractors for a constant number of polynomially small min-entropy independent sources
Anup Rao
STOC
,
497-506
,
2006
Fetch
|
Report
|
Google
Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources
Anup Rao
Electronic Colloquium on Computational Complexity (ECCC)
,
(106)
,
2005
Fetch
|
Report
|
Google
A Technique for Dynamic Updating of Java Software
Alessandro Orso
,
Anup Rao
,
Mary Jean Harrold
ICSM
,
649-658
,
2002