| 
| |  | |  |
SERF: ODMG-Based Generic Re-structuring Facility
Note: Links lead to the DBLP on the Web.
Ming Li
90
Tao Jiang
,
Paul E. Kearney
, Ming Li: Some Open Problems in Computational Molecular Biology.
J. Algorithms 34
(1): 194-201 (2000)
89
Vincent Berry
,
Tao Jiang
,
Paul E. Kearny
, Ming Li,
Todd Wareham
: Quartet Cleaning: Improved Algorithms and Simulations.
ESA 1999
: 313-324
88
Harry Buhrman
,
Tao Jiang
, Ming Li,
Paul M. B. Vitányi
: New Applications of the Incompressibility Method.
ICALP 1999
: 220-229
87
Tao Jiang
, Ming Li,
Paul M. B. Vitányi
: Average-Case Complexity of Shellsort.
ICALP 1999
: 453-462
86
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
85
Elke A. Rundensteiner
,
Kajal T. Claypool
, Ming Li,
Li Chen
,
Xin Zhang
,
Chandrakant Natarajan
,
Jing Jin
,
Stacia De Lima
,
S. Weiner
: SERF: ODMG-Based Generic Re-structuring Facility.
SIGMOD Conference 1999
: 568-570
84
Paul E. Kearney
, Ming Li,
John Tsang
,
Tao Jiang
: Recovering Branches on the Tree of Life: An Approximation Algorithm.
SODA 1999
: 537-546
83
J. Kevin Lanctot
, Ming Li,
Bin Ma
,
Shaojiu Wang
,
Louxin Zhang
: Distinguishing String Selection Problems.
SODA 1999
: 633-642
82
Ming Li,
Bin Ma
,
Lusheng Wang
: Finding Similar Regions in Many Strings.
STOC 1999
: 473-482
81
B. DasGupta
,
X. He
,
Tao Jiang
, Ming Li,
John Tromp
: On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.
Algorithmica 25
(2-3): 176-195 (1999)
80
Ming Li,
Louxin Zhang
: Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions.
J. Algorithms 32
(2): 155-166 (1999)
79
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)
78
Tao Jiang
, Ming Li,
Paul M. B. Vitányi
: New Applications of the Incompressibility Method.
The Computer Journal 42
(4): 287-293 (1999)
77
Ming Li,
Louxin Zhang
: Better Approximation of Diagonal-Flip Transformation and Rotation Transformation.
COCOON 1998
: 85-94
76
Bin Ma
,
Lusheng Wang
, Ming Li: Fixed Topology Alignment with Recombination.
CPM 1998
: 174-188
75
Tao Jiang
,
Paul E. Kearney
, Ming Li: Orchestrating Quartets: Approximation and Data Correction.
FOCS 1998
: 416-425
74
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
73
Richard Beigel
,
William I. Gasarch
, Ming Li,
Louxin Zhang
: Addition in log
2
n + O(1) Steps on Average: A Simple Analysis.
TCS 191
(1-2): 245-248 (1998)
72
Ming Li,
Paul M. B. Vitányi
: Average-Case Analysis Using Kolmogorov Complexity.
Advances in Algorithms, Languages, and Complexity 1997
: 157-169
71
Paul M. B. Vitányi
, Ming Li: On Prediction by Data Compression.
ECML 1997
: 14-30
70
Ming Li,
Paul M. B. Vitányi
: Average-Case Analysis via Incompressibility.
FCT 1997
: 38-50
69
B. DasGupta
,
X. He
,
Tao Jiang
, Ming Li,
John Tromp
,
Louxin Zhang
: On Distances between Phylogenetic Trees (Extended Abstract).
SODA 1997
: 427-436
68
Tao Jiang
, Ming Li,
Bala Ravikumar
: Formal Models and Computability.
The Computer Science and Engineering Handbook 1997
: 31-63
67
Ding-Zhu Du
, Ming Li: Foreword (COCOON'95).
TCS 181
(2): 227 (1997)
66
John D. Kececioglu
, Ming Li,
John Tromp
: Inferring a DNA Sequence from Erroneous Copies.
TCS 185
(1): 3-13 (1997)
65
Ming Li,
John Tromp
,
Louxin Zhang
: Some Notes on the Nearest Neighbour Interchange Distance.
COCOON 1996
: 343-351
64
Ming Li,
Paul M. B. Vitányi
: Reversible Simulation of Irreversible Computation.
IEEE Conference on Computational Complexity 1996
: 301-306
63
Richard Beigel
,
William I. Gasarch
, Ming Li,
Louxin Zhang
: Addition in log
2
n + O(1) Steps on Average: A Simple Analysis.
Electronic Colloquium on Computational Complexity (ECCC) 3
(051): (1996)
62
Thomas R. Hancock
,
Tao Jiang
, Ming Li,
John Tromp
: Lower Bounds on Learning Decision Lists and Trees.
Information and Computation 126
(2): 114-122 (1996)
61
Ming Li,
John Tromp
,
Paul M. B. Vitányi
: How to Share Concurrent Wait-Free Variables.
JACM 43
(4): 723-746 (1996)
60
Tao Jiang
, Ming Li: K One-Way Heads Cannot Do String-Matching.
JCSS 53
(3): 513-524 (1996)
59
Tao Jiang
, Ming Li: DNA Sequencing and String Learning.
Mathematical Systems Theory 29
(4): 387-405 (1996)
58
Jia-Huai You
,
Robert Cartwright
, Ming Li: Iterative Belief Revision in Extended Logic Programming.
TCS 170
(1-2): 383-406 (1996)
57
John D. Kececioglu
, Ming Li,
John Tromp
: Inferring a DNA Sequence from Erroneous Copies (Abstract).
ALT 1995
: 151-152
56
Ming Li,
Paul M. B. Vitányi
: Computational Machine Learning in Theory and Praxis.
Computer Science Today 1995
: 518-535
55
Thomas R. Hancock
,
Tao Jiang
, Ming Li,
John Tromp
: Lower Bounds on Learning Decision Lists and Trees (Extended Abstract).
STACS 1995
: 527-538
54
Paul M. B. Vitányi
, Ming Li: Algorithmic Arguments in Physics of Computation.
WADS 1995
: 315-333
53
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)
52
Tao Jiang
, Ming Li: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.
SIAM J. Comput. 24
(5): 1122-1139 (1995)
51
Tao Jiang
, Ming Li: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.
ICALP 1994
: 191-202
50
Avrim Blum
, Ming Li,
John Tromp
,
Mihalis Yannakakis
: Linear Approximation of Shortest Superstrings.
JACM 41
(4): 630-647 (1994)
49
Michael J. Kearns
, Ming Li,
Leslie G. Valiant
: Learning Boolean Formulas.
JACM 41
(6): 1298-1328 (1994)
48
Mihály Geréb-Graus
, Ming Li: Three One-Way Heads Cannot Do String Matching.
JCSS 48
(1): 1-8 (1994)
47
Ming Li,
Paul M. B. Vitányi
: Statistical Properties of Finite Sequences with High Kolmogorov Complexity.
Mathematical Systems Theory 27
(4): 365-376 (1994)
46
Benny Chor
,
Amos Israeli
, Ming Li: Wait-Free Consensus Using Asynchronous Hardware.
SIAM J. Comput. 23
(4): 701-712 (1994)
45
Tao Jiang
, Ming Li: Approximating Shortest Superstrings with Constraints.
TCS 134
(2): 473-491 (1994)
44
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
43
Tao Jiang
, Ming Li: k One-way Heads Cannot Do String-Matching.
STOC 1993
: 62-70
42
Tao Jiang
, Ming Li: Approximating Shortest Superstrings with Constraints (Extended Abstract).
WADS 1993
: 385-396
41
Amos Israeli
, Ming Li: Bonded Time-Stamps.
Distributed Computing 6
(4): 205-209 (1993)
40
Michael J. Kearns
, Ming Li: Learning in the Presence of Malicious Errors.
SIAM J. Comput. 22
(4): 807-837 (1993)
39
Tao Jiang
, Ming Li: On the Complexity of Learning Strings and Sequences.
TCS 119
(2): 363-371 (1993)
38
Ming Li,
Paul M. B. Vitányi
: Philosophical Issues in Kolmogorov Complexity.
ICALP 1992
: 1-15
37
David E. Foulser
, Ming Li,
Qiang Yang
: Theory and Algorithms for Plan Merging.
Artificial Intelligence 57
(2-3): 143-181 (1992)
36
Ming Li,
Paul M. B. Vitányi
: Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity.
IPL 42
(3): 145-149 (1992)
35
Ming Li,
Paul M. B. Vitányi
: Optimality of Wait-Free Atomic Multiwriter Variables.
IPL 43
(2): 107-112 (1992)
34
Tao Jiang
, Ming Li,
Ding-Zhu Du
: A Note on Shortest Superstrings with Flipping.
IPL 44
(4): 195-199 (1992)
33
Ming Li,
Paul M. B. Vitányi
: Inductive Reasoning and Kolmogorov Complexity.
JCSS 44
(2): 343-384 (1992)
32
Ming Li,
Luc Longpré
,
Paul M. B. Vitányi
: The Power of the Queue.
SIAM J. Comput. 21
(4): 697-712 (1992)
31
David E. Foulser
, Ming Li,
Qiang Yang
: A Quantitative Theory for Plan Merging.
AAAI, Vol. 2 1991
: 673-678
30
Tao Jiang
, Ming Li: On the Complexity of Learning Strings and Sequences.
COLT 1991
: 367-371
29
Avrim Blum
,
Tao Jiang
, Ming Li,
John Tromp
,
Mihalis Yannakakis
: Linear Approximation of Shortest Superstrings.
STOC 1991
: 328-336
28
Ming Li,
Paul M. B. Vitányi
: Combinatorics and Kolmogorov Complexity.
Structure in Complexity Theory Conference 1991
: 154-163
27
Ming Li,
Yaacov Yesha
: Resource Bounds for Parallel Computation of Threshold and Symmetric Functions.
JCSS 42
(1): 119-137 (1991)
26
Ming Li,
Paul M. B. Vitányi
: Learning Simple Concept Under Simple Distributions.
SIAM J. Comput. 20
(5): 911-935 (1991)
25
Ming Li: Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version).
FOCS 1990
: 125-134
24
Ming Li,
Paul M. B. Vitányi
: Kolmogorov Complexity and its Applications.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity 1990
: 187-254
23
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
22
Ming Li,
Paul M. B. Vitányi
: How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version).
ICALP 1989
: 488-505
21
Ming Li,
Paul M. B. Vitányi
: A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version).
ICALP 1989
: 506-520
20
Ming Li,
Paul M. B. Vitányi
: Inductive Reasoning and Komogorov Complexity.
Structure in Complexity Theory Conference 1989
: 165-185
19
Faith E. Fich
, Ming Li,
Prabhakar Ragde
,
Y. Yesha
: On the Power of Concurrent-Write PRAMs With Read-Only Memory.
Information and Computation 83
(2): 234-244 (1989)
18
Ming Li,
Yaacov Yesha
: New Lower Bounds for Parallel Computation.
JACM 36
(3): 671-680 (1989)
17
Ming Li,
Umest Vazirani
: On the Learnability of Finite Automata.
COLT 1988
: 359-370
16
Michael J. Kearns
, Ming Li: Learning in the Presence of Malicious Errors (Extended Abstract).
STOC 1988
: 267-280
15
Ming Li: A Separator Theorem for One-Dimensional Graphs Under Linear Mapping.
IPL 27
(1): 9-11 (1988)
14
Ming Li,
Paul M. B. Vitányi
: Tape versus Queue and Stacks: The Lower Bounds.
Information and Computation 78
(1): 56-85 (1988)
13
Ming Li: Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time.
JCSS 37
(1): 101-116 (1988)
12
Marek Chrobak
, Ming Li: k+1 Heads Are Better than k for PDAs.
JCSS 37
(2): 144-155 (1988)
11
Amos Israeli
, Ming Li: Bounded Time-Stamps (Extended Abstract).
FOCS 1987
: 371-382
10
Ming Li,
Yaacov Yesha
: The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions.
ICALP 1987
: 326-335
9
Benny Chor
,
Amos Israeli
, Ming Li: On Processor Coordination Using Asynchronous Hardware.
PODC 1987
: 86-97
8
Michael J. Kearns
, Ming Li,
Leonard Pitt
,
Leslie G. Valiant
: On the Learnability of Boolean Formulae.
STOC 1987
: 285-295
7
Ming Li,
Yaacov Yesha
: Separation and Lower Bounds for ROM and Nondeterministic Models of Parallel Computation.
Information and Computation 73
(2): 102-128 (1987)
6
Marek Chrobak
, Ming Li: k+1 Heads Are Better than k for PDA's.
FOCS 1986
: 361-367
5
Juris Hartmanis
, Ming Li,
Yaacov Yesha
: Containment, Separation, Complete Sets, and Immunity of Complexity Classes.
ICALP 1986
: 136-145
4
Ming Li,
Yaacov Yesha
: New Lower Bounds for Parallel Computation.
STOC 1986
: 177-187
3
Ming Li,
Yaacov Yesha
: String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation.
IPL 22
(5): 231-235 (1986)
2
Ming Li: Simulating Two Pushdown Stores by One Tape in O(n^1.5 sqrt(log n)) Time.
FOCS 1985
: 56-64
1
Ming Li: Lower Bounds by Kolmogorov-Complexity (Extended Abstract).
ICALP 1985
: 383-393
Copyright(C) 2000 ACM | | | | | | |
