Nairen Cao

According to our database, Nairen Cao authored at least 23 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax.

Hao-Ren Yao, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman

ACM Trans. Comput. Heal., April, 2024

Understanding the Cluster LP for Correlation Clustering.

Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl

CoRR, 2024

Understanding the Cluster Linear Program for Correlation Clustering.

Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds.

Nairen Cao, Shang-En Huang, Hsin-Hao Su

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights.

Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights.

Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su

CoRR, 2023

Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence.

Nairen Cao, Shang-En Huang, Hsin-Hao Su

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth.

Nairen Cao, Jeremy T. Fineman

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract).

Nairen Cao, Jeremy T. Fineman, Katina Russell

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022

I/O-Efficient Algorithms for Topological Sort and Related Problems.

Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang

ACM Trans. Algorithms, 2022

Parallel Shortest Paths with Negative Edge Weights.

Nairen Cao, Jeremy T. Fineman, Katina Russell

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Nested Active-Time Scheduling.

Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Nested Active-Time Scheduling.

Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm.

Nairen Cao, Jeremy T. Fineman, Katina Russell

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Efficient construction of directed hopsets and parallel approximate shortest paths.

Nairen Cao, Jeremy T. Fineman, Katina Russell

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths.

Nairen Cao, Jeremy T. Fineman, Katina Russell

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Toward RSA-OAEP Without Random Oracles.

Nairen Cao, Adam O'Neill, Mohammad Zaheri

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019

OC-ORAM: Constant Bandwidth ORAM with Smaller Block Size using Oblivious Clear Algorithm.

Linru Zhang, Gongxian Zeng, Yuechen Chen, Nairen Cao, Siu-Ming Yiu, Zheli Liu

Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, 2019

2018

Towards RSA-OAEP without Random Oracles.

Nairen Cao, Adam O'Neill, Mohammad Zaheri

IACR Cryptol. ePrint Arch., 2018

2017

Constant bandwidth ORAM with small block size using PIR operations.

Linru Zhang, Gongxian Zeng, Yuechen Chen, Siu-Ming Yiu, Nairen Cao, Zheli Liu

IACR Cryptol. ePrint Arch., 2017

2016

LRCRYPT: Leakage-Resilient Cryptographic System (Design and Implementation).

Xiaoqi Yu, Nairen Cao, Gongxian Zeng, Ruoqing Zhang, Siu-Ming Yiu

Proceedings of the Information Security Applications - 17th International Workshop, 2016

Dynamic Proofs of Retrievability with improved worst case overhead.

Xiaoqi Yu, Nairen Cao, Jun Zhang, Siu-Ming Yiu

Proceedings of the 2016 IEEE Conference on Communications and Network Security, 2016

2015

An ORAM Scheme with Improved Worst-Case Computational Overhead.

Nairen Cao, Xiaoqi Yu, Yufang Yang, Linru Zhang, Siu-Ming Yiu

Proceedings of the Information and Communications Security - 17th International Conference, 2015