|
This article is cited in 2 scientific papers (total in 2 papers)
Lower bounds of temporal and spatial complexity of the substring search problem
E. M. Perper M. V. Lomonosov Moscow State University
Received: 14.10.2013
Citation:
E. M. Perper, “Lower bounds of temporal and spatial complexity of the substring search problem”, Diskr. Mat., 26:2 (2014), 58–70; Discrete Math. Appl., 24:6 (2014), 373–382
Linking options:
https://www.mathnet.ru/eng/dm1280https://doi.org/10.4213/dm1280 https://www.mathnet.ru/eng/dm/v26/i2/p58
|
Statistics & downloads: |
Abstract page: | 466 | Full-text PDF : | 182 | References: | 47 | First page: | 26 |
|