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