Search the dblp DataBase
Verónica Becher :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Craig Boutilier , Verónica Becher Abduction As Belief Revision: A Model of Preferred Explanations. [Citation Graph (0, 0)][DBLP ] AAAI, 1993, pp:642-648 [Conf ] Verónica Becher Two Conditional Logics for Defeasible Inference: A Comparison Preliminary Version. [Citation Graph (0, 0)][DBLP ] SBIA, 1995, pp:49-58 [Conf ] Craig Boutilier , Verónica Becher Abduction as Belief Revision. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1995, v:77, n:1, pp:43-94 [Journal ] Verónica Becher , Gregory J. Chaitin Another Example of Higher Order Randomness. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2002, v:51, n:4, pp:325-338 [Journal ] Verónica Becher , Santiago Figueira Kolmogorov Complexity for Possibly Infinite Computations. [Citation Graph (0, 0)][DBLP ] Journal of Logic, Language and Information, 2005, v:14, n:2, pp:133-148 [Journal ] Verónica Becher , Santiago Figueira An example of a computable absolutely normal number. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:947-958 [Journal ] Verónica Becher , Serge Grigorieff Recursion and topology on 2<=omega for possibly infinite computations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:322, n:1, pp:85-136 [Journal ] Verónica Becher , Santiago Figueira , Rafael Picchi Turing's unpublished algorithm for normal numbers. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:377, n:1-3, pp:126-138 [Journal ] Verónica Becher , Serge Grigorieff Random reals à la Chaitin with or without prefix-freeness. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:385, n:1-3, pp:193-201 [Journal ] Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs