The Space Complexity of Approximating the Frequency Moments
- 1 February 1999
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 58 (1), 137-147
- https://doi.org/10.1006/jcss.1997.1545
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the distributional complexity of disjointnessPublished by Springer Nature ,2005
- A supplement to sampling-based methods for query size estimation in a database systemACM SIGMOD Record, 1992
- A linear-time probabilistic counting algorithm for database applicationsACM Transactions on Database Systems, 1990
- C332. Surprise indexes and p-valuesJournal of Statistical Computation and Simulation, 1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- Approximate counting: A detailed analysisBIT Numerical Mathematics, 1985
- Lower bounds by probabilistic argumentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Probabilistic countingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Some complexity questions related to distributive computing(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1979
- Counting large numbers of events in small registersCommunications of the ACM, 1978