Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

m. This improves on the best previously known cardinality estimator, LOGLOG, whose
accuracy can be matched by consuming only 64% of the original memory. For instance, the …

Page 1 Michael Drmota Random Trees An Interplay between Combinatorics and Probability
SpringerWien NewYork Page 2 SpringerWien NewYork Page 3 Michael Drmota Random Trees …

We present a development of parts of rate-distortion theory and pattern-matching algorithms
for lossy data compression, centered around a lossy version of the asymptotic equipartition …

The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

Using an auxiliary memory smaller than the size of this abstract, the LogLog algorithm
makes it possible to estimate in a single pass and within a few percents the number of …

Automated fire detection is an active research topic in computer vision. In this paper, we
propose and analyze a new method for identifying fire in videos. Computer vision-based fire …

Suppose P is an arbitrary discrete distribution on acountable alphabet 𝒳. Given an iid
sample (X1,…, Xn) drawnfrom P, we consider the problem of estimating the entropy H (P) or …

Effective processing of character strings is required at various stages of data analysis
pipelines: from data cleansing and preparation, through information extraction, to report …

Many applications depend on efficient management of large sets of distinct strings in
memory. For example, during index construction for text databases a record is held for each …