- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j7 |      | Andrej Bogdanov, Alon Rosen: Input Locality and Hardness Amplification. J. Cryptology 26(1): 144-171 (2013) |
| j6 | | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff: Pseudorandomness for Width-2 Branching Programs. Theory of Computing 9: 283-293 (2013) |
| c20 | | |
| 2012 | ||
| j5 | | Andrej Bogdanov, Youming Qiao: On the security of Goldreich's one-way function. Computational Complexity 21(1): 83-127 (2012) |
| c19 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Linear Length Branching Programs and Stack Machines. APPROX-RANDOM 2012: 447-458 |
| c18 | | Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. TCC 2012: 600-617 |
| i20 | | Andrej Bogdanov, Siyao Guo: Sparse extractor families for all the entropy. CoRR abs/1207.6260 (2012) |
| i19 | | Andrej Bogdanov, Siyao Guo: Sparse extractor families for all the entropy. Electronic Colloquium on Computational Complexity (ECCC) 19: 97 (2012) |
| i18 | | Andrej Bogdanov, Chin Ho Lee: Limits of provable security for homomorphic encryption. Electronic Colloquium on Computational Complexity (ECCC) 19: 156 (2012) |
| i17 | | Andrej Bogdanov, Chin Ho Lee: On the depth complexity of homomorphic encryption schemes. Electronic Colloquium on Computational Complexity (ECCC) 19: 157 (2012) |
| 2011 | ||
| j4 | | Andrej Bogdanov, Elchanan Mossel: On Extracting Common Random Bits From Correlated Sources. IEEE Transactions on Information Theory 57(10): 6351-6355 (2011) |
| c17 | | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel: The Computational Complexity of Estimating MCMC Convergence Time. APPROX-RANDOM 2011: 424-435 |
| c16 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for Read-Once Formulas. FOCS 2011: 240-246 |
| c15 | | Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka: Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131 |
| c14 | | |
| i16 | | |
| i15 | | Andrej Bogdanov, Alon Rosen: Input locality and hardness amplification. Electronic Colloquium on Computational Complexity (ECCC) 18: 12 (2011) |
| i14 | | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan: Pseudorandomness for read-once formulas. Electronic Colloquium on Computational Complexity (ECCC) 18: 117 (2011) |
| i13 | | Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. Electronic Colloquium on Computational Complexity (ECCC) 18: 126 (2011) |
| i12 | | Benny Applebaum, Andrej Bogdanov, Alon Rosen: A Dichotomy for Local Small-Bias Generators. IACR Cryptology ePrint Archive 2011: 512 (2011) |
| i11 | | Andrej Bogdanov, Chin Ho Lee: Homomorphic encryption from codes. IACR Cryptology ePrint Archive 2011: 622 (2011) |
| 2010 | ||
| j3 | | Andrej Bogdanov, Emanuele Viola: Pseudorandom Bits for Polynomials. SIAM J. Comput. 39(6): 2464-2486 (2010) |
| c13 | | Andrej Bogdanov, Kunal Talwar, Andrew Wan: Hard Instances for Satisfiability and Quasi-one-way Functions. ICS 2010: 290-300 |
| i10 | | Nayantara Bhatnagar, Andrej Bogdanov, Elchanan Mossel: The Computational Complexity of Estimating Convergence Time. CoRR abs/1007.0089 (2010) |
| i9 | | Andrej Bogdanov, Elchanan Mossel: On extracting common random bits from correlated sources. CoRR abs/1007.2315 (2010) |
| i8 | | |
| 2009 | ||
| c12 | | Andrej Bogdanov, Youming Qiao: On the Security of Goldreich's One-Way Function. APPROX-RANDOM 2009: 392-405 |
| i7 | | Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff: Pseudorandomness for Width 2 Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 16: 70 (2009) |
| 2008 | ||
| c11 | | Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan: The Complexity of Distinguishing Markov Random Fields. APPROX-RANDOM 2008: 331-342 |
| 2007 | ||
| c10 | | |
| c9 | | |
| i6 | | Andrej Bogdanov, Emanuele Viola: Pseudorandom bits for polynomials. Electronic Colloquium on Computational Complexity (ECCC) 14(081) (2007) |
| i5 | | Andrej Bogdanov, Muli Safra: Hardness amplification for errorless heuristics. Electronic Colloquium on Computational Complexity (ECCC) 14(102) (2007) |
| 2006 | ||
| j2 | | Andrej Bogdanov, Luca Trevisan: Average-Case Complexity. Foundations and Trends in Theoretical Computer Science 2(1) (2006) |
| j1 | | Andrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems. SIAM J. Comput. 36(4): 1119-1159 (2006) |
| i4 | | |
| i3 | | Andrej Bogdanov, Luca Trevisan: Average-Case Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(073) (2006) |
| 2005 | ||
| c8 | | Andrej Bogdanov, Hoeteck Wee: More on Noncommutative Polynomial Identity Testing. IEEE Conference on Computational Complexity 2005: 92-99 |
| c7 | | |
| i2 | | Andrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems. Electronic Colloquium on Computational Complexity (ECCC)(015) (2005) |
| 2004 | ||
| c6 | | Andrej Bogdanov, Hoeteck Wee: A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes. APPROX-RANDOM 2004: 298-309 |
| c5 | | Andrej Bogdanov, Luca Trevisan: Lower Bounds for Testing Bipartiteness in Dense Graphs. IEEE Conference on Computational Complexity 2004: 75-81 |
| c4 | | Andrej Bogdanov, Elitza N. Maneva, Samantha Riesenfeld: Power-aware base station positioning for sensor networks. INFOCOM 2004 |
| 2003 | ||
| c3 | | Andrej Bogdanov, Luca Trevisan: On Worst-Case to Average-Case Reductions for NP Problems. FOCS 2003: 308-317 |
| 2002 | ||
| c2 | | Andrej Bogdanov, Kenji Obata, Luca Trevisan: A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. FOCS 2002: 93-102 |
| c1 | | Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch: Mechanical Translation of I/O Automaton Specifications into First-Order Logic. FORTE 2002: 364-368 |
| i1 | | Andrej Bogdanov, Luca Trevisan: Lower Bounds for Testing Bipartiteness in Dense Graphs. Electronic Colloquium on Computational Complexity (ECCC)(064) (2002) |
Colors in the list of coauthors
Last update Tue May 21 11:39:10 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page