Andrej Bogdanov
Andrej Bogdanov
Dirección de correo verificada de cse.cuhk.edu.hk - Página principal
Título
Citado por
Citado por
Año
Power-aware base station positioning for sensor networks
A Bogdanov, E Maneva, S Riesenfeld
IEEE INFOCOM 2004 1, 2004
2092004
Average-case complexity
A Bogdanov, L Trevisan
arXiv preprint cs/0606037, 2006
1792006
On worst-case to average-case reductions for NP problems
A Bogdanov, L Trevisan
SIAM Journal on Computing 36 (4), 1119-1159, 2006
1612006
Pseudorandom bits for polynomials
A Bogdanov, E Viola
SIAM Journal on Computing 39 (6), 2464-2486, 2010
1322010
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, 2016
972016
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
972002
Pseudorandom generators for low degree polynomials
A Bogdanov
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
462005
A dichotomy for local small-bias generators
B Applebaum, A Bogdanov, A Rosen
Journal of Cryptology 29 (3), 577-596, 2016
422016
The complexity of distinguishing Markov random fields
A Bogdanov, E Mossel, S Vadhan
Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008
422008
Pseudorandomness for width-2 branching programs
A Bogdanov, Z Dvir, E Verbin, A Yehudayoff
Theory of Computing 9 (1), 283-293, 2013
392013
Candidate weak pseudorandom functions in AC0 ○ MOD2
A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
382014
Bounded indistinguishability and the complexity of recovering secrets
A Bogdanov, Y Ishai, E Viola, C Williamson
Annual International Cryptology Conference, 593-618, 2016
362016
On extracting common random bits from correlated sources
A Bogdanov, E Mossel
IEEE Transactions on information theory 57 (10), 6351-6355, 2011
362011
Formal verification of simulations between I/O automata
A Bogdanov
Massachusetts Institute of Technology, 2001
352001
On the security of goldreich’s one-way function
A Bogdanov, Y Qiao
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
332009
On the security of Goldreich’s one-way function
A Bogdanov, Y Qiao
computational complexity 21 (1), 83-127, 2012
312012
Pseudorandomness for read-once formulas
A Bogdanov, PA Papakonstaninou, A Wan
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 240-246, 2011
302011
Limits of provable security for homomorphic encryption
A Bogdanov, CH Lee
Annual Cryptology Conference, 111-128, 2013
282013
Pseudorandom functions: Three decades later
A Bogdanov, A Rosen
Tutorials on the Foundations of Cryptography, 79-158, 2017
272017
More on noncommutative polynomial identity testing
A Bogdanov, H Wee
20th Annual IEEE Conference on Computational Complexity (CCC'05), 92-99, 2005
272005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20