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
Parents
164
On the synthesis of a reactive module
Amir Pnueli, Roni Rosner · 1989 · 1.4K citations · Full text
David Aldous · The Annals of Probability · 1991 · 849 citations · Full text
Tree automata, mu-calculus and determinacy
E. Allen Emerson, Charanjit S. Jutla · 2002 · 742 citations
1–5 of 164
231
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 231
186
Université Paris Cité
Paris, France
11 h-index
14 publications
903 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
14 publications
665 citations

University of Warsaw
Warsaw, Poland
9 h-index
16 publications
321 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
6 h-index
7 publications
374 citations
University of Oxford
Oxford, United Kingdom
5 h-index
8 publications
156 citations
The University of Texas at Austin
Austin, United States
5 h-index
6 publications
1.7K citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
7 publications
1.2K citations
Université de Bordeaux
Bordeaux, France
4 h-index
4 publications
600 citations
1–8 of 186
8 publications · 1.4K citations
8
h-index
LMCS · 5 publications · 142 citations
5
h-index
5 publications · 216 citations
5
h-index
EJP · 5 publications · 117 citations
5
h-index
5 publications · 109 citations
5
h-index
1–5