The number of steps in the Robinson-Schensted algorithm
type: Item
instance of: scholarly article
title: The number of steps in the Robinson-Schensted algorithm
zbMATH Open document ID: 1117.05006
author: Dan Romik
publication date: 2007-06-05T00:00:00Z
Mathematics Subject Classification ID: 05A16
Mathematics Subject Classification ID: 05E10
zbMATH DE Number: 5161609
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: Young tableaux
zbMATH Keywords: Plancherel measure
MaRDI profile type: Publication
full work available at URL: s10688-005-0030-8
OpenAlex ID: W2067701708
cites work: Sparse interpolation of symmetric polynomials
cites work: The computational complexity of rules for the character table of \(S_n\).
cites work: Q4349924
cites work: A variational problem for random Young tableaux
cites work: Q4236280
cites work: Q4536184
DOI: 10.1007/S10688-005-0030-8
published in: Functional Analysis and Its Applications
description: scientific article; zbMATH DE number 5161609