BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Denmark
1 × Italy
13 × USA
Collaborated with:
S.P.Vadhan I.Haitner M.Naor R.Raz R.D.Rothblum D.Harnik A.Rosen R.Meka A.Wigderson G.N.Rothblum C.Dwork U.Wieder L.Trevisan R.Canetti D.Micciancio P.Gopalan D.Zuckerman H.Wee C.Lu M.R.Capalbo V.Feldman M.Hardt T.Pitassi A.L.Roth
Talks about:
pseudorandom (6) function (5) random (5) way (4) one (4) generat (3) effici (3) comput (3) data (3) extractor (2)

Person: Omer Reingold

DBLP DBLP: Reingold:Omer

Contributed to:

STOC 20152015
ICALP (1) 20142014
STOC 20112011
STOC 20102010
STOC 20092009
STOC 20072007
ICALP (2) 20062006
STOC 20062006
STOC 20052005
STOC 20042004
STOC 20032003
STOC 20022002
STOC 20002000
STOC 19991999
STOC 19981998
STOC 19971997

Wrote 19 papers:

STOC-2015-DworkFHPRR #adaptation #data analysis #statistics
Preserving Statistical Validity in Adaptive Data Analysis (CD, VF, MH, TP, OR, ALR), pp. 117–126.
ICALP-v1-2014-MekaRRR #independence #performance #pseudo
Fast Pseudorandomness for Independence and Load Balancing — (RM, OR, GNR, RDR), pp. 859–870.
ICALP-v1-2014-ReingoldRW #data type #graph #pseudo
Pseudorandom Graphs in Data Structures (OR, RDR, UW), pp. 943–954.
STOC-2011-GopalanMRZ #combinator #generative #pseudo
Pseudorandom generators for combinatorial shapes (PG, RM, OR, DZ), pp. 253–262.
STOC-2010-HaitnerRV #generative #performance #pseudo
Efficiency improvements in constructing pseudorandom generators from one-way functions (IH, OR, SPV), pp. 437–446.
STOC-2009-DworkNRRV #algorithm #complexity #on the #performance
On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
Inaccessible entropy (IH, OR, SPV, HW), pp. 611–620.
STOC-2007-HaitnerR #statistics
Statistically-hiding commitment from any one-way function (IH, OR), pp. 1–10.
ICALP-v2-2006-HaitnerHR #generative #performance #pseudo
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (IH, DH, OR), pp. 228–239.
STOC-2006-ReingoldTV #graph #problem #pseudo
Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.
Undirected ST-connectivity in log-space (OR), pp. 376–385.
STOC-2004-HarnikNRR #perspective
Completeness in two-party secure computation: a computational view (DH, MN, OR, AR), pp. 252–261.
STOC-2003-LuRVW #constant #named
Extractors: optimal up to constant factors (CJL, OR, SPV, AW), pp. 602–611.
Randomness conductors and constant-degree lossless expanders (MRC, OR, SPV, AW), pp. 659–668.
STOC-2000-NaorRR #pseudo
Pseudo-random functions and factoring (MN, OR, AR), pp. 11–20.
STOC-1999-RazR #bound #on the
On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.
STOC-1999-RazRV #fault
Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors (RR, OR, SPV), pp. 149–158.
STOC-1998-CanettiMR #probability
Perfectly One-Way Probabilistic Hash Functions (RC, DM, OR), pp. 131–140.
STOC-1997-NaorR #on the #permutation #pseudo #revisited
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (MN, OR), pp. 189–199.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.