Etienne Grandjean - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2021

Conjunctive Grammars, Cellular Automata and LogicThéo Grente, Etienne Grandjean. automata 2021: [doi]

2019

Descriptive complexity for minimal time of cellular automataEtienne Grandjean, Théo Grente. lics 2019: 1-13 [doi]

2017

Definability by Horn Formulas and Linear Time on Cellular AutomataNicolas Bacquey, Etienne Grandjean, Frédéric Olive. icalp 2017: [doi]

2016

A logical approach to locality in pictures languagesEtienne Grandjean, Frédéric Olive. jcss, 82(6):959-1006, 2016. [doi]

2012

Descriptive complexity for pictures languagesEtienne Grandjean, Frédéric Olive. csl 2012: 274-288 [doi]

2008

Computing the jth solution of a first-order queryGuillaume Bagan, Arnaud Durand, Etienne Grandjean, FrÃ©dÃ©ric Olive. ita, 42(1):147-164, 2008. [doi]

2007

On Acyclic Conjunctive Queries and Constant Delay EnumerationGuillaume Bagan, Arnaud Durand, Etienne Grandjean. csl 2007: 208-222 [doi]

First-order queries on structures of bounded degree are computable with constant delayArnaud Durand, Etienne Grandjean. tocl, 8(4):21, 2007. [doi]

2004

The Minimal Logically-Defined NP-Complete ProblemRégis Barbanchon, Etienne Grandjean. STACS 2004: 338-349 [doi]

Graph properties checkable in linear time in the number of verticesEtienne Grandjean, Frédéric Olive. jcss, 68(3):546-597, 2004. [doi]

2002

Local Problems, Planar Local Problems and Linear TimeRégis Barbanchon, Etienne Grandjean. csl 2002: 397-411 [doi]

Machine-Independent Characterizations and Complete Problems for Deterministic Linear TimeEtienne Grandjean, Thomas Schwentick. SICOMP, 32(1):196-230, 2002. [doi]

1998

Monadic Logical Definability of Nondeterministic Linear TimeEtienne Grandjean, Frédéric Olive. cc, 7(1):54-97, 1998.

1997

SAT-Problems and Reductions with Respect to the Number of VariablesEtienne Grandjean, Hans Kleine Büning. logcom, 7(4):457-471, 1997.

1996

Sorting, Linear Time and the Satisfiability ProblemEtienne Grandjean. AMAI, 16:183-236, 1996.

1994

Linear Time Algorithms and NP-Complete ProblemsEtienne Grandjean. SICOMP, 23(3):573-597, 1994.

Invariance Properties of Rams and Linear TimeEtienne Grandjean. cc, 4:62-106, 1994.

Monadic Logical Definability of NP-Complete ProblemsEtienne Grandjean, Frédéric Olive. csl 1995: 190-204

1992

Linear Time Algorithms and NP-Complete ProblemsEtienne Grandjean. csl 1993: 248-273

1990

First-Order Spectra with One VariableEtienne Grandjean. jcss, 40(2):136-153, 1990.

RAM with Compact Memory: A Realistic and Robust Model of ComputationEtienne Grandjean, J. M. Robson. csl 1991: 195-233

A Nontrivial Lower Bound for an NP Problem on AutomataEtienne Grandjean. SICOMP, 19(3):438-451, 1990.

1988

A Natural NP-Complete Problem with a Nontrivial Lower NoundEtienne Grandjean. SICOMP, 17(4):786-809, 1988.

1987

First-order Spectra with One VariableEtienne Grandjean. BIRTHDAY 1987: 166-180

1985

Universal Quantifiers and Time Complexity of Random Access MachinesEtienne Grandjean. mst, 18(2):171-187, 1985.

1984

The Spectra of First-Order Sentences and Computational ComplexityEtienne Grandjean. SICOMP, 13(2):356-373, 1984.

Ergonomic studies in computer aided designGerard H. van der Heiden, Etienne Grandjean. dac 1984: 220-227 [doi]

1983

Lighting characteristics of visual display terminals from an ergonomic point of viewU. Bräuninger, Etienne Grandjean. CHI 1983: 274-276 [doi]

Universal quantifiers and time complexity of random access machinesEtienne Grandjean. prolamat 1984: 366-379

Complexity of the First-Order Theory of Almost All Finite StructuresEtienne Grandjean. iandc, 57(2/3):180-204, May/June 1983.

1982

Number of universal quantifiers and computational complexity: preliminary reportEtienne Grandjean. sigact, 14(3):30, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL