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:
Parallel Algorithms for Butterfly Computations
Jessica Shi, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2019), pp. 16-30
Open Access | Times Cited: 33
Jessica Shi, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2019), pp. 16-30
Open Access | Times Cited: 33
Showing 26-50 of 33 citing articles:
RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs
Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 2
Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna, et al.
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 2
Parallel Batch-Dynamic k-Core Decomposition.
Quanquan C. Liu, Jessica Shi, Shangdi Yu, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 2
Quanquan C. Liu, Jessica Shi, Shangdi Yu, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 2
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang, Xuemin Lin, Lu Qin, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Kai Wang, Xuemin Lin, Lu Qin, et al.
arXiv (Cornell University) (2020)
Open Access | Times Cited: 1
Parallel Five-cycle Counting Algorithms
Jessica Shi, Louisa Ruixue Huang, Julian Shun
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-23
Open Access | Times Cited: 1
Jessica Shi, Louisa Ruixue Huang, Julian Shun
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-23
Open Access | Times Cited: 1
Counting Butterfies from a Large Bipartite Graph Stream
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sarıyüce, et al.
arXiv (Cornell University) (2018)
Closed Access
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sarıyüce, et al.
arXiv (Cornell University) (2018)
Closed Access
Introduction
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 1-5
Closed Access
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 1-5
Closed Access
CSS on Bipartite Networks
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 11-26
Closed Access
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 11-26
Closed Access
Comparison Analysis
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 47-55
Closed Access
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 47-55
Closed Access
