1 |
A. Berele, A Schensted-type correspondence for the symplectic group, J. Combin. Theory Ser. A 43 (1986), 320-328.
DOI
|
2 |
D. E. Knuth, Sorting and Searching; The Art of Computer Programming, Vol. 3 (1973), Addison-Wesley, Mass.
|
3 |
D. E. Knuth, Permutations, matrices, and generalized Young tableaux, Pacific J. Math. 34 (1970), 709-727.
DOI
|
4 |
J. Lee, A Schensted algorithm for shifted rim hook tableaux, J. Korean Math. Soc. 31 (1994), 179-203.
|
5 |
B. E. Sagan, Shifted tableaux, Schur Q-functions and a conjecture of R. Stanley, J. Combin. Theory Ser. A 45 (1987), 62-103.
DOI
|
6 |
C. Schensted, Longest increasing and decreasing subsequences, Canad. J. Math. 13 (1961), 179-191.
DOI
|
7 |
B. Sagan and R. Stanley, Robinson-Schensted algorithms for skew tableaux, J. Combin. Theory Ser. A 55 (1990), 161-193.
DOI
|
8 |
D. W. Stanton and D. E. White, A Schensted algorithm for rim hook tableaux, J. Combin. Theory Ser. A 40 (1985), 211-247.
DOI
|
9 |
D. E. White, A bijection proving orthogonality of the characters of , Advances in Math. 50 (1983), 160-186.
DOI
|
10 |
D. R. Worley, A Theory of Shifted Young Tableaux, Ph. D. thesis (1984), M.I.T.
|