The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yiannis N. Moschovakis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yiannis N. Moschovakis
    Recursion and Complexity. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:350-357 [Conf]
  2. Yiannis N. Moschovakis
    A Game-Theoretic, Concurrent and Fair Model of the Typed Lambda-calculus, with Full Recursion. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:341-359 [Conf]
  3. Yiannis N. Moschovakis, Glen T. Whitney
    Powerdomains, Powerstructures and Fairness. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:382-396 [Conf]
  4. Yiannis N. Moschovakis
    A Mathematical Modeling of Pure, Recursive Algorithms. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:208-229 [Conf]
  5. Yiannis N. Moschovakis
    A Game-Theoretic Modeling of Concurrency [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:154-163 [Conf]
  6. Yiannis N. Moschovakis
    Computable processes. [Citation Graph (0, 0)][DBLP]
    POPL, 1990, pp:72-80 [Conf]
  7. Lou van den Dries, Yiannis N. Moschovakis
    Is the Euclidean algorithm optimal among its peers? [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2004, v:10, n:3, pp:390-418 [Journal]
  8. Yiannis N. Moschovakis
    A Model of Concurrency with Fair Merge and Full Recursion [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:93, n:1, pp:114-171 [Journal]
  9. John Addison, Jon Barwise, H. Jerome Keisler, Kenneth Kunen, Yiannis N. Moschovakis
    The Kleene Symposium and the Summer Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:3, pp:469-480 [Journal]
  10. K. Jon Barwise, Robin O. Gandy, Yiannis N. Moschovakis
    The Next Admissible Set. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:1, pp:108-120 [Journal]
  11. Jon Barwise, Yiannis N. Moschovakis
    Global Inductive Definability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1978, v:43, n:3, pp:521-534 [Journal]
  12. Jon Barwise, Robert L. Vaught, Yiannis N. Moschovakis
    Meeting of the Association for Symbolic Logic: San Francisco, 1981. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1983, v:48, n:2, pp:505-513 [Journal]
  13. Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney
    The Logic of Recursive Equations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1998, v:63, n:2, pp:451-478 [Journal]
  14. Yiannis N. Moschovakis
    Meeting of the Association for Symbolic Logic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1969, v:34, n:1, pp:152-160 [Journal]
  15. Yiannis N. Moschovakis
    Abstract Computability and Invariant Definability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1969, v:34, n:4, pp:605-633 [Journal]
  16. Yiannis N. Moschovakis
    The Formal Language of Recursion. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1216-1252 [Journal]
  17. Yiannis N. Moschovakis
    On primitive recursive algorithms and the greatest common divisor function. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:1-30 [Journal]
  18. Yiannis N. Moschovakis
    Computable Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:139, n:1&2, pp:243-273 [Journal]

  19. Kleene's Amazing Second Recursion Theorem. [Citation Graph (, )][DBLP]


  20. The Axiomatic Derivation of Absolute Lower Bounds. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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