( en | de | ru )

 

Disambiguation of "Kopelowitz, Tsvi"

Author of the publication

copydeleteadd this publication to your clipboard
Conditional Lower Bounds for Space/Time Tradeoffs.

, , , and . CoRR, (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. You can also use the button next to the name to display some publications already assigned to the person.

Alexandra Tsvilina

 

Other publications of authors with the same name

Color-Distance Oracles and Snippets., and . CPM, volume 54 of LIPIcs, page 24:1-24:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Faster Worst Case Deterministic Dynamic Connectivity., , , and . ESA, volume 57 of LIPIcs, page 53:1-53:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Streaming Pattern Matching with d Wildcards., , and . Algorithmica, 81 (5): 1988-2015 (2019)Sparse Text Indexing in Small Space., , , , , and . ACM Trans. Algorithms, 12 (3): 39:1-39:19 (2016)Persistency in Suffix Trees with Applications to String Interval Problems., , and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 67-80. Springer, (2011)Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time., , , and . CoRR, (2016)Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue., and . ACM Trans. Algorithms, 18 (1): 4e:1-4e:2 (2022)Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap., , , , , and . ISAAC, volume 64 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Real-Time Suffix Tree Construction., , , and . SPIRE, volume 3772 of Lecture Notes in Computer Science, page 67-78. Springer, (2005)Orienting Fully Dynamic Graphs with Worst-Case Time Bounds., , , and . ICALP (2), volume 8573 of Lecture Notes in Computer Science, page 532-543. Springer, (2014)