Yossi Azar, Rajeev Motwani, Joseph (Seffi) Naor  Home/Search
Context Related
| math.tau.ac.il/~azar/bias.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~azar/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We formulate the notion of a "good approximation" to a probability distribution over a finite abelian group G . The quality of the approximating distribution is characterized by a parameter ffl which is a bound on the difference between corresponding Fourier coefficients of the two distributions. It is also required that the sample space of the approximating distribution be of size polynomial in log jGj and 1=ffl. Such approximations are useful in reducing or eliminating the use of... (Update)
Context of citations to this paper: More
...we get smaller sample spaces. Our considerations are motivated by a problem which was mentioned in recent work of Azar, Motwani and Naor [AMN], namely, how to construct in time polynomial in n a good approximation to the joint probability distribution of the random variables X 1...
Cited by: More
MOD p -tests, Almost Independence and Small Probability.. - Bertram-Kretzberg, Lefmann (Correct)
Similar documents (at the sentence level):
38.5%: Approximating Probability Distributions Using Small Sample.. - Azar, Motwani, Naor (1995) (Correct)
Active bibliography (related documents): More All
0.5: List Colouring When the Chromatic Number is Close to the Order .. - Reed, Sudakov (Correct)
0.5: Average Multiplicative Orders of Elements Modulo n - Luca, Shparlinski (Correct)
0.3: Small-Bias Probability Spaces: Efficient Constructions and.. - Naor, Naor (1993) (Correct)
Similar documents based on text: More All
0.2: The Probabilistic Method Yields Deterministic Parallel.. - Motwani, Naor, Naor (1989) (Correct)
0.2: The Competitiveness of On-Line Assignments - Azar, Naor, Rom (1992) (Correct)
0.2: On Exact and Approximate Cut Covers of Graphs - Motwani, Naor (1993) (Correct)
BibTeX entry: (Update)
Y. Azar, R. Motwani and J. Naor, Approximating Probability Distributions Using Small Sample Spaces, preprint, 1995. http://citeseer.ist.psu.edu/azar95approximating.html More
@article{ azar98approximating,
author = "Yossi Azar and Rajeev Motwani and Joseph Naor",
title = "Approximating Probability Distributions Using Small Sample Spaces",
journal = "Combinatorica",
volume = "18",
number = "2",
pages = "151-171",
year = "1998",
url = "citeseer.ist.psu.edu/azar95approximating.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992
860 The Theory of Error Correcting Codes (context) - MacWilliams, Sloane - 1977
199 A simple parallel algorithm for the maximal independent set (context) - Luby - 1986
138 Small-bias probability spaces: efficient constructions and a.. - Naor, Naor - 1993
128 Simple Constructions of Almost k-wise Independent Random Var.. - Alon, Goldreich et al. - 1992
102 A fast and simple randomized parallel algorithm for the maxi.. (context) - Alon, Babai et al. - 1986
71 A Fast Parallel Algorithm for the Maximal Independent Set Pr.. (context) - Karp, Wigderson - 1985
70 the power of two-point based sampling - Chor, Goldreich - 1989
62 Multiplicative Number Theory (context) - Davenport - 1980
57 Probabilistic Methods in Combinatorics - Erdos, Spencer - 1974
53 The probabilistic method yields deterministic parallel algor.. - Motwani, Naor et al. - 1994
49 Fourier Series and Integrals (context) - Dym, McKean - 1972
42 wise independence in NC (context) - Berger, Rompel et al. - 1991
41 Removing randomness in parallel computation without a proces.. - Luby - 1988
30 Adversaries and Computation (context) - Vazirani - 1986
22 Cambridge University Press (context) - Korner - 1988
18 Equations over Finite Fields: An Elementary Approach (context) - Schmidt - 1976
15 A Well Characterized Approximation Problem - Hastad, Phillips et al. - 1993
10 Construction of small probability spaces for deterministic s.. (context) - Even - 1991
9 Introduction to Group Characters (context) - Ledermann - 1987
8 Explicit Bounds for Primes in Residue Classes (context) - Bach, Sorenson - 1996
5 the randomness complexity of algorithms (context) - Peralta - 1990
5 Resilient functions (context) - Chor, Goldreich et al. - 1985
3 Introduction to Modern Prime Number Theory (context) - Estermann - 1969
3 Fourier Transforms and Equations over Finite Abelian Groups (context) - Babai - 1989
2 a combinatorial game. J. Combinatorial Theory (context) - Erdos, Selfridge - 1973
2 Zero-Free Regions for Dirichlet L-Functions and the Least Pr.. (context) - Heath-Brown - 1991
1 On dependent random variables over small sample spaces (context) - Ben-Nathan - 1990
Documents on the same site (http://www.math.tau.ac.il/~azar/): More
On-line Bin-Stretching - Azar, Regev (1997) (Correct)
On Two Dimensional Packing - Azar, Epstein (1996) (Correct)
Packet Routing via Min-Cost Circuit Routing - Awerbuch, Azar, Fiat (1996) (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