|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 13 occurrences of 10 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction access.  |
ITCS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff |
Restriction Access. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Information Equals Amortized Communication |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao |
Parallel Repetition in Projection Games and a Concentration Bound. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Information Equals Amortized Communication. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Towards coding for maximum errors in interactive communication. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Towards Coding for Maximum Errors in Interactive Communication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao |
Efficient Communication Using Partial Information. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Mark Braverman, Xi Chen, Anup Rao |
How to compress interactive communication. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Mark Braverman, Xi Chen, Anup Rao |
Direct Sums in Randomized Communication Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Anup Rao |
Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel |
Strong Parallel Repetition Theorem for Free Projection Games. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Xin Li, Anup Rao |
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
cryptography, network, extractor, weak random source |
| 1 | Anup Rao |
Extractors for Low-Weight Affine Sources. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao |
Extractors for Low-Weight Affine Sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anup Rao |
Parallel Repetition in Projection Games and a Concentration Bound. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Anup Rao, David Zuckerman |
Extractors for Three Uneven-Length Sources. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao |
A 2-Source Almost-Extractor for Linear Entropy. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman |
Network Extractor Protocols. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson |
Spherical Cubes and Rounding in High Dimensions. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer |
Rounding Parallel Repetitions of Unique Games. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Rao |
Parallel repetition in projection games and a concentration bound. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
chsh game, parallel repetition, unique games conjecture |
| 1 | Anup Rao |
An Exposition of Bourgain's 2-Source Extractor. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Anup Rao |
Extractors for a constant number of polynomially small min-entropy independent sources. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractor, Ramsey graphs |
| 1 | Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson |
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
independent sources, extractors, dispersers, Ramsey graphs |
| 1 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman |
Deterministic extractors for small-space sources. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
pseudorandomness, randomness extractors |
| 1 | Anup Rao |
Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Alessandro Orso, Anup Rao, Mary Jean Harrold |
A Technique for Dynamic Updating of Java Software. (PDF / PS) |
ICSM |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")