Verónica Becher

65 papers A* 1C 1Journal 61Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Automata for the commutative closure of regular languages. J. Comput. Syst. Sci. Verónica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham
2026	J	`jnl`	The Discrepancy of the Champernowne Constant. Am. Math. Mon. Verónica Becher, Nicole Graus
2025	J	`jnl`	Automata for the commutative closure of regular sets. CoRR Verónica Becher, Simon Lew Deveali, Ignacio Mollo Cunningham
2025	J	`jnl`	Rauzy complexity and block entropy. Inf. Comput. Verónica Becher, Olivier Carton, Santiago Figueira
2025	J	`jnl`	The descriptive complexity of the set of Poisson generic numbers. J. Math. Log. Verónica Becher, Stephen Jackson, Dominik Kwietniak, Bill Mance
2024	J	`jnl`	De Bruijn Sequences with Minimum Discrepancy. CoRR Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
2024	J	`jnl`	Lyndon pairs and the lexicographically greatest perfect necklace. CoRR Verónica Becher, Tomás Tropea
2024	J	`jnl`	Nested Perfect Arrays. IEEE Trans. Inf. Theory Verónica Becher, Olivier Carton
2024	J	`jnl`	On extremal factors of de Bruijn-like graphs. Discret. Appl. Math. Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
2024	J	`jnl`	Rauzy dimension and finite-state dimension. CoRR Verónica Becher, Olivier Carton, Santiago Figueira
2024	J	`jnl`	The discrepancy of the Champernowne constant. CoRR Verónica Becher, Nicole Graus
2023	J	`jnl`	Nested perfect toroidal arrays. CoRR Verónica Becher, Olivier Carton
2023	J	`jnl`	On extremal factors of de Bruijn-like graphs. CoRR Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto
2022	J	`jnl`	A construction of a λ- Poisson generic sequence. CoRR Verónica Becher, Gabriel Sac Himelfarb
2022	J	`jnl`	A construction of a 𝜆-Poisson generic sequence. Math. Comput. Verónica Becher, Gabriel Sac Himelfarb
2022	J	`jnl`	On the number of words with restrictions on the number of symbols. Adv. Appl. Math. Verónica Becher, Eda Cesaratto
2022	J	`jnl`	Randomness and uniform distribution modulo one. Inf. Comput. Verónica Becher, Serge Grigorieff
2021	J	`jnl`	Extending de Bruijn sequences to larger alphabets. Inf. Process. Lett. Verónica Becher, Lucas Cortés
2021	J	`jnl`	Insertion in constructed normal numbers. CoRR Verónica Becher
2020	J	`jnl`	Completely uniformly distributed sequences based on de Bruijn sequences. Math. Comput. Emilio Almansi, Verónica Becher
2019	J	`jnl`	Completely uniformly distributed sequences based on de Bruijn sequences. CoRR Emilio Almansi, Verónica Becher
2019	J	`jnl`	Extending de Bruijn sequences to larger alphabets. CoRR Verónica Becher, Lucas Cortés
2019	J	`jnl`	Finite-state independence and normal sequences. J. Comput. Syst. Sci. Nicolás Alvarez, Verónica Becher, Olivier Carton
2019	J	`jnl`	Low discrepancy sequences failing Poissonian pair correlations. CoRR Verónica Becher, Olivier Carton, Ignacio Mollo Cunningham
2019	J	`jnl`	Normal numbers and nested perfect necklaces. J. Complex. Verónica Becher, Olivier Carton
2018	J	`jnl`	Finite-State Independence. Theory Comput. Syst. Verónica Becher, Olivier Carton, Pablo Ariel Heiber
2018	J	`jnl`	Normal numbers with digit dependencies. CoRR Christoph Aistleitner, Verónica Becher, Olivier Carton
2017	J	`jnl`	Finite-state Independence and Normal Sequences. CoRR Nicolás Alvarez, Verónica Becher, Olivier Carton
2017	J	`jnl`	M. Levin's construction of absolutely normal numbers with very low discrepancy. Math. Comput. Nicolás Alvarez, Verónica Becher
2017	J	`jnl`	On absolutely normal numbers and their discrepancy estimate. CoRR Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman
2016	J	`jnl`	Finite-state independence. CoRR Verónica Becher, Olivier Carton, Pablo Ariel Heiber
2016	J	`jnl`	Perfect Necklaces. CoRR Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman
2016	J	`jnl`	Perfect necklaces. Adv. Appl. Math. Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman
2015	J	`jnl`	A computable absolutely normal Liouville number. Math. Comput. Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2015	J	`jnl`	Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Math. Struct. Comput. Sci. Verónica Becher, Serge Grigorieff
2015	J	`jnl`	M. Levin's construction of absolutely normal numbers with very low discrepancy. CoRR Nicolás Alvarez, Verónica Becher
2015	J	`jnl`	Normality and automata. J. Comput. Syst. Sci. Verónica Becher, Olivier Carton, Pablo Ariel Heiber
2015	J	`jnl`	Wadge hardness in Scott spaces and its effectivization. Math. Struct. Comput. Sci. Verónica Becher, Serge Grigorieff
2014	J	`jnl`	On the normality of numbers to different bases. J. Lond. Math. Soc. Verónica Becher, Theodore A. Slaman
2013	J	`jnl`	A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2013	J	`jnl`	Borel and Hausdorff Hierarchies in Topological Spaces of Choquet Games and Their Effectivization. CoRR Verónica Becher, Serge Grigorieff
2013	J	`jnl`	Efficient repeat finding in sets of strings via suffix arrays. Discret. Math. Theor. Comput. Sci. Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber
2013	J	`jnl`	Efficient repeat finding via suffix arrays CoRR Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
2013	J	`jnl`	Normal Numbers and the Borel Hierarchy. CoRR Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman
2013	J	`jnl`	Normal numbers and finite automata. Theor. Comput. Sci. Verónica Becher, Pablo Ariel Heiber
2013	J	`jnl`	Wadge Hardness in Scott Spaces and Its Effectivization. CoRR Verónica Becher, Serge Grigorieff
2012	J	`jnl`	A linearly computable measure of string complexity. Theor. Comput. Sci. Verónica Becher, Pablo Ariel Heiber
2012	J	`jnl`	Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo
2012	C	`conf`	Turing's Normal Numbers: Towards Randomness. CiE Verónica Becher
2011	J	`jnl`	On extending de Bruijn sequences. Inf. Process. Lett. Verónica Becher, Pablo Ariel Heiber
2009	J	`jnl`	Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinform. Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber
2009	J	`jnl`	From index sets to randomness in EMPTY SET J. Symb. Log. Verónica Becher, Serge Grigorieff
2007	J	`jnl`	Random reals à la Chaitin with or without prefix-freeness. Theor. Comput. Sci. Verónica Becher, Serge Grigorieff
2007	J	`jnl`	Turing's unpublished algorithm for normal numbers. Theor. Comput. Sci. Verónica Becher, Santiago Figueira, Rafael Picchi
2006	J	`jnl`	Randomness and halting probabilities. J. Symb. Log. Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller
2005	J	`jnl`	Kolmogorov Complexity for Possibly Infinite Computations. J. Log. Lang. Inf. Verónica Becher, Santiago Figueira
2005	J	`jnl`	Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi
2005	J	`jnl`	Random reals and possibly infinite computations Part I: Randomness in ∅'. J. Symb. Log. Verónica Becher, Serge Grigorieff
2004	J	`jnl`	Recursion and topology on 2<=omega for possibly infinite computations. Theor. Comput. Sci. Verónica Becher, Serge Grigorieff
2002	J	`jnl`	An example of a computable absolutely normal number. Theor. Comput. Sci. Verónica Becher, Santiago Figueira
2002	J	`jnl`	Another Example of Higher Order Randomness. Fundam. Informaticae Verónica Becher, Gregory J. Chaitin
2001	—	`conf`	A Highly Random Number. DMTCS Verónica Becher, Sergio Daicz, Gregory J. Chaitin
1995	J	`jnl`	Abduction as Belief Revision. Artif. Intell. Craig Boutilier, Verónica Becher
1995	—	`conf`	Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version. SBIA Verónica Becher
1993	A*	`conf`	Abduction As Belief Revision: A Model of Preferred Explanations. AAAI Craig Boutilier, Verónica Becher