The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
James C. Owings Jr.: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eliot D. Feldman, James C. Owings Jr.
    A class of universal linear bounded automata. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1973, v:6, n:, pp:187-190 [Journal]
  2. James C. Owings Jr.
    Recursion, Metarecursion, and Inclusion. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1967, v:32, n:2, pp:173-179 [Journal]
  3. James C. Owings Jr.
    pi11 Sets, omega-Sets, and Metacompleteness. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1969, v:34, n:2, pp:194-204 [Journal]
  4. James C. Owings Jr.
    The Meta-R.E. Sets, but Not the pi11 Sets, Can Be Enumerated Without Repetition. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1970, v:35, n:2, pp:223-229 [Journal]
  5. James C. Owings Jr.
    A Splitting Theorem for Simple pi11 Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:3, pp:433-438 [Journal]

Search in 0.001secs, Finished in 0.001secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002