Realization of phi-types and Keisler's order. - M. E. Malliaris 001 (Ann. Pure Appl. Log., 2009)

Edge distribution and density in the characteristic sequence. - M. E. Malliaris 001 (Ann. Pure Appl. Log., 2010)

The characteristic sequence of a first-order formula. - M. E. Malliaris 001 (J. Symb. Log., 2010)

Independence, order, and the interaction of ultrafilters and theories. - M. E. Malliaris 001 (Ann. Pure Appl. Log., 2012)

Hypergraph sequences as a tool for saturation of ultrapowers. - M. E. Malliaris 001 (J. Symb. Log., 2012)

Model-Theoretic Properties of Ultrafilters Built by Independent families of Functions. - M. Malliaris 001; Saharon Shelah (J. Symb. Log., 2014)

Saturating the Random Graph with an Independent Family of Small Range. - Maryanthe Malliaris; Saharon Shelah (Logic Without Borders, 2015)

The Clique Covering Problem and Other Questions. - Maryanthe Malliaris (FLAP, 2017)

On unavoidable-induced subgraphs in large prime graphs. - M. Malliaris 001; Caroline Terry (J. Graph Theory, 2018)

Private PAC learning implies finite Littlestone dimension. - Noga Alon; Roi Livni; Maryanthe Malliaris; Shay Moran (STOC, 2019)

A new look at interpretability and saturation. - Maryanthe Malliaris; Saharon Shelah (Ann. Pure Appl. Log., 2019)

Notes on the stable Regularity Lemma. - M. Malliaris 001; Saharon Shelah (Bull. Symb. Log., 2021)

Agnostic Online Learning and Excellent Sets. - Maryanthe Malliaris; Shay Moran (CoRR, 2021)

The unstable formula theorem revisited. - Maryanthe Malliaris; Shay Moran (CoRR, 2022)

Private and Online Learnability Are Equivalent. - Noga Alon; Mark Bun; Roi Livni; Maryanthe Malliaris; Shay Moran (J. ACM, 2022)

High-arity PAC learning via exchangeability. - Leonardo Nagami Coregliano; Maryanthe Malliaris (CoRR, 2024)

The Turing Degrees and Keisler's order. - Maryanthe Malliaris; Saharon Shelah (J. Symb. Log., 2024)

Some simple theories from a Boolean algebra point of view. - M. Malliaris 001; Saharon Shelah (Ann. Pure Appl. Log., 2024)

The unstable formula theorem revisited via algorithms. - Maryanthe Malliaris; Shay Moran (Ann. Pure Appl. Log., 2025)

Weak Randomness in Graphons and Theons. - Leonardo Nagami Coregliano; Maryanthe Malliaris (Random Struct. Algorithms, 2025)

A packing lemma for VCNk-dimension and learning high-dimensional data. - Leonardo Nagami Coregliano; Maryanthe Malliaris (CoRR, 2025)