Maryanthe Malliaris

According to our database1, Maryanthe Malliaris authored at least 17 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Some simple theories from a Boolean algebra point of view.
Ann. Pure Appl. Log., January, 2024

High-arity PAC learning via exchangeability.
CoRR, 2024

2022
Private and Online Learnability Are Equivalent.
J. ACM, 2022

The unstable formula theorem revisited.
CoRR, 2022

2021
Agnostic Online Learning and Excellent Sets.
CoRR, 2021

Notes on the stable Regularity Lemma.
Bull. Symb. Log., 2021

2019
A new look at interpretability and saturation.
Ann. Pure Appl. Log., 2019

Private PAC learning implies finite Littlestone dimension.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018
On unavoidable-induced subgraphs in large prime graphs.
J. Graph Theory, 2018

2017
The Clique Covering Problem and Other Questions.
FLAP, 2017

2015
Saturating the Random Graph with an Independent Family of Small Range.
Proceedings of the Logic Without Borders, 2015

2014
Model-Theoretic Properties of Ultrafilters Built by Independent families of Functions.
J. Symb. Log., 2014

2012
Hypergraph sequences as a tool for saturation of ultrapowers.
J. Symb. Log., 2012

Independence, order, and the interaction of ultrafilters and theories.
Ann. Pure Appl. Log., 2012

2010
The characteristic sequence of a first-order formula.
J. Symb. Log., 2010

Edge distribution and density in the characteristic sequence.
Ann. Pure Appl. Log., 2010

2009
Realization of phi-types and Keisler's order.
Ann. Pure Appl. Log., 2009


  Loading...