Author of the publication

Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time.

, , , , and . J. ACM, 67 (6): 36:1-36:22 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Optimal Quasi-Gray Codes: Does the Alphabet Matter?, , , and . CoRR, (2017)Pseudo-Cores: The Terminus of an Intelligent Viral Meme's Trajectory., , and . CompleNet, volume 644 of Studies in Computational Intelligence, page 213-226. Springer, (2016)Dimension, Pseudorandomness and Extraction of Pseudorandomness., , , and . FSTTCS, volume 45 of LIPIcs, page 221-235. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time., , , , and . J. ACM, 67 (6): 36:1-36:22 (2020)Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness., , , and . Electron. Colloquium Comput. Complex., (2014)Scalable clustering by aggregating representatives in hierarchical groups., , , , and . Pattern Recognit., (April 2023)Near Optimal Sized Weight Tolerant Subgraph for Single Source Shortest Path., and . CoRR, (2017)Which Modality should I use - Text, Motif, or Image? : Understanding Graphs with Large Language Models., , , and . CoRR, (2023)A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs., , , and . CoRR, (2021)Modeling memetics using edge diversity., , , and . Soc. Netw. Anal. Min., 9 (1): 2:1-2:17 (2019)