Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees

Hoffmann, Kurt; Mehlhorn, Kurt; Rosenstiehl, Pierre; Tarjan, Robert E.

doi:10.1016/S0019-9958(86)80033-X

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees

MPS-Authors

Hoffmann, Kurt
Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Rosenstiehl, Pierre
Max Planck Society;

Tarjan, Robert E.
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)

1-s2.0-S001999588680033X-main.pdf
(Publisher version), 735KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Hoffmann, K., Mehlhorn, K., Rosenstiehl, P., & Tarjan, R. E. (1986). Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees. Information and Control, 68(1-3), 170-184. doi:10.1016/S0019-9958(86)80033-X.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AEBE-B

Abstract

There is no abstract available