| On the number of words with restrictions on the number of symbols | 0 | 0.34 | 2022 |
| Randomness and uniform distribution modulo one | 0 | 0.34 | 2022 |
| Extending de Bruijn sequences to larger alphabets | 0 | 0.34 | 2021 |
| Normal numbers and nested perfect necklaces | 0 | 0.34 | 2019 |
| Low discrepancy sequences failing Poissonian pair correlations. | 0 | 0.34 | 2019 |
| Finite-state independence. | 0 | 0.34 | 2018 |
| Normal numbers with digit dependencies. | 0 | 0.34 | 2018 |
| M. Levin's construction of absolutely normal numbers with very low discrepancy. | 2 | 0.53 | 2017 |
| On absolutely normal numbers and their discrepancy estimate. | 0 | 0.34 | 2017 |
| Finite-state Independence and Normal Sequences. | 0 | 0.34 | 2017 |
| Perfect Necklaces. | 0 | 0.34 | 2016 |
| Normality and automata | 4 | 0.56 | 2015 |
| A computable absolutely normal Liouville number | 3 | 0.54 | 2015 |
| Normal numbers and the Borel hierarchy | 2 | 0.65 | 2013 |
| Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. | 1 | 0.40 | 2013 |
| Wadge hardness in Scott spaces and its effectivization. | 1 | 0.38 | 2013 |
| Normal numbers and finite automata. | 4 | 0.58 | 2013 |
| A polynomial-time algorithm for computing absolutely normal numbers. | 9 | 1.87 | 2013 |
| Efficient repeat finding in sets of strings via suffix arrays. | 0 | 0.34 | 2013 |
| Efficient repeat finding via suffix arrays | 0 | 0.34 | 2013 |
| A linearly computable measure of string complexity | 1 | 0.36 | 2012 |
| Computability, Complexity and Randomness (Dagstuhl Seminar 12021). | 0 | 0.34 | 2012 |
| Turing's normal numbers: towards randomness | 1 | 0.35 | 2012 |
| On extending de Bruijn sequences | 3 | 0.41 | 2011 |
| From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II | 0 | 0.34 | 2009 |
| Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. | 13 | 0.69 | 2009 |
| Turing's unpublished algorithm for normal numbers | 9 | 1.65 | 2007 |
| Random reals à la Chaitin with or without prefix-freeness | 0 | 0.34 | 2007 |
| Randomness and halting probabilities | 1 | 0.37 | 2006 |
| Program Size Complexity for Possibly Infinite Computations | 8 | 0.89 | 2005 |
| Random reals and possibly infinite computations Part I: Randomness in EMPTY SET | 0 | 0.34 | 2005 |
| Kolmogorov Complexity for Possibly Infinite Computations | 5 | 0.59 | 2005 |
| Recursion and topology on 2⩽ω for possibly infinite computations | 1 | 0.36 | 2004 |
| An example of a computable absolutely normal number | 8 | 1.95 | 2002 |
| Another Example of Higher Order Randomness | 5 | 0.79 | 2002 |
| Abduction As Belief Revision | 36 | 2.60 | 1995 |
| Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version | 0 | 0.34 | 1995 |
| Abduction as belief revision: a model of preferred explanations | 4 | 0.62 | 1993 |
