| Packed Compressed Sparse Row: A Dynamic Graph Representation B Wheatman, H Xu IEEE HPEC, 2018 | 58 | 2018 |
| Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs P Pandey, B Wheatman, H Xu, A Buluc Proceedings of the 2021 International Conference on Management of Data, 1372 …, 2021 | 39 | 2021 |
| A Parallel Packed Memory Array to Store Dynamic Graphs B Wheatman, H Xu 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021 | 21 | 2021 |
| Streaming Sparse Graphs using Efficient Dynamic Sets B Wheatman, R Burns 2021 IEEE International Conference on Big Data (Big Data), 284-294, 2021 | 8 | 2021 |
| Electricity demand and population dynamics prediction from mobile phone metadata B Wheatman, A Noriega, A Pentland Social, Cultural, and Behavioral Modeling: 9th International Conference, SBP …, 2016 | 7 | 2016 |
| RADICS: Runtime Assurance of Distributed Intelligent Control Systems B Wheatman, J Chen, T Sookoor, Y Amir 2021 51st Annual IEEE/IFIP International Conference on Dependable Systems …, 2021 | 4 | 2021 |
| High-throughput image alignment for connectomics using frugal snap judgments: poster T Kaler, B Wheatman, S Wooders Proceedings of the 24th Symposium on Principles and Practice of Parallel …, 2019 | 3 | 2019 |
| High-Throughput Image Alignment for Connectomics using Frugal Snap Judgments T Kaler, B Wheatman, S Wooders 2020 IEEE High Performance Extreme Computing Conference (HPEC), 1-9, 2020 | 2 | 2020 |
| CPMA: An efficient batch-parallel compressed set without pointers B Wheatman, R Burns, A Buluc, H Xu Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and …, 2024 | 1 | 2024 |
| BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees H Xu, A Li, B Wheatman, M Marneni, P Pandey Proceedings of the VLDB Endowment 16 (11), 2023 | 1 | 2023 |
| Optimizing Search Layouts in Packed Memory Arrays B Wheatman, R Burns, A Buluç, H Xu 2023 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2023 | 1 | 2023 |
| Image alignment and dynamic graph analytics: two case studies of how managing data movement can make (parallel) code run fast B Wheatman Massachusetts Institute of Technology, 2019 | 1 | 2019 |
| Masked Matrix Multiplication for Emergent Sparsity B Wheatman, M Madhyastha, R Burns arXiv preprint arXiv:2402.14118, 2024 | | 2024 |
| Anti-magic and Edge Graceful Graphs B Wheatman | | |
| Tourist Path Optimization Problem B Wheatman, S Karaman, D Rus | | |
Helen XuGeorgia Institute of TechnologyVerified email at gatech.edu
