SU\G(š”ø)/KĀ·U

Author Description

Login to generate an author description

Ask a Question About This Mathematician

All published works (49)

Action Title Date Authors
+ PDF Ask
Testing Distributions of Huge Objects 2024-01-02 Oded Goldreich Dana Ron
+ PDF Ask
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing 2022-12-19 Oded Goldreich Avi Wigderson
+
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. 2021-12-01 Oded Goldreich Avi Wigderson
+ PDF Ask
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing 2021-01-01 Oded Goldreich Avi Wigderson
+
The Uniform Distribution Is Complete with Respect to Testing Identity to a Fixed Distribution 2020-01-01 Oded Goldreich
+
Deconstructing 1-Local Expanders 2020-01-01 Oded Goldreich
+ PDF Ask
On (Valiantā€™s) Polynomial-Size Monotone Formula for Majority 2020-01-01 Oded Goldreich
+
On Constructing Expanders for Any Number of Vertices 2020-01-01 Oded Goldreich
+ PDF Ask
How to construct random functions 2019-10-09 Oded Goldreich Shafi Goldwasser Silvio Micali
+ PDF Ask
Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model 2019-05-08 Oded Goldreich
+ PDF Ask
Testing Bipartitness in an Augmented VDF Bounded-Degree Graph Model 2019-01-01 Oded Goldreich
+
Testing Properties of Distributions 2017-11-28 Oded Goldreich
+
Estimating Simple Graph Parameters in Sublinear Time 2016-01-01 Oded Goldreich Dana Ron
+ PDF Ask
Enhancements of Trapdoor Permutations 2012-09-12 Oded Goldreich Ron D. Rothblum
+ PDF Ask
Finding cycles and trees in sublinear time 2012-08-22 Artur Czumaj Oded Goldreich Dana Ron C. Seshadhri A. Shapira Christian Sohler
+ PDF Ask
Special issue from RANDOMā€™09: Editorsā€™ Foreword 2012-02-03 Oded Goldreich Salil Vadhan
+
On the Complexity of Computational Problems Regarding Distributions 2011-01-01 Oded Goldreich Salil Vadhan
+ PDF Ask
Proximity Oblivious Testing and the Role of Invariances 2011-01-01 Oded Goldreich Tali Kaufman
+ PDF Ask
On Testing Expansion in Bounded-Degree Graphs 2011-01-01 Oded Goldreich Dana Ron
+ PDF Ask
On the Circuit Complexity of Perfect Hashing 2011-01-01 Oded Goldreich Avi Wigderson
+
Enhancements of Trapdoor Permutations. 2011-01-01 Oded Goldreich Ron D. Rothblum
+
Bravely, Moderately: A Common Theme in Four Recent Works 2011-01-01 Oded Goldreich
+
On randomness extractors 2010-08-16 Oded Goldreich
+ PDF Ask
Finding Cycles and Trees in Sublinear Time 2010-01-01 Artur Czumaj Oded Goldreich Dana Ron C. Seshadhri A. Shapira Christian Sohler
+
A Candidate Counterexample to the Easy Cylinders Conjecture. 2009-01-01 Oded Goldreich
+
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. 2009-01-01 David Mandell Freeman Oded Goldreich Eike Kiltz Alon Rosen Gil Segev
+
Some Omitted Proofs 2008-04-28 Oded Goldreich
+
A tradeoff between information and communication in broadcast protocols 2006-08-03 Baruch Awerbuch Oded Goldreich David Peleg Ronen Vainish
+
Approximating Average Parameters of Graphs In Memory of Shimon Even (1935{2004) 2006-01-01 Oded Goldreich Dana Ron
+ PDF Ask
The random oracle methodology, revisited 2004-07-01 Ran Canetti Oded Goldreich Shai Halevi
+
On Estimating the Average Degree of a Graph 2004-01-01 Oded Goldreich Dana Ron
+ PDF Ask
Deterministic amplification of space-bounded probabilistic algorithms 2003-01-20 Ziv Bar-Yossef Oded Goldreich Avi Wigderson
+
The GGM Construction does NOT yield Correlation Intractable Function Ensembles. 2002-01-01 Oded Goldreich
+
On Testing Expansion in Bounded-Degree Graphs 2000-01-01 Oded Goldreich Dana Ron
+ PDF Ask
The Random Oracle Methodology, Revisited 2000-01-01 Ran Canetti Oded Goldreich Shai Halevi
+ PDF Ask
Pseudorandom Generators 1999-01-01 Oded Goldreich
+
Efficient approximation of product distributions 1998-08-01 Guy Even Oded Goldreich Michael Luby Noam Nisan Boban Veli kovi
+
Tiny families of functions with random properties: A quality-size trade-off for hashing 1997-12-01 Oded Goldreich Avi Wigderson
+
Tiny families of functions with random properties: A qualityā€size tradeā€off for hashing 1997-12-01 Oded Goldreich Avi Wigderson
+
Lower bounds for sampling algorithms for estimating the average 1995-01-01 Ran Canetti Guy Even Oded Goldreich
+ PDF Ask
A taxonomy of proof systems (part 2) 1994-03-01 Oded Goldreich
+
Computational Complexity and Knowledge Complexity 1994-01-01 Oded Goldreich Rafail Ostrovsky Erez Petrank
+
On the Existence of Pseudorandom Generators 1993-12-01 Oded Goldreich Hugo Krawczyk Michael Luby
+ PDF Ask
Simple Constructions of Almost kā€wise Independent Random Variables 1992-01-01 Noga Alon Oded Goldreich Johan HĆ„stad RenĆ© Peralta
+
A note on computational indistinguishability 1990-05-01 Oded Goldreich
+
On the number of monochromatic close pairs of beads in a rosary 1990-02-01 Oded Goldreich
+
On the power of two-point based sampling 1989-03-01 Benny Chor Oded Goldreich
+ PDF Ask
How to construct random functions 1986-08-10 Oded Goldreich Shafi Goldwasser Silvio Micali
+
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version) 1985-01-01 Benny Chor Oded Goldreich Johan HĆ„stad Joel Friedman Steven Rudich Roman Smolensky

