Relative to P, APP and promise-BPP are the same - Philippe Moser (Electron. Colloquium Comput. Complex., 2001)

Random nondeterministic real functions and Arthur Merlin games - Philippe Moser (Electron. Colloquium Comput. Complex., 2002)

ZPP is hard unless RP is small - Philippe Moser (Electron. Colloquium Comput. Complex., 2002)

A generalization of Lutz's measure to probabilistic classes - Philippe Moser (Electron. Colloquium Comput. Complex., 2002)

A zero one law for RP. - Russell Impagliazzo; Philippe Moser (CCC, 2003)

Baire's Categories on Small Complexity Classes. - Philippe Moser (FCT, 2003)

BPP has effective dimension at most 1/2 unless BPP=EXP - Philippe Moser (Electron. Colloquium Comput. Complex., 2003)

RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP - Philippe Moser (Electron. Colloquium Comput. Complex., 2003)

Locally Computed Baire's Categories on Small Complexity Classes - Philippe Moser (Electron. Colloquium Comput. Complex., 2003)

Zeta-Dimension. - David Doty; Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo; Philippe Moser (MFCS, 2005)

Generic Density and Small Span Theorem - Philippe Moser (Electron. Colloquium Comput. Complex., 2005)

Dimensions of Copeland-Erdös Sequences - Xiaoyang Gu; Jack H. Lutz; Philippe Moser (Electron. Colloquium Comput. Complex., 2005)

Lp Computable Functions and Fourier Series - Philippe Moser (CoRR, 2006)

Finite-State Dimension and Lossy Decompressors - David Doty; Philippe Moser (CoRR, 2006)

Feasible Depth. - David Doty; Philippe Moser (CiE, 2007)

Bounded Pushdown dimension vs Lempel Ziv information density. - Pilar Albert; Elvira Mayordomo; Philippe Moser (Electron. Colloquium Comput. Complex., 2007)

On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. - Philippe Moser (CCA, 2007)

Pushdown Compression. - Pilar Albert; Elvira Mayordomo; Philippe Moser; Sylvain Perifel (STACS, 2008)

A General Notion of Useful Information - Philippe Moser (CSP, 2008)

Baire categories on small complexity classes and meager-comeager laws. - Philippe Moser (Inf. Comput., 2008)

Resource-bounded measure on probabilistic classes. - Philippe Moser (Inf. Process. Lett., 2008)

Martingale families and dimension in P. - Philippe Moser (Theor. Comput. Sci., 2008)

Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression. - Elvira Mayordomo; Philippe Moser (SOFSEM, 2009)

A zero-one law for RP and derandomization of AM if NP is not small. - Russell Impagliazzo; Philippe Moser (Inf. Comput., 2009)

A zero-one SUBEXP-dimension law for BPP. - Philippe Moser (Inf. Process. Lett., 2011)

Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. - Elvira Mayordomo; Philippe Moser; Sylvain Perifel (Theory Comput. Syst., 2011)

Risk-adjusted portfolio optimisation using a parallel multi-objective evolutionary algorithm. - Phil Maguire; Donal O'Sullivan; Philippe Moser; Gavin Dunne (CIFEr, 2012)

A probabilistic risk-to-reward measure for evaluating the performance of financial securities. - Phil Maguire; Philippe Moser; J. McDonnell; Robert Kelly; Simon Fuller; Rebecca Maguire (CIFEr, 2013)

A Computational Theory of Subjective Probability [Featuring a Proof that the Conjunction Effect is not a Fallacy]. - Phil Maguire; Philippe Moser; Rebecca Maguire; Mark T. Keane (CogSci, 2013)

On the polynomial depth of various sets of random strings. - Philippe Moser (Theor. Comput. Sci., 2013)

Maximizing positive porfolio diversification. - Phil Maguire; Philippe Moser; Kieran O'Reilly; Conor McMenamin; Robert Kelly; Rebecca Maguire (CIFEr, 2014)

Is Consciousness Computable? Quantifying Integrated Information Using Algorithmic Information Theory. - Phil Maguire; Philippe Moser; Rebecca Maguire; Virgil Griffith (CogSci, 2014)

A Deep Context Grammatical Model For Authorship Attribution. - Simon Fuller; Phil Maguire; Philippe Moser (LREC, 2014)

Dimension spectra of random subfractals of self-similar fractals. - Xiaoyang Gu; Jack H. Lutz; Elvira Mayordomo; Philippe Moser (Ann. Pure Appl. Log., 2014)

A Computational Theory of Subjective Probability. - Phil Maguire; Philippe Moser; Rebecca Maguire; Mark T. Keane (CoRR, 2014)

A Clarification on Turing's Test and its Implications for Machine Intelligence. - Phil Maguire; Philippe Moser; Rebecca Maguire (EAPCogSci, 2015)

Polynomial Depth, Highness and Lowness for E. - Philippe Moser (CoRR, 2016)

Depth, Highness and DNR degrees. - Philippe Moser; Frank Stephan 001 (Discret. Math. Theor. Comput. Sci., 2017)

Limit-depth and DNR degrees. - Philippe Moser; Frank Stephan 001 (Inf. Process. Lett., 2018)

Seeing Patterns in Randomness: A Computational Model of Surprise. - Phil Maguire; Philippe Moser; Rebecca Maguire; Mark T. Keane (Top. Cogn. Sci., 2019)

On the Difference Between Finite-State and Pushdown Depth. - Liam Jordon; Philippe Moser (SOFSEM, 2020)

Pebble-Depth. - Liam Jordon; Philippe Moser (CoRR, 2020)

Polylog depth, highness and lowness for E. - Philippe Moser (Inf. Comput., 2020)

Normal Sequences with Non-Maximal Automatic Complexity. - Liam Jordon; Philippe Moser (FSTTCS, 2021)

A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78. - Liam Jordon; Philippe Moser (SOFSEM, 2021)

Pushdown and Lempel-Ziv depth. - Liam Jordon; Philippe Moser (Inf. Comput., 2023)

Pebble-depth. - Liam Jordon; Phil Maguire; Philippe Moser (Theor. Comput. Sci., 2024)