A sorting problem and its complexity

DOI10.1145/361405.361423zbMATH Open0234.68020OpenAlexW2024229565WikidataQ128028426 ScholiaQ128028426MaRDI QIDQ5643583FDOQ5643583

Authors: 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)

Cited In (11)

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

This page was built for publication: A sorting problem and its complexity

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