Verónica Becher

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 27

Top Topics

Agnostic Learning

Low Discrepancy Sequences

Topological Spaces

Uniform Distribution

Top Venues

J. Comput. Syst. Sci.

Math. Struct. Comput. Sci.

Publications

Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
De Bruijn Sequences with Minimum Discrepancy. CoRR (2024)
Verónica Becher, Olivier Carton, Santiago Figueira
Rauzy dimension and finite-state dimension. CoRR (2024)
Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
On extremal factors of de Bruijn-like graphs. Discret. Appl. Math. 357 (2024)
Verónica Becher, Nicole Graus
The discrepancy of the Champernowne constant. CoRR (2024)
Verónica Becher, Tomás Tropea
Lyndon pairs and the lexicographically greatest perfect necklace. CoRR (2024)
Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
On extremal factors of de Bruijn-like graphs. CoRR (2023)
Verónica Becher, Olivier Carton
Nested perfect toroidal arrays. CoRR (2023)
Verónica Becher, Serge Grigorieff
Randomness and uniform distribution modulo one. Inf. Comput. 285 (Part) (2022)
Verónica Becher, Gabriel Sac Himelfarb
A construction of a λ- Poisson generic sequence. CoRR (2022)
Verónica Becher, Eda Cesaratto
On the number of words with restrictions on the number of symbols. Adv. Appl. Math. 136 (2022)
Verónica Becher, Gabriel Sac Himelfarb
A construction of a 𝜆-Poisson generic sequence. Math. Comput. 92 (341) (2022)
Verónica Becher, Lucas Cortés
Extending de Bruijn sequences to larger alphabets. Inf. Process. Lett. 168 (2021)
Verónica Becher
Insertion in constructed normal numbers. CoRR (2021)
Emilio Almansi, Verónica Becher
Completely uniformly distributed sequences based on de Bruijn sequences. Math. Comput. 89 (325) (2020)
Verónica Becher, Olivier Carton
Normal numbers and nested perfect necklaces. J. Complex. 54 (2019)
Emilio Almansi, Verónica Becher
Completely uniformly distributed sequences based on de Bruijn sequences. CoRR (2019)
Verónica Becher, Lucas Cortés
Extending de Bruijn sequences to larger alphabets. CoRR (2019)
Verónica Becher, Olivier Carton, Ignacio Mollo Cunningham
Low discrepancy sequences failing Poissonian pair correlations. CoRR (2019)
Nicolás Alvarez, Verónica Becher, Olivier Carton
Finite-state independence and normal sequences. J. Comput. Syst. Sci. 103 (2019)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Finite-State Independence. Theory Comput. Syst. 62 (7) (2018)
Christoph Aistleitner, Verónica Becher, Olivier Carton
Normal numbers with digit dependencies. CoRR (2018)
Nicolás Alvarez, Verónica Becher, Olivier Carton
Finite-state Independence and Normal Sequences. CoRR (2017)
Nicolás Alvarez, Verónica Becher
M. Levin's construction of absolutely normal numbers with very low discrepancy. Math. Comput. 86 (308) (2017)
Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman
On absolutely normal numbers and their discrepancy estimate. CoRR (2017)
Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman
Perfect Necklaces. CoRR (2016)
Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman
Perfect necklaces. Adv. Appl. Math. 80 (2016)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Finite-state independence. CoRR (2016)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
A computable absolutely normal Liouville number. Math. Comput. 84 (296) (2015)
Verónica Becher, Olivier Carton, Pablo Ariel Heiber
Normality and automata. J. Comput. Syst. Sci. 81 (8) (2015)
Nicolás Alvarez, Verónica Becher
M. Levin's construction of absolutely normal numbers with very low discrepancy. CoRR (2015)
Verónica Becher, Serge Grigorieff
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Math. Struct. Comput. Sci. 25 (7) (2015)
Verónica Becher, Serge Grigorieff
Wadge hardness in Scott spaces and its effectivization. Math. Struct. Comput. Sci. 25 (7) (2015)
Verónica Becher, Theodore A. Slaman
On the normality of numbers to different bases. J. Lond. Math. Soc. 90 (2) (2014)
Verónica Becher, Pablo Ariel Heiber
Normal numbers and finite automata. Theor. Comput. Sci. 477 (2013)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. 232 (2013)
Verónica Becher, Serge Grigorieff
Wadge Hardness in Scott Spaces and Its Effectivization. CoRR (2013)
Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
Efficient repeat finding via suffix arrays CoRR (2013)
Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber
Efficient repeat finding in sets of strings via suffix arrays. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
Normal Numbers and the Borel Hierarchy. CoRR (2013)
Verónica Becher, Serge Grigorieff
Borel and Hausdorff Hierarchies in Topological Spaces of Choquet Games and Their Effectivization. CoRR (2013)
Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo
Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2 (1) (2012)
Verónica Becher
Turing's Normal Numbers: Towards Randomness. CiE (2012)
Verónica Becher, Pablo Ariel Heiber
A linearly computable measure of string complexity. Theor. Comput. Sci. 438 (2012)
Verónica Becher, Pablo Ariel Heiber
On extending de Bruijn sequences. Inf. Process. Lett. 111 (18) (2011)
Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinform. 25 (14) (2009)
Verónica Becher, Serge Grigorieff
: random reals and possibly infinite computations. Part II. J. Symb. Log. 74 (1) (2009)
Verónica Becher, Santiago Figueira, Rafael Picchi
Turing's unpublished algorithm for normal numbers. Theor. Comput. Sci. 377 (1-3) (2007)
Verónica Becher, Serge Grigorieff
Random reals à la Chaitin with or without prefix-freeness. Theor. Comput. Sci. 385 (1-3) (2007)
Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller
Randomness and halting probabilities. J. Symb. Log. 71 (4) (2006)
Verónica Becher, Serge Grigorieff
Random reals and possibly infinite computations Part I: Randomness in ∅'. J. Symb. Log. 70 (3) (2005)
Verónica Becher, Santiago Figueira
Kolmogorov Complexity for Possibly Infinite Computations. J. Log. Lang. Inf. 14 (2) (2005)
Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46 (1) (2005)
Verónica Becher, Serge Grigorieff
Recursion and topology on 2<=omega for possibly infinite computations. Theor. Comput. Sci. 322 (1) (2004)
Verónica Becher, Gregory J. Chaitin
Another Example of Higher Order Randomness. Fundam. Informaticae 51 (4) (2002)
Verónica Becher, Santiago Figueira
An example of a computable absolutely normal number. Theor. Comput. Sci. 270 (1-2) (2002)
Verónica Becher, Sergio Daicz, Gregory J. Chaitin
A Highly Random Number. DMTCS (2001)
Craig Boutilier, Verónica Becher
Abduction as Belief Revision. Artif. Intell. 77 (1) (1995)
Verónica Becher
Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version. SBIA (1995)
Craig Boutilier, Verónica Becher
Abduction As Belief Revision: A Model of Preferred Explanations. AAAI (1993)