Number of universal quantifiers and computational complexity: preliminary report. - Etienne Grandjean (SIGACT News, 1982)

Lighting characteristics of visual display terminals from an ergonomic point of view. - U. Bräuninger; Etienne Grandjean (CHI, 1983)

Complexity of the First-Order Theory of Almost All Finite Structures - Etienne Grandjean (Inf. Control., 1983)

Ergonomic studies in computer aided design. - Gerard H. van der Heiden; Etienne Grandjean (DAC, 1984)

The Spectra of First-Order Sentences and Computational Complexity. - Etienne Grandjean (SIAM J. Comput., 1984)

Universal Quantifiers and Time Complexity of Random Access Machines. - Etienne Grandjean (Math. Syst. Theory, 1985)

A Natural NP-Complete Problem with a Nontrivial Lower Nound. - Etienne Grandjean (SIAM J. Comput., 1988)

RAM with Compact Memory: A Realistic and Robust Model of Computation. - Etienne Grandjean; J. M. Robson (CSL, 1990)

First-Order Spectra with One Variable. - Etienne Grandjean (J. Comput. Syst. Sci., 1990)

A Nontrivial Lower Bound for an NP Problem on Automata. - Etienne Grandjean (SIAM J. Comput., 1990)

Monadic Logical Definability of NP-Complete Problems. - Etienne Grandjean; Frédéric Olive (CSL, 1994)

Invariance Properties of Rams and Linear Time. - Etienne Grandjean (Comput. Complex., 1994)

Linear Time Algorithms and NP-Complete Problems. - Etienne Grandjean (SIAM J. Comput., 1994)

Sorting, Linear Time and the Satisfiability Problem. - Etienne Grandjean (Ann. Math. Artif. Intell., 1996)

SAT-Problems and Reductions with Respect to the Number of Variables. - Etienne Grandjean; Hans Kleine Büning (J. Log. Comput., 1997)

Monadic Logical Definability of Nondeterministic Linear Time. - Etienne Grandjean; Frédéric Olive (Comput. Complex., 1998)

Local Problems, Planar Local Problems and Linear Time. - Régis Barbanchon; Etienne Grandjean (CSL, 2002)

Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. - Etienne Grandjean; Thomas Schwentick (SIAM J. Comput., 2002)

The Minimal Logically-Defined NP-Complete Problem. - Régis Barbanchon; Etienne Grandjean (STACS, 2004)

Graph properties checkable in linear time in the number of vertices. - Etienne Grandjean; Frédéric Olive (J. Comput. Syst. Sci., 2004)

The complexity of acyclic conjunctive queries revisited - Arnaud Durand 001; Etienne Grandjean (CoRR, 2006)

Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes - Philippe Chapdelaine; Etienne Grandjean (CoRR, 2006)

On Acyclic Conjunctive Queries and Constant Delay Enumeration. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean (CSL, 2007)

First-order queries on structures of bounded degree are computable with constant delay. - Arnaud Durand 001; Etienne Grandjean (ACM Trans. Comput. Log., 2007)

Computing the jth solution of a first-order query. - Guillaume Bagan; Arnaud Durand 001; Etienne Grandjean; Frédéric Olive (RAIRO Theor. Informatics Appl., 2008)

Descriptive complexity for pictures languages. - Etienne Grandjean; Frédéric Olive (CSL, 2012)

Descriptive complexity for pictures languages (extended abstract) - Etienne Grandjean; Frédéric Olive; Gaétan Richard (CoRR, 2012)

A logical approach to locality in pictures languages. - Etienne Grandjean; Frédéric Olive (J. Comput. Syst. Sci., 2016)

Definability by Horn Formulas and Linear Time on Cellular Automata. - Nicolas Bacquey; Etienne Grandjean; Frédéric Olive (ICALP, 2017)

Descriptive complexity for minimal time of cellular automata. - Etienne Grandjean; Théo Grente (LICS, 2019)

Conjunctive Grammars, Cellular Automata and Logic. - Théo Grente; Etienne Grandjean (AUTOMATA, 2021)

Which arithmetic operations can be performed in constant time in the RAM model with addition? - Etienne Grandjean; Louis Jachiet (CoRR, 2022)

Inductive definitions in logic versus programs of real-time cellular automata. - Etienne Grandjean; Théo Grente; Véronique Terrier (Theor. Comput. Sci., 2024)