CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers

Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu 0001. CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. In Michel Steuwer, I-Ting Angelina Lee, Milind Chabbi, editors, Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2024, Edinburgh, United Kingdom, March 2-6, 2024. pages 348-363, ACM, 2024. [doi]

@inproceedings{WheatmanBB024,
  title = {CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers},
  author = {Brian Wheatman and Randal C. Burns and Aydin Buluç and Helen Xu 0001},
  year = {2024},
  doi = {10.1145/3627535.3638492},
  url = {https://doi.org/10.1145/3627535.3638492},
  researchr = {https://researchr.org/publication/WheatmanBB024},
  cites = {0},
  citedby = {0},
  pages = {348-363},
  booktitle = {Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2024, Edinburgh, United Kingdom, March 2-6, 2024},
  editor = {Michel Steuwer and I-Ting Angelina Lee and Milind Chabbi},
  publisher = {ACM},
}