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

Authors

246

  1. BD
    Brendan D. McKay

    Australian National University, Australia

    17 publications · 842 citations

    16

    h-index

  2. EA
    Edward A. Bender

    University of California San Diego, United States

    12 publications · 2.2K citations

    12

    h-index

  3. ER
    E. Rodney Canfield

    University of Georgia, United States

    10 publications · 1.3K citations

    10

    h-index

  4. RW
    Robert W. Robinson

    University of Georgia, United States

    7 publications · 257 citations

    7

    h-index

  5. MN
    Marc Noy

    Universitat Politècnica de Catalunya, Spain

    6 publications · 178 citations

    6

    h-index

1–5 of 246

Venues

  1. Journal of Combinatorial Theory Series A

    18 publications · 2K citations

    17

    h-index

  2. The Electronic Journal of Combinatorics

    18 publications · 435 citations

    15

    h-index

  3. arXiv (Cornell University)

    Repository · 8 publications · 103 citations

    8

    h-index

  4. Combinatorics Probability Computing

    7 publications · 407 citations

    8

    h-index

  5. Journal of Combinatorial Theory Series B

    6 publications · 175 citations

    6

    h-index

1–5