OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!
If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.
Requested Article:
Optimal Parallel Algorithms in the Binary-Forking Model
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, et al.
(2020)
Open Access | Times Cited: 43
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, et al.
(2020)
Open Access | Times Cited: 43
Showing 26-50 of 43 citing articles:
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model
Michael T. Goodrich, Riko Jacob, Nodari Sitchinava
Society for Industrial and Applied Mathematics eBooks (2021), pp. 2141-2153
Open Access | Times Cited: 3
Michael T. Goodrich, Riko Jacob, Nodari Sitchinava
Society for Industrial and Applied Mathematics eBooks (2021), pp. 2141-2153
Open Access | Times Cited: 3
Parallel Minimum Cuts in O ( m log 2 n ) Work and Low Depth
Daniel Anderson, Guy E. Blelloch
(2021), pp. 71-82
Open Access | Times Cited: 3
Daniel Anderson, Guy E. Blelloch
(2021), pp. 71-82
Open Access | Times Cited: 3
Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu, Zachary Napier, Yihan Sun
Society for Industrial and Applied Mathematics eBooks (2022), pp. 46-60
Open Access | Times Cited: 2
Yan Gu, Zachary Napier, Yihan Sun
Society for Industrial and Applied Mathematics eBooks (2022), pp. 46-60
Open Access | Times Cited: 2
Brief Announcement
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
(2022), pp. 291-293
Closed Access | Times Cited: 2
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
(2022), pp. 291-293
Closed Access | Times Cited: 2
Low-Span Parallel Algorithms for the Binary-Forking Model
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
(2021), pp. 22-34
Open Access | Times Cited: 2
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
(2021), pp. 22-34
Open Access | Times Cited: 2
Optimal Multithreaded Batch-Parallel 2-3 Trees.
Wei Quan Lim
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 1
Wei Quan Lim
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 1
Parallel Finger Search Structures
Seth Gilbert, Wei Quan Lim
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 1
Seth Gilbert, Wei Quan Lim
arXiv (Cornell University) (2019)
Closed Access | Times Cited: 1
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Parallel Nearest Neighbors in Low Dimensions with Batch Updates
Guy E. Blelloch, Magdalen Dobson
Society for Industrial and Applied Mathematics eBooks (2022), pp. 195-208
Open Access | Times Cited: 1
Guy E. Blelloch, Magdalen Dobson
Society for Industrial and Applied Mathematics eBooks (2022), pp. 195-208
Open Access | Times Cited: 1
Parallel Shortest Paths with Negative Edge Weights
Nairen Cao, Jeremy T. Fineman, Katina Russell
(2022), pp. 177-190
Closed Access | Times Cited: 1
Nairen Cao, Jeremy T. Fineman, Katina Russell
(2022), pp. 177-190
Closed Access | Times Cited: 1
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
Xiaojun Dong, Yan Gu, Yihan Sun, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
Space and Time Bounded Multiversion Garbage Collection
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 1
Efficient Parallel Cache-Oblivious Sorting Algorithms
Manas Kumar Panda, G. Sajith
2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) (2022), pp. 1-7
Closed Access
Manas Kumar Panda, G. Sajith
2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME) (2022), pp. 1-7
Closed Access
Efficient Parallel Self-Adjusting Computation
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, et al.
arXiv (Cornell University) (2021)
Closed Access
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, et al.
arXiv (Cornell University) (2021)
Closed Access
Fast Stencil Computations using Fast Fourier Transforms
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
arXiv (Cornell University) (2021)
Open Access
Zafar Ahmad, Rezaul Chowdhury, Rathish Das, et al.
arXiv (Cornell University) (2021)
Open Access
Efficient Parallel Self-Adjusting Computation
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, et al.
(2021), pp. 59-70
Open Access
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, et al.
(2021), pp. 59-70
Open Access
The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model
Guy E. Blelloch, Magdalen Dobson
arXiv (Cornell University) (2021)
Closed Access
Guy E. Blelloch, Magdalen Dobson
arXiv (Cornell University) (2021)
Closed Access
Analysis of Work-Stealing and Parallel Cache Complexity
Yan Gu, Zachary Napier, Yihan Sun
arXiv (Cornell University) (2021)
Open Access
Yan Gu, Zachary Napier, Yihan Sun
arXiv (Cornell University) (2021)
Open Access
