The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Santiago Figueira: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Santiago Figueira, Frank Stephan, Guohua Wu
    Randomness and Universal Machines. [Citation Graph (0, 0)][DBLP]
    CCA, 2005, pp:103-116 [Conf]
  2. Benjamín René Callejas Bedregal, Santiago Figueira
    Classical Computability and Fuzzy Turing Machines. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:154-165 [Conf]
  3. Santiago Figueira, André Nies, Frank Stephan
    Lowness Properties and Approximations of the Jump. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:45-57 [Journal]
  4. Santiago Figueira, Frank Stephan, Guohua Wu
    Randomness and universal machines. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:6, pp:738-751 [Journal]
  5. 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]
  6. 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]
  7. 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]

  8. Counting the Changes of Random D02{\Delta^0_2} Sets. [Citation Graph (, )][DBLP]


  9. Completeness Results for Memory Logics. [Citation Graph (, )][DBLP]


  10. On the Formal Semantics of IF-Like Logics. [Citation Graph (, )][DBLP]


  11. Expressive Power and Decidability for Memory Logics. [Citation Graph (, )][DBLP]


  12. Lowness properties and approximations of the jump. [Citation Graph (, )][DBLP]


  13. The Question of Expressiveness in the Generation of Referring Expressions [Citation Graph (, )][DBLP]


  14. Ackermann and Primitive-Recursive Bounds with Dickson's Lemma [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002