uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence: Extended abstract
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.
2007 (English)In: DMTCS Proceedings AofA 2007, 2007Conference paper (Refereed)
Place, publisher, year, edition, pages
URN: urn:nbn:se:uu:diva-12750OAI: oai:DiVA.org:uu-12750DiVA: diva2:40519
Available from: 2008-01-11 Created: 2008-01-11

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Janson, Svante
By organisation
Department of Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 175 hits
ReferencesLink to record
Permanent link

Direct link