Sorting in Linear Time?

Andersson, Arne; Hagerup, Torben; Nilsson, Stefan; Raman, Rajeev

doi:10.1145/225058.225173

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

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

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

sortlint.pdf
(プレプリント), 147KB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ACCD-8

要旨

要旨はありません