This article is cited in 2 papers

Lower bounds of temporal and spatial complexity of the substring search problem

E. M. Perper

M. V. Lomonosov Moscow State University

UDC: 519.712

Received: 14.10.2013

DOI: 10.4213/dm1280

 English version: Discrete Mathematics and Applications, 2014, 24:6, 373–382

Bibliographic databases:

• 
• 
•