dblp.uni-trier.dewww.uni-trier.de

Philippe Moser

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
36EEElvira Mayordomo, Philippe Moser: Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression. SOFSEM 2009: 633-644
35EEElvira Mayordomo, Philippe Moser, Sylvain Perifel: Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable CoRR abs/0903.4101: (2009)
2008
34 Philippe Moser: A General Notion of Useful Information. CSP 2008: 215-224
33EEPilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Pushdown Compression. STACS 2008: 39-48
32EEPhilippe Moser: On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. Electr. Notes Theor. Comput. Sci. 202: 13-18 (2008)
31EEPhilippe Moser: Generic density and small span theorem. Inf. Comput. 206(1): 1-14 (2008)
30EEPhilippe Moser: Baire categories on small complexity classes and meager-comeager laws. Inf. Comput. 206(1): 15-33 (2008)
29EEPhilippe Moser: Resource-bounded measure on probabilistic classes. Inf. Process. Lett. 106(6): 241-245 (2008)
28EEPhilippe Moser: Martingale families and dimension in P. Theor. Comput. Sci. 400(1-3): 46-61 (2008)
2007
27EEDavid Doty, Philippe Moser: Feasible Depth. CiE 2007: 228-237
26EEPilar Albert, Elvira Mayordomo, Philippe Moser: Bounded Pushdown dimension vs Lempel Ziv information density CoRR abs/0704.2386: (2007)
25EEPilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel: Pushdown Compression CoRR abs/0709.2346: (2007)
24EEDavid Doty, Philippe Moser: Feasible Depth CoRR abs/cs/0701123: (2007)
23EEPilar Albert, Elvira Mayordomo, Philippe Moser: Bounded Pushdown dimension vs Lempel Ziv information density. Electronic Colloquium on Computational Complexity (ECCC) 14(051): (2007)
22EEXiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös sequences. Inf. Comput. 205(9): 1317-1333 (2007)
2006
21EEPhilippe Moser: Martingale Families and Dimension in P. CiE 2006: 388-397
20EEPhilippe Moser: Lp Computable Functions and Fourier Series CoRR abs/cs/0608106: (2006)
19EEPhilippe Moser: Baire Categories on Small Complexity Classes and Meager-Comeager Laws CoRR abs/cs/0609012: (2006)
18EEDavid Doty, Philippe Moser: Finite-State Dimension and Lossy Decompressors CoRR abs/cs/0609096: (2006)
2005
17EEPhilippe Moser: Generic Density and Small Span Theorem. FCT 2005: 92-102
16EEXiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös Sequences. FSTTCS 2005: 250-260
15EEDavid Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser: Zeta-Dimension. MFCS 2005: 283-294
14EEDavid Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser: Zeta-Dimension CoRR abs/cs/0503052: (2005)
13EEXiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdos Sequences CoRR abs/cs/0508001: (2005)
12EEPhilippe Moser: Martingale Families and Dimension in P Electronic Colloquium on Computational Complexity (ECCC)(045): (2005)
11EEPhilippe Moser: Generic Density and Small Span Theorem Electronic Colloquium on Computational Complexity (ECCC)(060): (2005)
10EEXiaoyang Gu, Jack H. Lutz, Philippe Moser: Dimensions of Copeland-Erdös Sequences Electronic Colloquium on Computational Complexity (ECCC)(089): (2005)
2003
9EEPhilippe Moser: Baire's Categories on Small Complexity Classes. FCT 2003: 333-342
8EERussell Impagliazzo, Philippe Moser: A zero one law for RP. IEEE Conference on Computational Complexity 2003: 48-52
7EEPhilippe Moser: BPP has effective dimension at most 1/2 unless BPP=EXP Electronic Colloquium on Computational Complexity (ECCC) 10(029): (2003)
6EEPhilippe Moser: RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP Electronic Colloquium on Computational Complexity (ECCC)(040): (2003)
5EEPhilippe Moser: Locally Computed Baire's Categories on Small Complexity Classes Electronic Colloquium on Computational Complexity (ECCC)(046): (2003)
2002
4EEPhilippe Moser: Random nondeterministic real functions and Arthur Merlin games Electronic Colloquium on Computational Complexity (ECCC)(006): (2002)
3EEPhilippe Moser: ZPP is hard unless RP is small Electronic Colloquium on Computational Complexity (ECCC)(015): (2002)
2EEPhilippe Moser: A generalization of Lutz's measure to probabilistic classes Electronic Colloquium on Computational Complexity (ECCC)(058): (2002)
2001
1EEPhilippe Moser: Relative to P, APP and promise-BPP are the same Electronic Colloquium on Computational Complexity (ECCC) 8(068): (2001)

Coauthor Index

1Pilar Albert [23] [25] [26] [33]
2David Doty [14] [15] [18] [24] [27]
3Xiaoyang Gu [10] [13] [14] [15] [16] [22]
4Russell Impagliazzo [8]
5Jack H. Lutz [10] [13] [14] [15] [16] [22]
6Elvira Mayordomo [14] [15] [23] [25] [26] [33] [35] [36]
7Sylvain Perifel [25] [33] [35]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)