- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j11 |      | Philippe Moser: On the polynomial depth of various sets of random strings. Theor. Comput. Sci. 477: 96-108 (2013) |
| 2011 | ||
| j10 | | |
| j9 | | Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. Theory Comput. Syst. 48(4): 731-766 (2011) |
| c11 | | |
| i22 | | |
| 2010 | ||
| j8 | | Philippe Moser: On the convergence of Fourier series of computable Lebesgue integrable functions. Math. Log. Q. 56(5): 461-469 (2010) |
| i21 | | Philippe Moser: On the polynomial depth of various sets of random strings. CoRR abs/1012.3548 (2010) |
| 2009 | ||
| j7 | | Russell Impagliazzo, Philippe Moser: A zero-one law for RP and derandomization of AM if NP is not small. Inf. Comput. 207(7): 787-792 (2009) |
| c10 | | Elvira Mayordomo, Philippe Moser: Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression. SOFSEM 2009: 633-644 |
| i20 | | Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. CoRR abs/0903.4101 (2009) |
| 2008 | ||
| j6 | | Philippe Moser: On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. Electr. Notes Theor. Comput. Sci. 202: 13-18 (2008) |
| j5 | | |
| j4 | | Philippe Moser: Baire categories on small complexity classes and meager-comeager laws. Inf. Comput. 206(1): 15-33 (2008) |
| j3 | | Philippe Moser: Resource-bounded measure on probabilistic classes. Inf. Process. Lett. 106(6): 241-245 (2008) |
| j2 | | |
| c9 | | Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Pushdown Compression. STACS 2008: 39-48 |
| c8 | | |
| 2007 | ||
| j1 | | Xiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös sequences. Inf. Comput. 205(9): 1317-1333 (2007) |
| c7 | | |
| i19 | | Pilar Albert, Elvira Mayordomo, Philippe Moser: Bounded Pushdown dimension vs Lempel Ziv information density. CoRR abs/0704.2386 (2007) |
| i18 | | Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Pushdown Compression. CoRR abs/0709.2346 (2007) |
| i17 | | |
| i16 | | Pilar Albert, Elvira Mayordomo, Philippe Moser: Bounded Pushdown dimension vs Lempel Ziv information density. Electronic Colloquium on Computational Complexity (ECCC) 14(051) (2007) |
| 2006 | ||
| c6 | | |
| i15 | | |
| i14 | | Philippe Moser: Baire Categories on Small Complexity Classes and Meager-Comeager Laws. CoRR abs/cs/0609012 (2006) |
| i13 | | David Doty, Philippe Moser: Finite-State Dimension and Lossy Decompressors. CoRR abs/cs/0609096 (2006) |
| 2005 | ||
| c5 | | |
| c4 | | Xiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös Sequences. FSTTCS 2005: 250-260 |
| c3 | | David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser: Zeta-Dimension. MFCS 2005: 283-294 |
| i12 | | David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser: Zeta-Dimension. CoRR abs/cs/0503052 (2005) |
| i11 | | Xiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdos Sequences. CoRR abs/cs/0508001 (2005) |
| i10 | | Philippe Moser: Martingale Families and Dimension in P. Electronic Colloquium on Computational Complexity (ECCC)(045) (2005) |
| i9 | | Philippe Moser: Generic Density and Small Span Theorem. Electronic Colloquium on Computational Complexity (ECCC)(060) (2005) |
| i8 | | Xiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös Sequences. Electronic Colloquium on Computational Complexity (ECCC)(089) (2005) |
| 2003 | ||
| c2 | | Russell Impagliazzo, Philippe Moser: A zero one law for RP. IEEE Conference on Computational Complexity 2003: 48-52 |
| c1 | | |
| i7 | | Philippe Moser: BPP has effective dimension at most 1/2 unless BPP=EXP. Electronic Colloquium on Computational Complexity (ECCC) 10(029) (2003) |
| i6 | | Philippe Moser: RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP. Electronic Colloquium on Computational Complexity (ECCC)(040) (2003) |
| i5 | | Philippe Moser: Locally Computed Baire's Categories on Small Complexity Classes. Electronic Colloquium on Computational Complexity (ECCC)(046) (2003) |
| 2002 | ||
| i4 | | Philippe Moser: Random nondeterministic real functions and Arthur Merlin games. Electronic Colloquium on Computational Complexity (ECCC)(006) (2002) |
| i3 | | Philippe Moser: ZPP is hard unless RP is small. Electronic Colloquium on Computational Complexity (ECCC)(015) (2002) |
| i2 | | Philippe Moser: A generalization of Lutz's measure to probabilistic classes. Electronic Colloquium on Computational Complexity (ECCC)(058) (2002) |
| 2001 | ||
| i1 | | Philippe Moser: Relative to P, APP and promise-BPP are the same. Electronic Colloquium on Computational Complexity (ECCC) 8(068) (2001) |
| 1 | Pilar Albert | |
| 2 | David Doty | |
| 3 | Xiaoyang Gu | |
| 4 | Russell Impagliazzo | |
| 5 | Jack H. Lutz | |
| 6 | Elvira Mayordomo | |
| 7 | Sylvain Perifel |
Data released under the ODC-BY 1.0 license — See also our legal information page