List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Finite-state independence Theory of Computing Systems | 2018-10-05 | Paper |
| Normality and automata Journal of Computer and System Sciences | 2015-08-31 | Paper |
| A computable absolutely normal Liouville number Mathematics of Computation | 2015-08-13 | Paper |
| Normality and two-way automata Information and Computation | 2015-05-04 | Paper |
| Normal numbers and the Borel hierarchy Fundamenta Mathematicae | 2014-05-19 | Paper |
| Efficient repeat finding in sets of strings via suffix arrays | 2014-02-14 | Paper |
| A polynomial-time algorithm for computing absolutely normal numbers Information and Computation | 2013-12-13 | Paper |
| Normal numbers and finite automata Theoretical Computer Science | 2013-04-17 | Paper |
| On extending de Bruijn sequences Information Processing Letters | 2013-04-04 | Paper |
| A linearly computable measure of string complexity Theoretical Computer Science | 2012-08-08 | Paper |
Research outcomes over time
This page was built for person: Pablo Ariel Heiber
