Lower Bounds for Selection in X + Y and Other Multisets

Authors:
Donald B. Johnson;Samuel D. Kashdan
Affiliations:
Computer Science Department, The Pennsylvania State University, University Park, PA;Computer Science Department, The Pennsylvania State University, University Park, PA
Venue:
Journal of the ACM (JACM)
Year:
1978

Citing 7
Cited 3

A Theorem on Boolean Matrices

Journal of the ACM (JACM)
On the Optimality of Some Set Algorithms

Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Sorting X + Y

Communications of the ACM
Algorithm 97: Shortest path

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Simple characterizations of P(#P) and complete problems

Journal of Computer and System Sciences
Algorithm 616: fast computation of the Hodges-Lehmann location estimator

ACM Transactions on Mathematical Software (TOMS)
Generalized selection and ranking (Preliminary Version)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract