A sorting problem and its complexity

DOI10.1145/361405.361423MaRDI QIDQ5643583zbMATH OpenOpenAlexWikidataFDO

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

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

Cited in

(11)

• Finding efficient solutions for rectilinear distance location problems efficiently
• Are two given elements neighbouring?
• An n-dimensional search problem with restricted questions
• The double selection problem
• Fuzzy weighted average: An improved algorithm
• 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.
• On partial sorting in restricted rounds
• A geometrical method in combinatorial complexity
• Finding the maximum and minimum elements with one lie

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)