受强制性开放获取政策约束的文章 - Nairen Cao了解详情
无法在其他位置公开访问的文章：1 篇
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
强制性开放获取政策： 国家自然科学基金委员会
可在其他位置公开访问的文章：10 篇
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
强制性开放获取政策： US National Science Foundation, US National Institutes of Health
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
Toward RSA-OAEP without random oracles
N Cao, A O’Neill, M Zaheri
IACR International Conference on Public-Key Cryptography, 279-308, 2020
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： 国家自然科学基金委员会
出版信息和资助信息由计算机程序自动确定