( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Conditional Lower Bounds for Space/Time Tradeoffs.

, , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 421-436. Springer, (2017)

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.

Maciej Lewenstein

Hans Lewenstein

Amir Moshe

Max Mosheim

Moshe Pinus

 

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

Approximate subset matching with Don't Cares., , и . SODA, стр. 305-306. ACM/SIAM, (2001)Can We Recover the Cover?, , , , и . Algorithmica, 81 (7): 2857-2875 (2019)Dictionary matching and indexing with errors and don't cares., , и . STOC, стр. 91-100. ACM, (2004)Approximate Parameterized Matching., , и . ESA, том 3221 из Lecture Notes in Computer Science, стр. 414-425. Springer, (2004)Approximating Constrained LCS., и . SPIRE, том 4726 из Lecture Notes in Computer Science, стр. 164-172. Springer, (2007)Quick Greedy Computation for Minimum Common String Partitions., и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 273-284. Springer, (2011)Range Minimum Query Indexes in Higher Dimensions., , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 149-159. Springer, (2015)Conditional Lower Bounds for Space/Time Tradeoffs., , , и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 421-436. Springer, (2017)Approximate Swapped Matching., , и . FSTTCS, том 1974 из Lecture Notes in Computer Science, стр. 302-311. Springer, (2000)Can We Recover the Cover?., , , , и . CPM, том 78 из LIPIcs, стр. 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)