Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2949329905 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1005.4033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and compact regular expression matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental String Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious string embeddings and edit distance approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating edit distance in near-linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low distortion embeddings for edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sublinear algorithm for weakly approximating edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbors and sequence comparison with block operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonembeddability theorems via Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds for embeddings into <i>L</i><sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Hardness of Estimating Edit Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space lower bounds for distance approximation in the data stream model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the distance to a monotone function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spot-checkers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximations of the frequency moments of data streams / rank
 
Normal rank

Latest revision as of 07:23, 3 July 2024

scientific article; zbMATH DE number 5799063
Language Label Description Also known as
English
Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity
scientific article; zbMATH DE number 5799063

    Statements

    Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (English)
    0 references
    0 references
    0 references
    0 references
    12 October 2010
    0 references
    edit distance
    0 references
    sampling
    0 references
    query complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references