Optimal time-space trade-offs for sorting

DOI10.1109/SFCS.1998.743455MaRDI QIDQ6909495zbMATH OpenFDO

Authors Theis Rauhe, Jakob Illeborg Pagter

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743455

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs
• Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism

This page was built for publication: Optimal time-space trade-offs for sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909495)