Abduction As Belief Revision: A Model of Preferred Explanations. - Craig Boutilier; Verónica Becher (AAAI, 1993)

Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version. - Verónica Becher (SBIA, 1995)

Abduction as Belief Revision. - Craig Boutilier; Verónica Becher (Artif. Intell., 1995)

A Highly Random Number. - Verónica Becher; Sergio Daicz; Gregory J. Chaitin (DMTCS, 2001)

Another Example of Higher Order Randomness. - Verónica Becher; Gregory J. Chaitin (Fundam. Informaticae, 2002)

An example of a computable absolutely normal number. - Verónica Becher; Santiago Figueira (Theor. Comput. Sci., 2002)

Recursion and topology on 2<=omega for possibly infinite computations. - Verónica Becher; Serge Grigorieff (Theor. Comput. Sci., 2004)

Kolmogorov Complexity for Possibly Infinite Computations. - Verónica Becher; Santiago Figueira (J. Log. Lang. Inf., 2005)

Random reals and possibly infinite computations Part I: Randomness in ∅'. - Verónica Becher; Serge Grigorieff (J. Symb. Log., 2005)

Program Size Complexity for Possibly Infinite Computations. - Verónica Becher; Santiago Figueira; André Nies; Silvana Picchi (Notre Dame J. Formal Log., 2005)

Randomness and halting probabilities. - Verónica Becher; Santiago Figueira; Serge Grigorieff; Joseph S. Miller (J. Symb. Log., 2006)

Turing's unpublished algorithm for normal numbers. - Verónica Becher; Santiago Figueira; Rafael Picchi (Theor. Comput. Sci., 2007)

Random reals à la Chaitin with or without prefix-freeness. - Verónica Becher; Serge Grigorieff (Theor. Comput. Sci., 2007)

Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. - Verónica Becher; Alejandro Deymonnaz; Pablo Ariel Heiber (Bioinform., 2009)

From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II. - Verónica Becher; Serge Grigorieff (J. Symb. Log., 2009)

On extending de Bruijn sequences. - Verónica Becher; Pablo Ariel Heiber (Inf. Process. Lett., 2011)

Turing's Normal Numbers: Towards Randomness. - Verónica Becher (CiE, 2012)

Computability, Complexity and Randomness (Dagstuhl Seminar 12021). - Verónica Becher; Laurent Bienvenu; Rodney G. Downey; Elvira Mayordomo (Dagstuhl Reports, 2012)

A linearly computable measure of string complexity. - Verónica Becher; Pablo Ariel Heiber (Theor. Comput. Sci., 2012)

Normal Numbers and the Borel Hierarchy. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (CoRR, 2013)

Efficient repeat finding via suffix arrays - Verónica Becher; Alejandro Deymonnaz; Pablo Ariel Heiber (CoRR, 2013)

Efficient repeat finding in sets of strings via suffix arrays. - Pablo Barenbaum; Verónica Becher; Alejandro Deymonnaz; Melisa Halsband; Pablo Ariel Heiber (Discret. Math. Theor. Comput. Sci., 2013)

A polynomial-time algorithm for computing absolutely normal numbers. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (Inf. Comput., 2013)

Normal numbers and finite automata. - Verónica Becher; Pablo Ariel Heiber (Theor. Comput. Sci., 2013)

On the normality of numbers to different bases. - Verónica Becher; Theodore A. Slaman (J. Lond. Math. Soc., 2014)

Normality and automata. - Verónica Becher; Olivier Carton; Pablo Ariel Heiber (J. Comput. Syst. Sci., 2015)

A computable absolutely normal Liouville number. - Verónica Becher; Pablo Ariel Heiber; Theodore A. Slaman (Math. Comput., 2015)

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. - Verónica Becher; Serge Grigorieff (Math. Struct. Comput. Sci., 2015)

Wadge hardness in Scott spaces and its effectivization. - Verónica Becher; Serge Grigorieff (Math. Struct. Comput. Sci., 2015)

Perfect necklaces. - Nicolás Alvarez; Verónica Becher; Pablo A. Ferrari; Sergio A. Yuhjtman (Adv. Appl. Math., 2016)

On absolutely normal numbers and their discrepancy estimate. - Verónica Becher; Adrian-Maria Scheerer; Theodore A. Slaman (CoRR, 2017)

M. Levin's construction of absolutely normal numbers with very low discrepancy. - Nicolás Alvarez; Verónica Becher (Math. Comput., 2017)

Normal numbers with digit dependencies. - Christoph Aistleitner; Verónica Becher; Olivier Carton (CoRR, 2018)

Finite-State Independence. - Verónica Becher; Olivier Carton; Pablo Ariel Heiber (Theory Comput. Syst., 2018)

Low discrepancy sequences failing Poissonian pair correlations. - Verónica Becher; Olivier Carton; Ignacio Mollo Cunningham (CoRR, 2019)

Normal numbers and nested perfect necklaces. - Verónica Becher; Olivier Carton (J. Complex., 2019)

Finite-state independence and normal sequences. - Nicolás Alvarez; Verónica Becher; Olivier Carton (J. Comput. Syst. Sci., 2019)

Completely uniformly distributed sequences based on de Bruijn sequences. - Emilio Almansi; Verónica Becher (Math. Comput., 2020)

Insertion in constructed normal numbers. - Verónica Becher (CoRR, 2021)

Extending de Bruijn sequences to larger alphabets. - Verónica Becher; Lucas Cortés (Inf. Process. Lett., 2021)

On the number of words with restrictions on the number of symbols. - Verónica Becher; Eda Cesaratto (Adv. Appl. Math., 2022)

Randomness and uniform distribution modulo one. - Verónica Becher; Serge Grigorieff (Inf. Comput., 2022)

A construction of a 𝜆-Poisson generic sequence. - Verónica Becher; Gabriel Sac Himelfarb (Math. Comput., 2022)

Nested perfect toroidal arrays. - Verónica Becher; Olivier Carton (CoRR, 2023)

Lyndon pairs and the lexicographically greatest perfect necklace. - Verónica Becher; Tomás Tropea (CoRR, 2024)

Rauzy dimension and finite-state dimension. - Verónica Becher; Olivier Carton; Santiago Figueira (CoRR, 2024)

The discrepancy of the Champernowne constant. - Verónica Becher; Nicole Graus (CoRR, 2024)

De Bruijn Sequences with Minimum Discrepancy. - Nicolás Alvarez; Verónica Becher; Martín Mereb; Ivo Pajor; Carlos Miguel Soto (CoRR, 2024)

On extremal factors of de Bruijn-like graphs. - Nicolás Alvarez; Verónica Becher; Martín Mereb; Ivo Pajor; Carlos Miguel Soto (Discret. Appl. Math., 2024)

Nested Perfect Arrays. - Verónica Becher; Olivier Carton (IEEE Trans. Inf. Theory, 2024)

Rauzy complexity and block entropy. - Verónica Becher; Olivier Carton; Santiago Figueira (Inf. Comput., 2025)

The descriptive complexity of the set of Poisson generic numbers. - Verónica Becher; Stephen Jackson; Dominik Kwietniak; Bill Mance (J. Math. Log., 2025)

Automata for the commutative closure of regular sets. - Verónica Becher; Simon Lew Deveali; Ignacio Mollo Cunningham (CoRR, 2025)