O. Reingold

Publications
Influence

C. Dwork, Moritz Hardt, T. Pitassi, O. Reingold, R. Zemel
Mathematics, Computer Science
ITCS '12
19 April 2011

We study fairness in classification, where the goal is to prevent discrimination against individuals based on their membership in some group, while maintaining utility for the classifier (the university). Expand

1,176
153
PDF

Undirected connectivity in log-space

O. Reingold
Mathematics, Computer Science
JACM
1 September 2008

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs with space complexity log4/3(ṡ) . Expand

Number-theoretic constructions of efficient pseudo-random functions

M. Naor, O. Reingold
Mathematics, Computer Science
Proceedings 38th Annual Symposium on Foundations…
19 October 1997

We describe efficient constructions of pseudo-random functions such that computing their value at any given point involves two multiple products. Expand

Priced Oblivious Transfer: How to Sell Digital Goods

W. Aiello, Y. Ishai, O. Reingold
Computer Science
EUROCRYPT
6 May 2001

We propose solutions which allow a buyer to purchase digital goods from a vendor without letting the vendor learn what, and to the extent possible also when and how much, it is buying. Expand

An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem

M. Charikar, K. Jansen, O. Reingold, J. Rolim
2007

We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1 + 2/e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)approximation… Expand

Keyword Search and Oblivious Pseudorandom Functions

M. Freedman, Y. Ishai, Benny Pinkas, O. Reingold
Computer Science
TCC
10 February 2005

We study the problem of privacy-preserving access to a database. Expand

Undirected ST-connectivity in log-space

O. Reingold
Computer Science, Mathematics
STOC '05
22 May 2005

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs with O(log n log log log n)-space complexity. Expand

Preserving Statistical Validity in Adaptive Data Analysis

C. Dwork, V. Feldman, Moritz Hardt, T. Pitassi, O. Reingold, A. Roth
Computer Science
STOC
10 November 2014

We propose a principled study of how to guarantee the validity of statistical inference in adaptive data analysis. Expand

Distributed Pseudo-random Functions and KDCs

M. Naor, Benny Pinkas, O. Reingold
Computer Science
EUROCRYPT
2 May 1999

This work describes schemes for distributing between n servers the evaluation of a function which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. Expand

Generalization in Adaptive Data Analysis and Holdout Reuse

C. Dwork, V. Feldman, Moritz Hardt, T. Pitassi, O. Reingold, A. Roth
Computer Science
NIPS
8 June 2015

We give an algorithm that enables the validation of a large number of adaptively chosen hypotheses, while provably avoiding overfitting to the holdout set. Expand

Recommended Authors