Search for Author All Reviews
	Ohlebusch, Enno     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       Space-efficient parallel construction of succinct representations of suffix tree topologies Baier U., Beller T., Ohlebusch E. Journal of Experimental Algorithmics 22(1): 1-26, 2017.  Type: Article A suffix tree is a compressed tree that represents all the suffixes of a given string. Such a data structure has wide applications in string processing, bioinformatics, and information retrieval and can be constructed with space/time c...... Jan 24 2018     Advanced topics in term rewriting Ohlebusch E., Springer-Verlag, London, UK, 2002. 414 pp.  Type: Book (9780387952505) Equational logic--replacing “equals by equals”--and equational reasoning are at the heart of several different subfields of computer science, including computer algebra, software engineering (alge...... Sep 4 2002
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy