default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 23 matches
- 2024
- Zitian Huo, Yaqi Duan, Dongdong Zhan, Xizhen Xu, Nairen Zheng, Jing Cai, Ruifang Sun, Jianping Wang, Fang Cheng, Zhan Gao, Caixia Xu, Wanlin Liu, Yuting Dong, Sailong Ma, Qian Zhang, Yiyun Zheng, Liping Lou, Dong Kuang, Qian Chu, Jun Qin, Guoping Wang, Yi Wang:
Proteomic Stratification of Prognosis and Treatment Options for Small Cell Lung Cancer. Genom. Proteom. Bioinform. 22(1) (2024) - 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 - Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. SODA 2024: 4124-4154 - 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 - 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
- Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence. SPAA 2023: 249-259 - 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) - Nairen Cao, Shang-En Huang, Hsin-Hao Su:
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds. CoRR abs/2307.06723 (2023) - 2022
- Prashant Kumar, Shivam Shakti, Naireet Datta, Shashwat Sinha, Partha Ghosh:
Feature selection using PRACO method for IDS in cloud environment. J. Intell. Fuzzy Syst. 43(5): 5487-5500 (2022) - 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 - 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 - Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, Seeun William Umboh:
Nested Active-Time Scheduling. CoRR abs/2207.12507 (2022) - 2021
- Nai-Ren Shih, Tsung-Yi Ho:
A Multi-Commodity Network Flow Based Routing Algorithm for Paper-Based Digital Microfluidic Biochips. ASP-DAC 2021: 73-78 - 2019
- Abdulghani Ragaa Alharbi, Shailesh Naire:
An adaptive moving mesh method for two-dimensional thin film flow equations with surface tension. J. Comput. Appl. Math. 356: 219-230 (2019) - Naireen Zaheer, Adeeb Shehzaad, Syed Omer Gilani, Jawad Aslam, Syed Ali Zaidi:
Automated Classification of Retinal Diseases in STARE Database Using Neural Network Approach. CCECE 2019: 1-5 - 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 - 2017
- Abdulghani Ragaa Alharbi, Shailesh Naire:
An adaptive moving mesh method for thin film flow equations with surface tension. J. Comput. Appl. Math. 319: 365-384 (2017) - 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
- Xiaoqi Yu, Nairen Cao, Jun Zhang, Siu-Ming Yiu:
Dynamic Proofs of Retrievability with improved worst case overhead. CNS 2016: 576-580 - Xiaoqi Yu, Nairen Cao, Gongxian Zeng, Ruoqing Zhang, Siu-Ming Yiu:
LRCRYPT: Leakage-Resilient Cryptographic System (Design and Implementation). WISA 2016: 233-244 - 2015
- Nairen Cao, Xiaoqi Yu, Yufang Yang, Linru Zhang, Siu-Ming Yiu:
An ORAM Scheme with Improved Worst-Case Computational Overhead. ICICS 2015: 393-405 - 2010
- Shuai Mu, Xinya Zhang, Nairen Zhang, Jiaxin Lu, Yangdong Steve Deng, Shu Zhang:
IP routing processing with graphic processors. DATE 2010: 93-98 - 2000
- R. J. Braun, S. Naire, S. A. Snow:
Limiting Cases of Gravitational Drainage of a Vertical Free Film for Evaluating Surfactants. SIAM J. Appl. Math. 61(3): 889-913 (2000)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-13 14:49 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint