VERONICA BECHER; GABRIEL SAC HIMELFARB

A construction of a lambda-Pooisson generic sequence

MATHEMATICS OF COMPUTATION; Lugar: Providence; Año: 2023

VERONICA BECHER; AGUSTÍN MARCHIONNA; GÉRALD TENENBAUM

Simply normal numbers with digit dependencies

Mathematika; Lugar: Londres; Año: 2023 vol. 69 p. 988 - 991

BECHER, VERÓNICA

Insertion in constructed normal numbers

Uniform Distribution Theory; Lugar: Vienna; Año: 2022 vol. 17 p. 55 - 76

ÁLVAREZ, NICOLÁS; BECHER, VERÓNICA; MEREB, MARTIN

Poisson generic sequences

INTERNATIONAL MATHEMATICS RESEARCH NOTICES; Lugar: Oxford; Año: 2022

BECHER, VERÓNICA; CESARATTO, EDA

On the number of words with restrictions on the number of symbols

ADVANCES IN APPLIED MATHEMATICS; Año: 2022 vol. 136

BECHER, VERÓNICA; MADRITSCH, MANFRED

On a question of Mendès France on normal numbers

ACTA ARITHMETICA; Lugar: VARSOVIA; Año: 2022

BECHER, VERÓNICA; GRIGORIEFF, SERGE

Randomness and uniform distribution modulo one

Information and Computation; Año: 2021 vol. 285

BECHER, VERÓNICA; CORTÉS, LUCAS

Extending de Bruijn sequences to larger alphabets

INFORMATION PROCESSING LETTERS; Año: 2021 vol. 168

ALMANSI, EMILIO; BECHER, VERÓNICA

Completely uniformly distributed sequences based on de Bruijn sequence

MATHEMATICS OF COMPUTATION; Lugar: Providence; Año: 2020 vol. 89 p. 2537 - 2551

CHRISTOPH AISTLEITNE; VERÓNICA BECHER; OLIVIER CARTON

Normal numbers with digit dependencies

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY; Lugar: Providence; Año: 2019 vol. 113 p. 169 - 178

BECHER, VERÓNICA; CARTÓN, OLIVIER; MOLLO CUNNINGHAM, IGNACIO

Low discrepancy sequences failing Poissonian pair correlations

ARCHIV DER MATHEMATIK; Lugar: BASEL; Año: 2019 vol. 113 p. 169 - 178

VERÓNICA BECHER; OLIVIER CARTON

Normal numbers and nested perfect necklaces

JOURNAL OF COMPLEXITY; Lugar: Amsterdam; Año: 2019 vol. 54 p. 1403 - 1403

VERÓNICA BECHER; SERGIO A. YUHJTMAN

On absolutely normal and continued fraction normal numbers

INTERNATIONAL MATHEMATICS RESEARCH NOTICES; Lugar: Oxford; Año: 2019 vol. 19 p. 6136 - 6161

ÁLVAREZ, NICOLÁS; BECHER, VERÓNICA; CARTON, OLIVIER

Finite-state independence and normal sequences

JOURNAL OF COMPUTER AND SYSTEM SCIENCES; Año: 2019 vol. 103 p. 1 - 17

VERÓNICA BECHER; JAN REIMANN; THEODORE A. SLAMAN

Irrationality Exponent, Hausdorff Dimension and Effectivization

MONATSHEFETE FUR MATHEMATIK; Lugar: Viena; Año: 2018 vol. 185 p. 167 - 188

VERÓNICA BECHER; PABLO ARIEL HEIBER; OLIVIER CARTON

Finite state independence

THEORY OF COMPUTING SYSTEMS; Lugar: Berlin; Año: 2018 vol. 62 p. 1555 - 1572

CHRISTOPH C. AISTLEITNER; VERÓNICA BECHER; ADRIAN-MARIA SCHEERER; THEODORE SLAMAN

On the construction of absolutely normal numbers

ACTA ARITHMETICA; Lugar: VARSOVIA; Año: 2017 vol. 180 p. 333 - 346

NICOLÁS ALVAREZ; BECHER, VERÓNICA

M. Levin's construction of absolutely normal numbers with very low discrepancy

MATHEMATICS OF COMPUTATION; Lugar: Providence; Año: 2017 vol. 86 p. 2927 - 2946

BECHER, VERÓNICA; BUGEAUD, YANN; SLAMAN, THEODORE A.

The irrationality exponents of computable numbers

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY; Lugar: Providence; Año: 2016 vol. 144 p. 1509 - 1521

TURJANSKI, PABLO; PARRA, GONZALO; ESPADA, ROCIO; BECHER, VERÓNICA; FERREIRO, DIEGO

Protein Repeats form First Principles

Scientific Rports; Año: 2016

BECHER, VERÓNICA; BUGEAUD, YANN; SLAMAN, THEODORE A.

On Simply Normal Numbers to different bases

MATHEMATISCHE ANNALEN; Lugar: Berlin; Año: 2016 vol. 364 p. 125 - 150

NICOLÁS ALVAREZ; VERÓNICA BECHER; PABLO A. FERRARI; SERGIO A. YUHJTMAN

Perfect Necklaces

ADVANCES IN APPLIED MATHEMATICS; Lugar: Amsterdam; Año: 2016 vol. 80 p. 48 - 61

BECHER, VERÓNICA; CARTÓN, OLIVIER; HEIBER, PABLO ARIEL

Normality and Automata

JOURNAL OF COMPUTER AND SYSTEM SCIENCES; Lugar: Amsterdam; Año: 2015 vol. 81 p. 1592 - 1613

VERÓNICA BECHER; HEIBER, PABLO ARIEL; SLAMAN, THEODORE A.

A computable absolutely normal Liouville number

MATHEMATICS OF COMPUTATION; Lugar: Providence; Año: 2015 vol. 84 p. 2939 - 2952

BECHER, VERÓNICA; GRIGOREFF, SERGE

Wadge hardness in Scott spaces and its effectivization

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE; Lugar: Cambridge; Año: 2015 vol. 25 p. 1520 - 1545

BECHER, VERÓNICA; GRIGOREFF, SERGE

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE; Lugar: Cambridge; Año: 2015 vol. 25 p. 1490 - 1515

VERÓNICA BECHER; PABLO ARIEL HEIBER; THEODORE A. SLAMAN

Normal numbers and the Borel hierarchy

FUNDAMENTA MATHEMATICAE; Lugar: VARSOVIA; Año: 2014 vol. 226 p. 63 - 77

BECHER, VERÓNICA; SLAMAN, THEODORE A.

On the Normality of Numbers to Different Bases

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY; Lugar: Londres; Año: 2014 vol. 90 p. 472 - 494

SERRA, FRANCOIS; BECHER, VERÓNICA; DOPAZO, HERNÁN

Neutral theory predicts the relative abundance and diversity of genetic elements in a broad array of eukaryotic genomes

PLOS ONE; Lugar: San Francisco; Año: 2013 vol. 8 p. 63915 - 63915

BECHER, VERÓNICA; HEIBER, PABLO

Normal numbers and finite automata

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2013 vol. 477 p. 109 - 116

BARENBAUM, PABLO; BECHER, VERÓNICA; DEYMONNAZ, ALEJANDRO; HALSBAND, MELISA; PABLO ARIEL HEIBER

Efficient repeat finding in sets of strings via suffix arrays

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE (DMTCS); Año: 2013 vol. 15 p. 1 - 1

VERÓNICA BECHER; PABLO ARIEL HEIBER; THEODORE A.SLAMAN

A polynomial-time algorithm for computing absolutely normal numbers

Information and Computation; Lugar: Amsterdam; Año: 2013 vol. 232 p. 1 - 9

BECHER, VERÓNICA; GRIGOREFF, SERGE

Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE; Lugar: Cambridge; Año: 2013 vol. 25

BECHER, VERÓNICA; GRIGOREFF, SERGE

Wadge hardness in Scott spaces and its effectivization

MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE; Lugar: Cambridge; Año: 2013 vol. 25

VERÓNICA BECHER; LAURENT BIENVENU; ROD DOWNEY; ELVIRA MAYORDOMO

