Mc2: Rigorous and efficient directed greybox fuzzing

A Shah, D She, S Sadhu, K Singal, P Coffman… - Proceedings of the …, 2022 - dl.acm.org
Directed greybox fuzzing is a popular technique for targeted software testing that seeks to
find inputs that reach a set of target sites in a program. Most existing directed greybox …

Intermediate value linearizability: A quantitative correctness criterion

A Rinberg, I Keidar - Journal of the ACM, 2023 - dl.acm.org
Big data processing systems often employ batched updates and data sketches to estimate
certain properties of large data. For example, a CountMin sketch approximates the …

Analytic methods

H Prodinger - … combinatorics, Discrete Math. Appl.(Boca Raton …, 2015 - api.taylorfrancis.com
This chapter should have really been written by Philippe Flajolet (1948–2011), who could
not make it this time. He coined the name analytic combinatorics. The present author knew …

Approximate counting via the Poisson-Laplace-Mellin method

M Fuchs, CK Lee, H Prodinger - Discrete Mathematics & …, 2012 - dmtcs.episciences.org
Approximate counting is an algorithm that provides a count of a huge number of objects
within an error tolerance. The first detailed analysis of this algorithm was given by Flajolet. In …

On distributed data aggregation and the precision of approximate histograms

K Gotfryd, J Cichoń - Journal of Parallel and Distributed Computing, 2023 - Elsevier
We consider selected aspects of distributed data aggregation in wireless sensor networks
(WSNs), including random sampling, averaging, and the construction of histograms. We …

Approximate counting with m counters: a detailed analysis

H Prodinger - Theoretical Computer Science, 2012 - Elsevier
The classical algorithm approximate counting has been recently modified by Cichoń and
Macyna: instead of one counter, m counters are used, and the assignment of an incoming …

Average counting via approximate histograms

J Cichoń, K Gotfryd - ACM Transactions on Sensor Networks (TOSN), 2018 - dl.acm.org
We propose a new algorithm for the classical averaging problem for distributed wireless
sensors networks. This subject has been studied extensively and there are many clever …

The story of HyperLogLog: How Flajolet processed streams with coin flips

JO Lumbroso - arXiv preprint arXiv:1805.00612, 2018 - arxiv.org
This article is a historical introduction to data streaming algorithms that was written as a
companion piece to the talk" How Philippe Flipped Coins to Count Data", given on …

[PDF][PDF] On the m-enumeration of maximum and left-to-right maxima in geometrically distributed words

H Prodinger - Pure Math. Appl, 2012 - math.tugraz.at
Words with letters being natural numbers equipped with geometric probabilities are counted
using a novel idea of Cichon and Macyna's, namely by sending the letters at random to one …

Probabilistic counters for privacy preserving data aggregation

D Bojko, K Grining, M Klonowski - arXiv preprint arXiv:2003.11446, 2020 - arxiv.org
Probabilistic counters are well-known tools often used for space-efficient set cardinality
estimation. In this paper, we investigate probabilistic counters from the perspective of …