Portal del Investigador
A concentration bound for the longest increasing subsequence of a randomly chosen involution
Abstract
In this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of { 1, ..., s }. © 2006 Elsevier B.V. All rights reserved.
Más información
| Título según WOS: | A concentration bound for the longest increasing subsequence of a randomly chosen involution |
| Título según SCOPUS: | A concentration bound for the longest increasing subsequence of a randomly chosen involution |
| Título de la Revista: | DISCRETE APPLIED MATHEMATICS |
| Volumen: | 154 |
| Número: | 13 |
| Editorial: | Elsevier |
| Fecha de publicación: | 2006 |
| Página de inicio: | 1816 |
| Página final: | 1823 |
| Idioma: | English |
| URL: | http://linkinghub.elsevier.com/retrieve/pii/S0166218X06001387 |
| DOI: |
10.1016/j.dam.2006.03.025 |
| Notas: | ISI, SCOPUS - ISI |