English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Sorting in Linear Time?

MPS-Authors
/persons/resource/persons44564

Hagerup,  Torben
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45250

Raman,  Rajeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

sortlint.pdf
(Preprint), 147KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Andersson, A., Hagerup, T., Nilsson, S., & Raman, R. (1995). Sorting in Linear Time? In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (pp. 427-436). New York, NY: ACM.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ACCD-8
Abstract
There is no abstract available