Boaz Barak
Affiliations:- Harvard University, John A. Paulson School of Engineering and Applied Sciences
- Microsoft Research New England (MSR-NE), Cambridge, USA
- Princeton University, Computer Science Department
- Institute for Advanced Study, School of Math, Princeton, USA
- Weizmann Institute of Science, Rehovot, Israel
According to our database1,
Boaz Barak
authored at least 104 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2022, "For contributions to theoretical computer science, in particular cryptography and computational complexity, and service to the theory community".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
2023
IACR Cryptol. ePrint Arch., 2023
Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates.
Bioinform., 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the Eleventh International Conference on Learning Representations, 2023
2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 9th International Conference on Learning Representations, 2021
2020
Proceedings of the 8th International Conference on Learning Representations, 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
SIAM J. Comput., 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
2018
IACR Cryptol. ePrint Arch., 2018
Electron. Colloquium Comput. Complex., 2018
2017
Merkle's Key Agreement Protocol is Optimal: An O(n<sup>2</sup>) Attack on Any Key Agreement from Random Oracles.
J. Cryptol., 2017
Electron. Colloquium Comput. Complex., 2017
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the Tutorials on the Foundations of Cryptography., 2017
2016
2015
IEEE/ACM Trans. Netw., 2015
Electron. Colloquium Comput. Complex., 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
2014
Electron. Colloquium Comput. Complex., 2014
2013
Electron. Colloquium Comput. Complex., 2013
Comput. Complex., 2013
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction.
Proceedings of the Innovations in Theoretical Computer Science, 2013
2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Commun. ACM, 2011
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors.
Electron. Colloquium Comput. Complex., 2010
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes.
Electron. Colloquium Comput. Complex., 2010
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010
Computational Complexity and Information Asymmetry in Financial Products (Extended Abstract).
Proceedings of the Innovations in Computer Science, 2010
2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Merkle Puzzles Are Optimal - An <i>O</i>(<i>n</i><sup>2</sup>)-Query Attack on Any Key Exchange from a Random Oracle.
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Approximation, 2009
Cambridge University Press, ISBN: 978-0-521-42426-4, 2009
2008
IACR Cryptol. ePrint Arch., 2008
Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Proceedings of the Advances in Cryptology, 2008
2007
Privacy, accuracy, and consistency too: a holistic solution to contingency table release.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007
2006
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
A model and architecture for pseudo-random generation with applications to /dev/random.
IACR Cryptol. ePrint Arch., 2005
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
Electron. Colloquium Comput. Complex., 2005
2004
IACR Cryptol. ePrint Arch., 2004
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Proceedings of the Cryptographic Hardware and Embedded Systems, 2003
2002
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
IACR Cryptol. ePrint Arch., 2001
Electron. Colloquium Comput. Complex., 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
2000
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
1999