Artículos y Publicaciones

• Abduction as belief revision

  1995, Artificial Intelligence 77 (1), 43-94, 1995
  Citas: 184

  Ver detalle

• An example of a computable absolutely normal number

  2002, Theoretical Computer Science 270 (1-2), 947-958, 2002
  Citas: 98

  Ver detalle

• Multiple genome rearrangement by swaps and by element duplications

  2007, Theoretical Computer Science 385 (1-3), 115-126, 2007
  Citas: 85

  Ver detalle

• Turing’s unpublished algorithm for normal numbers

  2007, Theoretical Computer Science 377 (1), 126-138, 2007
  Citas: 58

  Ver detalle

• Iterable AGM functions

  2001, Frontiers in belief revision, Frontiers in Belief Revision. Applied Logic …, 2001
  Citas: 52

  Ver detalle

• A polynomial-time algorithm for computing absolutely normal numbers

  2013, Information and Computation 232, 1--9, 2013
  Citas: 46

  Ver detalle

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

  2009, Bioinformatics 25 (14), 1746-1753, 2009
  Citas: 38

  Ver detalle

• On extending de Bruijn sequences

  2011, Information Processing Letters 111 (18), 930–932, 2011
  Citas: 37

  Ver detalle

• Normal numbers and finite automata

  2013, Theoretical Computer Science 477, 109-116, 2013
  Citas: 36

  Ver detalle

• A highly random number

  2001, Combinatorics, Computability and Logic: Proceedings of the Third …, 2001
  Citas: 31

  Ver detalle

• On the normality of numbers to different bases

  2014, Journal of the London Mathematical Society 90 (2), 472-494, 2014
  Citas: 29

  Ver detalle

• Normality and Automata

  2015, Journal of Computer and Systems Sciences 81 (8), 1592--1613, 2015
  Citas: 26

  Ver detalle

• Randomness and halting probabilities

  2006, Journal of Symbolic Logic 71 (4), 1411-1430, 2006
  Citas: 23

  Ver detalle

• Random reals and possibly infinite computations Part I: Randomness in the first jump of the halting problem

  2005, Journal of Symbolic Logic 70 (3), 891-913, 2005
  Citas: 23

  Ver detalle

• Normal numbers and the Borel hierarchy

  2014, Fundamenta Mathematicae 226, 63-77, 2014
  Citas: 21

  Ver detalle

• A computable absolutely normal Liouville number

  2015, Mathematics of Computation 84 (296), 2939–2952, 2015
  Citas: 19

  Ver detalle

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

  2013, PLoS One 8 (6), e63915, 2013
  Citas: 18

  Ver detalle

• A linearly computable measure of string complexity

  2012, Theoretical Computer Science 438, 62-73, 2012
  Citas: 18

  Ver detalle

• Another example of higher order randomness

  2002, Fundamenta Informaticae 51 (4), 325-338, 2002
  Citas: 18

  Ver detalle

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

  2015, Mathematical Structures in Computer Science 25 (7), 1490-1519, 2015
  Citas: 17

  Ver detalle

• Normal Numbers and Computer Science

  2018, “Sequences, Groups, and Number Theory”, https://link.springer.com/chapter/10.100, 2018
  Citas: 16

  Ver detalle

• Some observations on Carlos Alchourrón’s theory of defeasible conditionals

  1999, Mc. Namara P. and Prakke, editors, Norms, Logics and Information Systems …, 1999
  Citas: 15

  Ver detalle

• Normal numbers and nested perfect necklaces

  2019, Journal of Complexity 54 (101403), https://doi.org/10.1016/j.jco.2019.03.00, 2019
  Citas: 14

  Ver detalle

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

  2009, Journal of Symbolic Logic 74 (1), 124-156, 2009
  Citas: 14

  Ver detalle

• Abduction as belief revision: a model of preferred explanations

  1993, AAAI, 642-648, 1993
  Citas: 14

  Ver detalle

• Perfect necklaces

  2016, Advances of Applied Mathematics 80, 48--6, 2016
  Citas: 13

  Ver detalle

• Program size complexity for possibly infinite computations

  2005, Notre Dame Journal of Formal Logic 46 (1), 51-64, 2005
  Citas: 13

  Ver detalle

• The Irrationality Exponents of Computable Numbers

  2016, Proceedings of American Mathematical Society 144 (4), 1509–1521, 2016
  Citas: 12

  Ver detalle

• Turing’s normal numbers: towards randomness

  2012, Conference on Computability in Europe, 35-45, 2012
  Citas: 11

  Ver detalle

