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:
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
Krzysztof Nowicki, Krzysztof Onak
Society for Industrial and Applied Mathematics eBooks (2021), pp. 2939-2958
Open Access | Times Cited: 5
Krzysztof Nowicki, Krzysztof Onak
Society for Industrial and Applied Mathematics eBooks (2021), pp. 2939-2958
Open Access | Times Cited: 5
Showing 5 citing articles:
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
Prashant Pandey, Brian Wheatman, Helen Xu, et al.
Proceedings of the 2022 International Conference on Management of Data (2021)
Open Access | Times Cited: 31
Prashant Pandey, Brian Wheatman, Helen Xu, et al.
Proceedings of the 2022 International Conference on Management of Data (2021)
Open Access | Times Cited: 31
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
Streaming Graph Algorithms in the Massively Parallel Computation Model
Artur Czumaj, Gopinath Mishra, Anish Mukherjee
(2024), pp. 496-507
Closed Access
Artur Czumaj, Gopinath Mishra, Anish Mukherjee
(2024), pp. 496-507
Closed Access
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, et al.
Proceedings of the ACM on Measurement and Analysis of Computing Systems (2021) Vol. 5, Iss. 1, pp. 1-33
Open Access | Times Cited: 3
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, et al.
Proceedings of the ACM on Measurement and Analysis of Computing Systems (2021) Vol. 5, Iss. 1, pp. 1-33
Open Access | Times Cited: 3
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
