A sorting problem and its complexity

DOI10.1145/361405.361423zbMath0234.68020OpenAlexW2024229565WikidataQ128028426 ScholiaQ128028426MaRDI QIDQ5643583

I. Pohl

Publication date: 1972

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361405.361423

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

On the complexity of building an interval heap, Fuzzy weighted average: A max-min paired elimination method, An asymptotic theory for recurrence relations based on minimization and maximization., Finding efficient solutions for rectilinear distance location problems efficiently, Are two given elements neighbouring?, An \(n\)-dimensional search problem with restricted questions, A geometrical method in combinatorial complexity, On partial sorting in restricted rounds, Finding the maximum and minimum elements with one lie, The double selection problem, Fuzzy weighted average: An improved algorithm