 | 2009 |
|---|
| 10 |       | Verónica Becher,
Alejandro Deymonnaz,
Pablo Heiber:
Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome.
Bioinformatics 25(14): 1746-1753 (2009) |
| 2007 |
|---|
| 9 | | Verónica Becher,
Santiago Figueira,
Rafael Picchi:
Turing's unpublished algorithm for normal numbers.
Theor. Comput. Sci. 377(1-3): 126-138 (2007) |
| 8 | | Verónica Becher,
Serge Grigorieff:
Random reals à la Chaitin with or without prefix-freeness.
Theor. Comput. Sci. 385(1-3): 193-201 (2007) |
| 2005 |
|---|
| 7 | | Verónica Becher,
Santiago Figueira:
Kolmogorov Complexity for Possibly Infinite Computations.
Journal of Logic, Language and Information 14(2): 133-148 (2005) |
| 2004 |
|---|
| 6 | | Verónica Becher,
Serge Grigorieff:
Recursion and topology on 2<=omega for possibly infinite computations.
Theor. Comput. Sci. 322(1): 85-136 (2004) |
| 2002 |
|---|
| 5 | | Verónica Becher,
Gregory J. Chaitin:
Another Example of Higher Order Randomness.
Fundam. Inform. 51(4): 325-338 (2002) |
| 4 | | Verónica Becher,
Santiago Figueira:
An example of a computable absolutely normal number.
Theor. Comput. Sci. 270(1-2): 947-958 (2002) |
| 1995 |
|---|
| 3 |  | Verónica Becher:
Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version.
SBIA 1995: 49-58 |
| 2 | | Craig Boutilier,
Verónica Becher:
Abduction as Belief Revision.
Artif. Intell. 77(1): 43-94 (1995) |
| 1993 |
|---|
| 1 | | Craig Boutilier,
Verónica Becher:
Abduction As Belief Revision: A Model of Preferred Explanations.
AAAI 1993: 642-648 |