• Finite-state independence

  2018, Theory of Computing Systems 62 (7), 1555–1572, 2018
  Citas: 10

  Ver detalle

• On the construction of absolutely normal numbers

  2017, Acta Arithmetica 180 (4), 333--346, 2017
  Citas: 10

  Ver detalle

• Efficient repeat finding in sets of strings via suffix arrays

  2013, Discrete Mathematics & Theoretical Computer Science 15 (Discrete Algorithms), 2013
  Citas: 10

  Ver detalle

• A better complexity of finite sequences

  2011, 8th Int. Conf. on Computability and Complexity in Analysis and 6th Int. Conf …, 2011
  Citas: 10

  Ver detalle

• On absolutely normal and continued fraction normal numbers

  2019, International Mathematics Research Notices 19, 6136--6161, 2019
  Citas: 9

  Ver detalle

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

  2017, Mathematics of Computation 86 (308), 2927 – 2946, 2017
  Citas: 9

  Ver detalle

• Protein Repeats from First Principles

  2016, Scientific Reports 6 (23959), http://www.nature.com/articles/srep23959, 2016
  Citas: 9

  Ver detalle

• On Simply Normal Numbers to Different Bases

  2016, Mathematische Annalen 364 (1), 125-150, 2016
  Citas: 8

  Ver detalle

• Recursion and topology on 2⩽ω for possibly infinite computations

  2004, Theoretical Computer Science 322 (1), 85-136, 2004
  Citas: 8

  Ver detalle

• Binary functions for theory change

  1999, PhD thesis, Departamento de Computación, Facultad de Ciencias Exactas y …, 1999
  Citas: 8

  Ver detalle

• Unified semantics for revision and update, or the theory of lazy update

  1995, Trabajos de las 24 Jornadas Argentinas de Informática e Investigación …, 1995
  Citas: 8

  Ver detalle

• Low discrepancy sequences failing Poissonian pair correlations

  2019, Archive der Mathematik 113 (2), 169--178, 2019
  Citas: 7

  Ver detalle

• Wadge hardness in Scott spaces and its effectivization

  2015, Mathematical Structures in Computer Science 25 (7), 1520-1545, 2015
  Citas: 7

  Ver detalle

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

  2007, Theoretical Computer Science 385 (1-3), 193-201, 2007
  Citas: 7

  Ver detalle

• Kolmogorov complexity for possibly infinite computations

  2005, Journal of Logic, Language and Information 14, 133-148, 2005
  Citas: 7

  Ver detalle

• Irrationality Exponent, Hausdorff Dimension and Effectivization

  2018, Monatshefte für Mathematik 185 (1), 167-188, 2018
  Citas: 5

  Ver detalle

• A construction of a -Poisson generic sequence

  2023, Mathematics of Computation 92 (341), 1453-1466, 2023
  Citas: 4

  Ver detalle

• Randomness and uniform distribution modulo one

  2022, Information and Computation 285 (Part B), 104857, 2022
  Citas: 4

  Ver detalle

• Extending de Bruijn sequences to larger alphabets

  2021, Information Processing Letters 168 (106085), https://www.sciencedirect.com …, 2021
  Citas: 4

  Ver detalle

• Completely uniformly distributed sequences based on de Bruijn sequences

  2020, Mathematics of Computation 89, 2537-2551, 2020
  Citas: 4

  Ver detalle

• Finite-state independence and normal sequences

  2019, Journal of Computer and System Sciences 103, 1--17, 2019
  Citas: 4

  Ver detalle

• Computability, complexity and randomness (dagstuhl seminar 12021)

  2012, Dagstuhl Reports 2 (1), 2012
  Citas: 4

  Ver detalle

• Infinite sequences on de Bruijn graphs

  2007, manuscript, 2007
  Citas: 3

  Ver detalle

• Poisson generic sequences

  2022, International Mathematics Research Notices rnac234, 2022
  Citas: 2

  Ver detalle

• Normal numbers with digit dependencies

  2019, Transactions of American Mathematical Society 372 (6), 4425--4446, 2019
  Citas: 2

  Ver detalle

• On absolutely normal numbers and their discrepancy estimate

  2017, arXiv:1702.04072, 2017
  Citas: 2

  Ver detalle

• Two conditional logics for defeasible inference: A comparison preliminary version

  1995, Brazilian Symposium on Artificial Intelligence, 49-58, 1995
  Citas: 2

  Ver detalle

• Insertion in constructed normal numbers

  2022, Uniform Distribution Theory 17 (1), 55–76, 2022
  Citas: 1

  Ver detalle

• Efficient repeat finding via suffix arrays

  2013, arXiv:1304.0528, 2013
  Citas: 1

  Ver detalle

