Omer Reingold - RankMe

214 papers A* 58A 15B 6Journal 113Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility. CoRR Noga Amit, Omer Reingold, Guy N. Rothblum
2025	J	`jnl`	Fairness with respect to Stereotype Predictors: Impossibilities and Best Practices. Trans. Mach. Learn. Res. Inbal Rachel Livni Navon, Omer Reingold, Judy Hanwen Shen
2025	A*	`conf`	How Global Calibration Strengthens Multiaccuracy. FOCS Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade, Omer Reingold
2025	J	`jnl`	How Global Calibration Strengthens Multiaccuracy. CoRR Sílvia Casacuberta, Parikshit Gopalan, Varun Kanade, Omer Reingold
2025	—	`conf`	Multiaccuracy for Subpopulation Calibration Over Distribution Shift in Medical Prediction Models. CHIL Daniel Kapash, Noam Barda, Omer Reingold, Noa Dagan, Ran D. Balicer
2025	—	`conf`	OWA for Bipartite Assignments. FORC Jabari Hastings, Sigal Oren, Omer Reingold
2025	J	`jnl`	On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment. CoRR Sarah Ball, Greg Gluch, Shafi Goldwasser, Frauke Kreuter, Omer Reingold, Guy N. Rothblum
2025	A*	`conf`	Representative Language Generation. ICML Charlotte Peale, Vinod Raman, Omer Reingold
2025	J	`jnl`	Representative Language Generation. CoRR Charlotte Peale, Vinod Raman, Omer Reingold
2024	A*	`conf`	Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance. AAAI Omer Reingold, Judy Hanwen Shen, Aditi Talati
2024	A*	`conf`	Oracle Efficient Online Multicalibration and Omniprediction. SODA Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth
2023	—	`conf`	Bidding Strategies for Proportional Representation in Advertisement Campaigns. FORC Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2023	J	`jnl`	Bidding Strategies for Proportional Representation in Advertisement Campaigns. CoRR Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2023	J	`jnl`	Characterizing notions of omniprediction via multicalibration. CoRR Parikshit Gopalan, Michael P. Kim, Omer Reingold
2023	J	`jnl`	Dissenting Explanations: Leveraging Disagreement to Reduce Model Overreliance. CoRR Omer Reingold, Judy Hanwen Shen, Aditi Talati
2023	—	`conf`	From the Real Towards the Ideal: Risk Prediction in a Better World. FORC Cynthia Dwork, Omer Reingold, Guy N. Rothblum
2023	A	`conf`	Generative Models of Huge Objects. CCC Lunjia Hu, Inbal Livni Navon, Omer Reingold
2023	J	`jnl`	Generative Models of Huge Objects. CoRR Lunjia Hu, Inbal Livni Navon, Omer Reingold
2023	A	`conf`	Loss Minimization Through the Lens Of Outcome Indistinguishability. ITCS Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
2023	A*	`conf`	Omnipredictors for Constrained Optimization. ICML Lunjia Hu, Inbal Rachel Livni Navon, Omer Reingold, Chutong Yang
2023	J	`jnl`	Oracle Efficient Online Multicalibration and Omniprediction. CoRR Sumegha Garg, Christopher Jung, Omer Reingold, Aaron Roth
2023	A*	`conf`	Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration. NeurIPS Parikshit Gopalan, Michael P. Kim, Omer Reingold
2022	B	`conf`	Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. ALT Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2022	J	`jnl`	Bringing Research-Life to Centerstage. Bull. EATCS Omer Reingold
2022	J	`jnl`	KL Divergence Estimation with Multi-group Attribution. CoRR Parikshit Gopalan, Nina Narodytska, Omer Reingold, Vatsal Sharan, Udi Wieder
2022	—	`conf`	Leximax Approximations and Representative Cohort Selection. FORC Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2022	J	`jnl`	Leximax Approximations and Representative Cohort Selection. CoRR Monika Henzinger, Charlotte Peale, Omer Reingold, Judy Hanwen Shen
2022	J	`jnl`	Loss Minimization through the Lens of Outcome Indistinguishability. CoRR Parikshit Gopalan, Lunjia Hu, Michael P. Kim, Omer Reingold, Udi Wieder
2022	B	`conf`	Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability. ALT Lunjia Hu, Charlotte Peale, Omer Reingold
2022	J	`jnl`	Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability. CoRR Lunjia Hu, Charlotte Peale, Omer Reingold
2022	B	`conf`	Multicalibrated Partitions for Importance Weights. ALT Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
2022	J	`jnl`	Omnipredictors for Constrained Optimization. CoRR Lunjia Hu, Inbal Livni Navon, Omer Reingold, Chutong Yang
2022	A	`conf`	Omnipredictors. ITCS Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
2021	J	`jnl`	Constant-Round Interactive Proofs for Delegating Computation. SIAM J. Comput. Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2021	J	`jnl`	Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. SIAM J. Comput. Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2021	J	`jnl`	Deterministic Approximation of Random Walks in Small Space. Theory Comput. Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2021	J	`jnl`	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2021	J	`jnl`	Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. CoRR Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2021	J	`jnl`	Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Electron. Colloquium Comput. Complex. Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	J	`jnl`	Multicalibrated Partitions for Importance Weights. CoRR Parikshit Gopalan, Omer Reingold, Vatsal Sharan, Udi Wieder
2021	J	`jnl`	Omnipredictors. CoRR Parikshit Gopalan, Adam Tauman Kalai, Omer Reingold, Vatsal Sharan, Udi Wieder
2021	J	`jnl`	On the Communication Complexity of Key-Agreement Protocols. CoRR Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2021	A*	`conf`	Outcome indistinguishability. STOC Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2021	—	`conf`	Pseudorandom Generators for Read-Once Monotone Branching Programs. APPROX-RANDOM Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan
2021	A	`conf`	Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers. AISTATS Lunjia Hu, Omer Reingold
2020	—	`conf`	Bounded-Leakage Differential Privacy. FORC Katrina Ligett, Charlotte Peale, Omer Reingold
2020	J	`jnl`	Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions. CoRR Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020	J	`jnl`	Inaccessible Entropy II: IE Functions and Universal One-Way Hashing. Theory Comput. Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2020	J	`jnl`	Outcome Indistinguishability. CoRR Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2020	J	`jnl`	Outcome Indistinguishability. Electron. Colloquium Comput. Complex. Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2020	J	`jnl`	Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers. CoRR Lunjia Hu, Omer Reingold
2020	J	`jnl`	Through the lens of a passionate theoretician. Commun. ACM Omer Reingold
2019	—	`conf`	Deterministic Approximation of Random Walks in Small Space. APPROX-RANDOM Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2019	J	`jnl`	Deterministic Approximation of Random Walks in Small Space. CoRR Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2019	A*	`conf`	Learning from Outcomes: Evidence-Based Rankings. FOCS Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2019	A	`conf`	On the Communication Complexity of Key-Agreement Protocols. ITCS Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2019	A*	`conf`	Pseudorandom generators for width-3 branching programs. STOC Raghu Meka, Omer Reingold, Avishay Tal
2019	A*	`conf`	Tracking and Improving Information in the Service of Fairness. EC Sumegha Garg, Michael P. Kim, Omer Reingold
2019	J	`jnl`	Tracking and Improving Information in the Service of Fairness. CoRR Sumegha Garg, Michael P. Kim, Omer Reingold
2018	A	`conf`	Efficient Batch Verification for UP. CCC Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2018	J	`jnl`	Efficient Batch Verification for UP. Electron. Colloquium Comput. Complex. Omer Reingold, Guy N. Rothblum, Ron Rothblum
2018	A*	`conf`	Fairness Through Computationally-Bounded Awareness. NeurIPS Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018	J	`jnl`	Fairness Through Computationally-Bounded Awareness. CoRR Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018	A*	`conf`	Improved pseudorandomness for unordered branching programs through local monotonicity. STOC Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
2018	J	`jnl`	Incremental Deterministic Public-Key Encryption. J. Cryptol. Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2018	A*	`conf`	Multicalibration: Calibration for the (Computationally-Identifiable) Masses. ICML Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018	J	`jnl`	On the Communication Complexity of Key-Agreement Protocols. Electron. Colloquium Comput. Complex. Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff
2018	J	`jnl`	Pseudorandom Generators for Width-3 Branching Programs. CoRR Raghu Meka, Omer Reingold, Avishay Tal
2018	J	`jnl`	Pseudorandom Generators for Width-3 Branching Programs. Electron. Colloquium Comput. Complex. Raghu Meka, Omer Reingold, Avishay Tal
2017	J	`jnl`	Calibration for the (Computationally-Identifiable) Masses. CoRR Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
2017	A*	`conf`	Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. FOCS Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2017	J	`jnl`	Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space. CoRR Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan
2017	—	`conf`	ERA: A Framework for Economic Resource Allocation for the Cloud. WWW (Companion Volume) Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat
2017	J	`jnl`	ERA: A Framework for Economic Resource Allocation for the Cloud. CoRR Moshe Babaioff, Yishay Mansour, Noam Nisan, Gali Noti, Carlo Curino, Nar Ganapathy, Ishai Menache, Omer Reingold, Moshe Tennenholtz, Erez Timnat
2017	J	`jnl`	Guilt-free data reuse. Commun. ACM Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2017	J	`jnl`	Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. Electron. Colloquium Comput. Complex. Eshan Chattopadhyay, Pooya Hatami, Omer Reingold, Avishay Tal
2016	A	`conf`	Adaptive Condorcet-Based Stopping Rules Can Be Efficient. ECAI Omer Reingold, Nina Narodytska
2016	J	`jnl`	Constant-Round Interactive Proofs for Delegating Computation. Electron. Colloquium Comput. Complex. Omer Reingold, Ron Rothblum, Guy N. Rothblum
2016	A*	`conf`	Constant-round interactive proofs for delegating computation. STOC Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2016	A	`conf`	Equality and Social Mobility in Twitter Discussion Groups. WSDM Katherine Ellis, Moisés Goldszmidt, Gert R. G. Lanckriet, Nina Mishra, Omer Reingold
2016	J	`jnl`	New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. Omer Reingold, Shai Vardi
2015	J	`jnl`	Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2015	—	`conf`	Generalization in Adaptive Data Analysis and Holdout Reuse. NIPS Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2015	J	`jnl`	Generalization in Adaptive Data Analysis and Holdout Reuse. CoRR Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2015	A*	`conf`	Preserving Statistical Validity in Adaptive Data Analysis. STOC Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Leon Roth
2015	—	`conf`	Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum
2014	J	`jnl`	A New Interactive Hashing Theorem. J. Cryptol. Iftach Haitner, Omer Reingold
2014	—	`conf`	Deterministic Coupon Collection and Better Strong Dispersers. APPROX-RANDOM Raghu Meka, Omer Reingold, Yuan Zhou
2014	—	`conf`	Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2014	J	`jnl`	Fault tolerance in large games. Games Econ. Behav. Ronen Gradwohl, Omer Reingold
2014	J	`jnl`	New Techniques and Tighter Bounds for Local Computation Algorithms. CoRR Omer Reingold, Shai Vardi
2014	J	`jnl`	Preserving Statistical Validity in Adaptive Data Analysis. CoRR Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth
2014	—	`conf`	Pseudorandom Graphs in Data Structures. ICALP (1) Omer Reingold, Ron D. Rothblum, Udi Wieder
2013	J	`jnl`	Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2013	J	`jnl`	DNF sparsification and a faster deterministic counting algorithm. Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold
2013	J	`jnl`	Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions. SIAM J. Comput. Iftach Haitner, Omer Reingold, Salil P. Vadhan
2013	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. SIAM J. Comput. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2013	—	`conf`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM Omer Reingold, Thomas Steinke, Salil P. Vadhan
2013	J	`jnl`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. CoRR Omer Reingold, Thomas Steinke, Salil P. Vadhan
2013	J	`jnl`	Pseudorandomness for Regular Branching Programs via Fourier Analysis. Electron. Colloquium Comput. Complex. Omer Reingold, Thomas Steinke, Salil P. Vadhan
2012	J	`jnl`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions CoRR Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	A*	`conf`	Better Pseudorandom Generators from Milder Pseudorandom Restrictions. FOCS Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	J	`jnl`	Better pseudorandom generators from milder pseudorandom restrictions. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2012	J	`jnl`	DNF Sparsification and a Faster Deterministic Counting Algorithm CoRR Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	A	`conf`	DNF Sparsification and a Faster Deterministic Counting Algorithm. CCC Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	J	`jnl`	DNF Sparsification and a Faster Deterministic Counting. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold
2012	A	`conf`	Fairness through awareness. ITCS Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel
2012	A*	`conf`	Incremental Deterministic Public-Key Encryption. EUROCRYPT Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2012	J	`jnl`	Incremental Deterministic Public-Key Encryption. IACR Cryptol. ePrint Arch. Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2011	A*	`conf`	Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2011	J	`jnl`	Balls and Bins: Smaller Hash Families and Faster Evaluation. Electron. Colloquium Comput. Complex. L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2011	J	`jnl`	Fairness Through Awareness CoRR Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, Richard S. Zemel
2011	J	`jnl`	On the Power of the Randomized Iterate. SIAM J. Comput. Iftach Haitner, Danny Harnik, Omer Reingold
2011	A*	`conf`	Only valuable experts can be valued. EC Moshe Babaioff, Liad Blumrosen, Nicolas S. Lambert, Omer Reingold
2011	A*	`conf`	Pseudorandom generators for combinatorial shapes. STOC Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2011	J	`jnl`	S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2011	J	`jnl`	The Limits of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2010	J	`jnl`	Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions. Electron. Colloquium Comput. Complex. Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010	A*	`conf`	Efficiency improvements in constructing pseudorandom generators from one-way functions. STOC Iftach Haitner, Omer Reingold, Salil P. Vadhan
2010	J	`jnl`	Partial exposure in large games. Games Econ. Behav. Ronen Gradwohl, Omer Reingold
2010	J	`jnl`	Pseudorandom Generators for Combinatorial Shapes. Electron. Colloquium Comput. Complex. Parikshit Gopalan, Raghu Meka, Omer Reingold, David Zuckerman
2010	A*	`conf`	The Limits of Two-Party Differential Privacy. FOCS Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil P. Vadhan
2010	A*	`conf`	Universal One-Way Hash Functions via Inaccessible Entropy. EUROCRYPT Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2010	J	`jnl`	Universal One-Way Hash Functions via Inaccessible Entropy. IACR Cryptol. ePrint Arch. Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A*	`conf`	Computational Differential Privacy. CRYPTO Ilya Mironov, Omkant Pandey, Omer Reingold, Salil P. Vadhan
2009	J	`jnl`	Derandomized Constructions of Algorithmica Eyal Kaplan, Moni Naor, Omer Reingold
2009	—	`conf`	How Well Do Random Walks Parallelize?. APPROX-RANDOM Klim Efremenko, Omer Reingold
2009	J	`jnl`	Inaccessible Entropy. Electron. Colloquium Comput. Complex. Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A*	`conf`	Inaccessible entropy. STOC Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee
2009	A*	`conf`	On the complexity of differentially private data release: efficient algorithms and hardness results. STOC Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan
2009	J	`jnl`	Players' Effects Under Limited Independence. Math. Oper. Res. Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff
2009	—	`conf`	Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan
2009	J	`jnl`	Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function. SIAM J. Comput. Iftach Haitner, Minh-Huyen Nguyen, Shien Jin Ong, Omer Reingold, Salil P. Vadhan
2009	B	`ed.`	Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings TCC Omer Reingold
2008	A*	`conf`	Dense Subsets of Pseudorandom Sets. FOCS Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2008	J	`jnl`	Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan
2008	A*	`conf`	Fault tolerance in large games. EC Ronen Gradwohl, Omer Reingold
2008	J	`jnl`	Undirected connectivity in log-space. J. ACM Omer Reingold
2007	A	`conf`	A New Interactive Hashing Theorem. CCC Iftach Haitner, Omer Reingold
2007	—	`ed.`	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 APPROX-RANDOM Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim
2007	A*	`conf`	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. FOCS Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007	J	`jnl`	Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. IACR Cryptol. ePrint Arch. Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007	J	`jnl`	Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. Electron. Colloquium Comput. Complex. Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007	A	`conf`	S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2007	J	`jnl`	S-T Connectivity on Digraphs with a Known Stationary Distribution. Electron. Colloquium Comput. Complex. Kai-Min Chung, Omer Reingold, Salil P. Vadhan
2007	A*	`conf`	Statistically-hiding commitment from any one-way function. STOC Iftach Haitner, Omer Reingold
2006	J	`jnl`	A New Interactive Hashing Theorem. Electron. Colloquium Comput. Complex. Iftach Haitner, Omer Reingold
2006	J	`jnl`	Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM J. Comput. Irit Dinur, Omer Reingold
2006	J	`jnl`	Completeness in Two-Party Secure Computation: A Computational View. J. Cryptol. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2006	J	`jnl`	Derandomized Constructions of k-Wise (Almost) Independent Permutations Electron. Colloquium Comput. Complex. Eyal Kaplan, Moni Naor, Omer Reingold
2006	—	`conf`	Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. ICALP (2) Iftach Haitner, Danny Harnik, Omer Reingold
2006	J	`jnl`	Extracting Randomness via Repeated Condensing. SIAM J. Comput. Omer Reingold, Ronen Shaltiel, Avi Wigderson
2006	A*	`conf`	On the Power of the Randomized Iterate. CRYPTO Iftach Haitner, Danny Harnik, Omer Reingold
2006	A*	`conf`	Pseudorandom walks on regular digraphs and the RL vs. L problem. STOC Omer Reingold, Luca Trevisan, Salil P. Vadhan
2006	J	`jnl`	Statistically-Hiding Commitment from Any One-Way Function. IACR Cryptol. ePrint Arch. Iftach Haitner, Omer Reingold
2005	—	`conf`	Derandomized Constructions of k-Wise (Almost) Independent Permutations. APPROX-RANDOM Eyal Kaplan, Moni Naor, Omer Reingold
2005	B	`conf`	Keyword Search and Oblivious Pseudorandom Functions. TCC Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
2005	A*	`conf`	On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen
2005	J	`jnl`	On the Error Parameter of Dispersers Electron. Colloquium Comput. Complex. Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
2005	—	`conf`	On the Error Parameter of Dispersers. APPROX-RANDOM Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma
2005	J	`jnl`	On the Power of the Randomized Iterate Electron. Colloquium Comput. Complex. Iftach Haitner, Danny Harnik, Omer Reingold
2005	J	`jnl`	Pseudorandom Walks in Biregular Graphs and the RL vs. L Problem Electron. Colloquium Comput. Complex. Omer Reingold, Luca Trevisan, Salil P. Vadhan
2005	J	`jnl`	Tight bounds for shared memory systems accessed by Byzantine processes. Distributed Comput. Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
2005	A*	`conf`	Undirected ST-connectivity in log-space. STOC Omer Reingold
2004	A*	`conf`	Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem. FOCS Irit Dinur, Omer Reingold
2004	A*	`conf`	Completeness in two-party secure computation: a computational view. STOC Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2004	A*	`conf`	Immunizing Encryption Schemes from Decryption Errors. EUROCRYPT Cynthia Dwork, Moni Naor, Omer Reingold
2004	J	`jnl`	Just fast keying: Key agreement in a hostile internet. ACM Trans. Inf. Syst. Secur. William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold
2004	B	`conf`	Notions of Reducibility between Cryptographic Primitives. TCC Omer Reingold, Luca Trevisan, Salil P. Vadhan
2004	J	`jnl`	Number-theoretic constructions of efficient pseudo-random functions. J. ACM Moni Naor, Omer Reingold
2004	J	`jnl`	Undirected ST-Connectivity in Log-Space Electron. Colloquium Comput. Complex. Omer Reingold
2003	J	`jnl`	Completeness in Two-Party Secure Computation - A Computational View Electron. Colloquium Comput. Complex. Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
2003	A*	`conf`	Extractors: optimal up to constant factors. STOC Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2003	J	`jnl`	Magic Functions. J. ACM Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
2002	J	`jnl`	Constructing Pseudo-Random Permutations with a Prescribed Structure. J. Cryptol. Moni Naor, Omer Reingold
2002	A*	`conf`	Efficient, DoS-resistant, secure key exchange for internet protocols. CCS William Aiello, Steven M. Bellovin, Matt Blaze, John Ioannidis, Omer Reingold, Ran Canetti, Angelos D. Keromytis
2002	J	`jnl`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. Ran Raz, Omer Reingold, Salil P. Vadhan
2002	J	`jnl`	Pseudorandom Functions and Factoring. SIAM J. Comput. Moni Naor, Omer Reingold, Alon Rosen
2002	A	`conf`	Randomness Conductors and Constant-Degree Lossless Expanders. CCC Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002	A*	`conf`	Randomness conductors and constant-degree lossless expanders. STOC Michael R. Capalbo, Omer Reingold, Salil P. Vadhan, Avi Wigderson
2002	A	`conf`	Streaming Computation of Combinatorial Objects. CCC Ziv Bar-Yossef, Luca Trevisan, Omer Reingold, Ronen Shaltiel
2002	A	`conf`	Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. DISC Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright
2001	A*	`conf`	Constructing pseudo-random permutations with a prescribed structure. SODA Moni Naor, Omer Reingold
2001	—	`conf`	Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. Security Protocols Workshop William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, Omer Reingold
2001	J	`jnl`	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors Electron. Colloquium Comput. Complex. Omer Reingold, Salil P. Vadhan, Avi Wigderson
2001	A*	`conf`	On the Impossibility of Basing Trapdoor Functions on Trapdoor Predicates. FOCS Yael Gertner, Tal Malkin, Omer Reingold
2001	A*	`conf`	Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT William Aiello, Yuval Ishai, Omer Reingold
2001	J	`jnl`	Pseudo-Random Functions and Factoring Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold, Alon Rosen
2001	J	`jnl`	Pseudo-Random Functions and Factoring. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold, Alon Rosen
2000	J	`jnl`	Constructing Pseudo-Random Permutations with a Prescribed Structure. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold
2000	A*	`conf`	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. FOCS Omer Reingold, Salil P. Vadhan, Avi Wigderson
2000	J	`jnl`	Extracting Randomness via Repeated Condensing Electron. Colloquium Comput. Complex. Omer Reingold, Ronen Shaltiel, Avi Wigderson
2000	A*	`conf`	Extracting Randomness via Repeated Condensing. FOCS Omer Reingold, Ronen Shaltiel, Avi Wigderson
2000	A*	`conf`	Pseudo-random functions and factoring (extended abstract). STOC Moni Naor, Omer Reingold, Alon Rosen
2000	A*	`conf`	The Relationship between Public Key Encryption and Oblivious Transfer. FOCS Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
1999	J	`jnl`	Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring. Inf. Process. Lett. Eli Biham, Dan Boneh, Omer Reingold
1999	A*	`conf`	Distributed Pseudo-random Functions and KDCs. EUROCRYPT Moni Naor, Benny Pinkas, Omer Reingold
1999	A*	`conf`	Error Reduction for Extractors. FOCS Ran Raz, Omer Reingold, Salil P. Vadhan
1999	J	`jnl`	Extracting All the Randomness and Reducing the Error in Trevisan's Extractors Electron. Colloquium Comput. Complex. Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Magic Functions. FOCS Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
1999	A*	`conf`	On Recycling the Randomness of States in Space Bounded Computation. STOC Ran Raz, Omer Reingold
1999	J	`jnl`	On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptol. Moni Naor, Omer Reingold
1999	J	`jnl`	Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions. J. Comput. Syst. Sci. Moni Naor, Omer Reingold
1998	A*	`conf`	From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract). CRYPTO Moni Naor, Omer Reingold
1998	A*	`conf`	Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). STOC Ran Canetti, Daniele Micciancio, Omer Reingold
1997	J	`jnl`	Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring Electron. Colloquium Comput. Complex. Eli Biham, Dan Boneh, Omer Reingold
1997	J	`jnl`	Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring. IACR Cryptol. ePrint Arch. Eli Biham, Dan Boneh, Omer Reingold
1997	A*	`conf`	Number-theoretic Constructions of Efficient Pseudo-random Functions. FOCS Moni Naor, Omer Reingold
1997	J	`jnl`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold
1997	A*	`conf`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract). STOC Moni Naor, Omer Reingold
1996	J	`jnl`	On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited. IACR Cryptol. ePrint Arch. Moni Naor, Omer Reingold
1995	J	`jnl`	Synthesizers and Their Application to the Parallel Construction of Pseudo-random Functions Electron. Colloquium Comput. Complex. Moni Naor, Omer Reingold
1995	A*	`conf`	Synthesizers and Their Application to the Parallel Construction of Psuedo-Random Functions. FOCS Moni Naor, Omer Reingold