Slowing down sorting networks to obtain faster sorting algorithms-Reference-Cited by-同舟云学术

Slowing down sorting networks to obtain faster sorting algorithms

Published:1987-01 Issue:1 Volume:34 Page:200-208
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Cole Richard¹

Affiliation:

1. New York Univ., New York, NY

Abstract

Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O (log n ) time (or more) for many applications of this technique.

Publisher

Association for Computing Machinery (ACM)

Subject

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

Link

https://dl.acm.org/doi/pdf/10.1145/7531.7537

Reference17 articles.

1. AJTAI M. KOMLOS J. AND SZEMEREDI E. An O(n log n) sorting network. Combinatorica 3 (1983) 1-19. 10.1007/BF02579338 AJTAI M. KOMLOS J. AND SZEMEREDI E. An O(n log n) sorting network. Combinatorica 3 (1983) 1-19. 10.1007/BF02579338

2. A parallel median algorithm;COLE R.;Inf. Process. Lett.,1985

3. COLE R. SHARIR M. AND YAP C. On k-hulls and related problems. SIAM J. Comput. to appear. 10.1137/0216005 COLE R. SHARIR M. AND YAP C. On k-hulls and related problems. SIAM J. Comput. to appear. 10.1137/0216005

4. FREDERICKSON G. AND JOHNSON D. Finding k-th paths and p-centers by generating and searching good data structures. ~ Algorithms 4 (1983) 61-80. FREDERICKSON G. AND JOHNSON D. Finding k-th paths and p-centers by generating and searching good data structures. ~ Algorithms 4 (1983) 61-80.

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

1. Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance;ACM Transactions on Algorithms;2024-03-13

2. Connectivity with Uncertainty Regions Given as Line Segments;Algorithmica;2024-01-09

3. Dispersing facilities on planar segment and circle amidst repulsion;Journal of Global Optimization;2023-06-20

4. Discrete Fréchet distance for closed curves;Computational Geometry;2023-04

5. Intersecting disks using two congruent disks;Computational Geometry;2023-03