Sorting X + Y

Authors:
L. H. Harper;T. H. Payne;J. E. Savage;E. Straus
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Univ. of California, Riverside, CA;Brown Univ., Providence, RI;Univ. of California, Los Angeles, CA, Los Angeles
Venue:
Communications of the ACM
Year:
1975

Citing 1
Cited 6

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching

Parallel multiplication and powering of polynomials

Journal of Symbolic Computation
Time-Optimal Domain-Specific Querying on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
Lower Bounds for Selection in X + Y and Other Multisets

Journal of the ACM (JACM)
Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Parallel sparse polynomial division using heaps

Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Sparse polynomial division using a heap

Journal of Symbolic Computation

Quantified Score

Hi-index	48.22

Visualization

Abstract