Lower Bounds for Selection in X + Y and Other Multisets-Reference-Cited by-同舟云学术

Lower Bounds for Selection in X + Y and Other Multisets

Published:1978-10 Issue:4 Volume:25 Page:556-570
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Johnson Donald B.¹,Kashdan Samuel D.¹

Affiliation:

1. Computer Science Department, The Pennsylvania State University, University Park, PA

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference23 articles.

1. AHO A V HOPCROFT J E AND ULLMAN J D The Destgn andAnalvsls of ComputerAlgortthms Addison- Wesley Reading Mass 1974 AHO A V HOPCROFT J E AND ULLMAN J D The Destgn andAnalvsls of ComputerAlgortthms Addison- Wesley Reading Mass 1974

2. DOBKIN D.P AND LIPTON R J On the complexity of computations under varying sets of primitives J Comptr Syst Scl. To appear. DOBKIN D.P AND LIPTON R J On the complexity of computations under varying sets of primitives J Comptr Syst Scl. To appear.

3. Algorithm 97: Shortest path

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games;Information and Computation;2017-06

2. Percentile queries in multi-dimensional Markov decision processes;Formal Methods in System Design;2017-01-05

3. The complexity of the Kth largest subset problem and related problems;Information Processing Letters;2016-02

4. The computational complexity of the criticality problems in a network with interval activity times;European Journal of Operational Research;2002-02

5. Optimal algorithms for generalized searching in sorted matrices;Theoretical Computer Science;1997-11