Articles with public access mandates - Omer ReingoldLearn more
Available somewhere: 24
Multicalibration: Calibration for the (computationally-identifiable) masses
U Hébert-Johnson, M Kim, O Reingold, G Rothblum
International Conference on Machine Learning, 1939-1948, 2018
Mandates: US National Science Foundation
The reusable holdout: Preserving validity in adaptive data analysis
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Science 349 (6248), 636-638, 2015
Mandates: Natural Sciences and Engineering Research Council of Canada
Constant-round interactive proofs for delegating computation
O Reingold, GN Rothblum, RD Rothblum
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
Mandates: US National Science Foundation
Fairness through computationally-bounded awareness
M Kim, O Reingold, G Rothblum
Advances in neural information processing systems 31, 2018
Mandates: US National Science Foundation
Outcome indistinguishability
C Dwork, MP Kim, O Reingold, GN Rothblum, G Yona
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Mandates: US National Science Foundation, European Commission
Pseudorandom generators for width-3 branching programs
R Meka, O Reingold, A Tal
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Mandates: US National Science Foundation
Universal adaptability: Target-independent inference that competes with propensity scoring
MP Kim, C Kern, S Goldwasser, F Kreuter, O Reingold
Proceedings of the National Academy of Sciences 119 (4), e2108097119, 2022
Mandates: US National Science Foundation, German Research Foundation
Improved pseudorandomness for unordered branching programs through local monotonicity
E Chattopadhyay, P Hatami, O Reingold, A Tal
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Mandates: US National Science Foundation
Learning from outcomes: Evidence-based rankings
C Dwork, MP Kim, O Reingold, GN Rothblum, G Yona
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
Mandates: US National Science Foundation, European Commission
Derandomization beyond connectivity: Undirected laplacian systems in nearly logarithmic space
J Murtagh, O Reingold, A Sidford, S Vadhan
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
Mandates: US National Science Foundation
Efficient batch verification for UP
O Reingold, GN Rothblum, RD Rothblum
33rd Computational Complexity Conference (CCC 2018), 2018
Mandates: US National Science Foundation, US Department of Defense
Guilt-free data reuse
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Communications of the ACM 60 (4), 86-93, 2017
Mandates: US National Science Foundation
Omnipredictors for constrained optimization
L Hu, IRL Navon, O Reingold, C Yang
International Conference on Machine Learning, 13497-13527, 2023
Mandates: US National Science Foundation
Tracking and improving information in the service of fairness
S Garg, MP Kim, O Reingold
Proceedings of the 2019 ACM Conference on Economics and Computation, 809-824, 2019
Mandates: US National Science Foundation
Bounded-leakage differential privacy
K Ligett, C Peale, O Reingold
Leibniz international proceedings in informatics 156, 2020
Mandates: US National Science Foundation, US Department of Defense
Beyond bernoulli: Generating random outcomes that cannot be distinguished from nature
C Dwork, MP Kim, O Reingold, GN Rothblum, G Yona
International Conference on Algorithmic Learning Theory, 342-380, 2022
Mandates: US National Science Foundation, European Commission
Pseudorandom generators for read-once monotone branching programs
D Doron, R Meka, O Reingold, A Tal, S Vadhan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021
Mandates: US National Science Foundation
Metric entropy duality and the sample complexity of outcome indistinguishability
L Hu, C Peale, O Reingold
International Conference on Algorithmic Learning Theory, 515-552, 2022
Mandates: US National Science Foundation
Deterministic approximation of random walks in small space
J Murtagh, O Reingold, A Sidford, S Vadhan
Theory of Computing 17 (1), 2021
Mandates: US National Science Foundation
Robust mean estimation on highly incomplete data with arbitrary outliers
L Hu, O Reingold
International Conference on Artificial Intelligence and Statistics, 1558-1566, 2021
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program