Randomized Methoids in Computation -- Lecture Notes

Randomized Methoids in Computation -- Lecture Notes (2001)

Cached

Download Links

[www.wisdom.weizmann.ac.il]

by Oded Goldreich

BibTeX

@MISC{Goldreich01randomizedmethoids,
    author = {Oded Goldreich},
    title = {Randomized Methoids in Computation -- Lecture Notes},
    year = {2001}
}

Bookmark

OpenURL

Abstract

Citations

1605	The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
1566	Randomized Algorithms - MOTWANI, RAGHAVAN - 1995
601	A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
318	Probabilistic computations: Towards a unified measure of complexity - Yao - 1977
261	Digitalized signatures and public-key functions as intractable as factorization - Rabin
250	Random Generation of Combinatorial Structures from a Uniform Distributions, Theoret. Computer Sci - Jerrum, Valiant, et al. - 1986
163	How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
163	Probabilistic algorithm for testing primality - Rabin - 1980
136	A complexity theoretic approach to randomness - Sipser - 1983
122	A fast Monte-Carlo test for primality - Solovay, Strassen - 1977
113	Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics - Goldreich - 1999
90	and Zvi Galil. Explicit constructions of linear-sized superconcentrators - Gabber - 1981
86	deterministic amplification, and weak random sources - Cohen, Wigderson, et al. - 1989
84	On the power of two-point based sampling - Chor, Goldreich - 1989
74	Universal Hash Functions - Carter, Wegman - 1979
71	Every Prime has a Succinct Certificate - Pratt - 1975
65	A sample of samplers: A computational perspective on sampling - Goldreich - 1997
64	New 3/4-approximation algorithms for the maximum satisfiability problem - Goemans, Williamson - 1994
48	Tiny families of functions with random properties: A qualitysize trade-off for hashing. Random Structures and Algorithms - Goldreich, Wigderson - 1997
48	On Approximation Algorithms for #P - Stockmeyer - 1985
46	Security preserving amplification of hardness - Goldreich, Impagliazzo, et al. - 1990
46	Eigenvalues and Expansion of Regular Graphs - Kahale - 1995
43	On a set of almost deterministic k-independent random variables - Joffe - 1974
40	Adversaries and Computation - Vazirani, Randomness - 1986
23	Primality testing using elliptic curves - Goldwasser, Kilian - 1999
19	Lower Bounds for Sampling Algorithms for Estimating the Average - Canetti, Even, et al. - 1995
16	A well-characterized approximation problem - H˚astad, Phillips, et al. - 1993
8	Explicit Construction of Concentrators. Prob - Margulis - 1973