The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert McCloskey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sam M. Kim, Robert McNaughton, Robert McCloskey
    An Upper Bound on the Order of Locally Testable Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:48-65 [Conf]
  2. Sam M. Kim, Robert McNaughton, Robert McCloskey
    A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:420-436 [Conf]
  3. Sam M. Kim, Robert McNaughton, Robert McCloskey
    A Polynomial Time Algorithm for the Local Testability Problem of Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:10, pp:1087-1093 [Journal]

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