Tableau Pairs
Tableau Pairs is a formal mathematical construct in algebraic combinatorics that consists of an ordered pair of Young tableaux of the same shape, typically used to encode bijections in the Robinson–Schensted–Knuth correspondence.
33
Publications
954
Citations
60
Authors
39
Institutions
Publications per year
2017–2026
1
Parents
33
An Overview of Tableau Algorithms for Description Logics
Franz Baader, Ulrike Sattler · Studia Logica · 2001 · 388 citations
Single Step Tableaux for Modal Logics
Fabio Massacci · Journal of Automated Reasoning · 2000 · 85 citations
Affine insertion and Pieri rules for the affine Grassmannian
Thomas Lam, Luc Lapointe, Jennifer Morse et al. · Memoirs of the American Mathematical Society · 2010 · 66 citations · Full text
1–5 of 33
60
3
h-index
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 60
39
Virginia Tech
Blacksburg, United States
3 h-index
3 publications
214 citations
Université de Poitiers
Poitiers, France
3 h-index
3 publications
70 citations
Institut Pprime
Poitiers, France
3 h-index
3 publications
70 citations
University of Vienna
Vienna, Austria
2 h-index
2 publications
52 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
4 publications
152 citations
Lehman College
New York, United States
2 h-index
2 publications
70 citations
University of Iowa
Iowa City, United States
1 h-index
1 publications
27 citations
Institut de Recherche en Informatique de Toulouse
Toulouse, France
1 h-index
3 publications
117 citations
1–8 of 39
4 publications · 84 citations
4
h-index
3 publications · 96 citations
3
h-index
Repository · 2 publications · 35 citations
2
h-index
2 publications · 53 citations
2
h-index
2 publications · 51 citations
2
h-index
1–5