default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing Li 0001
Person information
- affiliation: University of Waterloo, ON, Canada
- affiliation (former): Cornell University, Ithaca, NY, USA
- affiliation (former): York University, Toronto, Canada
- affiliation (former): Harvard University, Cambridge, MA, USA
Other persons with the same name
- Ming Li — disambiguation page
- Ming Li 0002
![[0000-0002-2725-353X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2725-353X")
— East China Normal University, Shanghai, China (and 1 more) - Ming Li 0003 (aka: Ming (Fred) Li) — University of Arizona, Tucson, AZ, USA (and 2 more)
- Ming Li 0004 — Xidian University, National Key Lab of Radar Signal Processing, Xi'an, China
- Ming Li 0005 — Nanjing University, National Key Laboratory for Novel Software Technology, China
- Ming Li 0006 — University of Texas at Arlington, TX, USA (and 2 more)
- Ming Li 0007 — California State University, Fresno, CA, USA (and 1 more)
- Ming Li 0008 — Worcester Polytechnic Institute, MA, USA
- Ming Li 0009 — IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (and 1 more)
- Ming Li 0010 — Deakin University, VIC, Australia
- Ming Li 0011 — Dalian University of Technology, School of Information and Communication Engineering, China (and 2 more)
- Ming Li 0012 — Taiyuan University of Technology, College of Mathematics, China (and 1 more)
- Ming Li 0013 — China University of Mining & Technology, Xuzhou, China
- Ming Li 0014 — Unilever Corporate Research, Sharnbrook, Bedford, UK
- Ming Li 0015 — Lanzhou University of Technology, China
- Ming Li 0016 — RWTH Aachen University, Germany
- Ming Li 0017 — Zhejiang University, State Key Laboratory of CAD&CG, China
- Ming Li 0018 — Max-Planck-Institut für Informatik, Saarbrücken, Germany
- Ming Li 0019 — Carleton University, Ottawa, ON, Canada
- Ming Li 0020 — Google (and 1 more)
- Ming Li 0021 — Oracle (and 1 more)
- Ming Li 0022 — Vanderbilt University, Department of Biostatistics, Nashville, TN, USA
- Ming Li 0023 — Simon Fraser University, Burnaby, BC, Canada
- Ming Li 0024 — Concordia University, Department of Economics, Montreal, QC, Canada
- Ming Li 0025 — Chinese Academy of Sciences, Institute of Semiconductors, China (and 1 more)
- Ming Li 0026 — Duke Kunshan University, Data Science Research Center, China (and 3 more)
- Ming Li 0028 — National University of Defense Technology, College of Mechatronic Engineering and Automation, Changsha, China
- Ming Li 0029 — Beihang University, School of Automation Science and Electrical Engineering, Beijing, China (and 2 more)
- Ming Li 0030 — Auburn University MRI Research Center, Auburn, USA
- Ming Li 0031 — China University of Mining and Technology, School of Computer Science and Technology, Xuzhou, China
- Ming Li 0032 — Heidelberg University, Institute of Geography, Germany
- Ming Li 0033 — Chinese Academy of Sciences, Institute of Information Engineering, State Key Laboratory of Information Security, Beijing, China
- Ming Li 0034 — Beihang University, Institute of Solid Mechanics, Beijing, China
- Ming Li 0035 — Aalto University, Department of Computer Science, Espoo, Finland
- Ming Li 0036 — Honghe University, Department of Mathematics, Mengzi, Yunnan, China
- Ming Li 0037 — Wuhan University, State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing, China
- Ming Li 0038 — Second Military Medical University, Changhai Hospital, Department of Orthopaedics, Shanghai, China
- Ming Li 0039 — China Jiliang University, Department of Mathematics, Hangzhou, China
- Ming Li 0040 — Nanchang University, ISST, China (and 1 more)
- Ming Li 0041 — Tianjin Normal University, Tianjin Key Laboratory of Wireless Mobile Communications and Power Transmission, China (and 1 more)
- Ming Li 0042 — Hamburg University of Technology, Germany
- Ming Li 0043 — Unilever China (and 1 more)
- Ming Li 0044 — Colorado School of Mines, Department of Electrical Engineering and Computer Science, Golden, CO, USA
- Ming Li 0045 — Shanghai Jiao Tong University, Institute of Image Processing and Pattern Recognition, China
- Ming Li 0046 — Yanshan University, College of Electrical Engineering, Qinhuangdao, China
- Ming Li 0047 — Beijing Jiaotong University, School of Electronic and Information Engineering, China
- Ming Li 0048 — Sun Yat-sen University, School of Geography and Planning, Guangzhou, China
- Ming Li 0049 — Jinan University, College of Information Science and Technology, China
- Ming Li 0051 — China University of Petroleum, School of Economics and Management, Beijing, China
- Ming Li 0052 — National Institutes of Health, Center for Interventional Oncology / National Heart, Lung, and Blood Institute, Bethesda, MD, USA (and 1 more)
- Ming Li 0053 — Macquarie University, Sydney, NSW, Australia (and 3 more)
- Ming Li 0054 — Beihang University, School of Transportation Science and Engineering / Beijing Advanced Innovation Center for Big Data and Brain Computing, Beijing, China
- Ming Li 0055 — Hong Kong Polytechnic University, Department of Industrial and Systems Engineering, Hong Kong (and 2 more)
- Ming Li 0056 — Nanchang Hangkong University, MOE Key Laboratory of Nondestructive Testing, China (and 1 more)
- Ming Li 0057 — Ocean University of China, College of Engineering, Department of Automation, Qingdao, China (and 1 more)
- Ming Li 0058 — Shenyang University of Technology, School of Electrical Engineering, China
- Ming Li 0059 — National University of Defense Technology, College of Meteorology and Oceanography, Nanjing, China
- Ming Li 0060 — Harbin Engineering University, College of Computer Science and Technology, China
- Ming Li 0061 — Rizhao People's Hospital, Department of Nuclear Medicine, China
- Ming Li 0062 — CRRC Tangshan Company, Ltd., Tangshan, China
- Ming Li 0063 — Harbin Institute of Technology, Communication Research Center, China
- Ming Li 0064 — Beijing Institute of Technology, State Key Laboratory of Explosion Science and Technology, China
- Ming Li 0065 — Zhejiang Normal University, Department of Computer Science, Jinhua, China (and 2 more)
- Ming Li 0066 — National University of Defense Technology, College of Electronic Science and Technology, State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System, Changsha, China
- Ming Li 0067 — Lappeenranta University of Technology, LUT, Laboratory of Intelligent Machines, Department of Mechanical Engineering, Finland
- Ming Li 0068 — University of Amsterdam, IRLab, Netherlands (and 1 more)
- Ming Li 0069 — Nanjing University, School of Electronic Science and Engineering, China
- Ming Li 0070 — China University of Petroleum, School of Science, Qingdao, China (and 1 more)
- Ming Li 0071 — Jiangsu Ocean University, Department of Computer Science and Technology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i28]Ziguang Li, Chao Huang, Xuliang Wang, Haibo Hu, Cole Wyeth, Dongbo Bu, Quan Yu, Wen Gao, Xingwu Liu, Ming Li:
Understanding is Compression. CoRR abs/2407.07723 (2024)- 2023
- [j120]Zeping Mao, Ruixue Zhang, Lei Xin, Ming Li:
Mitigating the missing-fragmentation problem in de novo peptide sequencing with a two-stage graph-based deep learning model. Nat. Mac. Intell. 5(11): 1250-1260 (2023) - [i27]Cynthia Huang, Yuqing Xie, Zhiying Jiang, Jimmy Lin, Ming Li:
Approximating Human-Like Few-shot Learning with GPT-based Compression. CoRR abs/2308.06942 (2023) - 2022
- [j119]Ngoc Hieu Tran, Jinbo Xu, Ming Li:
A tale of solving two computational challenges in protein science: neoantigen prediction and protein structure prediction. Briefings Bioinform. 23(1) (2022) - [c117]Zhiying Jiang, Yiqin Dai, Ji Xin, Ming Li, Jimmy Lin:
Few-Shot Non-Parametric Learning with Deep Latent Variable Model. NeurIPS 2022 - [i26]Zhiying Jiang, Yiqin Dai, Ji Xin, Ming Li, Jimmy Lin:
Few-Shot Non-Parametric Learning with Deep Latent Variable Model. CoRR abs/2206.11573 (2022) - 2021
- [j118]Rui Qiao, Ngoc Hieu Tran, Lei Xin, Xin Chen, Ming Li, Baozhen Shan, Ali Ghodsi:
Computationally instrument-resolution-independent de novo peptide sequencing for high-resolution devices. Nat. Mach. Intell. 3(5): 420-425 (2021) - [j117]Wenju Zhang, Zhewei Liang, Xin Chen, Lei Xin, Baozhen Shan, Zhigang Luo, Ming Li:
ChimST: An Efficient Spectral Library Search Tool for Peptide Identification from Chimeric Spectra in Data-Dependent Acquisition. IEEE ACM Trans. Comput. Biol. Bioinform. 18(4): 1416-1425 (2021) - [c116]He Bai, Peng Shi, Jimmy Lin, Yuqing Xie, Luchen Tan, Kun Xiong, Wen Gao, Ming Li:
Segatron: Segment-Aware Transformer for Language Modeling and Understanding. AAAI 2021: 12526-12534 - [c115]He Bai, Peng Shi, Jimmy Lin, Luchen Tan, Kun Xiong, Wen Gao, Jie Liu, Ming Li:
Semantics of the Unwritten: The Effect of End of Paragraph and Sequence Tokens on Text Generation with GPT2. ACL (student) 2021: 148-162 - [c114]Mohan Zhang, Luchen Tan, Zihang Fu, Kun Xiong, Jimmy Lin, Ming Li, Zhengkai Tu:
Don't Change Me! User-Controllable Selective Paraphrase Generation. EACL 2021: 3522-3527 - [c113]Minghan Li, Ming Li, Kun Xiong, Jimmy Lin:
Multi-Task Dense Retrieval via Model Uncertainty Fusion for Open-Domain Question Answering. EMNLP (Findings) 2021: 274-287 - [c112]Anup Anand Deshmukh, Qianqiu Zhang, Ming Li, Jimmy Lin, Lili Mou:
Unsupervised Chunking as Syntactic Structure Induction with a Knowledge-Transfer Approach. EMNLP (Findings) 2021: 3626-3634 - 2020
- [j116]Ngoc Hieu Tran, Rui Qiao, Lei Xin, Xin Chen, Baozhen Shan, Ming Li:
Personalized deep learning of individual immunopeptidomes to identify neoantigens for cancer vaccines. Nat. Mach. Intell. 2(12): 764-771 (2020) - [c111]Hamidreza Shahidi, Ming Li, Jimmy Lin:
Two Birds, One Stone: A Simple, Unified Model for Text Generation from Structured and Unstructured Data. ACL 2020: 3864-3870 - [c110]Zhengkai Tu, Wei Yang, Zihang Fu, Yuqing Xie, Luchen Tan, Kun Xiong, Ming Li, Jimmy Lin:
Approximate Nearest Neighbor Search and Lightweight Dense Vector Reranking in Multi-Stage Retrieval Architectures. ICTIR 2020: 97-100 - [c109]Yuqing Xie, Wei Yang, Luchen Tan, Kun Xiong, Nicholas Jing Yuan, Baoxing Huai, Ming Li, Jimmy Lin:
Distant Supervision for Multi-Stage Fine-Tuning in Retrieval-Based Question Answering. WWW 2020: 2934-2940 - [i25]He Bai, Peng Shi, Jimmy Lin, Luchen Tan, Kun Xiong, Wen Gao, Jie Liu, Ming Li:
Semantics of the Unwritten. CoRR abs/2004.02251 (2020) - [i24]He Bai, Peng Shi, Jimmy Lin, Luchen Tan, Kun Xiong, Wen Gao, Ming Li:
SegaBERT: Pre-training of Segment-aware BERT for Language Understanding. CoRR abs/2004.14996 (2020) - [i23]Mohan Zhang, Luchen Tan, Zhengkai Tu, Zihang Fu, Kun Xiong, Ming Li, Jimmy Lin:
To Paraphrase or Not To Paraphrase: User-Controllable Selective Paraphrase Generation. CoRR abs/2008.09290 (2020) - [i22]Minghan Li, He Bai, Luchen Tan, Kun Xiong, Ming Li, Jimmy Lin:
Latte-Mix: Measuring Sentence Semantic Similarity with Latent Categorical Mixtures. CoRR abs/2010.11351 (2020)
2010 – 2019
- 2019
- [b6]Ming Li, Paul M. B. Vitányi:
An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition. Texts in Computer Science, Springer 2019, ISBN 978-3-030-11297-4, pp. 1-761 - [j115]Ming Li:
Deep Learning Deciphers Protein-RNA Interaction. Genom. Proteom. Bioinform. 17(5): 475-477 (2019) - [c108]Wei Yang, Luchen Tan, Chunwei Lu, Anqi Cui, Han Li, Xi Chen, Kun Xiong, Muzi Wang, Ming Li, Jian Pei, Jimmy Lin:
Detecting Customer Complaint Escalation with Recurrent Neural Networks and Manually-Engineered Features. NAACL-HLT (2) 2019: 56-63 - [c107]Wei Yang, Yuqing Xie, Aileen Lin, Xingyu Li, Luchen Tan, Kun Xiong, Ming Li, Jimmy Lin:
End-to-End Open-Domain Question Answering with BERTserini. NAACL-HLT (Demonstrations) 2019: 72-77 - [i21]Wei Yang, Yuqing Xie, Aileen Lin, Xingyu Li, Luchen Tan, Kun Xiong, Ming Li, Jimmy Lin:
End-to-End Open-Domain Question Answering with BERTserini. CoRR abs/1902.01718 (2019) - [i20]Wei Yang, Yuqing Xie, Luchen Tan, Kun Xiong, Ming Li, Jimmy Lin:
Data Augmentation for BERT Fine-Tuning in Open-Domain Question Answering. CoRR abs/1904.06652 (2019) - [i19]Rui Qiao, Ngoc Hieu Tran, Ming Li, Lei Xin, Baozhen Shan, Ali Ghodsi:
DeepNovoV2: Better de novo peptide sequencing with deep learning. CoRR abs/1904.08514 (2019) - [i18]Hamidreza Shahidi, Ming Li, Jimmy Lin:
Two Birds, One Stone: A Simple, Unified Model for Text Generation from Structured and Unstructured Data. CoRR abs/1909.10158 (2019) - 2018
- [c106]Ming Li:
Challenges from Cancer Immunotherapy. COCOON 2018: xii-x - 2017
- [j114]Chunyi Yue, Hanqiang Cao, Kun Xiong, Anqi Cui, Haocheng Qin, Ming Li:
Enhanced question understanding with dynamic memory networks for textual question answering. Expert Syst. Appl. 80: 39-45 (2017) - 2016
- [c105]Anqi Cui, Guangyu Feng, Borui Ye, Kun Xiong, Xing Yi Liu, Ming Li:
UWNLP at the NTCIR-12 Short Text Conversation Task. NTCIR 2016 - [r4]Lusheng Wang, Ming Li, Bin Ma:
Closest String and Substring Problems. Encyclopedia of Algorithms 2016: 321-324 - [r3]Bhaskar DasGupta, Xin He, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2016: 1402-1405 - [i17]Kun Xiong, Anqi Cui, Zefeng Zhang, Ming Li:
Neural Contextual Conversation Learning with Labeled Question-Answering Pairs. CoRR abs/1607.05809 (2016) - 2015
- [j113]Ming Li, Limsoon Wong:
John Wooley and JBCB. J. Bioinform. Comput. Biol. 13(4): 1501001:1 (2015) - [c104]Guangyu Feng, Kun Xiong, Yang Tang, Anqi Cui, Jing Bai, Hang Li, Qiang Yang, Ming Li:
Question Classification by Approximating Semantics. WWW (Companion Volume) 2015: 407-417 - 2014
- [j112]Xuefeng Cui, Shuai Cheng Li, Lin He, Ming Li:
Fingerprinting protein structures effectively and efficiently. Bioinform. 30(7): 949-955 (2014) - [j111]John C. Wooley, Ming Li, Limsoon Wong:
JBCB, the first decade. J. Bioinform. Comput. Biol. 12(3) (2014) - [j110]Xianglilan Zhang, Zhigang Luo, Ming Li:
Merge-Weighted Dynamic Time Warping for Speech Recognition. J. Comput. Sci. Technol. 29(6): 1072-1082 (2014) - [j109]Chong Long, Jie Zhang, Minlie Huang, Xiaoyan Zhu, Ming Li, Bin Ma:
Estimating feature ratings through an effective review selection approach. Knowl. Inf. Syst. 38(2): 419-446 (2014) - [p7]Tao Jiang, Ming Li, Bala Ravikumar:
Formal Models and Computability. Computing Handbook, 3rd ed. (1) 2014: 8: 1-37 - 2013
- [j108]Xuefeng Cui, Shuai Cheng Li, Dongbo Bu, Babak Alipanahi, Ming Li:
Protein Structure Idealization: How accurately is it possible to model protein structures with dihedral angles? Algorithms Mol. Biol. 8: 5 (2013) - [j107]Yang Tang, Di Wang, Jing Bai, Xiaoyan Zhu, Ming Li:
Information distance between what I said and what it heard. Commun. ACM 56(7): 70-77 (2013) - [j106]Daniel Holtby, Shuai Cheng Li, Ming Li:
LoopWeaver: Loop Modeling by the Weighted Scaling of Verified Proteins. J. Comput. Biol. 20(3): 212-223 (2013) - [j105]Babak Alipanahi, Nathan Krislock, Ali Ghodsi, Henry Wolkowicz, Logan Donaldson, Ming Li:
Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming. J. Comput. Biol. 20(4): 296-310 (2013) - [c103]Xuefeng Cui, Shuai Cheng Li, Dongbo Bu, Ming Li:
Towards Reliable Automatic Protein Structure Alignment. WABI 2013: 18-32 - 2012
- [j104]Richard Jang, Xin Gao, Ming Li:
Combining automated peak tracking in SAR by NMR with structure-based backbone assignment from 15N-NOESY. BMC Bioinform. 13(S-3): S4 (2012) - [j103]Shuai Cheng Li, Dongbo Bu, Ming Li:
Residues with Similar Hexagon Neighborhoods Share Similar Side-Chain Conformations. IEEE ACM Trans. Comput. Biol. Bioinform. 9(1): 240-248 (2012) - [j102]Shuai Cheng Li, Dongbo Bu, Ming Li:
Clustering 100, 000 Protein Structure Decoys in Minutes. IEEE ACM Trans. Comput. Biol. Bioinform. 9(3): 765-773 (2012) - [c102]Ming Li:
(2) Protein structure determination on demand. BIBM 2012: 1 - [c101]Xianglilan Zhang, Hongnan Wang, Tony J. Collins, Zhigang Luo, Ming Li:
Classifying Stem Cell Differentiation Images by Information Distance. ECML/PKDD (1) 2012: 269-282 - [c100]Babak Alipanahi, Nathan Krislock, Ali Ghodsi, Henry Wolkowicz, Logan Donaldson, Ming Li:
Protein Structure by Semidefinite Facial Reduction. RECOMB 2012: 1-11 - [c99]Daniel Holtby, Shuai Cheng Li, Ming Li:
LoopWeaver - Loop Modeling by the Weighted Scaling of Verified Proteins. RECOMB 2012: 113-126 - [c98]Xuefeng Cui, Shuai Cheng Li, Dongbo Bu, Babak Alipanahi Ramandi, Ming Li:
How Accurately Can We Model Protein Structures with Dihedral Angles? WABI 2012: 274-287 - 2011
- [j101]Babak Alipanahi, Xin Gao, Emre Karakoç, Shuai Cheng Li, Frank J. Balbach, Guangyu Feng, Logan Donaldson, Ming Li:
Error Tolerant NMR Backbone Resonance Assignment and Automated Structure Generation. J. Bioinform. Comput. Biol. 9(1): 15-41 (2011) - [j100]Richard Jang, Xin Gao, Ming Li:
Towards Fully Automated Structure-Based NMR Resonance Assignment of 15N-Labeled Proteins From Automatically Picked Peaks. J. Comput. Biol. 18(3): 347-363 (2011) - [j99]Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li:
Finding Nearly Optimal GDT Scores. J. Comput. Biol. 18(5): 693-704 (2011) - [j98]Fan Bu, Xiaoyan Zhu, Ming Li:
A New Multiword Expression Metric and Its Applications. J. Comput. Sci. Technol. 26(1): 3-13 (2011) - [c97]Ming Li:
Information Distance and Its Extensions. ALT 2011: 39 - [c96]Richard Jang, Xin Gao, Ming Li:
Combining ambiguous chemical shift mapping with structure-based backbone and NOE assignment from 15N-NOESY. BCB 2011: 76-86 - [c95]Ming Li:
Partial Match Distance - In Memoriam Ray Solomonoff 1926-2009. Algorithmic Probability and Friends 2011: 55-64 - [c94]Ming Li:
Information Distance and Its Extensions. Discovery Science 2011: 18-28 - 2010
- [j97]Yuzhong Zhao, Babak Alipanahi, Shuai Cheng Li, Ming Li:
Protein Secondary Structure Prediction Using NMR Chemical Shift Data. J. Bioinform. Comput. Biol. 8(5): 867-884 (2010) - [j96]Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li:
A New Approach for Multi-Document Update Summarization. J. Comput. Sci. Technol. 25(4): 739-749 (2010) - [c93]Fan Bu, Xiaoyan Zhu, Ming Li:
Measuring the Non-compositionality of Multiword Expressions. COLING 2010: 116-124 - [c92]Richard Jang, Xin Gao, Ming Li:
Towards Automated Structure-Based NMR Resonance Assignment. RECOMB 2010: 189-207 - [i16]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. CoRR abs/1006.3520 (2010)
2000 – 2009
- 2009
- [j95]Babak Alipanahi, Xin Gao, Emre Karakoç, Logan Donaldson, Ming Li:
PICKY: a novel SVD-based NMR spectra peak picking method. Bioinform. 25(12) (2009) - [j94]Xin Gao, Jinbo Xu, Shuai Cheng Li, Ming Li:
Predicting Local Quality of a Sequence-Structure Alignment. J. Bioinform. Comput. Biol. 7(5): 789-810 (2009) - [j93]Ying Xu, Ming Li, Tao Jiang:
Preface. J. Comput. Sci. Technol. 25(1): 1-2 (2009) - [j92]Ming Li:
Can We Determine a Protein Structure Quickly? J. Comput. Sci. Technol. 25(1): 95-106 (2009) - [j91]Shuai Cheng Li, Ming Li:
On two open problems of 2-interval patterns. Theor. Comput. Sci. 410(24-25): 2410-2423 (2009) - [j90]Dongbo Bu, Ming Li, Shuai Cheng Li, Jianbo Qian, Jinbo Xu:
Finding compact structural motifs. Theor. Comput. Sci. 410(30-32): 2834-2839 (2009) - [c91]Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li:
Multi-document Summarization by Information Distance. ICDM 2009: 866-871 - [c90]Chong Long, Jie Zhang, Minlie Huang, Xiaoyan Zhu, Ming Li, Bin Ma:
Specialized Review Selection for Feature Rating Estimation. Web Intelligence 2009: 214-221 - 2008
- [b5]Ming Li, Paul M. B. Vitányi:
An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Texts in Computer Science, Springer 2008, ISBN 978-0-387-33998-6, pp. i-xxiii, 1-790 - [j89]Hao Lin, Zefeng Zhang, Michael Q. Zhang, Bin Ma, Ming Li:
ZOOM! Zillions of oligos mapped. Bioinform. 24(21): 2431-2437 (2008) - [j88]Zefeng Zhang, Hao Lin, Ming Li:
Mango: Multiple Alignment with n Gapped Oligos. J. Bioinform. Comput. Biol. 6(3): 521-541 (2008) - [j87]Xian Zhang, Yu Hao, Xiaoyan Zhu, Ming Li:
New Information Distance Measure and Its Application in Question Answering System. J. Comput. Sci. Technol. 23(4): 557-572 (2008) - [c89]Chong Long, Xiaoyan Zhu, Ming Li, Bin Ma:
Information shared by many objects. CIKM 2008: 1213-1220 - [c88]Shuai Cheng Li, Dongbo Bu, Jinbo Xu, Ming Li:
Finding Largest Well-Predicted Subset of Protein Structure Models. CPM 2008: 44-55 - [c87]Shuai Cheng Li, Dongbo Bu, Xin Gao, Jinbo Xu, Ming Li:
Designing succinct structural alphabets. ISMB 2008: 182-189 - [c86]Jing Zhang, Xin Gao, Jinbo Xu, Ming Li:
Rapid and Accurate Protein Side Chain Prediction with Local Backbone Information. RECOMB 2008: 285-299 - [r2]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2008 - [i15]Paul M. B. Vitányi, Frank J. Balbach, Rudi Cilibrasi, Ming Li:
Normalized Information Distance. CoRR abs/0809.2553 (2008) - 2007
- [j86]Jing Zhang, Bo Jiang, Ming Li, John Tromp, Xuegong Zhang, Michael Q. Zhang:
Computing exact P-values for DNA motifs. Bioinform. 23(5): 531-537 (2007) - [j85]Ming Li:
Information Distance and its Applications. Int. J. Found. Comput. Sci. 18(4): 669-681 (2007) - [j84]Brendan Lucier, Tao Jiang, Ming Li:
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. Inf. Process. Lett. 103(2): 45-51 (2007) - [j83]Bin Ma, Lusheng Wang, Ming Li:
Near optimal multiple alignment within a band in polynomial time. J. Comput. Syst. Sci. 73(6): 997-1011 (2007) - [j82]Bin Ma, Ming Li:
On the complexity of the spaced seeds. J. Comput. Syst. Sci. 73(7): 1024-1034 (2007) - [j81]Ming Li, Paul M. B. Vitányi:
Applications of algorithmic information theory. Scholarpedia 2(5): 2658 (2007) - [c85]Ming Li:
Information Distance from a Question to an Answer. COCOON 2007: 3 - [c84]Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu:
Finding Compact Structural Motifs. CPM 2007: 142-149 - [c83]Jing Zhang, Xi Chen, Ming Li:
Computing Exact p-Value for Structured Motif. CPM 2007: 162-172 - [c82]Ming Li:
Invited Talk: Modern Homology Search. ISBRA 2007: 145 - [c81]Xuefeng Cui, Tomás Vinar, Brona Brejová, Dennis E. Shasha, Ming Li:
Homology search for genes. ISMB/ECCB (Supplement of Bioinformatics) 2007: 97-103 - [c80]Xian Zhang, Yu Hao, Xiaoyan Zhu, Ming Li, David R. Cheriton:
Information distance from a question to an answer. KDD 2007: 874-883 - 2006
- [j80]Minlie Huang, Xiaoyan Zhu, Ming Li:
A hybrid method for relation extraction from biomedical literature. Int. J. Medical Informatics 75(6): 443-455 (2006) - [j79]Jian Liu, Bin Ma, Ming Li:
Prima: Peptide Robust Identification from Ms/ms Spectra. J. Bioinform. Comput. Biol. 4(1): 125-138 (2006) - [j78]Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma:
Optimizing Multiple Spaced Seeds for Homology Search. J. Comput. Biol. 13(7): 1355-1368 (2006) - [c79]Minlie Huang, Xiaoyan Zhu, Shilin Ding, Hao Yu, Ming Li:
ONBRIRES: Ontology-Based Biological Relation Extraction System. APBC 2006: 327-336 - [c78]Ming Li:
Information distance. GrC 2006: 1 - [c77]Ming Li:
From Three Ideas in TCS to Three Applications in Bioinformatics. MFCS 2006: 84-85 - [c76]Ming Li, Bin Ma, Louxin Zhang:
Superiority and complexity of the spaced seeds. SODA 2006: 444-453 - [c75]Shuai Cheng Li, Ming Li:
On the Complexity of the Crossing Contact Map Pattern Matching Problem. WABI 2006: 231-241 - [c74]Ming Li:
Information Distance and Its Applications. CIAA 2006: 1-9 - 2005
- [j77]Derek Kisman, Ming Li, Bin Ma, Li Wang:
tPatternHunter: gapped, fast and sensitive translated homology search . Bioinform. 21(4): 542-544 (2005) - [j76]Hao Yu, Xiaoyan Zhu, Minlie Huang, Ming Li:
Discovering patterns to extract protein-protein interactions from the literature: Part II. Bioinform. 21(15): 3294-3300 (2005) - [j75]Jian Liu, Ming Li:
Finding Cancer Biomarkers from Mass Spectrometry Data by Decision Lists. J. Comput. Biol. 12(7): 971-979 (2005) - [c73]Jinbo Xu, Libo Yu, Ming Li:
Consensus fold recognition by predicted model quality. APBC 2005: 73-83 - [c72]Jian Liu, Bin Ma, Ming Li:
PRIME: Peptide robust identification from MS/MS spectra. APBC 2005: 181-190 - [c71]Yu Hao, Xiaoyan Zhu, Ming Li:
A New Algorithm for Pattern Optimization in Protein-Protein Interaction Extraction System. IbPRIA (2) 2005: 397-404 - [c70]Brona Brejová, Daniel G. Brown, Ming Li, Tomás Vinar:
ExonHunter: a comprehensive approach to gene finding. ISMB (Supplement of Bioinformatics) 2005: 57-65 - [c69]Thomas Tang, Jinbo Xu, Ming Li:
Discovering Sequence-Structure Motifs from Protein Segments and Two Applications. Pacific Symposium on Biocomputing 2005 - 2004
- [j74]Minlie Huang, Xiaoyan Zhu, Hao Yu, Donald G. Payan, Kunbin Qu, Ming Li:
Discovering patterns to extract protein-protein interactions from full texts. Bioinform. 20(18): 3604-3612 (2004) - [j73]Uri Keich, Ming Li, Bin Ma, John Tromp:
On spaced seeds for similarity search. Discret. Appl. Math. 138(3): 253-263 (2004) - [j72]Jonathan H. Badger, Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. J. Algorithms 51(1): 1-14 (2004) - [j71]Ming Li, Bin Ma, Derek Kisman, John Tromp:
Patternhunter Ii: Highly Sensitive and Fast Homology Search. J. Bioinform. Comput. Biol. 2(3): 417-440 (2004) - [j70]Daniel G. Brown, Ming Li, Bin Ma:
A Tutorial of Recent Developments in the Seeding of Local Alignment. J. Bioinform. Comput. Biol. 2(4): 819-842 (2004) - [j69]Jinbo Xu, Ming Li, Ying Xu:
Protein Threading by Linear Programming: Theoretical Analysis and Computational Results. J. Comb. Optim. 8(4): 403-418 (2004) - [j68]Hao Lin, Zefeng Zhang, Qiang-Feng Zhang, Dongbo Bu, Ming Li:
A Note on the Single Genotype Resolution Problem. J. Comput. Sci. Technol. 19(2): 254-257 (2004) - [j67]Xin Chen, Brent Francia, Ming Li, Brian McKinnon, Amit Seker:
Shared information and program plagiarism detection. IEEE Trans. Inf. Theory 50(7): 1545-1551 (2004) - [j66]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. IEEE Trans. Inf. Theory 50(12): 3250-3264 (2004) - [c68]Daming Yao, Jingbo Wang, Yanmei Lu, Nathan Noble, Huandong Sun, Xiaoyan Zhu, Nan Lin, Donald G. Payan, Ming Li, Kunbin Qu:
PathwayFinder: Paving the Way Towards Automatic Pathway Extraction. APBC 2004: 53-62 - [c67]Minlie Huang, Xiaoyan Zhu, Donald G. Payan, Kunbin Qu, Ming Li:
Discovering Patterns to Extract Protein-Protein Interactions from Full Biomedical Texts. NLPBA/BioNLP 2004 - [c66]Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma:
Optimizing Multiple Spaced Seeds for Homology Search. CPM 2004: 47-58 - [c65]Jian Liu, Ming Li:
Finding Cancer Biomarkers from Mass Spectrometry Data by Decision Lists. CSB 2004: 654-655 - 2003
- [j65]Huandong Sun, Ming Li, Ying Xu:
MOLVIE: an interactive visualization environment for molecular structures. Comput. Methods Programs Biomed. 71(1): 85-90 (2003) - [j64]J. Kevin Lanctôt, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang:
Distinguishing string selection problems. Inf. Comput. 185(1): 41-55 (2003) - [j63]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's razor. Inf. Process. Lett. 85(5): 267-274 (2003) - [j62]Jinbo Xu, Ming Li, Dongsup Kim, Ying Xu:
Raptor: Optimal Protein Threading by Linear Programming. J. Bioinform. Comput. Biol. 1(1): 95-118 (2003) - [c64]Jinbo Xu, Ming Li, Guo-Hui Lin, Dongsup Kim, Ying Xu:
Protein Threading by Linear Programming. Pacific Symposium on Biocomputing 2003: 264-275 - [c63]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. SODA 2003: 863-872 - 2002
- [j61]Bin Ma, John Tromp, Ming Li:
PatternHunter: faster and more sensitive homology search. Bioinform. 18(3): 440-445 (2002) - [j60]Xin Chen, Ming Li, Bin Ma, John Tromp:
DNACompress: fast and effective DNA sequence compression. Bioinform. 18(12): 1696-1698 (2002) - [j59]Ming Li, Bin Ma, Lusheng Wang:
On the closest string and substring problems. J. ACM 49(2): 157-171 (2002) - [j58]Ming Li, Bin Ma, Lusheng Wang:
Finding Similar Regions in Many Sequences. J. Comput. Syst. Sci. 65(1): 73-96 (2002) - [j57]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The average-case area of Heilbronn-type triangles. Random Struct. Algorithms 20(2): 206-219 (2002) - [c62]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. COCOON 2002: 411-419 - [i14]Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's Razor. CoRR cs.LG/0201005 (2002) - 2001
- [j56]Ming Li, Jonathan H. Badger, Xin Chen, Sam Kwong, Paul E. Kearney, Haoyong Zhang:
An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinform. 17(1): 149-154 (2001) - [j55]Ming Li:
Selected papers from ALT 1997 - Foreword. Theor. Comput. Sci. 261(1): 1 (2001) - [i13]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity. CoRR cs.CC/0110040 (2001) - [i12]Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vitányi:
The similarity metric. CoRR cs.CC/0111054 (2001) - 2000
- [j54]Qiong Gao, Ming Li, Paul M. B. Vitányi:
Applying MDL to learn best model granularity. Artif. Intell. 121(1-2): 1-29 (2000) - [j53]Lusheng Wang, Bin Ma, Ming Li:
Fixed topology alignment with recombination. Discret. Appl. Math. 104(1-3): 281-300 (2000) - [j52]Tao Jiang, Ming Li, Paul M. B. Vitányi:
A lower bound on the average-case complexity of shellsort. J. ACM 47(5): 905-911 (2000) - [j51]Tao Jiang, Paul E. Kearney, Ming Li:
Some Open Problems in Computational Molecular Biology. J. Algorithms 34(1): 194-201 (2000) - [j50]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Analysis of Algorithms Using Kolmogorov Complexity. J. Comput. Sci. Technol. 15(5): 402-408 (2000) - [j49]Bin Ma, Ming Li, Louxin Zhang:
From Gene Trees to Species Trees. SIAM J. Comput. 30(3): 729-752 (2000) - [j48]Tao Jiang, Paul E. Kearney, Ming Li:
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. SIAM J. Comput. 30(6): 1942-1961 (2000) - [j47]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New applications of the incompressibility method: Part II. Theor. Comput. Sci. 235(1): 59-70 (2000) - [j46]Paul M. B. Vitányi, Ming Li:
Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inf. Theory 46(2): 446-464 (2000) - [c61]Xin Chen, Sam Kwong, Ming Li:
A compression algorithm for DNA sequences and its applications in genome comparison. RECOMB 2000: 107 - [c60]David Bryant, John Tsang, Paul E. Kearney, Ming Li:
Computing the quartet distance between evolutionary trees. SODA 2000: 285-286 - [c59]Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang:
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA 2000: 287-296 - [c58]J. Kevin Lanctôt, Ming Li, En-Hui Yang:
Estimating DNA sequence entropy. SODA 2000: 409-418 - [c57]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Incompressibility Method. SOFSEM 2000: 36-53 - [c56]Ming Li, Bin Ma, Lusheng Wang:
Near optimal multiple alignment within a band in polynomial time. STOC 2000: 425-434 - [i11]Ming Li, Bin Ma, Lusheng Wang:
On The Closest String and Substring Problems. CoRR cs.CE/0002012 (2000) - [i10]Qiong Gao, Ming Li, Paul M. B. Vitányi:
Applying MDL to Learning Best Model Granularity. CoRR physics/0005062 (2000)
1990 – 1999
- 1999
- [j45]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp:
On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. Algorithmica 25(2-3): 176-195 (1999) - [j44]Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. Comput. J. 42(4): 287-293 (1999) - [j43]Ming Li, Louxin Zhang:
Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions. J. Algorithms 32(2): 155-166 (1999) - [j42]Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. J. Algorithms 33(1): 73-91 (1999) - [j41]Harry Buhrman, Ming Li, John Tromp, Paul M. B. Vitányi:
Kolmogorov Random Graphs and the Incompressibility Method. SIAM J. Comput. 29(2): 590-599 (1999) - [j40]Tao Jiang, Paul E. Kearney, Ming Li:
Some open problems in computational molecular biology. SIGACT News 30(3): 43-49 (1999) - [c55]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Some Examples of Average-case Analysis by the Imcompressibility Method. Jewels are Forever 1999: 250-261 - [c54]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Expected Size of Heilbronn's Triangles. CCC 1999: 105-113 - [c53]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On computing the nearest neighbor interchange distance. Discrete Mathematical Problems with Medical Applications 1999: 125-143 - [c52]Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham:
Quartet Cleaning: Improved Algorithms and Simulations. ESA 1999: 313-324 - [c51]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. ICALP 1999: 220-229 - [c50]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort. ICALP 1999: 453-462 - [c49]Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
Recovering Branches on the Tree of Life: An Approximation Algorithm. SODA 1999: 537-546 - [c48]J. Kevin Lanctôt, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang:
Distinguishing String Selection Problems. SODA 1999: 633-642 - [c47]Ming Li, Bin Ma, Lusheng Wang:
Finding Similar Regions in Many Strings. STOC 1999: 473-482 - [p6]Tao Jiang, Ming Li, Bala Ravikumar:
Basic Notions in Computational Complexity. Algorithms and Theory of Computation Handbook 1999 - [p5]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Computability. Algorithms and Theory of Computation Handbook 1999 - [p4]Tao Jiang, Ming Li, Bala Ravikumar, Kenneth W. Regan:
Formal Grammars and Languages. Algorithms and Theory of Computation Handbook 1999 - [i9]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort (Preliminary version). CoRR cs.CC/9906008 (1999) - [i8]Tao Jiang, Ming Li, Paul M. B. Vitányi:
Average-Case Complexity of Shellsort. CoRR cs.DS/9901010 (1999) - [i7]Paul M. B. Vitányi, Ming Li:
Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity. CoRR cs.LG/9901014 (1999) - [i6]Tao Jiang, Ming Li, Paul M. B. Vitányi:
The Average-Case Area of Heilbronn-Type Triangles. CoRR math.CO/9902043 (1999) - 1998
- [j39]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk:
On the Complexity and Approximation of Syntenic Distance. Discret. Appl. Math. 88(1-3): 59-82 (1998) - [j38]Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang:
Addition in log2n + O(1) Steps on Average: A Simple Analysis. Theor. Comput. Sci. 191(1-2): 245-248 (1998) - [j37]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. IEEE Trans. Inf. Theory 44(4): 1407-1423 (1998) - [c46]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS 1998: 1-4 - [c45]Ming Li, Louxin Zhang:
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation. COCOON 1998: 85-94 - [c44]Bin Ma, Lusheng Wang, Ming Li:
Fixed Topology Alignment with Recombination. CPM 1998: 174-188 - [c43]Tao Jiang, Paul E. Kearney, Ming Li:
Orchestrating Quartets: Approximation and Data Correction. FOCS 1998: 416-425 - [c42]Bin Ma, Ming Li, Louxin Zhang:
On reconstructing species trees from gene trees in term of duplications and losses. RECOMB 1998: 182-191 - [c41]Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li:
Approximation Algorithms for Directed Steiner Problems. SODA 1998: 192-200 - [i5]Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part II. CoRR cs.CC/9809060 (1998) - [i4]Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method: Part I. CoRR cs.CC/9809061 (1998) - 1997
- [b4]Ming Li, Paul M. B. Vitányi:
An introduction to Kolmogorov complexity and its applications, Second Edition. Graduate Texts in Computer Science, Springer 1997, ISBN 978-0-387-94868-3, pp. I-XXI, 1-637 - [j36]Ding-Zhu Du, Ming Li:
Foreword (COCOON'95). Theor. Comput. Sci. 181(2): 227 (1997) - [j35]John D. Kececioglu, Ming Li, John Tromp:
Inferring a DNA Sequence from Erroneous Copies. Theor. Comput. Sci. 185(1): 3-13 (1997) - [c40]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169 - [c39]Paul M. B. Vitányi, Ming Li:
On Prediction by Data Compression. ECML 1997: 14-30 - [c38]Ming Li, Paul M. B. Vitányi:
Average-Case Analysis via Incompressibility. FCT 1997: 38-50 - [c37]Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk:
On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 - [c36]Harry Buhrman, Ming Li, Paul M. B. Vitányi:
Kolmogorov random graphs. SEQUENCES 1997: 78-96 - [c35]Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang:
On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997: 427-436 - [p3]Ming Li, Tao Jiang:
Shortest common superstrings. Pattern Matching Algorithms 1997: 237-265 - [r1]Tao Jiang, Ming Li, Bala Ravikumar:
Formal Models and Computability. The Computer Science and Engineering Handbook 1997: 31-63 - [i3]Ming Li, John Tromp, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation by Pebble Games. CoRR quant-ph/9703009 (1997) - [i2]Ming Li, Paul M. B. Vitányi:
Reversibility and Adiabatic Computation: Trading Time and Space for Energy. CoRR quant-ph/9703022 (1997) - 1996
- [j34]Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp:
Lower Bounds on Learning Decision Lists and Trees. Inf. Comput. 126(2): 114-122 (1996) - [j33]Ming Li, John Tromp, Paul M. B. Vitányi:
How to Share Concurrent Wait-Free Variables. J. ACM 43(4): 723-746 (1996) - [j32]Tao Jiang, Ming Li:
K One-Way Heads Cannot Do String-Matching. J. Comput. Syst. Sci. 53(3): 513-524 (1996) - [j31]Tao Jiang, Ming Li:
DNA Sequencing and String Learning. Math. Syst. Theory 29(4): 387-405 (1996) - [j30]Jia-Huai You, Robert Cartwright, Ming Li:
Iterative Belief Revision in Extended Logic Programming. Theor. Comput. Sci. 170(1-2): 383-406 (1996) - [c34]Ming Li, Paul M. B. Vitányi:
Reversible Simulation of Irreversible Computation. CCC 1996: 301-306 - [c33]Ming Li, John Tromp, Louxin Zhang:
Some Notes on the Nearest Neighbour Interchange Distance. COCOON 1996: 343-351 - [i1]Richard Beigel, William I. Gasarch, Ming Li, Louxin Zhang:
Addition in log2n + O(1) Steps on Average: A Simple Analysis. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j29]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity. SIAM J. Comput. 24(2): 398-410 (1995) - [j28]Tao Jiang, Ming Li:
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. SIAM J. Comput. 24(5): 1122-1139 (1995) - [c32]John D. Kececioglu, Ming Li, John Tromp:
Inferring a DNA Sequence from Erroneous Copies (Abstract). ALT 1995: 151-152 - [c31]Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp:
Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). STACS 1995: 527-538 - [c30]Paul M. B. Vitányi, Ming Li:
Algorithmic Arguments in Physics of Computation. WADS 1995: 315-333 - [p2]Ming Li, Paul M. B. Vitányi:
Computational Machine Learning in Theory and Praxis. Computer Science Today 1995: 518-535 - [e1]Ding-Zhu Du, Ming Li:
Computing and Combinatorics, First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995, Proceedings. Lecture Notes in Computer Science 959, Springer 1995, ISBN 3-540-60216-X [contents] - 1994
- [j27]Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis:
Linear Approximation of Shortest Superstrings. J. ACM 41(4): 630-647 (1994) - [j26]Michael J. Kearns, Ming Li, Leslie G. Valiant:
Learning Boolean Formulas. J. ACM 41(6): 1298-1328 (1994) - [j25]Mihály Geréb-Graus, Ming Li:
Three One-Way Heads Cannot Do String Matching. J. Comput. Syst. Sci. 48(1): 1-8 (1994) - [j24]Ming Li, Paul M. B. Vitányi:
Kolmogorov Complexity Arguments in Combinatorics. J. Comb. Theory A 66(2): 226-236 (1994) - [j23]Ming Li, Paul M. B. Vitányi:
Statistical Properties of Finite Sequences with High Kolmogorov Complexity. Math. Syst. Theory 27(4): 365-376 (1994) - [j22]Benny Chor, Amos Israeli, Ming Li:
Wait-Free Consensus Using Asynchronous Hardware. SIAM J. Comput. 23(4): 701-712 (1994) - [j21]Tao Jiang, Ming Li:
Approximating Shortest Superstrings with Constraints. Theor. Comput. Sci. 134(2): 473-491 (1994) - [c29]Tao Jiang, Ming Li:
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. ICALP 1994: 191-202 - 1993
- [b3]Ming Li, Paul M. B. Vitányi:
An introduction to Kolmogorov complexity and its applications. Texts and Monographs in Computer Science, Springer 1993, ISBN 978-3-540-94053-1, pp. I-XX, 1-546 - [j20]Amos Israeli, Ming Li:
Bonded Time-Stamps. Distributed Comput. 6(4): 205-209 (1993) - [j19]Michael J. Kearns, Ming Li:
Learning in the Presence of Malicious Errors. SIAM J. Comput. 22(4): 807-837 (1993) - [j18]Tao Jiang, Ming Li:
On the Complexity of Learning Strings and Sequences. Theor. Comput. Sci. 119(2): 363-371 (1993) - [c28]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Thermodynamics of computation and information distance. STOC 1993: 21-30 - [c27]Tao Jiang, Ming Li:
k one-way heads cannot do string-matching. STOC 1993: 62-70 - [c26]Tao Jiang, Ming Li:
Approximating Shortest Superstrings with Constraints (Extended Abstract). WADS 1993: 385-396 - 1992
- [j17]David E. Foulser, Ming Li, Qiang Yang:
Theory and Algorithms for Plan Merging. Artif. Intell. 57(2-3): 143-181 (1992) - [j16]Ming Li, Paul M. B. Vitányi:
Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. Inf. Process. Lett. 42(3): 145-149 (1992) - [j15]Ming Li, Paul M. B. Vitányi:
Optimality of Wait-Free Atomic Multiwriter Variables. Inf. Process. Lett. 43(2): 107-112 (1992) - [j14]Tao Jiang, Ming Li, Ding-Zhu Du:
A Note on Shortest Superstrings with Flipping. Inf. Process. Lett. 44(4): 195-199 (1992) - [j13]Ming Li, Paul M. B. Vitányi:
Inductive Reasoning and Kolmogorov Complexity. J. Comput. Syst. Sci. 44(2): 343-384 (1992) - [j12]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SIAM J. Comput. 21(4): 697-712 (1992) - [c25]Ming Li, Paul M. B. Vitányi:
Inductive reasoning. Language Computations 1992: 127-148 - [c24]Ming Li, Paul M. B. Vitányi:
Philosophical Issues in Kolmogorov Complexity. ICALP 1992: 1-15 - 1991
- [b2]Ming Li, Paul M. B. Vitányi:
An introduction to Kolmogorov - complexity and its applications ; part 1: theory. CWI 1991, pp. 1-340 - [j11]Ming Li, Yaacov Yesha:
Resource Bounds for Parallel Computation of Threshold and Symmetric Functions. J. Comput. Syst. Sci. 42(1): 119-137 (1991) - [j10]Ming Li, Paul M. B. Vitányi:
Learning Simple Concept Under Simple Distributions. SIAM J. Comput. 20(5): 911-935 (1991) - [c23]David E. Foulser, Ming Li, Qiang Yang:
A Quantitative Theory for Plan Merging. AAAI 1991: 673-678 - [c22]Ming Li, Paul M. B. Vitányi:
Combinatorics and Kolmogorov Complexity. SCT 1991: 154-163 - [c21]Tao Jiang, Ming Li:
On the Complexity of Learning Strings and Sequences. COLT 1991: 367-371 - [c20]Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis:
Linear Approximation of Shortest Superstrings. STOC 1991: 328-336 - 1990
- [c19]Ming Li:
Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version). FOCS 1990: 125-134 - [p1]Ming Li, Paul M. B. Vitányi:
Kolmogorov Complexity and its Applications. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 187-254
1980 – 1989
- 1989
- [j9]Chandrajit L. Bajaj, Ming Li:
Geometric Optimization and Dp - Completeness. Discret. Comput. Geom. 4: 3-13 (1989) - [j8]Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha:
On the Power of Concurrent-Write PRAMs With Read-Only Memory. Inf. Comput. 83(2): 234-244 (1989) - [j7]Ming Li, Yaacov Yesha:
New lower bounds for parallel computation. J. ACM 36(3): 671-680 (1989) - [c18]Ming Li, Paul M. B. Vitányi:
Inductive Reasoning and Komogorov Complexity. SCT 1989: 165-185 - [c17]Ming Li, Paul M. B. Vitányi:
A Theory of Learning Simple Concepts Under Simple Distributions and Average Case Complexity for the Universal Distribution (Extended Abstract). FOCS 1989: 34-39 - [c16]Ming Li, Paul M. B. Vitányi:
How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version). ICALP 1989: 488-505 - [c15]Ming Li, Paul M. B. Vitányi:
A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version). ICALP 1989: 506-520 - [c14]Qiong Gao, Ming Li:
The Minimum Description Length Principle and Its Application to Online Learning of Handprinted Characters. IJCAI 1989: 843-848 - 1988
- [j6]Ming Li, Paul M. B. Vitányi:
Tape versus Queue and Stacks: The Lower Bounds. Inf. Comput. 78(1): 56-85 (1988) - [j5]Ming Li:
A Separator Theorem for One-Dimensional Graphs Under Linear Mapping. Inf. Process. Lett. 27(1): 9-11 (1988) - [j4]Ming Li:
Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time. J. Comput. Syst. Sci. 37(1): 101-116 (1988) - [j3]Marek Chrobak, Ming Li:
k+1 Heads Are Better than k for PDAs. J. Comput. Syst. Sci. 37(2): 144-155 (1988) - [c13]Ming Li, Paul M. B. Vitányi:
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87. SCT 1988: 80-101 - [c12]Ming Li, Umesh V. Vazirani:
On the Learnability of Finite Automata. COLT 1988: 359-370 - [c11]Michael J. Kearns, Ming Li:
Learning in the Presence of Malicious Errors (Extended Abstract). STOC 1988: 267-280 - 1987
- [j2]Ming Li, Yaacov Yesha:
Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation. Inf. Comput. 73(2): 102-128 (1987) - [c10]Amos Israeli, Ming Li:
Bounded Time-Stamps (Extended Abstract). FOCS 1987: 371-382 - [c9]Ming Li, Yaacov Yesha:
The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions. ICALP 1987: 326-335 - [c8]Benny Chor, Amos Israeli, Ming Li:
On Processor Coordination Using Asynchronous Hardware. PODC 1987: 86-97 - [c7]Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant:
On the Learnability of Boolean Formulae. STOC 1987: 285-295 - 1986
- [j1]Ming Li, Yaacov Yesha:
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation. Inf. Process. Lett. 22(5): 231-235 (1986) - [c6]Ming Li, Luc Longpré, Paul M. B. Vitányi:
The Power of the Queue. SCT 1986: 218-233 - [c5]Marek Chrobak, Ming Li:
k+1 Heads Are Better than k for PDA's. FOCS 1986: 361-367 - [c4]Juris Hartmanis, Ming Li, Yaacov Yesha:
Containment, Separation, Complete Sets, and Immunity of Complexity Classes. ICALP 1986: 136-145 - [c3]Ming Li, Yaacov Yesha:
New Lower Bounds for Parallel Computation. STOC 1986: 177-187 - 1985
- [b1]Ming Li:
Lower Bounds in Computational Complexity. Cornell University, USA, 1985 - [c2]Ming Li:
Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time. FOCS 1985: 56-64 - [c1]Ming Li:
Lower Bounds by Kolmogorov-Complexity (Extended Abstract). ICALP 1985: 383-393
Coauthor Index
[b6] [i16] [b5] [i15] [j81] [j66] [j63] [c63] [j57] [c62] [i14] [i13] [i12] [j54] [j52] [j50] [j47] [j46] [c57] [i10] [j44] [j41] [c55] [c54] [c51] [c50] [i9] [i8] [i7] [i6] [j37] [c46] [i5] [i4] [b4] [c40] [c39] [c38] [c36] [i3] [i2] [j33] [c34] [j29] [c30] [p2] [j24] [j23] [b3] [c28] [j16] [j15] [j13] [j12] [c25] [c24] [b2] [j10] [c22] [p1] [c18] [c17] [c16] [c15] [j6] [c13] [c6]
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-11-28 21:28 CET 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:
