| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrej Bogdanov, Youming Qiao |
On the security of Goldreich's one-way function.  |
Computational Complexity  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
Pseudorandomness for read-once formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Alon Rosen |
Input locality and hardness amplification. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Chin Ho Lee |
Homomorphic encryption from codes. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
A Dichotomy for Local Small-Bias Generators. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Chin Ho Lee |
Homomorphic encryption from codes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel |
On Extracting Common Random Bits From Correlated Sources. |
IEEE Transactions on Information Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka |
Hard Functions for Low-Degree Polynomials over Prime Fields. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Alon Rosen |
Input Locality and Hardness Amplification. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel |
The Computational Complexity of Estimating MCMC Convergence Time. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
Pseudorandomness for Read-Once Formulas. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Fan Li |
A better tester for bipartiteness? |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel |
The Computational Complexity of Estimating Convergence Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel |
On extracting common random bits from correlated sources |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom Bits for Polynomials. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Kunal Talwar, Andrew Wan |
Hard Instances for Satisfiability and Quasi-one-way Functions. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff |
Pseudorandomness for Width 2 Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Youming Qiao |
On the Security of Goldreich's One-Way Function. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan |
The Complexity of Distinguishing Markov Random Fields. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Muli Safra |
Hardness amplification for errorless heuristics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom bits for polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Muli Safra |
Hardness Amplification for Errorless Heuristics. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Emanuele Viola |
Pseudorandom Bits for Polynomials. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
Average-Case Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
Average-Case Complexity. |
Foundations and Trends in Theoretical Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
Average-Case Complexity |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Hoeteck Wee |
More on Noncommutative Polynomial Identity Testing. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov |
Pseudorandom generators for low degree polynomials. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
derandomization, pseudorandomness |
| 1 | Andrej Bogdanov, Elitza N. Maneva, Samantha Riesenfeld |
Power-aware base station positioning for sensor networks. |
INFOCOM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Hoeteck Wee |
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
Lower Bounds for Testing Bipartiteness in Dense Graphs. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
Lower Bounds for Testing Bipartiteness in Dense Graphs |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch |
Mechanical Translation of I/O Automaton Specifications into First-Order Logic. |
FORTE |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Kenji Obata, Luca Trevisan |
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")