Common Coauthors

Coauthor Papers Together
Dana Ron 8
Avi Wigderson 7
Ran Canetti 3
Silvio Micali 2
Christian Sohler 2
Shafi Goldwasser 2
Johan HĆ„stad 2
Salil Vadhan 2
Ron D. Rothblum 2
Artur Czumaj 2
Benny Chor 2
Guy Even 2
Shai Halevi 2
Michael Luby 2
A. Shapira 2
RenƩ Peralta 1
David Peleg 1
Hugo Krawczyk 1
Boban Veli kovi 1
Ronen Vainish 1
Rafail Ostrovsky 1
Tali Kaufman 1
Steven Rudich 1
Gil Segev 1
Erez Petrank 1
Baruch Awerbuch 1
C. Seshadhri 1
Noam Nisan 1
Noga Alon 1
C. Seshadhri 1
Joel Friedman 1
Roman Smolensky 1
Eike Kiltz 1
Alon Rosen 1
David Mandell Freeman 1
Ziv Bar-Yossef 1

Commonly Cited References

Action Title Date Authors # of times referenced
+
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits 1984-11-01 Manuel Blum Silvio Micali 8
+
On the power of two-point based sampling 1989-03-01 Benny Chor Oded Goldreich 6
+ PDF Ask
Testing that distributions are close 2002-11-08 Tuğkan Batu Lance Fortnow Ronitt Rubinfeld Warren D. Smith Patrick White 5
+ PDF Ask
How to construct random functions 1986-08-10 Oded Goldreich Shafi Goldwasser Silvio Micali 5
+
A fast and simple randomized parallel algorithm for the maximal independent set problem 1986-12-01 Noga Alon LĆ”szlĆ³ Babai Alon Itai 4
+ PDF Ask
Eigenvalues and expanders 1986-06-01 Ilan Alon 4
+ PDF Ask
Simple Constructions of Almost kā€wise Independent Random Variables 1992-01-01 Noga Alon Oded Goldreich Johan HĆ„stad RenĆ© Peralta 3
+
Ī»1, Isoperimetric inequalities for graphs, and superconcentrators 1985-02-01 Noga Alon Vitali Milman 3
+
Randomness is Linear in Space 1996-02-01 Noam Nisan David Zuckerman 3
+
Lower bounds for sampling algorithms for estimating the average 1995-01-01 Ran Canetti Guy Even Oded Goldreich 3
+
The Asymptotic Number of Unlabelled Regular Graphs 1982-10-01 BƩla BollobƔs 2
+
Isomorphism of graphs of bounded valence can be tested in polynomial time 1982-08-01 Eugene M. Luks 2
+
Randomness conservation inequalities; information and independence in mathematical theories 1984-04-01 Leonid A. Levin 2
+
Tight Bounds for Testing Bipartiteness in General Graphs 2004-01-01 Tali Kaufman Michael Krivelevich Dana Ron 2
+
Distinguishing Vertices of Random Graphs 1982-01-01 BƩla BollobƔs 2
+ PDF Ask
Permutation Pseudographs and Contiguity 2002-05-01 Catherine Greenhill Svante Janson Jeong Han Kim Nicholas Wormald 2
+ PDF Ask
Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory 1986-09-01 Ilan Alon 2
+
On the Existence of Pseudorandom Generators 1993-12-01 Oded Goldreich Hugo Krawczyk Michael Luby 2
+
On the asymmetry of random regular graphs and random graphs 2002-09-19 Jeong Han Kim Benny Sudakov Van H. Vu 2
+ PDF Ask
A New Approach for Testing Properties of Discrete Distributions 2016-10-01 Ilias Diakonikolas Daniel M. Kane 2
+
Testing the diameter of graphs 2002-03-01 Michal Parnas Dana Ron 2
+
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS 1970-12-31 Alexander K. Zvonkin Leonid A. Levin 2
+ PDF Ask
On a Set of Almost Deterministic $k$-Independent Random Variables 1974-02-01 A. Joffe 2
+
The definition of random sequences 1966-12-01 Per Martin-Lƶf 2
+ PDF Ask
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders 2002-01-01 Omer Reingold Salil Vadhan Avi Wigderson 1
+ PDF Ask
A Pushing-Pulling Method: New Proofs of Intersection Theorems 1999-01-01 Rudolf Ahlswede Levon H. Khachatrian 1
+
On the girth of hamiltonian weakly pancyclic graphs 1997-11-01 BƩla BollobƔs Andrew Thomason 1
+
On the Size of Separating Systems and Families of Perfect Hash Functions 1984-03-01 Michael L. Fredman JĆ”nos KomlĆ³s 1
+
New Bounds for Perfect Hashing via Information Theory 1988-11-01 JƔnos Kƶrner K. Marton 1
+
Bounds on the cover time 1989-01-01 Andrei Broder Anna R. Karlin 1
+
An Introduction to Probability Theory. 1986-03-01 Bert Fristedt P. A. P. Moran 1
+ PDF Ask
Gauging hidden symmetries in two dimensions 2007-08-28 Henning Samtleben Martin Weidner 1
+
Graph Minors. XX. Wagner's conjecture 2004-11-01 Neil Robertson Paul Seymour 1
+ PDF Ask
Uniform expansion bounds for Cayley graphs of SL<sub>2</sub>(š”½<sub>p</sub>) 2008-03-01 Jean Bourgain Alex Gamburd 1
+
Ɯber eine Eigenschaft der ebenen Komplexe 1937-12-01 Klaus W. Wagner 1
+ PDF Ask
Approximating the Minimum Spanning Tree Weight in Sublinear Time 2005-01-01 Bernard Chazelle Ronitt Rubinfeld Luca Trevisan 1
+
Expanding graphs contain all small trees 1987-03-01 Joel Friedman Nicholas Pippenger 1
+
Monte-Carlo approximation algorithms for enumeration problems 1989-09-01 Richard M. Karp Michael Luby Neal Madras 1
+ PDF Ask
Two-loop QCD helicity amplitudes for massless quark-quark scattering 2004-04-14 E. W. N. Glover 1
+
On the Hardness of Approximating the Chromatic Number 2000-03-01 Sanjeev Khanna Nathan Linial Muli Safra 1
+
A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data 2008-09-18 Liam Paninski 1
+ PDF Ask
Non-malleable Coding Against Bit-Wise and Split-State Tampering 2015-10-06 Mahdi Cheraghchi Venkatesan Guruswami 1
+ PDF Ask
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors 2002-11-07 Omer Reingold Salil Vadhan Avi Wigderson 1
+ PDF Ask
Approximating the Permanent 1989-12-01 Mark Jerrum Alistair Sinclair 1
+
The disjoint paths problem in quadratic time 2011-08-01 Kenā€ichi Kawarabayashi Yusuke Kobayashi Bruce Reed 1
+ PDF Ask
A parallel algorithmic version of the local lemma 1991-12-01 Noga Alon 1
+ PDF Ask
Optimal Algorithms for Testing Closeness of Discrete Distributions 2013-01-01 Siu-On Chan Ilias Diakonikolas Gregory Valiant Paul Valiant 1
+ PDF Ask
A Characterization of Easily Testable Induced Subgraphs 2006-08-14 Noga Alon A. Shapira 1
+
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries 2004-07-01 Mark Jerrum Alistair Sinclair Eric Vigoda 1
+
The GGM Construction does NOT yield Correlation Intractable Function Ensembles. 2002-01-01 Oded Goldreich 1