default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEtienne Grandjean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Etienne Grandjean, Théo Grente, Véronique Terrier:
Inductive definitions in logic versus programs of real-time cellular automata. Theor. Comput. Sci. 987: 114355 (2024)- 2022
- [i6]Etienne Grandjean, Louis Jachiet:
Which arithmetic operations can be performed in constant time in the RAM model with addition? CoRR abs/2206.13851 (2022) - 2021
- [c14]Théo Grente, Etienne Grandjean:
Conjunctive Grammars, Cellular Automata and Logic. AUTOMATA 2021: 8:1-8:19
2010 – 2019
- 2019
- [c13]Etienne Grandjean, Théo Grente:
Descriptive complexity for minimal time of cellular automata. LICS 2019: 1-13 - [i5]Etienne Grandjean, Théo Grente:
Descriptive complexity for minimal time of cellular automata. CoRR abs/1902.05720 (2019) - 2017
- [c12]Nicolas Bacquey, Etienne Grandjean, Frédéric Olive:
Definability by Horn Formulas and Linear Time on Cellular Automata. ICALP 2017: 99:1-99:14 - 2016
- [j17]Etienne Grandjean, Frédéric Olive
:
A logical approach to locality in pictures languages. J. Comput. Syst. Sci. 82(6): 959-1006 (2016) - 2012
- [c11]Etienne Grandjean, Frédéric Olive:
Descriptive complexity for pictures languages. CSL 2012: 274-288 - [i4]Etienne Grandjean, Frédéric Olive, Gaétan Richard:
Descriptive complexity for pictures languages (extended abstract). CoRR abs/1201.5853 (2012)
2000 – 2009
- 2008
- [j16]Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive:
Computing the jth solution of a first-order query. RAIRO Theor. Informatics Appl. 42(1): 147-164 (2008) - 2007
- [j15]Arnaud Durand, Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. 8(4): 21 (2007) - [c10]Guillaume Bagan, Arnaud Durand, Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL 2007: 208-222 - 2006
- [i3]Arnaud Durand, Etienne Grandjean:
The complexity of acyclic conjunctive queries revisited. CoRR abs/cs/0605008 (2006) - [i2]Philippe Chapdelaine, Etienne Grandjean:
Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes. CoRR abs/cs/0606058 (2006) - 2005
- [i1]Arnaud Durand, Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay. CoRR abs/cs/0507020 (2005) - 2004
- [j14]Etienne Grandjean, Frédéric Olive:
Graph properties checkable in linear time in the number of vertices. J. Comput. Syst. Sci. 68(3): 546-597 (2004) - [c9]Régis Barbanchon, Etienne Grandjean:
The Minimal Logically-Defined NP-Complete Problem. STACS 2004: 338-349 - 2002
- [j13]Etienne Grandjean, Thomas Schwentick:
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. SIAM J. Comput. 32(1): 196-230 (2002) - [c8]Régis Barbanchon, Etienne Grandjean:
Local Problems, Planar Local Problems and Linear Time. CSL 2002: 397-411
1990 – 1999
- 1999
- [e1]Georg Gottlob, Etienne Grandjean, Katrin Seyr:
Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings. Lecture Notes in Computer Science 1584, Springer 1999, ISBN 3-540-65922-6 [contents] - 1998
- [j12]Etienne Grandjean, Frédéric Olive:
Monadic Logical Definability of Nondeterministic Linear Time. Comput. Complex. 7(1): 54-97 (1998) - 1997
- [j11]Etienne Grandjean, Hans Kleine Büning:
SAT-Problems and Reductions with Respect to the Number of Variables. J. Log. Comput. 7(4): 457-471 (1997) - 1996
- [j10]Etienne Grandjean:
Sorting, Linear Time and the Satisfiability Problem. Ann. Math. Artif. Intell. 16: 183-236 (1996) - 1994
- [j9]Etienne Grandjean:
Invariance Properties of Rams and Linear Time. Comput. Complex. 4: 62-106 (1994) - [j8]Etienne Grandjean:
Linear Time Algorithms and NP-Complete Problems. SIAM J. Comput. 23(3): 573-597 (1994) - [c7]Etienne Grandjean, Frédéric Olive:
Monadic Logical Definability of NP-Complete Problems. CSL 1994: 190-204 - 1992
- [c6]Etienne Grandjean:
Linear Time Algorithms and NP-Complete Problems. CSL 1992: 248-273 - 1990
- [j7]Etienne Grandjean:
First-Order Spectra with One Variable. J. Comput. Syst. Sci. 40(2): 136-153 (1990) - [j6]Etienne Grandjean:
A Nontrivial Lower Bound for an NP Problem on Automata. SIAM J. Comput. 19(3): 438-451 (1990) - [c5]Etienne Grandjean, J. M. Robson:
RAM with Compact Memory: A Realistic and Robust Model of Computation. CSL 1990: 195-233
1980 – 1989
- 1988
- [j5]Etienne Grandjean:
A Natural NP-Complete Problem with a Nontrivial Lower Nound. SIAM J. Comput. 17(4): 786-809 (1988) - 1987
- [c4]Etienne Grandjean:
First-order Spectra with One Variable. Computation Theory and Logic 1987: 166-180 - 1985
- [j4]Etienne Grandjean:
Universal Quantifiers and Time Complexity of Random Access Machines. Math. Syst. Theory 18(2): 171-187 (1985) - 1984
- [j3]Etienne Grandjean:
The Spectra of First-Order Sentences and Computational Complexity. SIAM J. Comput. 13(2): 356-373 (1984) - [c3]Gerard H. van der Heiden, Etienne Grandjean:
Ergonomic studies in computer aided design. DAC 1984: 220-227 - 1983
- [j2]Etienne Grandjean:
Complexity of the First-Order Theory of Almost All Finite Structures. Inf. Control. 57(2/3): 180-204 (1983) - [c2]U. Bräuninger, Etienne Grandjean:
Lighting characteristics of visual display terminals from an ergonomic point of view. CHI 1983: 274-276 - [c1]Etienne Grandjean:
Universal quantifiers and time complexity of random access machines. Logic and Machines 1983: 366-379 - 1982
- [j1]Etienne Grandjean:
Number of universal quantifiers and computational complexity: preliminary report. SIGACT News 14(3): 30 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-20 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
