Efficient counting of square substrings in a tree

Theoretical Computer Science 2014 / 08 Vol. 544

Efficient counting of square substrings in a tree

Kociumaka, Tomasz, Pachocki, Jakub, Radoszewski, Jakub, Rytter, Wojciech, Waleń, Tomasz
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
544
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2014.04.015
Date:
August, 2014
File:
PDF, 846 KB
english, 2014
Conversion to is in progress
Conversion to is failed