Interval Partitions

Interval Partitions is a combinatorial construct in partition calculus that consists of a finite sequence of disjoint, contiguous subsets of a linearly ordered set, each forming an interval, such that their union exhausts the original set.

41

Publications

1.8K

Citations

75

Authors

54

Institutions

Publications per year

2017–2026

4

Authors

75

  1. DR
    Douglas Rizzolo

    University of Washington, United States

    2 publications · 29 citations

    2

    h-index

  2. YL
    Yves Lechevallier

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 125 citations

    2

    h-index

  3. FD
    Francisco de A.T. de Carvalho

    Universidade Federal de Pernambuco, Brazil

    2 publications · 125 citations

    2

    h-index

  4. NF
    Noah Forman

    McMaster University, Canada

    2 publications · 29 citations

    2

    h-index

  5. JP
    Jim Pitman

    University of California, Berkeley, United States

    2 publications · 253 citations

    2

    h-index

1–5 of 75

Venues

  1. Stochastic Processes and their Applications

    2 publications · 22 citations

    2

    h-index

  2. IEEE Transactions on Computers

    2 publications · 98 citations

    2

    h-index

  3. Canadian Mathematical Bulletin

    CMB · 1 publications · 12 citations

    1

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 10 citations

    1

    h-index

  5. Electronic Journal of Probability

    EJP · 1 publications · 10 citations

    1

    h-index

1–5