Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes

Kaufmann, Michael; Sibeyn, Jop F.; Suel, Torsten

doi:10.1007/3-540-60313-1_135

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes

MPS-Authors

/persons/resource/persons44745

Kaufmann, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Sibeyn, Jop F.
Max Planck Society;

External Resource

https://rdcu.be/dtT1k
(Publisher version)

Fulltext (restricted access)

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

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kaufmann, M., Sibeyn, J. F., & Suel, T. (1995). Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. In P. Spirakis (Ed.), Algorithms - ESA '95 (pp. 75-88). Berlin, Germany: Springer.

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

Abstract

There is no abstract available