Sorting X + Y
From MaRDI portal
Publication:4060389
DOI10.1145/360825.360869zbMath0304.68047OpenAlexW2053121818MaRDI QIDQ4060389
Ernst Gabor Straus, Lawrence H. Harper, Thomas H. Payne, John E. Savage
Publication date: 1975
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360825.360869
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
On the memory usage of the SIA algorithm family for symbolic music pattern discovery, Complexity of selection in \(X+Y\), Optimal slope selection via cuttings, The complexity of searching in \(X+Y\) and other multisets, Algorithmic complexity of protein identification: Combinatorics of weighted strings, A pseudo-algorithmic separation of lines from pseudo-lines, Sorting the sums \((x_ i+y_ j)\) in \(O(n^ 2)\) comparisons, Sparse polynomial division using a heap, How good is the information theory bound in sorting?, Lower bounds for sorting of sums, Selection in \(X+Y\) and matrices with sorted rows and columns, A parallel selection algorithm, Ernst G. Straus (1922-1983), Parallel multiplication and powering of polynomials
