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:
Streaming Sparse Graphs using Efficient Dynamic Sets
Brian Wheatman, Randal Burns
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 284-294
Closed Access | Times Cited: 8
Brian Wheatman, Randal Burns
2021 IEEE International Conference on Big Data (Big Data) (2021), pp. 284-294
Closed Access | Times Cited: 8
Showing 8 citing articles:
High-Performance Graph Storage and Mutation for Graph Processing and Streaming
Soukaina Firmli, Dalila Chiadmi
International journal of electrical and computer engineering systems (2025) Vol. 16, Iss. 1, pp. 19-30
Open Access
Soukaina Firmli, Dalila Chiadmi
International journal of electrical and computer engineering systems (2025) Vol. 16, Iss. 1, pp. 19-30
Open Access
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
(2024), pp. 348-363
Open Access | Times Cited: 2
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
(2024), pp. 348-363
Open Access | Times Cited: 2
Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage
Jifan Shi, Baochao Wang, Yun Xu
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 1, pp. 1-26
Closed Access | Times Cited: 2
Jifan Shi, Baochao Wang, Yun Xu
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 1, pp. 1-26
Closed Access | Times Cited: 2
DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs
Naw Safrin Sattar, Khaled Z. Ibrahim, Aydın Buluç, et al.
International Journal of Parallel Programming (2024) Vol. 53, Iss. 1
Closed Access | Times Cited: 1
Naw Safrin Sattar, Khaled Z. Ibrahim, Aydın Buluç, et al.
International Journal of Parallel Programming (2024) Vol. 53, Iss. 1
Closed Access | Times Cited: 1
Online List Labeling: Breaking the log2n Barrier
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
Open Access | Times Cited: 4
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022)
Open Access | Times Cited: 4
Layered List Labeling
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 2, pp. 1-19
Closed Access
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 2, pp. 1-19
Closed Access
Nearly Optimal List Labeling
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
(2024), pp. 2253-2274
Closed Access
Michael A. Bender, Alex Conway, Martı́n Farach-Colton, et al.
(2024), pp. 2253-2274
Closed Access
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
arXiv (Cornell University) (2023)
Open Access
Brian Wheatman, Randal Burns, Aydın Buluç, et al.
arXiv (Cornell University) (2023)
Open Access
