Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Reingold
Person information
- affiliation: 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
2020 – today
- 2023
[c88]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- [i69]Parikshit Gopalan, Michael P. Kim, Omer Reingold:
Characterizing notions of omniprediction via multicalibration. CoRR abs/2302.06726 (2023) - [i68]Lunjia Hu, Inbal Livni Navon, Omer Reingold:
Generative Models of Huge Objects. CoRR abs/2302.12823 (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 - [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
- [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. Theory Comput. 17: 1-35 (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 - [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
- [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) - [c79]Katrina Ligett, Charlotte Peale, Omer Reingold:
Bounded-Leakage Differential Privacy. FORC 2020: 10:1-10:20 - [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)
2010 – 2019
- 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 - [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
- [j30]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. J. Cryptol. 31(1): 134-161 (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 - [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
- [j29]Cynthia Dwork, Vitaly Feldman, Moritz Hardt, Toniann Pitassi, Omer Reingold, Aaron Roth:
Guilt-free data reuse. Commun. ACM 60(4): 86-93 (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 - [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
- [j28]Omer Reingold, Shai Vardi:
New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. 82(7): 1180-1200 (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 - [i41]Omer Reingold, Ron Rothblum, Guy N. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. Electron. Colloquium Comput. Complex. TR16 (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) - [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 - [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
- [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) - [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 - [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
- [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) - [c58]Omer Reingold, Thomas Steinke, Salil P. Vadhan:
Pseudorandomness for Regular Branching Programs via Fourier Analysis. APPROX-RANDOM 2013: 655-670 - [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
- [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 - [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
- [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) - [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 - [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
- [j18]Ronen Gradwohl, Omer Reingold:
Partial exposure in large games. Games Econ. Behav. 68(2): 602-613 (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 - [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)
2000 – 2009
- 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) - [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 - [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] - [i24]Iftach Haitner, Omer Reingold, Salil P. Vadhan, Hoeteck Wee:
Inaccessible Entropy. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j14]Omer Reingold:
Undirected connectivity in log-space. J. ACM 55(4): 17:1-17:24 (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 - [i23]Omer Reingold, Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan:
Dense Subsets of Pseudorandom Sets. Electron. Colloquium Comput. Complex. TR08 (2008) - 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]