( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How Compression and Approximation Affect Efficiency in String Distance Measures.

, , , и . CoRR, (2021)

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.

Ulrich Lincoln

Tania Lincoln

Tania Lincoln

Bryan Lincoln

Lincoln Opper

 

Другие публикации лиц с тем же именем

Faster Random k-CNF Satisfiability., и . CoRR, (2019)Monochromatic Triangles, Intermediate Matrix Products, and Convolutions., , и . CoRR, (2020)Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs., и . ITCS, том 151 из LIPIcs, стр. 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy., , , , и . ITCS, том 94 из LIPIcs, стр. 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Faster Random k-CNF Satisfiability., и . ICALP, том 168 из LIPIcs, стр. 78:1-78:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Delegation for Search Problems., , и . ICALP, том 229 из LIPIcs, стр. 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Deterministic Time-Space Trade-Offs for k-SUM., , , и . ICALP, том 55 из LIPIcs, стр. 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The one-out-of-k retrieval problem and linear network coding., , , , и . Adv. Math. Commun., 10 (1): 95-112 (2016)Quasipolynomiality of the Smallest Missing Induced Subgraph., , и . CoRR, (2023)How Compression and Approximation Affect Efficiency in String Distance Measures., , , и . CoRR, (2021)