Testing that distributions are close

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 259-269

  Batu, Tuğkan ^a   Fortnow, Lance ^b   Rubinfeld, Ronitt ^b   Smith, Warren D ^b   White, Patrick ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

SUBLINEAR ALGORITHMS;

COMPUTER SCIENCE;

EID: 0034427756     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892113     Document Type: Article

References (27)

1. N. Alon Eigenvalues and expanders Combinatorica 6 2 83 96 1986
2. N. Alon Y. Matias M. Szegedy The space complexity of approximating the frequency moments JCSS 58 1999
3. A. Broder M. Charikar A. Frieze M. Mitzenmacher Min-wise independent permutations JCSS 60 2000
4. T. M. Cover J. A. Thomas Elements of Information Theory Wiley Series in Telecommunications 1991 John Wiley & Sons
5. N. Cressie P. Morgan Design considerations for neyman pearson and wald hypothesis testing Metrika 36 6 317 325 1989
6. I. Csiszár Information-type measures of difference of probability distributions and indirect observations Studia Scientiarum Mathematicarum Hungarica 1967
7. F. Ergün S. Kannan S. R. Kumar R. Rubinfeld M. Viswanathan Spot-checkers STOC 30 259 268 STOC 30 1998
8. J. Feigenbaum S. Kannan M. Strauss M. Viswanathan An approximate L1-difference algorithm for massive data streams (extended abstract) FOCS 40 FOCS 1999
9. J. Fong M. Strauss An approximate Lp-difference algorithm for massive data streams Annual Symposium on Theoretical Aspects of Computer Science Annual Symposium on Theoretical Aspects of Computer Science 2000
10. A. Frieze R. Kannan Quick approximation to matrices and applications Combinatorica 19 1999
11. P. B. Gibbons Y. Matias Synopsis data structures for massive data sets SODA 10 909 910 SODA 10 1999
12. O. Goldeich D. Ron On testing expansion in bounded-degree graphs 2000 TR00-020 ECCC
13. O. Goldreich S. Goldwasser D. Ron Property testing and its connection to learning and approximation FOCS 37 339 348 FOCS 37 1996-Oct.-14-16
14. O. Goldreich D. Ron Property testing in bounded degree graphs STOC 29 406 415 STOC 29 1997
15. G. H. Golub C. F. van Loan Matrix Computations 1996 The John Hopkins University Press MD, Baltimore
16. R. Kannan Markov chains and polynomial time algorithms FOCS 35 656 673 FOCS 35 1994-Nov.
17. S. Kannan A, C.-C. Yao Program checkers for probability generation ICALP 18 510 163 173 ICALP 18 Madrid Spain 1991-July-8-12
18. E.L. Lehmann Testing Statistical Hypotheses. Wadsworth and Brooks/Cole second 1986 Wiley] CA, Pacific Grove
19. J. Neyman E. Pearson On the problem of the most efficient test of statistical hypotheses Philos. Trans. Royal Soc. A 231 289 337 1933
20. M. Parnas D. Ron Randomization, Approximation, and Combinatorial Optimization 1671 85 96 8-11 Aug. 1999 Springer-Verlag Testing the diameter of graphs
21. R. Rubinfeld M. Sudan Robust characterizations of polynomials with applications to program testing SIAM J. Comput. 25 2 252 271 Apr. 1996
22. A. Sahai S. Vadhan A complete promise problem for statistical zero-knowledge Proceedings of the 38th Annual Symposium on the Foundations of Computer Science 448 457 Proceedings of the 38th Annual Symposium on the Foundations of Computer Science 1997-Oct.-20-22
23. A. Sinclair M. Jerrum Approximate counting, uniform generation and rapidly mixing Markov chains Information and Computation 82 1 93 133 July 1989
24. W. D. Smith Testing if distributions are close via sampling 2000 56 NECI http://www.neci.nj.nec.com/homepages/wds/works.html
25. A. J. Walker An efficient method for generating discrete random variables with general distributions ACM trans. math, software 3 253 256 1977
26. K. Yamanishi Probably almost discriminative learning Machine Learning 18 1 23 50 1995