Integer Sorting in O(nlog log n) Expected Time and Linear Space
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Integer Sorting in O(nlog log n) Expected Time and Linear Space. / Han, Yijie; Thorup, Mikkel.
Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). 2002. p. 135-144.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Han, Y & Thorup, M 2002, Integer Sorting in O(nlog log n) Expected Time and Linear Space. in Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). pp. 135-144.
APA
Han, Y., & Thorup, M. (2002). Integer Sorting in O(nlog log n) Expected Time and Linear Space. In Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 135-144)
Vancouver
Han Y, Thorup M. Integer Sorting in O(nlog log n) Expected Time and Linear Space. In Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). 2002. p. 135-144
Author
Bibtex
@inproceedings{89becde2048c405183dd9c90b4976945,
title = "Integer Sorting in O(nlog log n) Expected Time and Linear Space",
author = "Yijie Han and Mikkel Thorup",
year = "2002",
language = "English",
pages = "135--144",
booktitle = "Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS)",
}
RIS
TY - GEN
T1 - Integer Sorting in O(nlog log n) Expected Time and Linear Space
AU - Han, Yijie
AU - Thorup, Mikkel
PY - 2002
Y1 - 2002
M3 - Article in proceedings
SP - 135
EP - 144
BT - Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS)
ER -
ID: 98320137