Search the dblp DataBase

Publications of Author

1. Richard Beigel, William I. Gasarch, James C. Owings
   Nondeterministic Bounded Query Reducibilities. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 1989, v:41, n:2, pp:107-118 [Journal]
   
2. Richard Beigel, William I. Gasarch, John Gill, James C. Owings
   Terse, Superterse, and Verbose Sets [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1993, v:103, n:1, pp:68-85 [Journal]
   
3. James C. Owings
   Splitting a Context-Sensitive Set. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1975, v:10, n:1, pp:83-87 [Journal]
   
4. James C. Owings
   Effective Choice Functions and Index Sets. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 1986, v:32, n:3, pp:370-373 [Journal]
   
5. Valentina S. Harizanov, Martin Kummer, James C. Owings
   Frequency Computations and the Cardinality Theorem. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1992, v:57, n:2, pp:682-687 [Journal]
   
6. Carl G. Jockusch Jr., James C. Owings
   Weakly Semirecursive Sets. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1990, v:55, n:2, pp:637-644 [Journal]
   
7. James C. Owings
   A Cardinality Version of Biegel's Nonspeedup Theorem. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1989, v:54, n:3, pp:761-767 [Journal]
   
8. James C. Owings, Hilary Putnam, Gerald E. Sacks
   Meeting of the Association for Symbolic Logic Washington, D.C., 1975. [Citation Graph (0, 0)][DBLP]
   J. Symb. Log., 1976, v:41, n:1, pp:279-288 [Journal]
   
9. James C. Owings
   Corrigendum to ``Diagonalization and the Recursion Theorem''. [Citation Graph (0, 0)][DBLP]
   Notre Dame Journal of Formal Logic, 1989, v:30, n:1, pp:153- [Journal]
   
10. 
    Max and min limiters. [Citation Graph (, )][DBLP]