A local limit theorem for QuickSort key comparisons via multiround smoothing
(James Allen Fill / The Johns Hopkins University)



Analytic combinatorics of graphs with marked subgraphs
(Élie de Panafieu / Université Pierre et Marie Curie)



Asymptotics of the number of standard Young tableaux of skew shape
(Alejandro Morales / UCLA)



Distribution of the coefficients of polynomials with only unit roots
(HsienKuei Hwang / Academia Sinica)



Distribution of the Number of Factors in Monoids Generated by a Lucas sequence
(Clemens Heuberger / AlpenAdriaUniversität Klagenfurt)



Efficient Computation of Ratios of Stirling Numbers
(Sara Kropf / Insitute of Statistical Science)



Forty years of tree enumeration
(Helmut Prodinger / Stellenbosch University)



Horizontal profiles of forests: scaling limits and timechange equations
(Geronimo Uribe Bravo / UNAM)



Measurevalued P\'olya urn processes (with JeanFrançois Marckert)
(Cécile Mailler / University of Bath)



On the game of Memory
(Pawel Hitczenko / Drexel University)



On the growth of grid classes and staircases of permutations
(Vincent Vatter / University of Florida)



Periods of iterations of mappings over finite fields with restricted preimage sizes
(Daniel Panario / Carleton University)



Random shifts of finite type: tools and techniques
(Kevin McGoff / UNC Charlotte)



Random subshifts of finite type: an introduction
(Ronald Pavlov / University of Denver)



Restricted Stirling and Lah numbers, and their inverses
(David Galvin / Notre Dame)



Sorting with Cmachines: Enumerative and Analytic Aspects
(Jay Pantone / Dartmouth College)



Subgraph Counting in SeriesParallel Graphs and Infinite Dimensional Systems of Functional Equations
(Michael Drmota / Technische Universitaet Wien)



The Number of Automorphisms of Random Trees
(Stephan Wagner / Stellenbosch University)



Universality classes for weighted lattice paths: where probability and ACSV meet
(Marni Mishna / Simon Fraser University)



Using Pólya urns to show normal limit laws for fringe subtrees in preferential attachment trees
(Cecilia Holmgren / Uppsala University)



Using Rooted Triplets to Identify Experimental Error in Cancer Data
(Jeff Gaither / Mathematical Biosciences Institute)



Back to top of page 
