Analytic combinatorics of graphs with marked subgraphs
(Élie de Panafieu / Université Pierre et Marie Curie)
|
|
|
Distribution of the Number of Factors in Monoids Generated by a Lucas sequence
(Clemens Heuberger / Alpen-Adria-Universität Klagenfurt)
|
|
|
Forty years of tree enumeration
(Helmut Prodinger / Stellenbosch University)
|
|
|
Sorting with C-machines: Enumerative and Analytic Aspects
(Jay Pantone / Dartmouth College)
|
|
|
The Number of Automorphisms of Random Trees
(Stephan Wagner / Stellenbosch University)
|
|
|
Using Pólya urns to show normal limit laws for fringe subtrees in preferential attachment trees
(Cecilia Holmgren / Uppsala University)
|
|
|
A local limit theorem for QuickSort key comparisons via multi-round smoothing
(James Allen Fill / The Johns Hopkins University)
|
|
|
Distribution of the coefficients of polynomials with only unit roots
(Hsien-Kuei Hwang / Academia Sinica)
|
|
|
Efficient Computation of Ratios of Stirling Numbers
(Sara Kropf / Insitute of Statistical Science)
|
|
|
On the growth of grid classes and staircases of permutations
(Vincent Vatter / University of Florida)
|
|
|
Random shifts of finite type: tools and techniques
(Kevin McGoff / UNC Charlotte)
|
|
|
Random subshifts of finite type: an introduction
(Ronald Pavlov / University of Denver)
|
|
|
Asymptotics of the number of standard Young tableaux of skew shape
(Alejandro Morales / UCLA)
|
|
|
Universality classes for weighted lattice paths: where probability and ACSV meet
(Marni Mishna / Simon Fraser University)
|
|
|
Using Rooted Triplets to Identify Experimental Error in Cancer Data
(Jeff Gaither / Mathematical Biosciences Institute)
|
|
|
Horizontal profiles of forests: scaling limits and time-change equations
(Geronimo Uribe Bravo / UNAM)
|
|
|
Measure-valued P\'olya urn processes (with Jean-François Marckert)
(Cécile Mailler / University of Bath)
|
|
|
On the game of Memory
(Pawel Hitczenko / Drexel University)
|
|
|
Periods of iterations of mappings over finite fields with restricted preimage sizes
(Daniel Panario / Carleton University)
|
|
|
Restricted Stirling and Lah numbers, and their inverses
(David Galvin / Notre Dame)
|
|
|
Subgraph Counting in Series-Parallel Graphs and Infinite Dimensional Systems of Functional Equations
(Michael Drmota / Technische Universitaet Wien)
|
|
|
| Back to top of page |
|