Verónica Becher

Q: What Schools Are Affiliated With Verónica Becher

Verónica Becher is affiliated with the following schools: National University of La Plata, University of Buenos Aires, Stanford University

Verónica Becher's AcademicInfluence.com Rankings

Verónica Becher

Computer Science

#9446

World Rank

#9920

Historical Rank

Data Mining

#299

World Rank

#300

Historical Rank

Machine Learning

#5928

World Rank

#6020

Historical Rank

Artificial Intelligence

#6386

World Rank

#6498

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Verónica Becher's Degrees

Bachelors Computer Science University of Buenos Aires
Masters Computer Science University of Buenos Aires
PhD Computer Science University of Buenos Aires

Similar Degrees You Can Earn

Why Is Verónica Becher Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Verónica Becher is an Argentinian computer scientist known for her work in logic and theoretical computer science. She is Full Professor at the University of Buenos Aires and Director of the KAPOW at the Department of Computation.

(See a Problem?)

Verónica Becher's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Abduction as Belief Revision (1995) (122)
An example of a computable absolutely normal number (2002) (78)
A polynomial-time algorithm for computing absolutely normal numbers (2013) (44)
Turing's unpublished algorithm for normal numbers (2007) (43)
Normal numbers and finite automata (2013) (32)
Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome (2009) (29)
On extending de Bruijn sequences (2011) (27)
A Highly Random Number (2001) (26)
Normality and automata (2015) (22)
Iterable AGM Functions (2001) (21)
On the normality of numbers to different bases (2013) (19)
A computable absolutely normal Liouville number (2015) (18)
Random reals and possibly infinite computations Part I: Randomness in ∅′ (2005) (18)
On simply normal numbers to different bases (2013) (16)
Randomness and halting probabilities (2006) (15)
Normal Numbers and the Borel Hierarchy (2013) (13)
Normal Numbers and Computer Science (2018) (13)
Neutral Theory Predicts the Relative Abundance and Diversity of Genetic Elements in a Broad Array of Eukaryotic Genomes (2013) (12)
The irrationality exponents of computable numbers (2014) (12)
Another Example of Higher Order Randomness (2002) (12)
Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization (2013) (11)
From index sets to randomness in ∅n: random reals and possibly infinite computations part II (2009) (11)
Program Size Complexity for Possibly Infinite Computations (2005) (10)
Normal numbers and nested perfect necklaces (2018) (9)
M. Levin's construction of absolutely normal numbers with very low discrepancy (2015) (8)
Abduction As Belief Revision: A Model of Preferred Explanations (1993) (8)
Wadge hardness in Scott spaces and its effectivization (2013) (8)
Turing's Normal Numbers: Towards Randomness (2012) (8)
A linearly computable measure of string complexity (2012) (8)
Finite-State Independence (2016) (8)
On the construction of absolutely normal numbers (2017) (8)
Random reals à la Chaitin with or without prefix-freeness (2007) (7)
Protein Repeats from First Principles (2015) (7)
Perfect Necklaces (2016) (7)
Kolmogorov Complexity for Possibly Infinite Computations (2003) (6)
On absolutely normal and continued fraction normal numbers (2017) (6)
Low discrepancy sequences failing Poissonian pair correlations (2019) (5)
Efficient repeat finding in sets of strings via suffix arrays (2013) (4)
Sobre el trabajo no publicado de Alan M.Turing "A note on normal numbers" (2005) (4)
Recursion and topology on 2<=omega for possibly infinite computations (2004) (4)
Recursion and Topology on 2 ≤ ω for Possibly Infinite Computations (2006) (4)
Extending de Bruijn sequences to larger alphabets (2019) (3)
Randomness and uniform distribution modulo one (2021) (3)
Computability, Complexity and Randomness (Dagstuhl Seminar 12021) (2012) (3)
Finite-state Independence and Normal Sequences (2017) (2)
Efficient repeat finding via suffix arrays (2013) (2)
Irrationality exponent, Hausdorff dimension and effectivization (2016) (2)
Normal numbers with digit dependencies (2018) (2)
Completely uniformly distributed sequences based on de Bruijn sequences (2019) (2)
Poisson Generic Sequences (2022) (2)
THE ADDITIVE GROUPS OF Z AND Q WITH PREDICATES FOR BEING SQUARE-FREE (2022) (1)
A construction of a $\lambda$- Poisson generic sequence (2022) (1)
A construction of a λ- Poisson generic sequence (2022) (1)
Characterization Results for Formulas (2000) (0)
Finite-State Independence (2017) (0)
Irrationality exponent, Hausdorff dimension and effectivization (2017) (0)
From index sets to randomness in EMPTY SET n: random reals and possibly infinite computations. Part II (2009) (0)
On simply normal numbers with digit dependencies (2023) (0)
JSL volume 87 issue 1 Cover and Front matter (2022) (0)
On absolutely normal numbers and their discrepancy estimate (2017) (0)
On a question of Mendès France on normal numbers (2021) (0)
JSL volume 86 issue 1 Cover and Front matter (2021) (0)
On modifying normal numbers Constructions of irreducible polynomials over finite fields (2021) (0)
A conditional model of abduction (1993) (0)
JSL volume 85 issue 2 Cover and Front matter (2020) (0)
Nested perfect toroidal arrays (2023) (0)
Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version (1995) (0)
Córdoba, Argentina September 20–24, 2004 (2005) (0)
JSL volume 85 issue 1 Cover and Front matter (2020) (0)
Low discrepancy sequences failing Poissonian pair correlations (2019) (0)
A pr 2 01 8 NORMAL NUMBERS WITH DIGIT DEPENDENCIES (0)
On the logic for utopia (1995) (0)
On the number of words with restrictions on the number of symbols (2021) (0)
Conference on Computability, Complexity and Randomness (2008) (0)
On simply normal numbers to different bases (2015) (0)
Theoretical Computer Science A linearly computable measure of string complexity (2012) (0)
N ov 2 02 2 A construction of a λ-Poisson generic sequence (2022) (0)
Insertion in Constructed Normal Numbers (2021) (0)
JSL volume 87 issue 3 Cover and Front matter (2022) (0)
Logic, Computability, and Randomness (2005) (0)
JSL volume 86 issue 2 Cover and Front matter (2021) (0)
Update, the infinite case (1999) (0)
Irrationality Exponent, Hausdorﬀ Dimension and Eﬀectivization (2016) (0)

This paper list is powered by the following services:

Other Resources About Verónica Becher

What Schools Are Affiliated With Verónica Becher?

Verónica Becher is affiliated with the following schools:

Verónica Becher's Academic­Influence.com Rankings

Verónica Becher's Degrees

Similar Degrees You Can Earn

Why Is Verónica Becher Influential?

Verónica Becher's Published Works

Published Works

Other Resources About Verónica Becher

What Schools Are Affiliated With Verónica Becher?

Verónica Becher's AcademicInfluence.com Rankings