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 …

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 …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We consider the asymptotics of the Plancherel measures on partitions of $ n $ as $ n $ goes
to infinity. We prove that the local structure of a Plancherel typical partition in the middle of …

The goal of this paper is to increase our understanding of the fundamental performance
limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multihop paths may …

Information theory traditionally deals with “conventional data,” be it textual data, image, or
video data. However, databases of various sorts have come into existence in recent years …

We prove the existence of a threshold phenomenon regarding the random 3-XORSAT
problem (or more generally k-XORSAT). We provide the value of the threshold as the …

A cutting-edge look at the emerging distributional theory of sorting Research on distributions
associated with sorting algorithms has grown dramatically over the last few decades …