default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNeng Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Joshua Brakensiek, Neng Huang
, Uri Zwick:
Tight approximability of MAX 2-SAT and relatives, under UGC. SODA 2024: 1328-1344- [i8]Neng Huang, Will Perkins, Aaron Potechin:
Hardness of sampling for the anti-ferromagnetic Ising model on random graphs. CoRR abs/2409.03974 (2024) - 2023
- [j12]Neng Huang, Minghua Xu, Fan Nie, Peng Ni, Chuan-Le Xiao, Feng Luo, Jianxin Wang:
NanoSNP: a progressive and haplotype-aware SNP caller on low-coverage nanopore sequencing data. Bioinform. 39(1) (2023) - [j11]Neng Huang, Heng Li:
compleasm: a faster and more accurate reimplementation of BUSCO. Bioinform. 39(10) (2023) - [c7]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. FOCS 2023: 234-252 - [i7]Antares Chen, Neng Huang, Kunal Marwaha:
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs. CoRR abs/2310.01563 (2023) - [i6]Joshua Brakensiek, Neng Huang, Uri Zwick:
Tight approximability of MAX 2-SAT and relatives, under UGC. CoRR abs/2310.12911 (2023) - 2022
- [j10]Neng Huang, Fan Nie, Peng Ni, Xin Gao, Feng Luo, Jianxin Wang:
BlockPolish: accurate polishing of long-read assembly via block divide-and-conquer. Briefings Bioinform. 23(1) (2022) - [j9]Jun Zhang, Fan Nie, Neng Huang, Peng Ni, Feng Luo, Jianxin Wang:
Fec: a fast error correction method based on two-rounds overlapping and caching. Bioinform. 38(19): 4629-4632 (2022) - [j8]Neng Huang, Fan Nie, Peng Ni, Feng Luo, Jianxin Wang:
SACall: A Neural Network Basecaller for Oxford Nanopore Sequencing Data Based on Self-Attention Mechanism. IEEE ACM Trans. Comput. Biol. Bioinform. 19(1): 614-623 (2022) - [i5]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
Separating MAX 2-AND, MAX DI-CUT and MAX CUT. CoRR abs/2212.11191 (2022) - 2021
- [j7]Kang Hu, Neng Huang, You Zou, Xingyu Liao, Jianxin Wang:
MultiNanopolish: refined grouping method for reducing redundant calculations in Nanopolish. Bioinform. 37(17): 2757-2760 (2021) - [j6]Neng Huang, Fan Nie, Peng Ni, Feng Luo, Xin Gao, Jianxin Wang:
NeuralPolish: a novel Nanopore polishing method based on alignment matrix construction and orthogonal Bi-GRU Networks. Bioinform. 37(19): 3120-3127 (2021) - [j5]Neng Huang, Junxing Zhu, Chaonian Guo, Shuhan Cheng, Xiaoyong Li:
A Novel Hash Chain-Based Data Availability Monitoring Method for Off-site Disaster Recovery Architecture. J. Circuits Syst. Comput. 30(16): 2150294:1-2150294:28 (2021) - [c6]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. SODA 2021: 484-503 - 2020
- [j4]Guanlan Tan, Qilong Feng, Beilin Zhuo, Neng Huang, Jianxin Wang:
New kernels for several problems on planar graphs. Theor. Comput. Sci. 806: 587-594 (2020) - [c5]Neng Huang, Aaron Potechin:
On the Approximability of Presidential Type Predicates. APPROX-RANDOM 2020: 58:1-58:20 - [i4]Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick:
On the Mysteries of MAX NAE-SAT. CoRR abs/2009.10677 (2020)
2010 – 2019
- 2019
- [j3]Peng Ni, Neng Huang, Zhi Zhang, De-Peng Wang, Fan Liang, Yu Miao, Chuan-Le Xiao, Feng Luo, Jianxin Wang:
DeepSignal: detecting DNA methylation state from Nanopore sequencing reads using deep-learning. Bioinform. 35(22): 4586-4595 (2019) - [j2]Qilong Feng, Jiaxin Hu, Neng Huang, Jianxin Wang:
Improved PTAS for the constrained k-means problem. J. Comb. Optim. 37(4): 1091-1110 (2019) - [c4]Neng Huang, Fan Nie, Peng Ni, Feng Luo, Jianxin Wang:
An attention-based neural network basecaller for Oxford Nanopore sequencing data. BIBM 2019: 390-394 - [i3]Neng Huang, Aaron Potechin:
On the Approximability of Presidential Type Predicates. CoRR abs/1907.04451 (2019) - 2018
- [j1]Qilong Feng, Neng Huang, Xiong Jiang, Jianxin Wang:
Dealing with several parameterized problems by random methods. Theor. Comput. Sci. 734: 94-104 (2018) - [c3]Xiaoyu He, Neng Huang, Xiaoming Sun:
On the Decision Tree Complexity of String Matching. ESA 2018: 45:1-45:13 - [c2]Qilong Feng, Beilin Zhuo, Guanlan Tan, Neng Huang, Jianxin Wang:
Improved Kernels for Several Problems on Planar Graphs. FAW 2018: 169-180 - [i2]George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden:
The idemetric property: when most distances are (almost) the same. CoRR abs/1804.11187 (2018) - 2017
- [i1]Xiaoyu He, Neng Huang, Xiaoming Sun:
On the Decision Tree Complexity of String Matching. CoRR abs/1712.09738 (2017) - 2013
- [c1]Neng Huang, Zhiyuan Shao, Hai Jin:
FRESA: A Frequency-Sensitive Sampling-Based Approach for Data Race Detection. NPC 2013: 49-60
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-24 21:29 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:
