Barak, Boaz

Computational Complexity: A Modern Approach

Arora, S., & Barak, B. (2009) · Cambridge University Press eBooks

Complexity and Algorithms in GraphsComputability, Logic, AI Algorithms

Cited by 1,690

Quantum optimization of maximum independent set using Rydberg atom arrays

Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science

Quantum Computing Algorithms and ArchitectureCold Atom Physics and Bose-Einstein Condensates

Cited by 430

Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage

Gao, X., Kalinowski, M., Chou, C.-N., Lukin, M. D., Barak, B., & Choi, S. (2021) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum many-body systems

Cited by 54

OpenAI o1 System Card

OpenAI, :, Jaech, A., Kalai, A., Lerer, A., Richardson, A., El-Kishky, A., Low, A., Helyar, A., Madry, A., et al. (2024) · arXiv

Adversarial Robustness in Machine LearningEthics and Social Impacts of AI

Cited by 50

Scaling Data-Constrained Language Models

Muennighoff, N., Rush, A. M., Barak, B., Scao, T. L., Piktus, A., Tazi, N., Pyysalo, S., Wolf, T., & Raffel, C. (2023) · arXiv

Topic ModelingNatural Language Processing Techniques

Cited by 49

Scaling Data-Constrained Language Models

Muennighoff, N., Rush, A., Barak, B., Scao, T. L., Tazi, N., Piktus, A., Pyysalo, S., Wolf, T., & Raffel, C. (2023) · Advances in Neural Information Processing Systems 36

Topic ModelingNatural Language Processing Techniques

Cited by 47

Revisiting Model Stitching to Compare Neural Representations

Bansal, Y., Nakkiran, P., & Barak, B. (2021) · arXiv

Domain Adaptation and Few-Shot LearningStochastic Gradient Optimization Techniques

Cited by 26

OpenAI GPT-5 System Card

Singh, A., Fry, A., Perelman, A., Tart, A., Ganesh, A., El-Kishky, A., McLaughlin, A., Low, A., Ostrow, A., Ananthram, A., et al. (2026) · arXiv

Topic ModelingNatural Language Processing Techniques

Cited by 26

Classical algorithms and quantum limitations for maximum cut on high-girth graphs

Barak, B., & Marwaha, K. (2021) · arXiv

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 19

Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs

Barak, B., & Marwaha, K. (2022) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Quantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs

Cited by 19

Watermarks in the Sand: Impossibility of Strong Watermarking for Generative Models

Zhang, H., Edelman, B. L., Francati, D., Venturi, D., Ateniese, G., & Barak, B. (2023) · arXiv

Advanced Steganography and Watermarking TechniquesAdversarial Robustness in Machine Learning

Cited by 12

Beating the random assignment on constraint satisfaction problems of bounded degree

Barak, B., Moitra, A., O'Donnell, R., Raghavendra, P., Regev, O., Steurer, D., Trevisan, L., Vijayaraghavan, A., Witmer, D., & Wright, J. (2015) · arXiv

Constraint Satisfaction and OptimizationComplexity and Algorithms in Graphs

Cited by 8

Distinguishing the Knowable from the Unknowable with Language Models

Ahdritz, G., Qin, T., Vyas, N., Barak, B., & Edelman, B. L. (2024) · arXiv

Topic ModelingAdversarial Robustness in Machine Learning

Cited by 4