default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Reingold
Person information
- affiliation: Stanford University, CA, USA
- affiliation (former): Weizmann Institute of Science, Israel
- award (2009): Gödel Prize
- award (2005): Grace Murray Hopper Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2025
[j37]Inbal Rachel Livni Navon, Omer Reingold, Judy Hanwen Shen:
Fairness with respect to Stereotype Predictors: Impossibilities and Best Practices. Trans. Mach. Learn. Res. 2025 (2025)- 2022
- [j36]Omer Reingold:
Bringing Research-Life to Centerstage. Bull. EATCS 138 (2022) - 2021
- [j35]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. SIAM J. Comput. 50(3) (2021) - [j34]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. SIAM J. Comput. 50(6): 1892-1922 (2021) - [j33]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. Adv. Math. Commun. 17: 1-35 (2021) - 2020
- [j32]Omer Reingold:
Through the lens of a passionate theoretician. Commun. ACM 63(3): 25-27 (2020) - [j31]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. 16: 1-55 (2020) - 2018
- [j30]Ilya Mironov
, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. J. Cryptol. 31(1): 134-161 (2018) - 2017
- [j29]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (2017) - 2016
- [j28]Omer Reingold, Shai Vardi:
New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. 82(7): 1180-1200 (2016) - 2015
- [j27]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44(1): 193-242 (2015) - 2014
- [j26]Ronen Gradwohl, Omer Reingold:
Fault tolerance in large games. Games Econ. Behav. 86: 438-457 (2014) - [j25]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. J. Cryptol. 27(1): 109-138 (2014) - 2013
- [j24]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF sparsification and a faster deterministic counting algorithm. Comput. Complex. 22(2): 275-310 (2013) - [j23]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42(3): 1030-1050 (2013) - [j22]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. 42(3): 1051-1076 (2013) - [j21]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. 42(3): 1405-1430 (2013) - 2011
- [j20]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. SIAM J. Comput. 40(6): 1486-1528 (2011) - [j19]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3): 30:1-30:21 (2011) - 2010
- [j18]Ronen Gradwohl, Omer Reingold:
Partial exposure in large games. Games Econ. Behav. 68(2): 602-613 (2010) - 2009
- [j17]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. Algorithmica 55(1): 113-133 (2009) - [j16]Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff:
Players' Effects Under Limited Independence. Math. Oper. Res. 34(4): 971-980 (2009) - [j15]Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan:
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. 39(3): 1153-1218 (2009) - 2008
- [j14]Omer Reingold:
Undirected connectivity in log-space. J. ACM 55(4): 17:1-17:24 (2008) - 2006
- [j13]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation: A Computational View. J. Cryptol. 19(4): 521-552 (2006) - [j12]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. SIAM J. Comput. 35(5): 1185-1209 (2006) - [j11]Irit Dinur, Omer Reingold:
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. 36(4): 975-1024 (2006) - 2005
- [j10]Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. 18(2): 99-109 (2005) - 2004
- [j9]Moni Naor, Omer Reingold:
Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2): 231-262 (2004) - [j8]William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold:
Just fast keying: Key agreement in a hostile internet. ACM Trans. Inf. Syst. Secur. 7(2): 242-273 (2004) - 2003
- [j7]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. J. ACM 50(6): 852-921 (2003) - 2002
- [j6]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. 65(1): 97-128 (2002) - [j5]Moni Naor, Omer Reingold:
Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptol. 15(2): 97-102 (2002) - [j4]Moni Naor, Omer Reingold, Alon Rosen:
Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002) - 1999
- [j3]Eli Biham, Dan Boneh, Omer Reingold:
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. Inf. Process. Lett. 70(2): 83-87 (1999) - [j2]Moni Naor, Omer Reingold:
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci. 58(2): 336-375 (1999) - [j1]Moni Naor, Omer Reingold:
On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptol. 12(1): 29-66 (1999)
Conference and Workshop Papers
- 2025
- [c96]Jabari Hastings, Sigal Oren, Omer Reingold:
OWA for Bipartite Assignments. FORC 2025: 21:1-21:20 - 2024
- [c95]Omer Reingold, Judy Hanwen Shen, Aditi Talati:
Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance. AAAI 2024: 21537-21544 - [c94]Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth:
Oracle Efficient Online Multicalibration and Omniprediction. SODA 2024: 2725-2792 - 2023
- [c93]Lunjia Hu, Inbal Livni Navon, Omer Reingold:
Generative Models of Huge Objects. CCC 2023: 5:1-5:20 - [c92]Cynthia Dwork, Omer Reingold, Guy N. Rothblum:
From the Real Towards the Ideal: Risk Prediction in a Better World. FORC 2023: 1:1-1:17 - [c91]Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Bidding Strategies for Proportional Representation in Advertisement Campaigns. FORC 2023: 3:1-3:22 - [c90]Lunjia Hu, Inbal Rachel Livni Navon, Omer Reingold, Chutong Yang:
Omnipredictors for Constrained Optimization. ICML 2023: 13497-13527 - [c89]Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS 2023: 60:1-60:20 - [c88]Parikshit Gopalan, Michael P. Kim, Omer Reingold:
Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration. NeurIPS 2023 - 2022
- [c87]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. ALT 2022: 342-380 - [c86]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. ALT 2022: 408-435 - [c85]Lunjia Hu, Charlotte Peale, Omer Reingold:
Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability. ALT 2022: 515-552 - [c84]Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Leximax Approximations and Representative Cohort Selection. FORC 2022: 2:1-2:22 - [c83]Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. ITCS 2022: 79:1-79:21 - 2021
- [c82]Lunjia Hu, Omer Reingold:
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers. AISTATS 2021: 1558-1566 - [c81]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM 2021: 58:1-58:21 - [c80]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome indistinguishability. STOC 2021: 1095-1108 - 2020
- [c79]Katrina Ligett, Charlotte Peale, Omer Reingold:
Bounded-Leakage Differential Privacy. FORC 2020: 10:1-10:20 - 2019
- [c78]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. APPROX-RANDOM 2019: 42:1-42:22 - [c77]Sumegha Garg, Michael P. Kim, Omer Reingold:
Tracking and Improving Information in the Service of Fairness. EC 2019: 809-824 - [c76]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Learning from Outcomes: Evidence-Based Rankings. FOCS 2019: 106-125 - [c75]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. ITCS 2019: 40:1-40:16 - [c74]Raghu Meka, Omer Reingold, Avishay Tal:
Pseudorandom generators for width-3 branching programs. STOC 2019: 626-637 - 2018
- [c73]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Efficient Batch Verification for UP. CCC 2018: 22:1-22:23 - [c72]Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Multicalibration: Calibration for the (Computationally-Identifiable) Masses. ICML 2018: 1944-1953 - [c71]Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Fairness Through Computationally-Bounded Awareness. NeurIPS 2018: 4847-4857 - [c70]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved pseudorandomness for unordered branching programs through local monotonicity. STOC 2018: 363-375 - 2017
- [c69]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS 2017: 801-812 - [c68]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. WWW (Companion Volume) 2017: 635-642 - 2016
- [c67]Omer Reingold, Nina Narodytska:
Adaptive Condorcet-Based Stopping Rules Can Be Efficient. ECAI 2016: 1704-1705 - [c66]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-round interactive proofs for delegating computation. STOC 2016: 49-62 - [c65]Katherine Ellis, Moisés Goldszmidt, Gert R. G. Lanckriet, Nina Mishra, Omer Reingold:
Equality and Social Mobility in Twitter Discussion Groups. WSDM 2016: 523-532 - 2015
- [c64]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - [c63]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS 2015: 2350-2358 - [c62]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth:
Preserving Statistical Validity in Adaptive Data Analysis. STOC 2015: 117-126 - 2014
- [c61]Raghu Meka, Omer Reingold, Yuan Zhou:
Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM 2014: 872-884 - [c60]Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) 2014: 859-870 - [c59]Omer Reingold, Ron D. Rothblum, Udi Wieder:
Pseudorandom Graphs in Data Structures. ICALP (1) 2014: 943-954 - 2013
- [c58]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM 2013: 655-670 - 2012
- [c57]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. CCC 2012: 126-135 - [c56]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. EUROCRYPT 2012: 628-644 - [c55]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS 2012: 120-129 - [c54]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness through awareness. ITCS 2012: 214-226 - 2011
- [c53]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS 2011: 599-608 - [c52]Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert, Omer Reingold:
Only valuable experts can be valued. EC 2011: 221-222 - [c51]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom generators for combinatorial shapes. STOC 2011: 253-262 - 2010
- [c50]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT 2010: 616-637 - [c49]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. FOCS 2010: 81-90 - [c48]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC 2010: 437-446 - 2009
- [c47]Klim Efremenko, Omer Reingold:
How Well Do Random Walks Parallelize?. APPROX-RANDOM 2009: 476-489 - [c46]Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630 - [c45]Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan:
Computational Differential Privacy. CRYPTO 2009: 126-142 - [c44]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan:
On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390 - [c43]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible entropy. STOC 2009: 611-620 - 2008
- [c42]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. FOCS 2008: 76-85 - [c41]Ronen Gradwohl, Omer Reingold:
Fault tolerance in large games. EC 2008: 274-283 - 2007
- [c40]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC 2007: 236-249 - [c39]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. CCC 2007: 319-332 - [c38]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS 2007: 669-679 - [c37]Iftach Haitner, Omer Reingold:
Statistically-hiding commitment from any one-way function. STOC 2007: 1-10 - 2006
- [c36]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. CRYPTO 2006: 22-40 - [c35]Iftach Haitner, Danny Harnik, Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) 2006: 228-239 - [c34]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC 2006: 457-466 - 2005
- [c33]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305 - [c32]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM 2005: 354-365 - [c31]Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113 - [c30]Omer Reingold:
Undirected ST-connectivity in log-space. STOC 2005: 376-385 - [c29]Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold:
Keyword Search and Oblivious Pseudorandom Functions. TCC 2005: 303-324 - 2004
- [c28]Cynthia Dwork, Moni Naor, Omer Reingold:
Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT 2004: 342-360 - [c27]Irit Dinur, Omer Reingold:
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS 2004: 155-164 - [c26]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in two-party secure computation: a computational view. STOC 2004: 252-261 - [c25]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Notions of Reducibility between Cryptographic Primitives. TCC 2004: 1-20 - 2003
- [c24]Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Extractors: optimal up to constant factors. STOC 2003: 602-611 - 2002
- [c23]William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis:
Efficient, DoS-resistant, secure key exchange for internet protocols. CCS 2002: 48-58 - [c22]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness Conductors and Constant-Degree Lossless Expanders. CCC 2002: 15 - [c21]Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel:
Streaming Computation of Combinatorial Objects. CCC 2002: 165-174 - [c20]Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Randomness conductors and constant-degree lossless expanders. STOC 2002: 659-668 - [c19]Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC 2002: 222-236 - 2001
- [c18]William Aiello, Yuval Ishai, Omer Reingold:
Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135 - [c17]Yael Gertner, Tal Malkin, Omer Reingold:
On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. FOCS 2001: 126-135 - [c16]Moni Naor, Omer Reingold:
Constructing pseudo-random permutations with a prescribed structure. SODA 2001: 458-459 - [c15]William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold:
Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. Security Protocols Workshop 2001: 27-39 - 2000
- [c14]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS 2000: 3-13 - [c13]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. FOCS 2000: 22-31 - [c12]Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan:
The Relationship between Public Key Encryption and Oblivious Transfer. FOCS 2000: 325-335 - [c11]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20 - 1999
- [c10]Moni Naor, Benny Pinkas, Omer Reingold:
Distributed Pseudo-random Functions and KDCs. EUROCRYPT 1999: 327-346 - [c9]Ran Raz, Omer Reingold, Salil P. Vadhan:
Error Reduction for Extractors. FOCS 1999: 191-201 - [c8]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. FOCS 1999: 523-534 - [c7]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC 1999: 149-158 - [c6]Ran Raz, Omer Reingold:
On Recycling the Randomness of States in Space Bounded Computation. STOC 1999: 159-168 - 1998
- [c5]Moni Naor, Omer Reingold:
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO 1998: 267-282 - [c4]Ran Canetti, Daniele Micciancio, Omer Reingold:
Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC 1998: 131-140 - 1997
- [c3]Moni Naor, Omer Reingold:
Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS 1997: 458-467 - [c2]Moni Naor, Omer Reingold:
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC 1997: 189-199 - 1995
- [c1]Moni Naor, Omer Reingold:
Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS 1995: 170-181
Editorship
- 2009
- [e2]Omer Reingold:
Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings. Lecture Notes in Computer Science 5444, Springer 2009, ISBN 978-3-642-00456-8 [contents] - 2007
- [e1]Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings. Lecture Notes in Computer Science 4627, Springer 2007, ISBN 978-3-540-74207-4 [contents]
Informal and Other Publications
- 2025
- [i75]Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade, Omer Reingold:
How Global Calibration Strengthens Multiaccuracy. CoRR abs/2504.15206 (2025) - [i74]Noga Amit, Omer Reingold, Guy N. Rothblum:
Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility. CoRR abs/2505.16494 (2025) - [i73]Charlotte Peale, Vinod Raman, Omer Reingold:
Representative Language Generation. CoRR abs/2505.21819 (2025) - 2023
- [i72]Parikshit Gopalan, Michael P. Kim, Omer Reingold:
Characterizing notions of omniprediction via multicalibration. CoRR abs/2302.06726 (2023) - [i71]Lunjia Hu, Inbal Livni Navon, Omer Reingold:
Generative Models of Huge Objects. CoRR abs/2302.12823 (2023) - [i70]Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Bidding Strategies for Proportional Representation in Advertisement Campaigns. CoRR abs/2305.13542 (2023) - [i69]Omer Reingold, Judy Hanwen Shen, Aditi Talati:
Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance. CoRR abs/2307.07636 (2023) - [i68]Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth:
Oracle Efficient Online Multicalibration and Omniprediction. CoRR abs/2307.08999 (2023) - 2022
- [i67]Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder:
KL Divergence Estimation with Multi-group Attribution. CoRR abs/2202.13576 (2022) - [i66]Lunjia Hu, Charlotte Peale, Omer Reingold:
Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability. CoRR abs/2203.04536 (2022) - [i65]Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen:
Leximax Approximations and Representative Cohort Selection. CoRR abs/2205.01157 (2022) - [i64]Lunjia Hu, Inbal Livni Navon, Omer Reingold, Chutong Yang:
Omnipredictors for Constrained Optimization. CoRR abs/2209.07463 (2022) - [i63]Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder:
Loss Minimization through the Lens of Outcome Indistinguishability. CoRR abs/2210.08649 (2022) - 2021
- [i62]Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder:
Multicalibrated Partitions for Importance Weights. CoRR abs/2103.05853 (2021) - [i61]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR abs/2105.01417 (2021) - [i60]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR abs/2105.01459 (2021) - [i59]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. CoRR abs/2105.01958 (2021) - [i58]Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder:
Omnipredictors. CoRR abs/2109.05389 (2021) - [i57]Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i56]Lunjia Hu, Omer Reingold:
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers. CoRR abs/2008.08071 (2020) - [i55]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR abs/2010.05586 (2020) - [i54]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. CoRR abs/2011.13426 (2020) - [i53]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i52]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Deterministic Approximation of Random Walks in Small Space. CoRR abs/1903.06361 (2019) - [i51]Sumegha Garg, Michael P. Kim, Omer Reingold:
Tracking and Improving Information in the Service of Fairness. CoRR abs/1904.09942 (2019) - 2018
- [i50]Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Fairness Through Computationally-Bounded Awareness. CoRR abs/1803.03239 (2018) - [i49]Raghu Meka, Omer Reingold, Avishay Tal:
Pseudorandom Generators for Width-3 Branching Programs. CoRR abs/1806.04256 (2018) - [i48]Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff:
On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. TR18 (2018) - [i47]Raghu Meka, Omer Reingold, Avishay Tal:
Pseudorandom Generators for Width-3 Branching Programs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i46]Omer Reingold, Guy N. Rothblum, Ron Rothblum:
Efficient Batch Verification for UP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i45]Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat:
ERA: A Framework for Economic Resource Allocation for the Cloud. CoRR abs/1702.07311 (2017) - [i44]Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan:
Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR abs/1708.04634 (2017) - [i43]Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Calibration for the (Computationally-Identifiable) Masses. CoRR abs/1711.08513 (2017) - [i42]Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal:
Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i41]Omer Reingold, Ron Rothblum, Guy N. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i40]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR abs/1506.02629 (2015) - 2014
- [i39]Omer Reingold, Shai Vardi:
New Techniques and Tighter Bounds for Local Computation Algorithms. CoRR abs/1404.5398 (2014) - [i38]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Preserving Statistical Validity in Adaptive Data Analysis. CoRR abs/1411.2664 (2014) - 2013
- [i37]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR abs/1306.3004 (2013) - [i36]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i35]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting Algorithm. CoRR abs/1205.3534 (2012) - [i34]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better Pseudorandom Generators from Milder Pseudorandom Restrictions. CoRR abs/1210.0049 (2012) - [i33]Parikshit Gopalan, Raghu Meka, Omer Reingold:
DNF Sparsification and a Faster Deterministic Counting. Electron. Colloquium Comput. Complex. TR12 (2012) - [i32]Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. TR12 (2012) - [i31]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. IACR Cryptol. ePrint Arch. 2012: 47 (2012) - 2011
- [i30]Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel:
Fairness Through Awareness. CoRR abs/1104.3913 (2011) - [i29]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. Electron. Colloquium Comput. Complex. TR11 (2011) - [i28]Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan:
The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i27]Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman:
Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i26]Iftach Haitner, Omer Reingold, Salil P. Vadhan:
Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electron. Colloquium Comput. Complex. TR10 (2010) - [i25]Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. 2010: 120 (2010) - 2009
- [i24]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i23]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i22]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. Electron. Colloquium Comput. Complex. TR07 (2007) - [i21]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electron. Colloquium Comput. Complex. TR07 (2007) - [i20]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. IACR Cryptol. ePrint Arch. 2007: 145 (2007) - 2006
- [i19]Eyal Kaplan, Moni Naor, Omer Reingold:
Derandomized Constructions of k-Wise (Almost) Independent Permutations. Electron. Colloquium Comput. Complex. TR06 (2006) - [i18]Iftach Haitner, Omer Reingold:
A New Interactive Hashing Theorem. Electron. Colloquium Comput. Complex. TR06 (2006) - [i17]Iftach Haitner, Omer Reingold:
Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptol. ePrint Arch. 2006: 436 (2006) - 2005
- [i16]Omer Reingold, Luca Trevisan, Salil P. Vadhan:
Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem. Electron. Colloquium Comput. Complex. TR05 (2005) - [i15]Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma:
On the Error Parameter of Dispersers. Electron. Colloquium Comput. Complex. TR05 (2005) - [i14]Iftach Haitner, Danny Harnik, Omer Reingold:
On the Power of the Randomized Iterate. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [i13]Omer Reingold:
Undirected ST-Connectivity in Log-Space. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [i12]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation - A Computational View. Electron. Colloquium Comput. Complex. TR03 (2003) - 2001
- [i11]Omer Reingold, Salil P. Vadhan, Avi Wigderson:
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. Electron. Colloquium Comput. Complex. TR01 (2001) - [i10]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. Electron. Colloquium Comput. Complex. TR01 (2001) - [i9]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. IACR Cryptol. ePrint Arch. 2001: 75 (2001) - 2000
- [i8]Omer Reingold, Ronen Shaltiel, Avi Wigderson:
Extracting Randomness via Repeated Condensing. Electron. Colloquium Comput. Complex. TR00 (2000) - [i7]Moni Naor, Omer Reingold:
Constructing Pseudo-Random Permutations with a Prescribed Structure. IACR Cryptol. ePrint Arch. 2000: 42 (2000) - 1999
- [i6]Ran Raz, Omer Reingold, Salil P. Vadhan:
Extracting All the Randomness and Reducing the Error in Trevisan's Extractors. Electron. Colloquium Comput. Complex. TR99 (1999) - 1997
- [i5]Moni Naor, Omer Reingold:
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. Electron. Colloquium Comput. Complex. TR97 (1997) - [i4]Eli Biham, Dan Boneh, Omer Reingold:
Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring. Electron. Colloquium Comput. Complex. TR97 (1997) - [i3]Eli Biham, Dan Boneh, Omer Reingold:
Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring. IACR Cryptol. ePrint Arch. 1997: 14 (1997) - 1996
- [i2]Moni Naor, Omer Reingold:
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. IACR Cryptol. ePrint Arch. 1996: 11 (1996) - 1995
- [i1]Moni Naor, Omer Reingold:
Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions. Electron. Colloquium Comput. Complex. TR95 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-29 20:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
