 | 2007 |
|---|
| 10 |       | Arnaud Durand,
Clemens Lautemann,
Malika More:
A simple proof of the polylog counting ability of first-order logic: guest column.
SIGACT News 38(4): 40-45 (2007) |
| 2006 |
|---|
| 9 | | Arnaud Durand,
Clemens Lautemann,
Malika More:
Counting Results in Weak Formalisms.
Circuits, Logic, and Games 2006 |
| 8 | | Annie Chateau,
Malika More:
The ultra-weak Ash conjecture and some particular cases.
Math. Log. Q. 52(1): 4-13 (2006) |
| 2004 |
|---|
| 7 | | Patrick Cégielski,
Malika More:
Foreword.
Theor. Comput. Sci. 322(1): 1-3 (2004) |
| 2002 |
|---|
| 6 | | Arnaud Durand,
Malika More:
Nonerasing, Counting, and Majority over the Linear Time Hierarchy.
Inf. Comput. 174(2): 132-142 (2002) |
| 5 | | Rémy Malgouyres,
Malika More:
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology.
Theor. Comput. Sci. 283(1): 67-108 (2002) |
| 1998 |
|---|
| 4 | | Henri-Alex Esbelin,
Malika More:
Rudimentary Relations and Primitive Recursion: A Toolbox.
Theor. Comput. Sci. 193(1-2): 129-148 (1998) |
| 1997 |
|---|
| 3 |  | Nadia Creignou,
Malika More:
Complexity of Satisfiability Problems with Symmetric Polynomial Clauses.
J. Log. Comput. 7(3): 353-366 (1997) |
| 2 | | Malika More,
Frédéric Olive:
Rudimentary Languages and Second Order Logic.
Math. Log. Q. 43: 419-426 (1997) |
| 1994 |
|---|
| 1 | | Malika More:
Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs.
Theor. Comput. Sci. 124(2): 221-272 (1994) |
