In-place linear probing sort

Carlsson, Svante; Katajainen, Jyrki; Teuhola, Jukka

Simple search

Advanced search -
Research publications Advanced search -
Student theses Statistics

Change search

Cite ExportLink to record

Permanent link

https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-27421

Direct link

https://ltu.diva-portal.org/smash/record.jsf?pid=diva2:1000605

Cite

Citation style

apa
ieee
modern-language-association-8th-edition
vancouver
Other style

More styles

Language

de-DE
en-GB
en-US
fi-FI
nn-NO
nn-NB
sv-SE
Other locale

More languages

Output format

html
text
asciidoc
rtf

In-place linear probing sort

Carlsson, Svante

Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.

Katajainen, Jyrki

Datalogisk Institut, KØpenhavns Universitet, Universitetsparken 1, 2100, KØbenhavn O, Denmark.

Teuhola, Jukka

Department of Computer Science, University of Turku, Lemminkäsenkatu 14 A, SF-20520, Turku, Finland.

1992 (English)In: STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13 - 15, 1992 proceedings / [ed] Alain Finkel; Matthias Jantzen, Springer , 1992, p. 581-587Conference paper, Published paper (Refereed)

Abstract [en]

We introduce the first sorting algorithm that is proven to sort n randomly drawn uniformly distributed elements in O(n) time in situ. The constants in this algorithm are small, and simulations have shown it competitive with other sorting algorithms. It is, furthermore, conceptually simple and easy to code, which makes it a practical distributive sorting algorithm.

Place, publisher, year, edition, pages

Springer , 1992. p. 581-587

Series

Lecture Notes in Computer Science, ISSN 0302-9743 ; 577

National Category

Computer Sciences

Research subject

Dependable Communication and Computation Systems

Identifiers

URN: urn:nbn:se:ltu:diva-27421DOI: 10.1007/3-540-55210-3_214Scopus ID: 2-s2.0-84958061949Local ID: 0dca83a0-cf85-11df-a707-000ea68e967bISBN: 3-540-55210-3 (print)OAI: oai:DiVA.org:ltu-27421DiVA, id: diva2:1000605

Conference

Annual Symposium on Theoretical Aspects of Computer Science : 13/02/1992 - 15/02/1992

Note

Godkänd; 1992; 20101004 (andbra)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2026-02-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search outside of DiVA

Google Google Scholar

doi

isbn

urn-nbn

Total: 98 hits