Infinite Trees

Infinite Trees is a mathematical construct in set theory consisting of a partially ordered set with a unique root element and infinitely extending branches, where every element has an infinite number of successors, thereby forming a tree structure of infinite height and potentially unbounded width.

164

Publications

13.7K

Citations

231

Authors

186

Institutions

Publications per year

2017–2026

15

Authors

231

  1. TC
    Thomas Colcombet

    Université Paris Cité, France

    4 publications · 98 citations

    4

    h-index

  2. EA
    E. Allen Emerson

    The University of Texas at Austin, United States

    4 publications · 1.4K citations

    4

    h-index

  3. CS
    Charanjit S. Jutla

    IBM (United States), United States

    4 publications · 1.4K citations

    4

    h-index

  4. DN
    Damian Niwiński

    University of Warsaw, Poland

    4 publications · 143 citations

    4

    h-index

  5. WT
    Wolfgang Thomas

    RWTH Aachen University, Germany

    4 publications · 146 citations

    4

    h-index

1–5 of 231

Venues

  1. Theoretical Computer Science

    8 publications · 1.4K citations

    8

    h-index

  2. Logical Methods in Computer Science

    LMCS · 5 publications · 142 citations

    5

    h-index

  3. SIAM Journal on Computing

    5 publications · 216 citations

    5

    h-index

  4. Electronic Journal of Probability

    EJP · 5 publications · 117 citations

    5

    h-index

  5. Discrete Mathematics

    5 publications · 109 citations

    5

    h-index

1–5