HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm | 2007/01/01 | English | 102 |
On P_4-tidy graphs | 1997/01/01 | English | 38 |
Some exactly solvable models of urn process theory | 2006/01/01 | English | 26 |
Mean field analysis for inhomogeneous bike sharing systems | 2012/01/01 | English | 18 |
Random Infinite Permutations and the Cyclic Time Random Walk | 2003/01/01 | English | 17 |
A note on the fragmentation of a stable tree | 2008/01/01 | English | 17 |
P6- and triangle-free graphs revisited: structure and bounded clique-width | 2006/01/01 | English | 17 |
Stacks, Queues and Tracks: Layouts of Graph Subdivisions | 2005/01/01 | English | 16 |
A direct bijective proof of the hook-length formula | 1997/01/01 | English | 15 |
An invariance principle for random planar maps | 2006/01/01 | English | 15 |
Frogs and some other interacting random walks models | 2003/01/01 | English | 14 |
Acyclic, Star and Oriented Colourings of Graph Subdivisions | 2005/01/01 | English | 13 |
Finding hidden cliques in linear time | 2010/01/01 | English | 13 |
Optimal L(h,k)-Labeling of Regular Grids | 2006/01/01 | English | 12 |
The Many Faces of Alternating-Sign Matrices | 2001/01/01 | English | 12 |
Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras | 1997/01/01 | English | 12 |
The total irregularity of a graph | 2014/04/04 | English | 10 |
Gardens of Eden and Fixed Points in Sequential Dynamical Systems | 2001/01/01 | English | 9 |
The Bernoulli sieve: an overview | 2010/01/01 | English | 9 |
Digital Trees and Memoryless Sources: from Arithmetics to Analysis | 2010/01/01 | English | 9 |
Constructing a sequence of random walks strongly converging to Brownian motion | 2003/01/01 | English | 8 |
Queue Layouts of Graph Products and Powers | 2005/01/01 | English | 8 |
Karp-Miller Trees for a Branching Extension of VASS | 2005/01/01 | English | 8 |
Lattice of combinatorial Hopf algebras: binary trees with multiplicities | 2013/01/01 | English | 8 |
Multicolored isomorphic spanning trees in complete graphs | 2002/01/01 | English | 8 |
On the computability of the topological entropy of subshifts | 2006/01/01 | English | 8 |
The Chip Firing Game and Matroid Complexes | 2001/01/01 | English | 8 |
Plane recursive trees, Stirling permutations and an urn model | 2008/01/01 | English | 7 |
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks | 2006/01/01 | English | 7 |
Graphs of low chordality | 2005/01/01 | English | 7 |