| A polynomial-time algorithm for computing absolutely normal numbers V Becher, PA Heiber, TA Slaman Information and Computation 232, 1-9, 2013 | 46 | 2013 |
| Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome V Becher, A Deymonnaz, P Heiber Bioinformatics 25 (14), 1746-1753, 2009 | 38 | 2009 |
| On extending de Bruijn sequences VA Becher, PA Heiber Elsevier Science, 2011 | 37 | 2011 |
| Normal numbers and finite automata V Becher, PA Heiber Theoretical Computer Science 477, 109-116, 2013 | 36 | 2013 |
| Normality and automata V Becher, O Carton, PA Heiber Journal of Computer and System Sciences 81 (8), 1592-1613, 2015 | 27 | 2015 |
| Normal numbers and the Borel hierarchy V Becher, PA Heiber, TA Slaman arXiv preprint arXiv:1311.0335, 2013 | 21 | 2013 |
| A computable absolutely normal Liouville number V Becher, PA Heiber, TA Slaman Mathematics of Computation, 2939-2952, 2015 | 19 | 2015 |
| A linearly computable measure of string complexity V Becher, PA Heiber Theoretical Computer Science 438, 62-73, 2012 | 18 | 2012 |
| Normality and two-way automata O Carton, PA Heiber Information and Computation 241, 264-276, 2015 | 16 | 2015 |
| New stochastic algorithms for scheduling ads in sponsored search E Feuerstein, PA Heiber, J Martínez-Viademonte, R Baeza-Yates 2007 Latin American Web Conference (LA-WEB 2007), 22-31, 2007 | 15 | 2007 |
| Finite-state independence V Becher, O Carton, PA Heiber Theory of Computing Systems 62, 1555-1572, 2018 | 10 | 2018 |
| Efficient repeat finding in sets of strings via suffix arrays P Barenbaum, V Becher, A Deymonnaz, M Halsband, PA Heiber Discrete Mathematics & Theoretical Computer Science 15 (Discrete Algorithms), 2013 | 10 | 2013 |
| A better complexity of finite sequences V Becher, PA Heiber 8th Int. Conf. on Computability and Complexity in Analysis and 6th Int. Conf …, 2011 | 10 | 2011 |
| Truthful stochastic and deterministic auctions for sponsored search E Feuerstein, PA Heiber, M Mydlarz 2008 Latin American Web Conference, 39-48, 2008 | 5 | 2008 |
| Efficient repeat finding via suffix arrays V Becher, A Deymonnaz, PA Heiber arXiv preprint arXiv:1304.0528, 2013 | 1 | 2013 |
| Optimal auctions capturing constraints in sponsored search E Feuerstein, PA Heiber, M Lopez-Rosenfeld, M Mydlarz International Conference on Algorithmic Applications in Management, 188-201, 2009 | 1 | 2009 |
| Una perspectiva computacional sobre números normales PA Heiber Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 2014 | | 2014 |
| Normality and differentiability V Becher, PA Heiber Seventh International Conference on Computability, Complexity and Randomness …, 2012 | | 2012 |
| Optimal stochastic auctions for constrained sponsored search M Mydlarz, E Feuerstein, PA Heiber US Patent 8,051,062, 2011 | | 2011 |
| Tesis de Licenciatura en Ciencias de la Computación PA Heiber | | 2009 |
Verónica BecherUniversidad de Buenos Aires & CONICETDirección de correo verificada de dc.uba.ar
