Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations. / Thorup, Mikkel.

In: Journal of Algorithms, Vol. 42, No. 2, 2002, p. 205-230.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Thorup, M 2002, 'Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations', Journal of Algorithms, vol. 42, no. 2, pp. 205-230.

APA

Thorup, M. (2002). Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations. Journal of Algorithms, 42(2), 205-230.

Vancouver

Thorup M. Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations. Journal of Algorithms. 2002;42(2):205-230.

Author

Thorup, Mikkel. / Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations. In: Journal of Algorithms. 2002 ; Vol. 42, No. 2. pp. 205-230.

Bibtex

@article{3535525d9e8b40f4aac114147c73c082,

title = "Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations",

author = "Mikkel Thorup",

note = "Announced at SODA'97",

year = "2002",

language = "English",

volume = "42",

pages = "205--230",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press",

number = "2",

}

RIS

TY - JOUR

T1 - Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations

AU - Thorup, Mikkel

N1 - Announced at SODA'97

PY - 2002

Y1 - 2002

M3 - Journal article

VL - 42

SP - 205

EP - 230

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 2

ER -

ID: 98319936