Verónica Becher

IEEE Trans. Inf. Theory, October, 2024

On extremal factors of de Bruijn-like graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

De Bruijn Sequences with Minimum Discrepancy.

[BibT_eX]

[DOI]

CoRR, 2024

The discrepancy of the Champernowne constant.

[BibT_eX]

[DOI]

Nicole Graus

CoRR, 2024

Rauzy dimension and finite-state dimension.

[BibT_eX]

[DOI]

CoRR, 2024

Lyndon pairs and the lexicographically greatest perfect necklace.

[BibT_eX]

[DOI]

Tomás Tropea

CoRR, 2024

2023

Nested perfect toroidal arrays.

[BibT_eX]

[DOI]

CoRR, 2023

2022

A construction of a 𝜆-Poisson generic sequence.

[BibT_eX]

[DOI]

Gabriel Sac Himelfarb

Math. Comput., November, 2022

Randomness and uniform distribution modulo one.

[BibT_eX]

[DOI]

Inf. Comput., 2022

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

[BibT_eX]

[DOI]

Eda Cesaratto

Adv. Appl. Math., 2022

2021

Extending de Bruijn sequences to larger alphabets.

[BibT_eX]

[DOI]

Lucas Cortés

Inf. Process. Lett., 2021

Insertion in constructed normal numbers.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Completely uniformly distributed sequences based on de Bruijn sequences.

[BibT_eX]

[DOI]

Emilio Almansi

Math. Comput., 2020

2019

Finite-state independence and normal sequences.

[BibT_eX]

[DOI]

Nicolás Alvarez

J. Comput. Syst. Sci., 2019

Normal numbers and nested perfect necklaces.

[BibT_eX]

[DOI]

J. Complex., 2019

Low discrepancy sequences failing Poissonian pair correlations.

[BibT_eX]

[DOI]

Ignacio Mollo Cunningham

CoRR, 2019

2018

Finite-State Independence.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Normal numbers with digit dependencies.

[BibT_eX]

[DOI]

Christoph Aistleitner

CoRR, 2018

2017

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

[BibT_eX]

[DOI]

Nicolás Alvarez

Math. Comput., 2017

On absolutely normal numbers and their discrepancy estimate.

[BibT_eX]

[DOI]

Adrian-Maria Scheerer

CoRR, 2017

2016

Perfect necklaces.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

Wadge hardness in Scott spaces and its effectivization.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2015

A computable absolutely normal Liouville number.

[BibT_eX]

[DOI]

Math. Comput., 2015

Normality and automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2015

2014

On the normality of numbers to different bases.

[BibT_eX]

[DOI]

J. Lond. Math. Soc., 2014

2013

Normal numbers and finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A polynomial-time algorithm for computing absolutely normal numbers.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Efficient repeat finding in sets of strings via suffix arrays.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Efficient repeat finding via suffix arrays

[BibT_eX]

[DOI]

Alejandro Deymonnaz

CoRR, 2013

Normal Numbers and the Borel Hierarchy.

[BibT_eX]

[DOI]

CoRR, 2013

2012

A linearly computable measure of string complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Computability, Complexity and Randomness (Dagstuhl Seminar 12021).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2012

Turing's Normal Numbers: Towards Randomness.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

2011

On extending de Bruijn sequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

2009

From index sets to randomness in EMPTY SET <sup>n</sup>: random reals and possibly infinite computations. Part II.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

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

[BibT_eX]

[DOI]

Alejandro Deymonnaz

Bioinform., 2009

2007

Random reals à la Chaitin with or without prefix-freeness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Turing's unpublished algorithm for normal numbers.

[BibT_eX]

[DOI]

Rafael Picchi

Theor. Comput. Sci., 2007

2006

Randomness and halting probabilities.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

2005

Program Size Complexity for Possibly Infinite Computations.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2005

Random reals and possibly infinite computations Part I: Randomness in ∅'.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

Kolmogorov Complexity for Possibly Infinite Computations.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2005

2004

Recursion and topology on 2<=omega for possibly infinite computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2002

An example of a computable absolutely normal number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Another Example of Higher Order Randomness.

[BibT_eX]

[DOI]

Gregory J. Chaitin

Fundam. Informaticae, 2002

2001

A Highly Random Number.

[BibT_eX]

[DOI]

Sergio Daicz

Gregory J. Chaitin

Proceedings of the Combinatorics, 2001

1995

Abduction as Belief Revision.

[BibT_eX]

[DOI]

Craig Boutilier

Artif. Intell., 1995

Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 1995

1993

Abduction As Belief Revision: A Model of Preferred Explanations.

[BibT_eX]

[DOI]

Craig Boutilier