Average-case complexity A Bogdanov, L Trevisan Foundations and Trends® in Theoretical Computer Science 2 (1), 1-106, 2006 | 244 | 2006 |

Power-aware base station positioning for sensor networks A Bogdanov, E Maneva, S Riesenfeld IEEE INFOCOM 2004 1, 2004 | 222 | 2004 |

On worst-case to average-case reductions for NP problems A Bogdanov, L Trevisan SIAM Journal on Computing 36 (4), 1119-1159, 2006 | 200 | 2006 |

Pseudorandom bits for polynomials A Bogdanov, E Viola SIAM Journal on Computing 39 (6), 2464-2486, 2010 | 155 | 2010 |

On the hardness of learning with rounding over small modulus A Bogdanov, S Guo, D Masny, S Richelson, A Rosen Theory of Cryptography Conference, 209-224, 2015 | 147 | 2015 |

A lower bound for testing 3-colorability in bounded-degree graphs A Bogdanov, K Obata, L Trevisan The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002 | 116 | 2002 |

Pseudorandom functions: Three decades later A Bogdanov, A Rosen Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich …, 2017 | 70 | 2017 |

Candidate weak pseudorandom functions in AC^{0} ○ MOD_{2}A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 63 | 2014 |

Pseudorandom generators for low degree polynomials A Bogdanov Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 58 | 2005 |

A dichotomy for local small-bias generators B Applebaum, A Bogdanov, A Rosen Journal of Cryptology 29, 577-596, 2016 | 57 | 2016 |

Bounded indistinguishability and the complexity of recovering secrets A Bogdanov, Y Ishai, E Viola, C Williamson Annual International Cryptology Conference, 593-618, 2016 | 52 | 2016 |

Pseudorandomness for width-2 branching programs A Bogdanov, Z Dvir, E Verbin, A Yehudayoff Theory of Computing 9 (1), 283-293, 2013 | 49 | 2013 |

On extracting common random bits from correlated sources A Bogdanov, E Mossel IEEE Transactions on information theory 57 (10), 6351-6355, 2011 | 49 | 2011 |

The complexity of distinguishing Markov random fields A Bogdanov, E Mossel, S Vadhan Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008 | 49 | 2008 |

On the security of goldreich’s one-way function A Bogdanov, Y Qiao Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 44 | 2009 |

On basing size-verifiable one-way functions on NP-hardness A Bogdanov, C Brzuska Theory of Cryptography: 12th Theory of Cryptography Conference, TCC 2015 …, 2015 | 39 | 2015 |

Pseudorandomness for read-once formulas A Bogdanov, PA Papakonstaninou, A Wan 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 240-246, 2011 | 39 | 2011 |

Formal verification of simulations between I/O automata A Bogdanov Massachusetts Institute of Technology, 2001 | 38 | 2001 |

On the security of Goldreich’s one-way function A Bogdanov, Y Qiao computational complexity 21 (1), 83-127, 2012 | 37 | 2012 |

Lower bounds for testing bipartiteness in dense graphs A Bogdanov, L Trevisan Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004 …, 2004 | 36 | 2004 |