Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Andrej Bogdanov
Observed names:
A. Bogdanov,
Bogdanov, Andrej,
Bogdanov, Andrej, 1978-
Institution:
University of Ottawa
Observed institutions:
Rutgers, The State University of New Jersey,
University of Ottawa,
Chinese University of Hong Kong,
Center for Discrete Mathematics and Theoretical Computer Science,
Massachusetts Institute of Technology,
University of California, Berkeley,
Tsinghua University
show all 7
ORCID:
0000-0002-0338-6151
Observed ORCID:
0000-0002-0338-6151
OpenAlex ID:
A5091529166
Power-aware base station positioning for sensor networks
2004
·
A. Bogdanov
, E. Maneva
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
157
On Worst‐Case to Average‐Case Reductions for NP Problems
2004
·
A. Bogdanov
, L. Trevisan
·
Annual Symposium on Foundations of Computer Science
·
129
Average-Case Complexity
2006
·
Andrej Bogdanov
, Luca Trevisan
·
Foundations and Trends® in Theoretical Computer Science
·
119
On the Hardness of Learning with Rounding over Small Modulus
2015
·
Andrej Bogdanov
, Siyao Guo
, et al.
·
Lecture notes in computer science
·
111
PDF
A lower bound for testing 3-colorability in bounded-degree graphs
2003
·
A. Bogdanov
, K. Obata
, et al.
·
92
Pseudorandom Bits for Polynomials
2010
·
Andrej Bogdanov
, Emanuele Viola
·
SIAM Journal on Computing
·
78
Pseudorandom Bits for Polynomials
2007
·
Andrej Bogdanov
, Emanuele Viola
·
Annual Symposium on Foundations of Computer Science
·
55
On the Security of Goldreich’s One-Way Function
2009
·
Andrej Bogdanov
, Youming Qiao
·
Lecture notes in computer science
·
49
Candidate weak pseudorandom functions in AC 0 ○ MOD 2
2014
·
Adi Akavia
, Andrej Bogdanov
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
47
PDF
Pseudorandom Functions: Three Decades Later
2017
·
Andrej Bogdanov
, Alon Rosen
·
Information security and cryptography
·
45
A Dichotomy for Local Small-Bias Generators
2012
·
Benny Applebaum
, Andrej Bogdanov
, et al.
·
Lecture notes in computer science
·
40
Pseudorandom generators for low degree polynomials
2005
·
Andrej Bogdanov
·
ACM Symposium on Theory of Computing (STOC)
·
38
On Extracting Common Random Bits From Correlated Sources
2011
·
Andrej Bogdanov
, Elchanan Mossel
·
IEEE Transactions on Information Theory
·
37
On the security of Goldreich’s one-way function
2012
·
Andrej Bogdanov
, Youming Qiao
·
Computational Complexity
·
32
More on Noncommutative Polynomial Identity Testing
2005
·
A. Bogdanov
, Hoeteck Wee
·
Proceedings - IEEE Conference on Computational Complexity/Proceedings
·
32
Bounded Indistinguishability and the Complexity of Recovering Secrets
2016
·
Andrej Bogdanov
, Yuval Ishai
, et al.
·
Lecture notes in computer science
·
30
The Complexity of Distinguishing Markov Random Fields
2008
·
Andrej Bogdanov
, Elchanan Mossel
, et al.
·
Lecture notes in computer science
·
30
Pseudorandomness for width-2 branching programs
2013
·
Andrej Bogdanov
, Zeev Dvir
, et al.
·
Theory of Computing
·
29
PDF
On Basing Size-Verifiable One-Way Functions on NP-Hardness
2015
·
Andrej Bogdanov
, Christina Brzuska
·
Lecture notes in computer science
·
27
Pseudorandomness for Read-Once Formulas
2011
·
Andrej Bogdanov
, Periklis A. Papakonstaninou
, et al.
·
Annual Symposium on Foundations of Computer Science
·
25
Threshold Secret Sharing Requires a Linear Size Alphabet
2016
·
Andrej Bogdanov
, Siyao Guo
, et al.
·
Lecture notes in computer science
·
24
The Computational Complexity of Estimating MCMC Convergence Time
2011
·
Nayantara Bhatnagar
, Andrej Bogdanov
, et al.
·
Lecture notes in computer science
·
23
Hardness Amplification for Errorless Heuristics
2007
·
Andrej Bogdanov
, Muli Safra
·
Annual Symposium on Foundations of Computer Science
·
22
Homomorphic encryption from codes
2011
·
Bogdanov, Andrej
, Lee, Chin Ho
·
arXiv (Cornell University)
·
20
PDF
When are large codes possible for AVCs?
2019
·
Xishi Wang
, Amitalok J. Budkuley
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
19
Show more works
View as search
Works count:
96
Citation count:
1,600
H-index:
22
I10-index:
37
Year
Topic
Type
