default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVerónica Becher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Nicolás Alvarez, Verónica Becher
, Martín Mereb, Ivo Pajor, Carlos Miguel Soto:
On extremal factors of de Bruijn-like graphs. Discret. Appl. Math. 357: 352-364 (2024)- [j33]Verónica Becher, Olivier Carton:
Nested Perfect Arrays. IEEE Trans. Inf. Theory 70(10): 7463-7471 (2024) - [i22]Verónica Becher, Tomás Tropea:
Lyndon pairs and the lexicographically greatest perfect necklace. CoRR abs/2405.17812 (2024) - [i21]Verónica Becher, Olivier Carton, Santiago Figueira:
Rauzy dimension and finite-state dimension. CoRR abs/2406.18383 (2024) - [i20]Verónica Becher, Nicole Graus:
The discrepancy of the Champernowne constant. CoRR abs/2407.13114 (2024) - [i19]Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto:
De Bruijn Sequences with Minimum Discrepancy. CoRR abs/2407.17367 (2024) - 2023
- [i18]Verónica Becher, Olivier Carton:
Nested perfect toroidal arrays. CoRR abs/2301.00633 (2023) - [i17]Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto:
On extremal factors of de Bruijn-like graphs. CoRR abs/2308.16257 (2023) - 2022
- [j32]Verónica Becher, Eda Cesaratto:
On the number of words with restrictions on the number of symbols. Adv. Appl. Math. 136: 102321 (2022) - [j31]Verónica Becher, Serge Grigorieff:
Randomness and uniform distribution modulo one. Inf. Comput. 285(Part): 104857 (2022) - [j30]Verónica Becher, Gabriel Sac Himelfarb:
A construction of a 𝜆-Poisson generic sequence. Math. Comput. 92(341): 1453-1466 (2022) - [i16]Verónica Becher, Gabriel Sac Himelfarb:
A construction of a λ- Poisson generic sequence. CoRR abs/2205.03981 (2022) - 2021
- [j29]Verónica Becher, Lucas Cortés:
Extending de Bruijn sequences to larger alphabets. Inf. Process. Lett. 168: 106085 (2021) - [i15]Verónica Becher:
Insertion in constructed normal numbers. CoRR abs/2106.00801 (2021) - 2020
- [j28]Emilio Almansi, Verónica Becher:
Completely uniformly distributed sequences based on de Bruijn sequences. Math. Comput. 89(325): 2537-2551 (2020)
2010 – 2019
- 2019
- [j27]Verónica Becher, Olivier Carton:
Normal numbers and nested perfect necklaces. J. Complex. 54 (2019) - [j26]Nicolás Alvarez, Verónica Becher, Olivier Carton:
Finite-state independence and normal sequences. J. Comput. Syst. Sci. 103: 1-17 (2019) - [i14]Verónica Becher, Olivier Carton, Ignacio Mollo Cunningham:
Low discrepancy sequences failing Poissonian pair correlations. CoRR abs/1903.02106 (2019) - [i13]Verónica Becher, Lucas Cortés:
Extending de Bruijn sequences to larger alphabets. CoRR abs/1907.00056 (2019) - [i12]Emilio Almansi, Verónica Becher:
Completely uniformly distributed sequences based on de Bruijn sequences. CoRR abs/1909.11156 (2019) - 2018
- [j25]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Finite-State Independence. Theory Comput. Syst. 62(7): 1555-1572 (2018) - [i11]Christoph Aistleitner, Verónica Becher, Olivier Carton:
Normal numbers with digit dependencies. CoRR abs/1804.02844 (2018) - 2017
- [j24]Nicolás Alvarez, Verónica Becher:
M. Levin's construction of absolutely normal numbers with very low discrepancy. Math. Comput. 86(308): 2927-2946 (2017) - [i10]Nicolás Alvarez, Verónica Becher, Olivier Carton:
Finite-state Independence and Normal Sequences. CoRR abs/1702.00320 (2017) - [i9]Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman:
On absolutely normal numbers and their discrepancy estimate. CoRR abs/1702.04072 (2017) - 2016
- [j23]Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman:
Perfect necklaces. Adv. Appl. Math. 80: 48-61 (2016) - [i8]Nicolás Alvarez, Verónica Becher, Pablo A. Ferrari, Sergio A. Yuhjtman:
Perfect Necklaces. CoRR abs/1601.07975 (2016) - [i7]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Finite-state independence. CoRR abs/1611.03921 (2016) - 2015
- [j22]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Normality and automata. J. Comput. Syst. Sci. 81(8): 1592-1613 (2015) - [j21]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A computable absolutely normal Liouville number. Math. Comput. 84(296): 2939-2952 (2015) - [j20]Verónica Becher, Serge Grigorieff:
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization. Math. Struct. Comput. Sci. 25(7): 1490-1519 (2015) - [j19]Verónica Becher, Serge Grigorieff:
Wadge hardness in Scott spaces and its effectivization. Math. Struct. Comput. Sci. 25(7): 1520-1545 (2015) - [i6]Nicolás Alvarez, Verónica Becher:
M. Levin's construction of absolutely normal numbers with very low discrepancy. CoRR abs/1510.02004 (2015) - 2014
- [j18]Verónica Becher, Theodore A. Slaman:
On the normality of numbers to different bases. J. Lond. Math. Soc. 90(2): 472-494 (2014) - 2013
- [j17]Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber:
Efficient repeat finding in sets of strings via suffix arrays. Discret. Math. Theor. Comput. Sci. 15(2): 59-70 (2013) - [j16]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. 232: 1-9 (2013) - [j15]Verónica Becher, Pablo Ariel Heiber:
Normal numbers and finite automata. Theor. Comput. Sci. 477: 109-116 (2013) - [i5]Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber:
Efficient repeat finding via suffix arrays. CoRR abs/1304.0528 (2013) - [i4]Verónica Becher, Serge Grigorieff:
Borel and Hausdorff Hierarchies in Topological Spaces of Choquet Games and Their Effectivization. CoRR abs/1311.0330 (2013) - [i3]Verónica Becher, Serge Grigorieff:
Wadge Hardness in Scott Spaces and Its Effectivization. CoRR abs/1311.0331 (2013) - [i2]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
Normal Numbers and the Borel Hierarchy. CoRR abs/1311.0335 (2013) - 2012
- [j14]Verónica Becher, Pablo Ariel Heiber:
A linearly computable measure of string complexity. Theor. Comput. Sci. 438: 62-73 (2012) - [c4]Verónica Becher:
Turing's Normal Numbers: Towards Randomness. CiE 2012: 35-45 - [i1]Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo:
Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2(1): 19-38 (2012) - 2011
- [j13]Verónica Becher, Pablo Ariel Heiber:
On extending de Bruijn sequences. Inf. Process. Lett. 111(18): 930-932 (2011)
2000 – 2009
- 2009
- [j12]Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber:
Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinform. 25(14): 1746-1753 (2009) - [j11]Verónica Becher, Serge Grigorieff:
From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II. J. Symb. Log. 74(1): 124-156 (2009) - 2007
- [j10]Verónica Becher, Santiago Figueira, Rafael Picchi:
Turing's unpublished algorithm for normal numbers. Theor. Comput. Sci. 377(1-3): 126-138 (2007) - [j9]Verónica Becher, Serge Grigorieff:
Random reals à la Chaitin with or without prefix-freeness. Theor. Comput. Sci. 385(1-3): 193-201 (2007) - 2006
- [j8]Verónica Becher, Santiago Figueira, Serge Grigorieff, Joseph S. Miller:
Randomness and halting probabilities. J. Symb. Log. 71(4): 1411-1430 (2006) - 2005
- [j7]Verónica Becher, Santiago Figueira:
Kolmogorov Complexity for Possibly Infinite Computations. J. Log. Lang. Inf. 14(2): 133-148 (2005) - [j6]Verónica Becher, Serge Grigorieff:
Random reals and possibly infinite computations Part I: Randomness in ∅'. J. Symb. Log. 70(3): 891-913 (2005) - [j5]Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi:
Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46(1): 51-64 (2005) - 2004
- [j4]Verónica Becher, Serge Grigorieff:
Recursion and topology on 2<=omega for possibly infinite computations. Theor. Comput. Sci. 322(1): 85-136 (2004) - 2002
- [j3]Verónica Becher, Gregory J. Chaitin:
Another Example of Higher Order Randomness. Fundam. Informaticae 51(4): 325-338 (2002) - [j2]Verónica Becher, Santiago Figueira:
An example of a computable absolutely normal number. Theor. Comput. Sci. 270(1-2): 947-958 (2002) - 2001
- [c3]Verónica Becher, Sergio Daicz, Gregory J. Chaitin:
A Highly Random Number. DMTCS 2001: 55-68
1990 – 1999
- 1995
- [j1]Craig Boutilier, Verónica Becher:
Abduction as Belief Revision. Artif. Intell. 77(1): 43-94 (1995) - [c2]Verónica Becher:
Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version. SBIA 1995: 49-58 - 1993
- [c1]Craig Boutilier, Verónica Becher:
Abduction As Belief Revision: A Model of Preferred Explanations. AAAI 1993: 642-648
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
