Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs. - Malika More (Theor. Comput. Sci., 1994)

Complexity of Satisfiability Problems with Symmetric Polynomial Clauses. - Nadia Creignou; Malika More (J. Log. Comput., 1997)

Rudimentary Languages and Second Order Logic. - Malika More; Frédéric Olive (Math. Log. Q., 1997)

Rudimentary Relations and Primitive Recursion: A Toolbox. - Henri-Alex Esbelin; Malika More (Theor. Comput. Sci., 1998)

Nonerasing, Counting, and Majority over the Linear Time Hierarchy. - Arnaud Durand 001; Malika More (Inf. Comput., 2002)

On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. - Rémy Malgouyres; Malika More (Theor. Comput. Sci., 2002)

Foreword. - Patrick Cégielski; Malika More (Theor. Comput. Sci., 2004)

Counting Results in Weak Formalisms. - Arnaud Durand 001; Clemens Lautemann; Malika More (Circuits, Logic, and Games, 2006)

The ultra-weak Ash conjecture and some particular cases. - Annie Chateau; Malika More (Math. Log. Q., 2006)

A simple proof of the polylog counting ability of first-order logic: guest column. - Arnaud Durand 001; Clemens Lautemann; Malika More (SIGACT News, 2007)

Fifty years of the spectrum problem: survey and new results. - Arnaud Durand 001; Neil D. Jones; Johann A. Makowsky; Malika More (Bull. Symb. Log., 2012)

How to explain modern security concepts to your children. - Xavier Bultel; Jannik Dreier; Pascal Lafourcade 001; Malika More (Cryptologia, 2017)

How to Teach the Undecidability of Malware Detection Problem and Halting Problem. - Matthieu Journault; Pascal Lafourcade 001; Malika More; Rémy Poulain; Léo Robert (WISE, 2020)