Follow
Verónica Becher
Title
Cited by
Cited by
Year
Abduction as belief revision
C Boutilier, V Becher
Artificial Intelligence 77 (1), 43-94, 1995
1881995
An example of a computable absolutely normal number
V Becher, S Figueira
Theoretical Computer Science 270 (1-2), 947-958, 2002
1012002
Multiple genome rearrangement by swaps and by element duplications
VY Popov
Theoretical Computer Science 385 (1-3), 115-126, 2007
872007
Turing’s unpublished algorithm for normal numbers
V Becher, S Figueira, R Picchi
Theoretical Computer Science 377 (1), 126-138, 2007
622007
Iterable AGM functions
C Areces, V Becher
Frontiers in belief revision, Frontiers in Belief Revision. Applied Logic …, 2001
532001
A polynomial-time algorithm for computing absolutely normal numbers
V Becher, PA Heiber, TA Slaman
Information and Computation 232, 1--9, 2013
462013
On extending de Bruijn sequences
VA Becher, PA Heiber
Information Processing Letters 111 (18), 930–932, 2011
382011
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
372013
A highly random number
V Becher, S Daicz, G Chaitin
Combinatorics, Computability and Logic: Proceedings of the Third …, 2001
312001
On the normality of numbers to different bases
V Becher, TA Slaman
Journal of the London Mathematical Society 90 (2), 472-494, 2014
302014
Normality and Automata
V Becher, PA Heiber, O Carton
Journal of Computer and Systems Sciences 81 (8), 1592--1613, 2015
282015
Randomness and halting probabilities
V Becher, S Figueira, S Grigorieff, JS Miller
Journal of Symbolic Logic 71 (4), 1411-1430, 2006
232006
Random reals and possibly infinite computations Part I: Randomness in the first jump of the halting problem
V Becher, S Grigorieff
Journal of Symbolic Logic 70 (3), 891-913, 2005
232005
Normal numbers and the Borel hierarchy
V Becher, PA Heiber, TA Slaman
Fundamenta Mathematicae 226, 63-77, 2014
212014
A computable absolutely normal Liouville number
V Becher, PA Heiber, TA Slaman
Mathematics of Computation 84 (296), 2939–2952, 2015
192015
Neutral theory predicts the relative abundance and diversity of genetic elements in a broad array of eukaryotic genomes
F Serra, V Becher, H Dopazo
PLoS One 8 (6), e63915, 2013
182013
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization
V Becher, S Grigorieff
Mathematical Structures in Computer Science 25 (7), 1490-1519, 2015
172015
A linearly computable measure of string complexity
V Becher, PA Heiber
Theoretical Computer Science 438, 62-73, 2012
172012
Another example of higher order randomness
V Becher, GJ Chaitin
Fundamenta Informaticae 51 (4), 325-338, 2002
172002
The system can't perform the operation now. Try again later.
Articles 1–20