- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j3 |      | George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle: Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113(5-6): 171-178 (2013) |
| j2 | | Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. Theory Comput. Syst. 52(1): 80-94 (2013) |
| 2012 | ||
| j1 | | Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. J. Log. Comput. 22(4): 701-715 (2012) |
| c6 | | Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies: The Denjoy alternative for computable functions. STACS 2012: 543-554 |
| 2010 | ||
| c5 | | Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu: Initial Segment Complexities of Randomness Notions. IFIP TCS 2010: 259-270 |
| c4 | | |
| 2009 | ||
| c3 | | Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of Non-monotonic Randomness Notions. CCA 2009 |
| c2 | | Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Time-Bounded Kolmogorov Complexity and Solovay Functions. MFCS 2009: 392-402 |
| i1 | | Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle: Separations of non-monotonic randomness notions. CoRR abs/0907.2324 (2009) |
| 2008 | ||
| c1 | | Rupert Hölzl, Wolfgang Merkle: Generation Complexity Versus Distinction Complexity. TAMC 2008: 457-466 |
| 1 | George Barmpalias | |
| 2 | Laurent Bienvenu | |
| 3 | Thorsten Kräling | |
| 4 | Andrew E. M. Lewis | |
| 5 | Wolfgang Merkle | |
| 6 | Joseph S. Miller | |
| 7 | André Nies | |
| 8 | Frank Stephan | |
| 9 | Guohua Wu |
Data released under the ODC-BY 1.0 license — See also our legal information page