Etienne Grandjean

Available identifiers

zbMath Open grandjean.etienneMaRDI QIDQ295629

List of research outcomes

Publication	Date of Publication	Type
Descriptive complexity for minimal time of cellular automata	2024-12-19	Paper
Conjunctive grammars, cellular automata and logic	2024-08-13	Paper
Inductive definitions in logic versus programs of real-time cellular automata	2024-03-01	Paper
Definability by Horn formulas and linear time on cellular automata	2020-05-27	Paper
First-order queries on structures of bounded degree are computable with constant delay	2017-07-12	Paper
A logical approach to locality in pictures languages	2016-06-13	Paper
Descriptive complexity for pictures languages	2012-11-22	Paper
On Acyclic Conjunctive Queries and Constant Delay Enumeration	2009-03-05	Paper
Computing thejth solution of a first-order query	2008-07-21	Paper
STACS 2004	2007-10-01	Paper
Graph properties checkable in linear time in the number of vertices	2004-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4474839	2004-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q4411837	2003-07-10	Paper
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time	2003-01-05	Paper
Monadic logical definability of nondeterministic linear time	1999-05-24	Paper
SAT-Problems and Reductions with Respect to the Number of Variables	1997-08-28	Paper
Sorting, linear time and the satisfiability problem	1996-12-01	Paper
Linear Time Algorithms and NP-Complete Problems	1994-08-14	Paper
Invariance properties of RAMs and linear time	1994-07-13	Paper
https://portal.mardi4nfdi.de/entity/Q4281688	1994-06-13	Paper
https://portal.mardi4nfdi.de/entity/Q4283241	1994-06-02	Paper
First-order spectra with one variable	1990-01-01	Paper
A Nontrivial Lower Bound for an NP Problem on Automata	1990-01-01	Paper
A Natural NP-Complete Problem with a Nontrivial Lower Bound	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3030809	1987-01-01	Paper
Universal quantifiers and time complexity of random access machines	1985-01-01	Paper
The Spectra of First-Order Sentences and Computational Complexity	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340841	1984-01-01	Paper
Complexity of the first-order theory of almost all finite structures	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4090317	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4108315	1976-01-01	Paper

Research outcomes over time

This page was built for person: Etienne Grandjean