Janson, S. (2007). Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract. Discrete Mathematics & Theoretical Computer Science.
Chicago Style (17th ed.) CitationJanson, Svante. Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence: Extended Abstract. Discrete Mathematics & Theoretical Computer Science, 2007.
MLA (9th ed.) CitationJanson, Svante. Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence: Extended Abstract. Discrete Mathematics & Theoretical Computer Science, 2007.
Warning: These citations may not always be 100% accurate.