Author:
Merkurev Oleg,Shur Arseny M.
Publisher
Springer International Publishing
Reference20 articles.
1. Andersson, A., Thorup, M.: Dynamic ordered sets with exponential search trees. J. ACM 54(3), 13 (2007)
2. Lecture Notes in Computer Science;Y Arbitman,2009
3. Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The “runs” theorem. SIAM J. Comput. 46(5), 1501–1514 (2017)
4. Lecture Notes in Computer Science;D Breslauer,2011
5. Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13, 405–425 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Small-space and streaming pattern matching with $k$ edits;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Computing The Maximum Exponent in a Stream;Algorithmica;2021-11-03