4 citations · 5 across the 3 of their papers we have counts for
4 papers
Learning to Improve Code Efficiency
Binghong Chen, Daniel Tarlow, Kevin Swersky +5
Improvements in the performance of computing systems, driven by Moore's Law, have transformed society. As such hardware-driven gains slow down, it becomes even more important for s…
Finite-state independence
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
In this work we introduce a notion of independence based on finite-state automata: two infinite words are independent if no one helps to compress the other using one-to-one finite-…
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…
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…