Malika More - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2020

How to Teach the Undecidability of Malware Detection Problem and Halting ProblemMatthieu Journault, Pascal Lafourcade 0001, Malika More, Rémy Poulain, Léo Robert. wise 2020: 159-169 [doi]

2017

How to explain modern security concepts to your childrenXavier Bultel, Jannik Dreier, Pascal Lafourcade 0001, Malika More. cryptologia, 41(5):422-447, 2017. [doi]

2012

Fifty years of the spectrum problem: survey and new resultsArnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More. bsl, 18(4):505-553, 2012. [doi]

2007

A simple proof of the polylog counting ability of first-order logic: guest columnArnaud Durand, Clemens Lautemann, Malika More. sigact, 38(4):40-45, 2007. [doi]

2006

The ultra-weak Ash conjecture and some particular casesAnnie Chateau, Malika More. mlq, 52(1):4-13, 2006. [doi]

Counting Results in Weak FormalismsArnaud Durand, Clemens Lautemann, Malika More. Dagstuhl 2007: [doi]

2004

ForewordPatrick Cégielski, Malika More. TCS, 322(1):1-3, 2004. [doi]

2002

Nonerasing, Counting, and Majority over the Linear Time HierarchyArnaud Durand, Malika More. iandc, 174(2):132-142, 2002. [doi]

On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topologyRémy Malgouyres, Malika More. TCS, 283(1):67-108, 2002. [doi]

1998

Rudimentary Relations and Primitive Recursion: A ToolboxHenri-Alex Esbelin, Malika More. TCS, 193(1-2):129-148, 1998. [doi]

1997

Complexity of Satisfiability Problems with Symmetric Polynomial ClausesNadia Creignou, Malika More. logcom, 7(3):353-366, 1997.

Rudimentary Languages and Second Order LogicMalika More, Frédéric Olive. mlq, 43:419-426, 1997.

1994

Investigation of Binary Spectra by Explicit Polynomial Transformations of GraphsMalika More. TCS, 124(2):221-272, 1994.

Sign in or sign up to see more results.

runs on WebDSL