Finite Set Enumeration

Finite Set Enumeration is a combinatorial method that systematically determines the number of distinct structures or configurations associated with finite sets by explicitly accounting for set cardinality and element distinguishability.

27

Publications

974

Citations

43

Authors

29

Institutions

Publications per year

2017–2026

1

Authors

43

  1. SB
    S. Barry Cooper

    Massey University, New Zealand

    2 publications · 45 citations

    2

    h-index

  2. AS
    Andrea Sorbi

    University of Siena, Italy

    1 publications · 26 citations

    1

    h-index

  3. KZ
    K. Zeger

    University of California San Diego, United States

    1 publications · 20 citations

    1

    h-index

  4. MJ
    Min-Jen Jou

    National Yang Ming Chiao Tung University, Taiwan

    1 publications · 12 citations

    1

    h-index

  5. VR
    Venkatesh Raman

    Institute of Mathematical Sciences, India

    1 publications · 59 citations

    1

    h-index

1–5 of 43

Venues

  1. Theory of Computing Systems

    2 publications · 99 citations

    2

    h-index

  2. Naval Research Logistics Quarterly

    1 publications · 33 citations

    1

    h-index

  3. Bulletin of the London Mathematical Society

    1 publications · 11 citations

    1

    h-index

  4. Advances in Mathematics

    1 publications · 17 citations

    1

    h-index

  5. The Annals of Mathematical Statistics

    1 publications · 20 citations

    1

    h-index

1–5