| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| 6 |      | William C. Calhoun: Triviality and Minimality in the Degrees of Monotone Complexity. J. Log. Comput. 22(2): 197-206 (2012) |
| 2006 | ||
| 5 | | William C. Calhoun: Degrees of monotone complexity. J. Symb. Log. 71(4): 1327-1341 (2006) |
| 2002 | ||
| 4 | | Paul Mullins, Jim Wolfe, Michael Fry, Erik L. Wynters, William C. Calhoun, Robert Montante, William Oblitey: Panel on integrating security concepts into existing computer courses. SIGCSE 2002: 365-366 |
| 2001 | ||
| 3 | | William C. Calhoun, Manuel Lerman: Embedding Finite Lattices into The Ideals of Computably Enumerable Turing Degrees. J. Symb. Log. 66(4): 1791-1802 (2001) |
| 1996 | ||
| 2 | | William C. Calhoun, Theodore A. Slaman: The Pi20 Enumeration Degrees Are Not Dense. J. Symb. Log. 61(4): 1364-1379 (1996) |
| 1993 | ||
| 1 | | William C. Calhoun: Incomparable Prime Ideals of Recursively Enumerable Degrees. Ann. Pure Appl. Logic 63(1): 39-56 (1993) |
| 1 | Michael Fry | [4] |
| 2 | Manuel Lerman | [3] |
| 3 | Robert Montante | [4] |
| 4 | Paul Mullins | [4] |
| 5 | William Oblitey | [4] |
| 6 | Theodore A. Slaman | [2] |
| 7 | Jim Wolfe | [4] |
| 8 | Erik L. Wynters | [4] |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page