Dudley Stark - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2023

Random permutations and queuesAlexander V. Gnedin, Dudley Stark. aam, 149:102549, 2023. [doi]

The small cycle counts of random feedback shift registersDudley Stark. ajc, 86:414-422, 2023. [doi]

2022

The component counts of random functionsDudley Stark. DM, 345(9):112977, 2022. [doi]

2021

The Component Counts of Random InjectionsDudley Stark. combinatorics, 28(1):1, 2021. [doi]

2018

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random GraphDudley Stark, Nick Wormald. cpc, 27(4):672-715, 2018. [doi]

2017

Poisson approximation of counts of induced subgraphs in random intersection graphsKatarzyna Rybarczyk, Dudley Stark. DM, 340(9):2183-2193, 2017. [doi]

2015

Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic EnumerationBoris L. Granovsky, Dudley Stark. combinatorics, 22(4):4, 2015. [doi]

2013

k-to-1 Functions Between GraphsJohn Baptist Gauci, Anthony J. W. Hilton, Dudley Stark. jgt, 74(3):275-308, 2013. [doi]

Asymptotic enumeration of decomposable combinatorial structures with multiple singularities (Abstract)Boris L. Granovsky, Dudley Stark. endm, 43:15-20, 2013. [doi]

The asymptotic number of spanning forests of complete bipartite labelled graphsDudley Stark. DM, 313(11):1256-1261, 2013. [doi]

2010

Asymptotic enumeration of 2-covers and line graphsPeter J. Cameron, Thomas Prellberg, Dudley Stark. DM, 310(2):230-240, 2010. [doi]

Random preorders and alignmentsPeter J. Cameron, Mihyun Kang, Dudley Stark. DM, 310(3):591-603, 2010. [doi]

2008

Meinardus' theorem on weighted partitions: Extensions and a probabilistic proofBoris L. Granovsky, Dudley Stark, Michael M. Erlihson. aam, 41(3):307-328, 2008. [doi]

The Vertex Degree Distribution of Passive Random Intersection Graph ModelsJerzy Jaworski, Dudley Stark. cpc, 17(4):549-558, 2008. [doi]

2006

Asymptotics for Incidence Matrix ClassesPeter J. Cameron, Thomas Prellberg, Dudley Stark. combinatorics, 13(1), 2006. [doi]

The degree of a typical vertex in generalized random intersection graph modelsJerzy Jaworski, Michal Karonski, Dudley Stark. DM, 306(18):2152-2165, 2006. [doi]

2004

The vertex degree distribution of random intersection graphsDudley Stark. rsa, 24(3):249-258, 2004. [doi]

Convergence in Distribution for Subset Counts Between Random SetsDudley Stark. combinatorics, 11(1), 2004. [doi]

2002

A Prolific Construction of Strongly Regular Graphs with the n-e.c. PropertyPeter J. Cameron, Dudley Stark. combinatorics, 9(1), 2002. [doi]

Information Loss In Top To Random ShufflingDudley Stark. cpc, 11(6):607-627, 2002.

Information Loss In Riffle ShufflingDudley Stark, A. Ganesh, Neil O Connell. cpc, 11(1):79-95, 2002.

2001

Compound Poisson approximations of subgraph counts in random graphsDudley Stark. rsa, 18(1):39-60, 2001.

1999

The Asymptotic Number of Set Partitions with Unequal Block SizesArnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, G. Szekeres, Nicholas C. Wormald. combinatorics, 6, 1999. [doi]

Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic AssembliesDudley Stark. cpc, 8(6):567-598, 1999.

1997

Total variation asymptotics for independent process approximations of logarithmic multisets and selectionsDudley Stark. rsa, 11(1):51-80, 1997.

Asymptotic Enumeration of Convex PolygonsDudley Stark, Nicholas C. Wormald. JCT, 80(2):196-217, 1997. [doi]

Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson ProcessesDudley Stark. cpc, 6(1):87-105, 1997.

1995

First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of PevznerDudley Stark. cpc, 4:279-285, 1995.

Sign in or sign up to see more results.

runs on WebDSL