Discrete Mathematics & Theoretical Computer Science

Title Publication Date Language Citations
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm2007/01/01English102
On P_4-tidy graphs1997/01/01English38
Some exactly solvable models of urn process theory2006/01/01English26
Mean field analysis for inhomogeneous bike sharing systems2012/01/01English18
Random Infinite Permutations and the Cyclic Time Random Walk2003/01/01English17
A note on the fragmentation of a stable tree2008/01/01English17
P6- and triangle-free graphs revisited: structure and bounded clique-width2006/01/01English17
Stacks, Queues and Tracks: Layouts of Graph Subdivisions2005/01/01English16
A direct bijective proof of the hook-length formula1997/01/01English15
An invariance principle for random planar maps2006/01/01English15
Frogs and some other interacting random walks models2003/01/01English14
Acyclic, Star and Oriented Colourings of Graph Subdivisions2005/01/01English13
Finding hidden cliques in linear time2010/01/01English13
Optimal L(h,k)-Labeling of Regular Grids2006/01/01English12
The Many Faces of Alternating-Sign Matrices2001/01/01English12
Noncommutative symmetric functions III : Deformations of Cauchy and convolution algebras1997/01/01English12
The total irregularity of a graph2014/04/04English10
Gardens of Eden and Fixed Points in Sequential Dynamical Systems2001/01/01English9
The Bernoulli sieve: an overview2010/01/01English9
Digital Trees and Memoryless Sources: from Arithmetics to Analysis2010/01/01English9
Constructing a sequence of random walks strongly converging to Brownian motion2003/01/01English8
Queue Layouts of Graph Products and Powers2005/01/01English8
Karp-Miller Trees for a Branching Extension of VASS2005/01/01English8
Lattice of combinatorial Hopf algebras: binary trees with multiplicities2013/01/01English8
Multicolored isomorphic spanning trees in complete graphs2002/01/01English8
On the computability of the topological entropy of subshifts2006/01/01English8
The Chip Firing Game and Matroid Complexes2001/01/01English8
Plane recursive trees, Stirling permutations and an urn model2008/01/01English7
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks2006/01/01English7
Graphs of low chordality2005/01/01English7