![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 16 | Peter Cholak, Rodney G. Downey, Leo Harrington: The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14(1): 69-87 (2008) | |
| 13 | Peter Cholak, Rodney G. Downey, Stephen Walk: Maximal Contiguous Degrees. J. Symb. Log. 67(1): 409-437 (2002) | |
| 12 | Peter Cholak, Rodney G. Downey, Eberhard Herrmann: Some orbits for E. Ann. Pure Appl. Logic 107(1-3): 193-226 (2001) | |
| 4 | Peter Cholak, Rodney G. Downey: Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 61(3): 195-221 (1993) | |
| 3 | Peter Cholak, Rodney G. Downey: On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. 58(2): 629-640 (1993) | |
| 2 | Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman: Degrees of Inferability. COLT 1992: 180-192 |
Selection of 6 from 16 records - Peter Cholak has 19 coauthors
Copyright © 2009-12-07 by Michael Ley (ley@uni-trier.de)