Computability, Complexity and Randomness (Seminar 12021)

DAGSTUHL REPORTS; Año: 2012 vol. 2 p. 19 - 38

VERÓNICA BECHER

Turing's normal numbers: towards randomness

LECTURE NOTES IN COMPUTER SCIENCE; Lugar: Heidelberg; Año: 2012 vol. 7318 p. 35 - 45

VERÓNICA BECHER; PABLO ARIEL HEIBER

A linearly computable measure of string complexity

THEORETICAL COMPUTER SCIENCE; Lugar: Amsterdam; Año: 2012 vol. 438 p. 62 - 73

VERÓNICA BECHER; PABLO ARIEL HEIBER

On extending de Bruijn sequences

INFORMATION PROCESSING LETTERS; Año: 2011 vol. 111 p. 930 - 932

VERÓNICA BECHER; SERGE GRIGORIEFF

From index sets to randomness in the the n-th jump of the halting problem. Random reals and possibly infinite computations Part II"

JOURNAL OF SYMBOLIC LOGIC, THE; Año: 2009 vol. 74 p. 124 - 156

BECHER, VERÓNICA; HEIBER, PABLO; DEYMONNAZ, ALEJANDRO

Efficient computation of all perfect repeats in genomic sequences of up to half a Gigabyte, with a case study on the Human genome

BIOINFORMATICS (OXFORD, ENGLAND); Año: 2009 vol. 25 p. 1746 - 1753

VERÓNICA BECHER; SERGE GRIGORIEFF

Random reals à la Chaitin with or without prefix freeness

THEORETICAL COMPUTER SCIENCE; Año: 2007 vol. 385 p. 193 - 201

VERÓNICA BECHER; SANTIAGO FIGUEIRA; RAFAEL PICCHI

Turing's unpublished algorithm for normal numbers

THEORETICAL COMPUTER SCIENCE; Año: 2007 vol. 377 p. 126 - 138

VERÓNICA BECHER; SANTIAGO FIGUEIRA; SERGE GRIGORIEFF; JOSEPH MILLER

Randomness and Halting Probabilities

JOURNAL OF SYMBOLIC LOGIC, THE; Año: 2006 vol. 71 p. 1411 - 1430

BECHER, VERÓNICA; GRIGOREFF, SERGE

RAMDOM REALS AND POSSIBLY INFINITE COMPUTATIONS. Part I: randomnes in the first jump of the halting problem

JOURNAL OF SYMBOLIC LOGIC, THE; Año: 2005 vol. 70 p. 891 - 913

BECHER, VERÓNICA; FIGUEIRA, SANTIAGO

Kolmogorov Complexity for Possibly Infinite Computations

Journal of Logic Language and Information; Año: 2005 vol. 14 p. 133 - 148

BECHER, VERÓNICA; FIGUEIRA, SANTIAGO; NIES, ANDRÉ; PICCHI, SIILVANA

Program size complexity for possibly infinite computations

NOTRE DAME JOURNAL OF FORMAL LOGIC; Año: 2005 vol. 46 p. 51 - 64

VERÓNICA BECHER; SERGE GRIGORIEFF

Recursion and Topology on finite and infinite words for possibly Infinite computations

THEORETICAL COMPUTER SCIENCE; Año: 2004 vol. 322 p. 85 - 136

VERÓNICA BECHER; GREGORY CHAITIN

Another example of higher order randomness

FUNDAMENTA INFORMATICAE; Año: 2002 vol. 51 p. 325 - 338

VERÓNICA BECHER; SANTIAGO FIGUEIRA

An example of a computable absolutely normal number

THEORETICAL COMPUTER SCIENCE; Año: 2002 vol. 270 p. 947 - 958

VERÓNICA BECHER; CRAIG BOUTILIER

Abduction as Belief Revision

ARTIFICIAL INTELLIGENCE; Año: 1995 vol. 77 p. 43 - 94

VERÓNICA BECHER

Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version

LECTURE NOTES IN COMPUTER SCIENCE; Año: 1995 vol. 991 p. 49 - 58