The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Etienne Grandjean: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Etienne Grandjean
    Complexity of the First-Order Theory of Almost All Finite Structures [Citation Graph (5, 0)][DBLP]
    Information and Control, 1983, v:57, n:2/3, pp:180-204 [Journal]
  2. Etienne Grandjean
    First-order Spectra with One Variable. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:166-180 [Conf]
  3. Régis Barbanchon, Etienne Grandjean
    Local Problems, Planar Local Problems and Linear Time. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:397-411 [Conf]
  4. Etienne Grandjean
    Linear Time Algorithms and NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:248-273 [Conf]
  5. Etienne Grandjean, Frédéric Olive
    Monadic Logical Definability of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    CSL, 1994, pp:190-204 [Conf]
  6. Etienne Grandjean, J. M. Robson
    RAM with Compact Memory: A Realistic and Robust Model of Computation. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:195-233 [Conf]
  7. Etienne Grandjean
    Universal quantifiers and time complexity of random access machines. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:366-379 [Conf]
  8. Régis Barbanchon, Etienne Grandjean
    The Minimal Logically-Defined NP-Complete Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:338-349 [Conf]
  9. Etienne Grandjean
    Sorting, Linear Time and the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1996, v:16, n:, pp:183-236 [Journal]
  10. Etienne Grandjean
    Invariance Properties of Rams and Linear Time. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:62-106 [Journal]
  11. Etienne Grandjean, Frédéric Olive
    Monadic Logical Definability of Nondeterministic Linear Time. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:54-97 [Journal]
  12. Etienne Grandjean
    First-Order Spectra with One Variable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:40, n:2, pp:136-153 [Journal]
  13. Etienne Grandjean, Frédéric Olive
    Graph properties checkable in linear time in the number of vertices. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:3, pp:546-597 [Journal]
  14. Etienne Grandjean, Hans Kleine Büning
    SAT-Problems and Reductions with Respect to the Number of Variables. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1997, v:7, n:4, pp:457-471 [Journal]
  15. Etienne Grandjean
    Universal Quantifiers and Time Complexity of Random Access Machines. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1985, v:18, n:2, pp:171-187 [Journal]
  16. Etienne Grandjean
    The Spectra of First-Order Sentences and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:356-373 [Journal]
  17. Etienne Grandjean
    A Natural NP-Complete Problem with a Nontrivial Lower Nound. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:786-809 [Journal]
  18. Etienne Grandjean
    A Nontrivial Lower Bound for an NP Problem on Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:438-451 [Journal]
  19. Etienne Grandjean
    Linear Time Algorithms and NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:573-597 [Journal]
  20. Etienne Grandjean, Thomas Schwentick
    Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:196-230 [Journal]
  21. Guillaume Bagan, Arnaud Durand, Etienne Grandjean
    On Acyclic Conjunctive Queries and Constant Delay Enumeration. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:208-222 [Conf]
  22. Arnaud Durand, Etienne Grandjean
    The complexity of acyclic conjunctive queries revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  23. Philippe Chapdelaine, Etienne Grandjean
    Lower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  24. Arnaud Durand, Etienne Grandjean
    First-order queries on structures of bounded degree are computable with constant delay. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:4, pp:- [Journal]

  25. First-order queries on structures of bounded degree are computable with constant delay [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002