A concentration bound for the longest increasing subsequence of a randomly chosen involution (Q2500530): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution of the length of the longest increasing subsequence of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotics of monotone subsequences of involutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The height of a random partial order: Concentration of measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the length of the longest monotone subsequence in a random permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On increasing subsequences of random permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected length of the longest common subsequence for large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent progress in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of measure and isoperimetric inequalities in product spaces / rank
 
Normal rank

Latest revision as of 19:21, 24 June 2024

scientific article
Language Label Description Also known as
English
A concentration bound for the longest increasing subsequence of a randomly chosen involution
scientific article

    Statements

    A concentration bound for the longest increasing subsequence of a randomly chosen involution (English)
    0 references
    17 August 2006
    0 references
    0 references
    Ulam's problem
    0 references
    random involutions
    0 references
    0 references
    0 references