共 31 条
[2]
Edit Distance in Near-Linear Time: it's a Constant Factor
[J].
2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020),
2020,
:990-1001
[3]
Parallel Algorithms for Geometric Graph Problems
[J].
STOC'14: PROCEEDINGS OF THE 46TH ANNUAL 2014 ACM SYMPOSIUM ON THEORY OF COMPUTING,
2014,
:574-583
[4]
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
[J].
2010 IEEE 51ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE,
2010,
:377-386
[5]
Andoni A, 2009, ACM S THEORY COMPUT, P199
[6]
[Anonymous], 2004, OSDI 04 P 6 C S OPEA
[7]
[Anonymous], 2013, P ACM SIGACT SIGMOD, DOI [10.1145/2463664.2465224, 10]
[8]
[Anonymous], 2009, Hadoop: The Definitive Guide
[9]
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
[J].
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING,
2015,
:51-58
[10]
Approximating edit distance efficiently
[J].
45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS,
2004,
:550-559