Asymptotic Enumeration
Asymptotic Enumeration is a method in combinatorial enumeration that determines the approximate growth rate of a sequence counting combinatorial structures as the size tends to infinity, typically by analyzing the singularities of associated generating functions.
178
Publications
8.8K
Citations
246
Authors
178
Institutions
Publications per year
2017–2026
23
178
1–5 of 178
246
16
h-index
12
h-index
10
h-index
7
h-index
6
h-index
1–5 of 246
178

Australian National University
Canberra, Australia
14 h-index
16 publications
857 citations

University of Georgia
Athens, United States
9 h-index
12 publications
1.4K citations

UNSW Sydney
Sydney, Australia
8 h-index
9 publications
273 citations
University of California San Diego
San Diego, United States
8 h-index
10 publications
1.4K citations
Universitat Politècnica de Catalunya
Barcelona, Spain
7 h-index
14 publications
403 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
8 publications
431 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
6 h-index
7 publications
993 citations

University of Waterloo
Waterloo, Canada
6 h-index
7 publications
313 citations
1–8 of 178
18 publications · 2K citations
17
h-index
18 publications · 435 citations
15
h-index
Repository · 8 publications · 103 citations
8
h-index
7 publications · 407 citations
8
h-index
6 publications · 175 citations
6
h-index
1–5