Follow
Pablo Ariel Heiber
Title
Cited by
Cited by
Year
A polynomial-time algorithm for computing absolutely normal numbers
V Becher, PA Heiber, TA Slaman
Information and Computation 232, 1-9, 2013
442013
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
382009
Normal numbers and finite automata
V Becher, PA Heiber
Theoretical Computer Science 477, 109-116, 2013
362013
On extending de Bruijn sequences
V Becher, PA Heiber
Information Processing Letters 111 (18), 930-932, 2011
342011
Normality and automata
V Becher, O Carton, PA Heiber
Journal of Computer and System Sciences 81 (8), 1592-1613, 2015
262015
A computable absolutely normal Liouville number
V Becher, P Heiber, T Slaman
Mathematics of Computation 84 (296), 2939-2952, 2015
172015
Normal numbers and the Borel hierarchy
V Becher, PA Heiber, TA Slaman
arXiv preprint arXiv:1311.0335, 2013
172013
Normality and two-way automata
O Carton, PA Heiber
Information and Computation 241, 264-276, 2015
162015
A linearly computable measure of string complexity
V Becher, PA Heiber
Theoretical Computer Science 438, 62-73, 2012
162012
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
152007
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
152007
A better complexity of finite sequences
V Becher, PA Heiber
8th Int. Conf. on Computability and Complexity in Analysis and 6th Int. Conf …, 2011
102011
Finite-state independence
V Becher, O Carton, PA Heiber
Theory of Computing Systems 62 (7), 1555-1572, 2018
92018
Efficient repeat finding in sets of strings via suffix arrays
P Barenbaum, V Becher, A Deymonnaz, M Halsband, PA Heiber
Discrete Mathematics and Theoretical Computer Science 15 (2), 59--70, 2013
92013
Truthful stochastic and deterministic auctions for sponsored search
E Feuerstein, PA Heiber, M Mydlarz
2008 Latin American Web Conference, 39-48, 2008
52008
Efficient repeat finding via suffix arrays
V Becher, A Deymonnaz, PA Heiber
arXiv preprint arXiv:1304.0528, 2013
12013
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
12009
Una perspectiva computacional sobre números normales
PA Heiber
Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 2014
2014
Efficient repeat finding in sets of strings via suffix arrays
PA Heiber, M Halsband, A Deymonnaz, V Becher, P Barenbaum
Discrete Mathematics & Theoretical Computer Science 15, 2013
2013
Normality and differentiability
V Becher, PA Heiber
Seventh International Conference on Computability, Complexity and Randomness …, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–20