2024
The number of descendants in a random directed acyclic graph.
Random Struct. Algorithms, May, 2024
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
Adv. Appl. Math., April, 2024
Phragmén's voting methods and justified representation.
Math. Program., January, 2024
Periodic minimum in the count of binomial coefficients not divisible by a prime.
CoRR, 2024
On Semi-Restricted Rock, Paper, Scissors.
Electron. J. Comb., 2024
Fringe Trees for Random Trees with Given Vertex Degrees.
Proceedings of the 35th International Conference on Probabilistic, 2024
Bit-Array-Based Alternatives to HyperLogLog.
Proceedings of the 35th International Conference on Probabilistic, 2024
Depth-First Search Performance in Random Digraphs.
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
Fluctuations of subgraph counts in graphon based random graphs.
Comb. Probab. Comput., May, 2023
On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution.
CoRR, 2023
Estimating Global Subgraph Counts by Sampling.
Electron. J. Comb., 2023
The Number of Occurrences of Patterns in a Random Tree or Forest Permutation.
Electron. J. Comb., 2023
2022
Successive minimum spanning trees.
Random Struct. Algorithms, 2022
On convergence for graphexes.
Eur. J. Comb., 2022
The distance profile of rooted and unrooted simply generated trees.
Comb. Probab. Comput., 2022
Depth-First Search performance in a random digraph with geometric outdegree distribution.
CoRR, 2022
Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution.
Proceedings of the 33rd International Conference on Probabilistic, 2022
2021
Tree limits and limits of random trees.
Comb. Probab. Comput., 2021
Hidden Words Statistics for Large Patterns.
Electron. J. Comb., 2021
2020
Asymptotic normality in random graphs with given vertex degrees.
Random Struct. Algorithms, July, 2020
Random graphs with given vertex degrees and switchings.
Random Struct. Algorithms, 2020
Rate of convergence for traditional Pólya urns.
J. Appl. Probab., 2020
Strong convergence of infinite color balanced urns under uniform ergodicity.
J. Appl. Probab., 2020
A graphon counter example.
Discret. Math., 2020
Central limit theorems for additive functionals and fringe trees in tries.
CoRR, 2020
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns.
Algorithmica, 2020
2019
Patterns in random permutations avoiding the pattern 321.
Random Struct. Algorithms, 2019
Component structure of the configuration model: Barely supercritical case.
Random Struct. Algorithms, 2019
Competition in growth and urns.
Random Struct. Algorithms, 2019
Competing first passage percolation on random graphs with finite variance degrees.
Random Struct. Algorithms, 2019
A modified bootstrap percolation on a random graph coupled with a lattice.
Discret. Appl. Math., 2019
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees.
Comb. Probab. Comput., 2019
Inversions in Split Trees and Conditional Galton-Watson Trees.
Comb. Probab. Comput., 2019
Preferential attachment without vertex growth: emergence of the giant component.
CoRR, 2019
2018
Graph properties, graph limits, and entropy.
J. Graph Theory, 2018
Thresholds quantifying proportionality criteria for election methods.
CoRR, 2018
Preferential Attachment When Stable.
CoRR, 2018
Non-Fringe Subtrees in Conditioned Galton - Watson Trees.
Electron. J. Comb., 2018
Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers).
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.
ACM Trans. Algorithms, 2017
The Greedy Independent Set in a Random Graph with Given Degrees.
Random Struct. Algorithms, 2017
Packing random graphs and hypergraphs.
Random Struct. Algorithms, 2017
On String Graph Limits and the Structure of a Typical String Graph.
J. Graph Theory, 2017
Patterns in Random Permutations Avoiding the Pattern 132.
Comb. Probab. Comput., 2017
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees.
Electron. J. Comb., 2017
2016
The lower tail: Poisson approximation revisited.
Random Struct. Algorithms, 2016
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees.
Random Struct. Algorithms, 2016
Graph limits and hereditary properties.
Eur. J. Comb., 2016
On the Length of a Random Minimum Spanning Tree.
Comb. Probab. Comput., 2016
Phragmén's and Thiele's election methods.
CoRR, 2016
A Unified Approach to Linear Probing Hashing with Buckets.
Algorithmica, 2016
2015
On degenerate sums of <i>m</i>-dependent variables.
J. Appl. Probab., 2015
More on quasi-random graphs, subgraph counts and graph limits.
Eur. J. Comb., 2015
On the tails of the limiting Quicksort distribution.
CoRR, 2015
Maximal Clades in Random Binary Search Trees.
Electron. J. Comb., 2015
2014
Law of large numbers for the SIR epidemic on a random graph with given degrees.
Random Struct. Algorithms, 2014
The probability that a random multigraph is simple. II.
J. Appl. Probab., 2014
Graphs where every k-subset of vertices is an identifying set.
Discret. Math. Theor. Comput. Sci., 2014
Weighted Random Staircase Tableaux.
Comb. Probab. Comput., 2014
On the Spread of Random Graphs.
Comb. Probab. Comput., 2014
On Symmetry of Uniform and Preferential Attachment Graphs.
Electron. J. Comb., 2014
On the Typical Structure of Graphs in a Monotone Property.
Electron. J. Comb., 2014
Asymptotic bias of some election methods.
Ann. Oper. Res., 2014
Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
2013
Coupon collecting and transversals of hypergraphs.
Discret. Math. Theor. Comput. Sci., 2013
VCG Auction Mechanism Cost Expectations and Variances.
CoRR, 2013
2012
Renewal theory in the analysis of tries and strings.
Theor. Comput. Sci., 2012
Hitting Times for Random Walks with Restarts.
SIAM J. Discret. Math., 2012
The Probability of the Alabama Paradox.
J. Appl. Probab., 2012
Monotone Graph Limits and Quasimonotone Graphs.
Internet Math., 2012
Susceptibility in Inhomogeneous Random Graphs.
Electron. J. Comb., 2012
Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems.
Electron. J. Comb., 2012
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf.
Electron. J. Comb., 2012
Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124].
Adv. Appl. Math., 2012
2011
Duality in inhomogeneous random graphs, and the cut metric.
Random Struct. Algorithms, 2011
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees.
Random Struct. Algorithms, 2011
Sparse random graphs with clustering.
Random Struct. Algorithms, 2011
On covering by translates of a set.
Random Struct. Algorithms, 2011
Correlations for paths in random orientations of G(n, p) and G(n, m).
Random Struct. Algorithms, 2011
Generalized Stirling permutations, families of increasing trees and urn models.
J. Comb. Theory A, 2011
Quasi-random graphs and graph limits.
Eur. J. Comb., 2011
On Vertex, Edge, and Vertex-Edge Random Graphs.
Electron. J. Comb., 2011
Poset limits and exchangeable random posets.
Comb., 2011
The Mahonian probability distribution on words is asymptotically normal.
Adv. Appl. Math., 2011
2010
Asymptotic equivalence and contiguity of some random graphs.
Random Struct. Algorithms, 2010
Random graphs with forbidden vertex degrees.
Random Struct. Algorithms, 2010
A divertent generating function that can be summed and analysed analytically.
Discret. Math. Theor. Comput. Sci., 2010
On the Number of Perfect Matchings in Random Lifts.
Comb. Probab. Comput., 2010
2009
A new approach to the giant component problem.
Random Struct. Algorithms, 2009
On the size of identifying codes in binary hypercubes.
J. Comb. Theory A, 2009
The Probability That a Random Multigraph is Simple.
Comb. Probab. Comput., 2009
Line-of-Sight Percolation.
Comb. Probab. Comput., 2009
An optimal result for codes identifying sets of words.
Proceedings of the IEEE International Symposium on Information Theory, 2009
2008
Threshold Graph Limits and Random Threshold Graphs.
Internet Math., 2008
Convergence of Some Leader Election Algorithms.
Discret. Math. Theor. Comput. Sci., 2008
Dismantling Sparse Random Graphs.
Comb. Probab. Comput., 2008
Individual Displacements in Hashing with Coalesced Chains.
Comb. Probab. Comput., 2008
2007
Partial fillup and search time in LC tries.
ACM Trans. Algorithms, 2007
Rainbow Hamilton cycles in random regular graphs.
Random Struct. Algorithms, 2007
A simple solution to the <i>k</i>-core problem.
Random Struct. Algorithms, 2007
Spread-out percolation in R<sup>d</sup>.
Random Struct. Algorithms, 2007
The phase transition in inhomogeneous random graphs.
Random Struct. Algorithms, 2007
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.
Comb. Probab. Comput., 2007
On a Random Graph Related to Quantum Theory.
Comb. Probab. Comput., 2007
2006
Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph".
Random Struct. Algorithms, 2006
Random cutting and records in deterministic and random trees.
Random Struct. Algorithms, 2006
Left and Right Pathlengths in Random Binary Trees.
Algorithmica, 2006
2005
Individual displacements for linear probing hashing with different insertion policies.
ACM Trans. Algorithms, 2005
Asymptotic degree distribution in random recursive trees.
Random Struct. Algorithms, 2005
The phase transition in the uniformly grown random graph has infinite order.
Random Struct. Algorithms, 2005
2004
On average sequence complexity.
Theor. Comput. Sci., 2004
Large deviations for sums of partly dependent random variables.
Random Struct. Algorithms, 2004
On Generalized Random Railways.
Comb. Probab. Comput., 2004
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Comb. Probab. Comput., 2004
The Deletion Method For Upper Tail Estimates.
Comb., 2004
The number of bit comparisons used by Quicksort: an average-case analysis.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
2003
The Wiener Index of simply generated random trees.
Random Struct. Algorithms, 2003
Random Struct. Algorithms, 2003
Cycles And Unicyclic Components In Random Graphs.
Comb. Probab. Comput., 2003
2002
Random dyadic tilings of the unit square.
Random Struct. Algorithms, 2002
Random Struct. Algorithms, 2002
Permutation Pseudographs And Contiguity.
Comb. Probab. Comput., 2002
2001
Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT.
Random Struct. Algorithms, 2001
Asymptotic distribution for the cost of linear probing hashing.
Random Struct. Algorithms, 2001
Approximating the limiting Quicksort distribution.
Random Struct. Algorithms, 2001
2000
Bounding the unsatisfiability threshold of random 3-SAT.
Random Struct. Algorithms, 2000
Growth of components in random graphs.
Random Struct. Algorithms, 2000
A characterization of the set of fixed points of the Quicksort transformation
CoRR, 2000
Smoothness and decay properties of the limiting Quicksort density function
CoRR, 2000
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-17541-4, 2000
1999
On the variance of the random sphere of influence graph.
Random Struct. Algorithms, 1999
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights.
Comb. Probab. Comput., 1999
1998
New versions of Suen's correlation inequality.
Random Struct. Algorithms, 1998
1997
Shellsort with three increments.
Random Struct. Algorithms, 1997
Analysis of an Asymmetric Leader Election Algorithm.
Electron. J. Comb., 1997
Hook Lengths in a Skew Young Diagram.
Electron. J. Comb., 1997
1996
1995
A Graph Fourier Transform and Proportional Graphs.
Random Struct. Algorithms, 1995
Hamilton Cycles in a Random Tournament.
Random Struct. Algorithms, 1995
The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph.
Random Struct. Algorithms, 1995
Perfect Matchings in Random s-Uniform Hypergraphs.
Random Struct. Algorithms, 1995
Random Regular Graphs: Asymptotic Distributions and Contiguity.
Comb. Probab. Comput., 1995
1994
Random Struct. Algorithms, 1994
The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph.
Comb. Probab. Comput., 1994
1993
The Birth of the Giant Component.
Random Struct. Algorithms, 1993
Multicyclic Components in a Random Graph Process.
Random Struct. Algorithms, 1993
1992
Probabilistic Construction of Proportional Graphs.
Random Struct. Algorithms, 1992
Thresholds for classes of intersection graphs.
Discret. Math., 1992
1991
Random Struct. Algorithms, 1991
1990
Poisson Approximation for Large Deviations.
Random Struct. Algorithms, 1990
A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics.
Random Struct. Algorithms, 1990
Small Cliques in Random Graphs.
Random Struct. Algorithms, 1990
