default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNairen Cao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Hao-Ren Yao
, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman:
Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. ACM Trans. Comput. Heal. 5(2): 10:1-10:28 (2024)- [c18]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15 - [c17]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. SODA 2024: 4124-4154 - [c16]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster Linear Program for Correlation Clustering. STOC 2024: 1605-1616 - [i8]Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl:
Understanding the Cluster LP for Correlation Clustering. CoRR abs/2404.17509 (2024) - 2023
- [c15]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract). HOPC@SPAA 2023: 3-4 - [c14]Nairen Cao, Jeremy T. Fineman:
Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. SODA 2023: 4354-4372 - [c13]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. SPAA 2023: 249-259 - [i7]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR abs/2303.00811 (2023) - [i6]Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. CoRR abs/2307.06723 (2023) - 2022
- [j1]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. ACM Trans. Algorithms 18(1): 5:1-5:24 (2022) - [c12]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. ISAAC 2022: 36:1-36:16 - [c11]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Parallel Shortest Paths with Negative Edge Weights. SPAA 2022: 177-190 - [c10]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Brief Announcement: Nested Active-Time Scheduling. SPAA 2022: 381-383 - [i5]Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - [i4]Hao-Ren Yao, Nairen Cao, Katina Russell, Der-Chen Chang, Ophir Frieder, Jeremy T. Fineman:
Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax. CoRR abs/2209.00655 (2022) - 2021
- [c9]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. PODC 2021: 493-496 - 2020
- [c8]Nairen Cao, Adam O'Neill, Mohammad Zaheri:
Toward RSA-OAEP Without Random Oracles. Public Key Cryptography (1) 2020: 279-308 - [c7]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. SPAA 2020: 511-513 - [c6]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient construction of directed hopsets and parallel approximate shortest paths. STOC 2020: 336-349
2010 – 2019
- 2019
- [c5]Linru Zhang, Gongxian Zeng, Yuechen Chen, Nairen Cao, Siu-Ming Yiu, Zheli Liu:
OC-ORAM: Constant Bandwidth ORAM with Smaller Block Size using Oblivious Clear Algorithm. ICETE (2) 2019: 149-160 - [c4]Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. SODA 2019: 2053-2070 - [i3]Nairen Cao, Jeremy T. Fineman, Katina Russell:
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths. CoRR abs/1912.05506 (2019) - 2018
- [i2]Nairen Cao, Adam O'Neill, Mohammad Zaheri:
Towards RSA-OAEP without Random Oracles. IACR Cryptol. ePrint Arch. 2018: 1170 (2018) - 2017
- [i1]Linru Zhang, Gongxian Zeng, Yuechen Chen, Siu-Ming Yiu, Nairen Cao, Zheli Liu:
Constant bandwidth ORAM with small block size using PIR operations. IACR Cryptol. ePrint Arch. 2017: 590 (2017) - 2016
- [c3]Xiaoqi Yu, Nairen Cao, Jun Zhang, Siu-Ming Yiu:
Dynamic Proofs of Retrievability with improved worst case overhead. CNS 2016: 576-580 - [c2]Xiaoqi Yu, Nairen Cao, Gongxian Zeng, Ruoqing Zhang, Siu-Ming Yiu:
LRCRYPT: Leakage-Resilient Cryptographic System (Design and Implementation). WISA 2016: 233-244 - 2015
- [c1]Nairen Cao, Xiaoqi Yu, Yufang Yang, Linru Zhang, Siu-Ming Yiu:
An ORAM Scheme with Improved Worst-Case Computational Overhead. ICICS 2015: 393-405
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
