 | 2009 |
|---|
| 20 |       | Andrej Bogdanov,
Youming Qiao:
On the Security of Goldreich's One-Way Function.
APPROX-RANDOM 2009: 392-405 |
| 2008 |
|---|
| 19 | | Andrej Bogdanov,
Elchanan Mossel,
Salil P. Vadhan:
The Complexity of Distinguishing Markov Random Fields.
APPROX-RANDOM 2008: 331-342 |
| 2007 |
|---|
| 18 | | Andrej Bogdanov,
Emanuele Viola:
Pseudorandom Bits for Polynomials.
FOCS 2007: 41-51 |
| 17 | | Andrej Bogdanov,
Muli Safra:
Hardness Amplification for Errorless Heuristics.
FOCS 2007: 418-426 |
| 16 | | Andrej Bogdanov,
Emanuele Viola:
Pseudorandom bits for polynomials.
Electronic Colloquium on Computational Complexity (ECCC) 14(081): (2007) |
| 15 | | Andrej Bogdanov,
Muli Safra:
Hardness amplification for errorless heuristics.
Electronic Colloquium on Computational Complexity (ECCC) 14(102): (2007) |
| 2006 |
|---|
| 14 | | Andrej Bogdanov,
Luca Trevisan:
Average-Case Complexity
CoRR abs/cs/0606037: (2006) |
| 13 | | Andrej Bogdanov,
Luca Trevisan:
Average-Case Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 13(073): (2006) |
| 12 | | Andrej Bogdanov,
Luca Trevisan:
Average-Case Complexity.
Foundations and Trends in Theoretical Computer Science 2(1): (2006) |
| 11 | | Andrej Bogdanov,
Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems.
SIAM J. Comput. 36(4): 1119-1159 (2006) |
| 2005 |
|---|
| 10 | | Andrej Bogdanov,
Hoeteck Wee:
More on Noncommutative Polynomial Identity Testing.
IEEE Conference on Computational Complexity 2005: 92-99 |
| 9 | | Andrej Bogdanov:
Pseudorandom generators for low degree polynomials.
STOC 2005: 21-30 |
| 8 | | Andrej Bogdanov,
Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems
Electronic Colloquium on Computational Complexity (ECCC)(015): (2005) |
| 2004 |
|---|
| 7 | | Andrej Bogdanov,
Hoeteck Wee:
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.
APPROX-RANDOM 2004: 298-309 |
| 6 | | Andrej Bogdanov,
Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs.
IEEE Conference on Computational Complexity 2004: 75-81 |
| 5 | | Andrej Bogdanov,
Elitza N. Maneva,
Samantha Riesenfeld:
Power-aware base station positioning for sensor networks.
INFOCOM 2004 |
| 2003 |
|---|
| 4 | | Andrej Bogdanov,
Luca Trevisan:
On Worst-Case to Average-Case Reductions for NP Problems.
FOCS 2003: 308-317 |
| 2002 |
|---|
| 3 | | Andrej Bogdanov,
Kenji Obata,
Luca Trevisan:
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs.
FOCS 2002: 93-102 |
| 2 | | Andrej Bogdanov,
Stephen J. Garland,
Nancy A. Lynch:
Mechanical Translation of I/O Automaton Specifications into First-Order Logic.
FORTE 2002: 364-368 |
| 1 | | Andrej Bogdanov,
Luca Trevisan:
Lower Bounds for Testing Bipartiteness in Dense Graphs
Electronic Colloquium on Computational Complexity (ECCC)(064): (2002) |
