| Theoretically efficient parallel graph algorithms can be fast and scalable L Dhulipala, GE Blelloch, J Shun ACM Transactions on Parallel Computing (TOPC) 8 (1), 1-70, 2021 | 189 | 2021 |
| Smaller and faster: Parallel processing of compressed graphs with Ligra+ J Shun, L Dhulipala, GE Blelloch 2015 Data Compression Conference, 403-412, 2015 | 172 | 2015 |
| Julienne: A framework for parallel graph algorithms using work-efficient bucketing L Dhulipala, G Blelloch, J Shun Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017 | 153 | 2017 |
| Low-latency graph streaming using compressed purely-functional trees L Dhulipala, GE Blelloch, J Shun Proceedings of the 40th ACM SIGPLAN conference on programming language …, 2019 | 141 | 2019 |
| Compressing graphs and indexes with recursive graph bisection L Dhulipala, I Kabiljo, B Karrer, G Ottaviano, S Pupyrev, A Shalita Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge …, 2016 | 128 | 2016 |
| ParlayLib-a toolkit for parallel algorithms on shared-memory multicore machines GE Blelloch, D Anderson, L Dhulipala Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 83 | 2020 |
| A simple and practical linear-work parallel algorithm for connectivity J Shun, L Dhulipala, G Blelloch Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014 | 74 | 2014 |
| Near-optimal massively parallel graph connectivity S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 61 | 2019 |
| Parallel batch-dynamic graph connectivity UA Acar, D Anderson, GE Blelloch, L Dhulipala The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 381-392, 2019 | 51 | 2019 |
| Optimizing ordered graph algorithms with graphit Y Zhang, A Brahmakshatriya, X Chen, L Dhulipala, S Kamil, ... Proceedings of the 18th ACM/IEEE International Symposium on Code Generation …, 2020 | 49 | 2020 |
| Parallel clique counting and peeling algorithms J Shi, L Dhulipala, J Shun SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21 …, 2021 | 46 | 2021 |
| The Graph Based Benchmark Suite (GBBS) L Dhulipala, J Shi, T Tseng, GE Blelloch, J Shun Proceedings of the 3rd Joint International Workshop on Graph Data Management …, 2020 | 45 | 2020 |
| Sage: Parallel semi-asymmetric graph algorithms for NVRAMs L Dhulipala, C McGuffey, H Kang, Y Gu, GE Blelloch, PB Gibbons, J Shun arXiv preprint arXiv:1910.12310, 2019 | 44 | 2019 |
| Connectit: A framework for static and incremental parallel graph connectivity algorithms L Dhulipala, C Hong, J Shun arXiv preprint arXiv:2008.03909, 2020 | 43 | 2020 |
| Massively parallel computation via remote memory access S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy ACM Transactions on Parallel Computing 8 (3), 1-25, 2021 | 40 | 2021 |
| Batch-parallel euler tour trees T Tseng, L Dhulipala, G Blelloch 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019 | 40 | 2019 |
| Scalable community detection via parallel correlation clustering J Shi, L Dhulipala, D Eisenstat, J Łącki, V Mirrokni arXiv preprint arXiv:2108.01731, 2021 | 36 | 2021 |
| Parallel Batch-Dynamic k-Clique Counting L Dhulipala, QC Liu, J Shun, S Yu Symposium on Algorithmic Principles of Computer Systems (APOCS), 129-143, 2021 | 34 | 2021 |
| Parallel batch-dynamic graphs: Algorithms and lower bounds L Dhulipala, D Durfee, J Kulkarni, R Peng, S Sawlani, X Sun Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 31 | 2020 |
| Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs L Dhulipala, QC Liu, S Raskhodnikova, J Shi, J Shun, S Yu 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 29 | 2022 |
Julian ShunMITVerifierad e-postadress på mit.edu
