Author： Merlini D. Sprugnoli R. Cecilia Verri M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.285, Iss.1, 2002-08, pp. : 73-88
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
An Approximation Algorithm for Binary Searching in Trees
By Laber Eduardo Molinaro Marco
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
Access to resources
Recommend
Compact searchable static binary trees
By Durgan B.K.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
Stringlish: improved English string searching in binary files
SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 45, Iss. 11, 2015-11 ,pp. :
Stringlish: improved English string searching in binary files
SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 38-0644, Iss. 11, 2015-11 ,pp. :