مرکز منطقه ای اطلاع رساني علوم و فناوري - A concentration bound for the longest increasing subsequence of a randomly chosen involution Original Research Article

Title of article :

A concentration bound for the longest increasing subsequence of a randomly chosen involution Original Research Article

Author/Authors :

Marcos Kiwi، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2006

Pages :

From page :

1816

To page :

1823

Keywords :

Ulamיs problem , Random involutions , Longest increasing subsequence

Journal title :

Discrete Applied Mathematics

Serial Year :

2006

Journal title :

Discrete Applied Mathematics

Record number :

886330

Link To Document :