Ran Canetti, Guy Even, Oded Goldreich  Home/Search
Context Related
| wisdom.weizmann.ac.il/pub/oded...ceg.ps mit.edu/pub/people/oded/ceg.ps wisdom.weizmann.ac.il/~oded/PS...ceg.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: fermivista.math....weizmann.ac.il (more) From: cryptosoft.com/html/secpub (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show lower bounds on the number of sample points and on the number of coin tosses used by general sampling algorithms for estimating the average value of functions over a large domain. The bounds depend on the desired precision and on the error probability of the estimate. Our lower bounds match upper bounds established by known algorithms, up to a multiplicative constant. Furthermore, we give a non-constructive proof of existence of an algorithm that improves the known upper bounds by a... (Update)
Context of citations to this paper: More
.... Work that also refer to lower bounds on query complexity for approximate solutions include results on the approximation of the mean [26], 34, 80] the approximation on the frequency moment [29] 8 Lossy compression may be related to sampling. When we have les in...
Cited by: More
SIA: Secure Information Aggregation in Sensor Networks - Przydatek, Song, Perrig (2003) (Correct)
Towards a Theory of Variable Privacy - Vora (2003) (Correct)
Tiny Families of Functions with Random Properties: A.. - Goldreich, Wigderson (2003) (Correct)
Active bibliography (related documents): More All
0.5: The Parallel Maxflow Problem is easy for almost all Graphs - Sibeyn (1997) (Correct)
0.1: Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
0.1: Amortized Communication Complexity - Feder, Naor, Kushilevitz, Nisan (1995) (Correct)
Similar documents based on text: More All
0.3: Almost Sure Convergence Theorems of Rate of Coin Tosses for.. - Uyematsu, Kanaya (2000) (Correct)
0.1: Continuous Sampling and Storage Using Matched Delays - Clements, Liu, Kang, III (1993) (Correct)
0.1: Bounds on Tradeoffs between Randomness and Communication.. - Ran Canetti (1993) (Correct)
Related documents from co-citation: More All
8: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Co.. - Chor, Goldreich - 1988
7: Deterministic simulation in logspace (context) - Ajtai, Koml'os et al. - 1987
7: the Power of Two--Point Based Sampling - Chor, Goldreich - 1989
BibTeX entry: (Update)
R. Canetti, G. Even and O. Goldreich, "Lower Bounds for Sampling Algorithms for Estimating the Average", IPL, Vol. 53, pp. 17--25, 1995. http://citeseer.ist.psu.edu/canetti94lower.html More
@article{ canetti95lower,
author = "Ran Canetti and Guy Even and Oded Goldreich",
title = "Lower Bounds for Sampling Algorithms for Estimating the Average",
journal = "Information Processing Letters",
volume = "53",
number = "1",
pages = "17-25",
year = "1995",
url = "citeseer.ist.psu.edu/canetti94lower.html" }
Citations (may not include all citations):68 Monte-Carlo Approximation Algorithms for Enumeration Problem.. (context) - Karp, Luby et al. - 1989
45 Randomness in Interactive Proofs - Bellare, Goldreich et al. - 1990
40 Tiny Families of Functions with Random Properties: A Quality.. - Goldreich, Wigderson - 1994
20 Lower Bounds for Sampling Algorithms for Estimating the Aver.. - Canetti, Even et al. - 1993
11 Detection, Estimation, and Modulation Theory (context) - Van Trees - 1968
7 Private vs. Common Random Bits in Communication Complexity - Newman - 1991
2 Probability Inequalities for Sums of Bounded Random Variable.. (context) - Hoefding - 1963
1 Monte-Carlo Algorithms for Enumeration and Related Problems (context) - Karp, Luby - 1983
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.wisdom.weizmann.ac.il.html): More
Local Majority Voting, Small Coalitions and Controlling Monopolies .. - Peleg (1996) (Correct)
On Constructing 1-1 One-Way Functions - Goldreich, Levin, Nisan (1995) (Correct)
Infinite Cyclic Impartial Games - Fraenkel, Rahat (2001) (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