• Update, the infinite case

  1999, Workshop Argentino de Informática Teórica de la JAIIO, ISSN 1666-1133, 1999
  Citas: 1

  Ver detalle

• Characterization Results for d-Horn Formulas

  1998, Proceedings of ITALLC'98. Information Theoretic Approaches to Logic …, 1998
  Citas: 1

  Ver detalle

• On extremal factors of de Bruijn-like graphs

  2023, arXiv preprint arXiv:2308.16257, 2023
  Citas: 0

• On simply normal numbers with digit dependencies

  2023, Mathematika 69 (4), 988-991, 2023
  Citas: 0

• The descriptive complexity of the set of Poisson generic numbers

  2023, preprint arXiv:2305.10529, 2023
  Citas: 0

• THE JOURNAL OF SYMBOLIC LOGIC

  2023,
  Citas: 0

• Nested perfect toroidal arrays

  2023, apreprint arXiv:2301.00633, 2023, 2023
  Citas: 0

• Insertion in normal numbers

  2022,
  Citas: 0

• Poisson generic real numbers

  2022,
  Citas: 0

• The Seventh International Conference on Uniform Distribution Theory (UDT 2021)

  2022,
  Citas: 0

• On a question of Mendès France on normal numbers

  2022, Acta Arithmetica 203, 271-288, 2022
  Citas: 0

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

  2022, Advances of Applied Mathematics 136, 102321, 2022
  Citas: 0

• On modifying normal numbers

  2021, Uniform Distribution Theory, 2021
  Citas: 0

• THE JOURNAL OF SYMBOLIC LOGIC

  2021,
  Citas: 0

• THE JOURNAL OF SYMBOLIC LOGIC

  2019,
  Citas: 0

• Daejeon, Republic of Korea July 24–27, 2017

  2018, The Bulletin of Symbolic Logic 24 (4), 2018
  Citas: 0

• Computable Examples of Absolutely Normal Numbers

  2017, Computability and Complexity in Analysis, 2017
  Citas: 0

• Irrationality Exponent, Hausdorff Dimension and Effectivization

  2016,
  Citas: 0

• Ciencias de la Computación

  2015, Academia Nacional de Ciencias; Academia Nacional de Ciencias Exactas …, 2015
  Citas: 0

• On normal numbers

  2014, Workshop on Logic Language and Information, 2014
  Citas: 0

• Dagstuhl Reports, Vol. 2, Issue 1 ISSN 2192-5283

  2012,
  Citas: 0

• Normality and differentiability

  2012, Seventh International Conference on Computability, Complexity and Randomness …, 2012
  Citas: 0

• Traducción del alemán al español del artículo “Endliche Automaten und Zufallsfolgen” Schnorr, CP; Stimm,

  2012,
  Citas: 0

• A new efficient algorithm to find all DNA repeats with exact matching

  2009,
  Citas: 0

• Conference on Computability, Complexity and Randomness

  2008, Bulletin of Symbolic Logic 14 (4), 548-549, 2008
  Citas: 0

• Logic, Computability, and Randomness

  2005, Bulletin of Symbolic Logic 11 (4), 557-557, 2005
  Citas: 0

• Córdoba, Argentina September 20–24, 2004

  2005, The Bulletin of Symbolic Logic 11 (4), 2005
  Citas: 0

• Kolmogorov complexity for possibly infinite computations

  2003, IX Congreso Argentino de Ciencias de la Computación, 2003
  Citas: 0

• Binary Functions for Theory

  2000, Electronic Journal of SADIO (EJS) 3, 2000
  Citas: 0

• Characterization Results for Formulas

  2000, StanfordCSLI, 2000
  Citas: 0

• Analytic AGM Revision

  2000, Department of Computer Science, The University of Auckland, New Zealand, 2000
  Citas: 0

• Departamento de Computación Facultad de Ciencias Exactas y Naturales

  1999, University of Buenos Aires. Argentina, 1999
  Citas: 0

• Funciones binarias para el cambio de teorías

  1999, Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales, 1999
  Citas: 0

• On the logic for utopia

  1995, I Congreso Argentino de Ciencias de la Computación, 1995
  Citas: 0

• A conditional model of abduction

  1993, University of British Columbia, 1993
  Citas: 0

• 3.3 On normal numbers (including new results)

  , Duality in Computer Science, 59, 0
  Citas: 0

• Nested perfect necklaces and normal numbers

  ,
  Citas: 0

• Información y Azar

  ,
  Citas: 0

• Some Observations on Carlos Alchourrón’s Theory of Defeasible Conditionals

  ,
  Citas: 0