| Efficient construction of directed hopsets and parallel approximate shortest paths N Cao, JT Fineman, K Russell Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 19 | 2020 |
| Brief announcement: An improved distributed approximate single source shortest paths algorithm N Cao, JT Fineman, K Russell Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 13 | 2021 |
| Improved work span tradeoff for single source reachability and approximate shortest paths N Cao, JT Fineman, K Russell Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 11 | 2020 |
| Toward RSA-OAEP without random oracles N Cao, A O’Neill, M Zaheri IACR International Conference on Public-Key Cryptography, 279-308, 2020 | 7 | 2020 |
| Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds N Cao, SE Huang, HH Su Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 3 | 2024 |
| Nearly optimal parallel algorithms for longest increasing subsequence N Cao, SE Huang, HH Su Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 3 | 2023 |
| Parallel exact shortest paths in almost linear work and square root depth N Cao, JT Fineman Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 3 | 2023 |
| Parallel shortest paths with negative edge weights N Cao, JT Fineman, K Russell Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 3 | 2022 |
| I/O-efficient algorithms for topological sort and related problems N Cao, JT Fineman, K Russell, E Yang ACM Transactions on Algorithms (TALG) 18 (1), 1-24, 2022 | 3 | 2022 |
| Understanding the Cluster LP for Correlation Clustering N Cao, V Cohen-Addad, E Lee, S Li, A Newman, L Vogl arXiv preprint arXiv:2404.17509, 2024 | 1 | 2024 |
| Self-supervised representation learning on electronic health records with graph kernel infomax HR Yao, N Cao, K Russell, DC Chang, O Frieder, JT Fineman ACM Transactions on Computing for Healthcare 5 (2), 1-28, 2024 | 1 | 2024 |
| Parallel and distributed exact single-source shortest paths with negative edge weights V Ashvinkumar, A Bernstein, N Cao, C Grunau, B Haeupler, Y Jiang, ... arXiv preprint arXiv:2303.00811, 2023 | 1 | 2023 |
| Understanding the Cluster Linear Program for Correlation Clustering N Cao, V Cohen-Addad, E Lee, S Li, A Newman, L Vogl | | 2024 |
| Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths N Cao, JT Fineman, K Russell Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 3-4, 2023 | | 2023 |
| Nested Active-Time Scheduling N Cao, JT Fineman, S Li, J Mestre, K Russell, SW Umboh arXiv preprint arXiv:2207.12507, 2022 | | 2022 |
| Brief Announcement: Nested Active-Time Scheduling N Cao, JT Fineman, S Li, J Mestre, K Russell, SW Umboh Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | | 2022 |
| Single-Source Shortest Paths for Directed Graphs N Cao Georgetown University, 2022 | | 2022 |
| LRCRYPT: Leakage-Resilient Cryptographic System (Design and Implementation) X Yu, N Cao, G Zeng, R Zhang, SM Yiu International Workshop on Information Security Applications, 233-244, 2016 | | 2016 |
| An ORAM Scheme with Improved Worst-Case Computational Overhead N Cao, X Yu, Y Yang, L Zhang, SM Yiu International Conference on Information and Communications Security, 393-405, 2015 | | 2015 |
Adam O'NeillUniversity of Massachusetts AmherstVerified email at cs.umass.edu
