First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner. - Dudley Stark (Comb. Probab. Comput., 1995)

Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes. - Dudley Stark (Comb. Probab. Comput., 1997)

A Darboux-Type Theorem for Slowly Varying Functions. - B. L. J. Braaksma; Dudley Stark (J. Comb. Theory A, 1997)

Asymptotic Enumeration of Convex Polygons. - Dudley Stark; Nicholas C. Wormald (J. Comb. Theory A, 1997)

Total variation asymptotics for independent process approximations of logarithmic multisets and selections. - Dudley Stark (Random Struct. Algorithms, 1997)

The Asymptotic Number of Set Partitions with Unequal Block Sizes. - Arnold Knopfmacher; Andrew M. Odlyzko; Boris G. Pittel; L. Bruce Richmond; Dudley Stark; George Szekeres; Nicholas C. Wormald (Electron. J. Comb., 1999)

Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies. - Dudley Stark (Comb. Probab. Comput., 1999)

Compound Poisson approximations of subgraph counts in random graphs. - Dudley Stark (Random Struct. Algorithms, 2001)

A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. - Peter J. Cameron; Dudley Stark (Electron. J. Comb., 2002)

Information Loss In Top To Random Shuffling. - Dudley Stark (Comb. Probab. Comput., 2002)

Information Loss In Riffle Shuffling. - Dudley Stark; Ayalvadi Ganesh 001; Neil O'Connell (Comb. Probab. Comput., 2002)

Convergence in Distribution for Subset Counts Between Random Sets. - Dudley Stark (Electron. J. Comb., 2004)

The vertex degree distribution of random intersection graphs. - Dudley Stark (Random Struct. Algorithms, 2004)

Asymptotics for Incidence Matrix Classes. - Peter J. Cameron; Thomas Prellberg; Dudley Stark (Electron. J. Comb., 2006)

The degree of a typical vertex in generalized random intersection graph models. - Jerzy Jaworski; Michal Karonski; Dudley Stark (Discret. Math., 2006)

Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof. - Boris L. Granovsky; Dudley Stark; Michael M. Erlihson (Adv. Appl. Math., 2008)

The Vertex Degree Distribution of Passive Random Intersection Graph Models. - Jerzy Jaworski; Dudley Stark (Comb. Probab. Comput., 2008)

Random preorders and alignments. - Peter J. Cameron; Mihyun Kang; Dudley Stark (Discret. Math., 2010)

Asymptotic enumeration of 2-covers and line graphs. - Peter J. Cameron; Thomas Prellberg; Dudley Stark (Discret. Math., 2010)

The asymptotic number of spanning forests of complete bipartite labelled graphs. - Dudley Stark (Discret. Math., 2013)

Asymptotic enumeration of decomposable combinatorial structures with multiple singularities (Abstract). - Boris L. Granovsky; Dudley Stark (Electron. Notes Discret. Math., 2013)

Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs. - John Baptist Gauci; Anthony J. W. Hilton; Dudley Stark (J. Graph Theory, 2013)

Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration. - Boris L. Granovsky; Dudley Stark (Electron. J. Comb., 2015)

Poisson approximation of counts of induced subgraphs in random intersection graphs. - Katarzyna Rybarczyk; Dudley Stark (Discret. Math., 2017)

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph. - Dudley Stark; Nick Wormald (Comb. Probab. Comput., 2018)

The Component Counts of Random Injections. - Dudley Stark (Electron. J. Comb., 2021)

The component counts of random functions. - Dudley Stark (Discret. Math., 2022)

Random permutations and queues. - Alexander V. Gnedin; Dudley Stark (Adv. Appl. Math., 2023)

The small cycle counts of random feedback shift registers. - Dudley Stark (Australas. J Comb., 2023)