4 citations · 5 across the 3 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013
Normal Numbers and the Borel Hierarchy
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
We show that the set of absolutely normal numbers is -complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is…
cs.DS2013★ 1 cited
Efficient repeat finding via suffix arrays
Veronica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
We solve the problem of finding interspersed maximal repeats using a suffix array construction. As it is well known, all the functionality of suffix trees can be handled by suffix…