default search action
Philippe Moser
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Liam Jordon, Phil Maguire, Philippe Moser:
Pebble-depth. Theor. Comput. Sci. 1009: 114638 (2024) - 2023
- [j16]Liam Jordon
, Philippe Moser:
Pushdown and Lempel-Ziv depth. Inf. Comput. 292: 105025 (2023) - 2021
- [c24]Liam Jordon, Philippe Moser:
Normal Sequences with Non-Maximal Automatic Complexity. FSTTCS 2021: 47:1-47:16 - [c23]Liam Jordon
A Normal Sequence Compressed by PPM* But Not by Lempel-Ziv 78. SOFSEM 2021: 389-399 - [i30]Liam Jordon, Philippe Moser:
Normal Sequences with Non Maximal Automatic Complexity. CoRR abs/2107.05979 (2021) - 2020
- [j15]Philippe Moser:
Polylog depth, highness and lowness for E. Inf. Comput. 271: 104483 (2020) - [c22]Liam Jordon, Philippe Moser:
On the Difference Between Finite-State and Pushdown Depth. SOFSEM 2020: 187-198 - [i29]Liam Jordon, Philippe Moser:
Pushdown and Lempel-Ziv Depth. CoRR abs/2009.04821 (2020) - [i28]Liam Jordon, Philippe Moser:
A Normal Sequence Compressed by PPM* but not by Lempel-Ziv 78. CoRR abs/2009.04827 (2020) - [i27]Liam Jordon, Philippe Moser:
Pebble-Depth. CoRR abs/2009.12225 (2020)
2010 – 2019
- 2019
- [j14]Phil Maguire, Philippe Moser, Rebecca Maguire
Seeing Patterns in Randomness: A Computational Model of Surprise. Top. Cogn. Sci. 11(1): 103-118 (2019) - 2018
- [j13]Philippe Moser, Frank Stephan
Limit-depth and DNR degrees. Inf. Process. Lett. 135: 36-40 (2018) - 2017
- [j12]Philippe Moser, Frank Stephan:
Depth, Highness and DNR degrees. Discret. Math. Theor. Comput. Sci. 19(4) (2017) - [c21]Pilar Albert, Elvira Mayordomo
Bounded Pushdown Dimension vs Lempel Ziv Information Density. Computability and Complexity 2017: 95-114 - 2016
- [i26]Philippe Moser:
Polynomial Depth, Highness and Lowness for E. CoRR abs/1602.03332 (2016) - 2015
- [c20]Phil Maguire, Philippe Moser, Rebecca Maguire:
A Clarification on Turing's Test and its Implications for Machine Intelligence. EAPCogSci 2015 - [c19]Philippe Moser, Frank Stephan
Depth, Highness and DNR Degrees. FCT 2015: 81-94 - [i25]Philippe Moser, Frank Stephan:
Depth, Highness and DNR degrees. CoRR abs/1511.05027 (2015) - 2014
- [j11]Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
Dimension spectra of random subfractals of self-similar fractals. Ann. Pure Appl. Log. 165(11): 1707-1726 (2014) - [c18]Phil Maguire, Philippe Moser, Kieran O'Reilly, Conor McMenamin, Robert Kelly, Rebecca Maguire
Maximizing positive porfolio diversification. CIFEr 2014: 174-181 - [c17]Phil Maguire, Philippe Moser, Rebecca Maguire, Virgil Griffith:
Is Consciousness Computable? Quantifying Integrated Information Using Algorithmic Information Theory. CogSci 2014 - [c16]Simon Fuller, Phil Maguire, Philippe Moser:
A Deep Context Grammatical Model For Authorship Attribution. LREC 2014: 4488-4492 - [i24]Phil Maguire, Philippe Moser, Rebecca Maguire, Virgil Griffith:
Is Consciousness Computable? Quantifying Integrated Information Using Algorithmic Information Theory. CoRR abs/1405.0126 (2014) - [i23]Phil Maguire, Philippe Moser, Rebecca Maguire, Mark T. Keane:
A Computational Theory of Subjective Probability. CoRR abs/1405.6142 (2014) - 2013
- [j10]Philippe Moser:
On the polynomial depth of various sets of random strings. Theor. Comput. Sci. 477: 96-108 (2013) - [c15]Phil Maguire, Philippe Moser, J. McDonnell, Robert Kelly, Simon Fuller, Rebecca Maguire
A probabilistic risk-to-reward measure for evaluating the performance of financial securities. CIFEr 2013: 102-109 - [c14]Phil Maguire, Philippe Moser, Rebecca Maguire, Mark T. Keane:
A Computational Theory of Subjective Probability [Featuring a Proof that the Conjunction Effect is not a Fallacy]. CogSci 2013 - 2012
- [c13]Phil Maguire, Donal O'Sullivan, Philippe Moser, Gavin Dunne:
Risk-adjusted portfolio optimisation using a parallel multi-objective evolutionary algorithm. CIFEr 2012: 1-8 - 2011
- [j9]Philippe Moser:
A zero-one SUBEXP-dimension law for BPP. Inf. Process. Lett. 111(9): 429-432 (2011) - [j8]Elvira Mayordomo
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. Theory Comput. Syst. 48(4): 731-766 (2011) - [c12]Philippe Moser:
On the Polynomial Depth of Various Sets of Random Strings. TAMC 2011: 517-527 - [i22]Philippe Moser:
A zero-one SUBEXP-dimension law for BPP. CoRR abs/1101.4848 (2011) - 2010
- [j7]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)
2000 – 2009
- 2009
- [j6]Russell Impagliazzo
A zero-one law for RP and derandomization of AM if NP is not small. Inf. Comput. 207(7): 787-792 (2009) - [c11]Elvira Mayordomo
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
- [j5]Philippe Moser:
Generic density and small span theorem. Inf. Comput. 206(1): 1-14 (2008) - [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]Philippe Moser:
Martingale families and dimension in P. Theor. Comput. Sci. 400(1-3): 46-61 (2008) - [c10]Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Pushdown Compression. STACS 2008: 39-48 - [c9]Philippe Moser:
A General Notion of Useful Information. CSP 2008: 164-171 - 2007
- [j1]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös sequences. Inf. Comput. 205(9): 1317-1333 (2007) - [c8]David Doty
Feasible Depth. CiE 2007: 228-237 - [c7]Philippe Moser:
On the Convergence of Fourier Series of Computable Lebesgue Integrable Functions. CCA 2007: 13-18 - [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]David Doty, Philippe Moser:
Feasible Depth. CoRR abs/cs/0701123 (2007) - [i16]Pilar Albert, Elvira Mayordomo, Philippe Moser:
Bounded Pushdown dimension vs Lempel Ziv information density. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c6]Philippe Moser:
Martingale Families and Dimension in P. CiE 2006: 388-397 - [i15]Philippe Moser:
Lp Computable Functions and Fourier Series. CoRR abs/cs/0608106 (2006) - [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]Philippe Moser:
Generic Density and Small Span Theorem. FCT 2005: 92-102 - [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. Electron. Colloquium Comput. Complex. TR05 (2005) - [i9]Philippe Moser:
Generic Density and Small Span Theorem. Electron. Colloquium Comput. Complex. TR05 (2005) - [i8]Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
Dimensions of Copeland-Erdös Sequences. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [c2]Russell Impagliazzo
A zero one law for RP. CCC 2003: 48-52 - [c1]Philippe Moser:
Baire's Categories on Small Complexity Classes. FCT 2003: 333-342 - [i7]Philippe Moser:
BPP has effective dimension at most 1/2 unless BPP=EXP. Electron. Colloquium Comput. Complex. TR03 (2003) - [i6]Philippe Moser:
RP is Small in SUBEXP else ZPP equals PSPACE and NP equals EXP. Electron. Colloquium Comput. Complex. TR03 (2003) - [i5]Philippe Moser:
Locally Computed Baire's Categories on Small Complexity Classes. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [i4]Philippe Moser:
Random nondeterministic real functions and Arthur Merlin games. Electron. Colloquium Comput. Complex. TR02 (2002) - [i3]Philippe Moser:
ZPP is hard unless RP is small. Electron. Colloquium Comput. Complex. TR02 (2002) - [i2]Philippe Moser:
A generalization of Lutz's measure to probabilistic classes. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [i1]Philippe Moser:
Relative to P, APP and promise-BPP are the same. Electron. Colloquium Comput. Complex. TR01 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: