(Enter summary)
Abstract: This set of notes gives several applications of the following paradigm.
The paradigm consists of two complementary parts. The first part is
to design a probabilistic algorithm described by a sequence of random
variables so that the analysis is valid assuming limited independence
between the random variables. The second part is the design of a small
probability space for the random variables such that they are somewhat
independent of each other. Thus, the analysis of the algorithm holds
even... (Update)
Context of citations to this paper: More
...also at the core of many constructions in complexity theory. Examples are pseudorandom generation [11, 14] derandomization of algorithms [15], hardness results in computational learning theory [13] and computing with degenerate, weak random sources [20] A survey of these...
.... Universal hash functions were introduced by Carter and Wegman [8, 28] and have found many applications in theoretical computer science [15]. A 2 universal hash function is a set G of functions X Y if, for all distinct x 1 ; x 2 2 X , there are at most jGj=jYj functions g in...
Cited by: More
Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997)
(Correct)
Smoothing Probability Distributions and Smooth Entropy.. - Cachin, al. (1996)
(Correct)
Unconditional Security Against Memory-Bounded Adversaries - Cachin, Maurer (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Quantifying Knowledge Complexity - Goldreich, Petrank (1997)
(Correct)
0.2: On Deterministic Approximation of DNF - Luby, Velickovic (1993)
(Correct)
0.2: Combinatorial Methods In Boolean Function Complexity - Gal (1995)
(Correct)
Similar documents based on text: More All
0.2: Automatic Vehicle Identification Technology Applications to .. - Lu, Rechtorik, Yang
(Correct)
0.2: A Complete Bibliography of Publications in the ACM Symposia on.. - Beebe (2001)
(Correct)
0.2: Deterministic Approximate Counting of Depth-2 Circuits - Luby, Velickovic, Wigderson (1993)
(Correct)
Related documents from co-citation: More All
4: Extracting randomness: How and why --- a survey (context) - Nisan - 1996
4: Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
4: Secret key agreement by public discussion from common information
- Maurer - 1993
BibTeX entry: (Update)
M. Luby and A. Wigderson, "Pairwise independence and derandomization," Tech. Rep. 95-035, International Computer Science Institute (ICSI), Berkeley, 1995. http://citeseer.ist.psu.edu/luby95pairwise.html More
@techreport{ luby95pairwise,
author = "Michael Luby and Avi Wigderson",
title = "Pairwise Independence and Derandomization",
number = "CSD-95-880",
pages = "59",
year = "1995",
url = "citeseer.ist.psu.edu/luby95pairwise.html" }
Citations (may not include all citations):
109
Relative to a random oracle (context) - Bennett, Gill
102
A Fast and Simple Randomized Parallel Algorithm for the Maxi.. (context) - Alon, Babai et al. - 1986
88
Deterministic simulation in LOGSPACE (context) - Ajtai, Komlos et al. - 1987
70
Two Theorems on Random Polynomial Time (context) - Adleman - 1978
5
P 1 1 -Formulae on Finite Structures (context) - Ajtai - 1983
3
RSA/Rabin Functions: Certain Parts are as Hard as the Whole (context) - Alexi, Chor et al. - 1988
Documents on the same site (http://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/english/scripts.html): More
Coding and Cryptography - Körner (1998)
(Correct)
Advanced Algorithms - Network flows - Goemans (1994)
(Correct)
Applicative Programming and Specification - Gilmore (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC