Probabilistic counting algorithms for data base applications

DOI10.1016/0022-0000(85)90041-8zbMATH Open0583.68059DBLPjournals/jcss/FlajoletM85OpenAlexW2025051251WikidataQ59831137 ScholiaQ59831137MaRDI QIDQ1069325FDOQ1069325

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Approximate counting: a detailed analysis
Sorting and Searching in Multisets
Counting large numbers of events in small registers

Cited In (77)

Incremental delay enumeration: space and time
More infinite products: Thue-Morse and the gamma function
FURL: fixed-memory and uncertainty reducing local triangle counting for multigraph streams
Prefixes of infinite words and ambiguous context-free languages
Mellin transforms and asymptotics: Harmonic sums
Statistical estimation with bounded memory
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems
Accurate and precise aggregation counting
On finding common neighborhoods in massive graphs.
A note on compressed sensing and the complexity of matrix multiplication
Mellin transforms and asymptotics. The mergesort recurrence
Analytical depoissonization and its applications
Binary vectors for fast distance and similarity estimation
Estimating hybrid frequency moments of data streams
Sampling to estimate the number of duplicates in a database
Gap-free compositions and gap-free samples of geometric random variables
On adaptive sampling
Secure and efficient multiparty private set intersection cardinality
A result in order statistics related to probabilistic counting
A statistical analysis of probabilistic counting algorithms
Approximating the Size of a Radio Network in Beeping Model
Hierarchical sampling from sketches: Estimating functions over data streams
Combinatorics of geometrically distributed random variables: Left-to-right maxima
Spatially-decaying aggregation over a network
LiMoSense: live monitoring in dynamic sensor networks
A general method for estimating correlated aggregates over a data stream
On gaps and unoccupied urns in sequences of geometrically distributed random variables
On the distribution for the duration of a randomized leader election algorithm
Title not available (Why is that?)
Title not available (Why is that?)
Streaming techniques and data aggregation in networks of tiny artefacts
Give me some slack: efficient network measurements
An analytic approach to the asymptotic variance of trie statistics and related structures
Probabilistic analysis of adaptative sampling
The visibility parameter for words and permutations
A unified scheme for generalizing cardinality estimators to sum aggregation
Streaming algorithms for multitasking scheduling with shared processing
Paperfolding infinite products and the gamma function
A flexible way of counting large numbers approximately in small registers
The number of distinct values in a geometrically distributed sample
Distinctness of compositions of an integer: A probabilistic analysis
The Largest Missing Value in a Sample of Geometric Random Variables
Two improved range-efficient algorithms for $F_0$ estimation
Occupancy schemes associated to Yule processes
Model counting meets $F_0$ estimation
Distributed data clustering in sensor networks
Fast size approximation of a radio network in beeping model
Combinatorics of geometrically distributed random variables: Run statistics
When distributed computation is communication expensive
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
Measuring the impact of MVC attack in large complex networks
The Cost of Fault Tolerance in Multi-Party Communication Complexity
Analytic analysis of algorithms
Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
A variation of the Newton-Pepys problem and its connections to size-estimation problems
The zeta-regularized product of odious numbers
Efficient sampling strategies for relational database operations
Aggregate query processing in the presence of duplicates in wireless sensor networks
Depth First Search in the Semi-streaming Model
On Approximating Matrix Norms in Data Streams
Space‐efficient tracking of persistent items in a massive data stream
A Note on Estimating Hybrid Frequency Moment of Data Streams
Title not available (Why is that?)
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
Counting distinct items over update streams
Continuous Monitoring of l_p Norms in Data Streams
Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
Simplified Planar Coresets for Data Streams
The Online Space Complexity of Probabilistic Languages
Philippe Flajolet's early work in combinatorics
Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
Summary Data Structures for Massive Data
Transcendental Infinite Products Associated with the $\pm 1$ Thue-Morse Sequence
Adversarially robust streaming algorithms via differential privacy
Accelerate the classification statistics in RFID systems
Approximate set union via approximate randomization
Approximate set union via approximate randomization

   Recommendations

Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making 👍 👎
A statistical analysis of probabilistic counting algorithms 👍 👎
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems 👍 👎
Title not available (Why is that?) 👍 👎
A flexible way of counting large numbers approximately in small registers 👍 👎

This page was built for publication: Probabilistic counting algorithms for data base applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069325)