The SCEAS System
| |||||||

## Search the dblp DataBase
Arnaud Durand:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Arnaud Durand
**Modeling Cache Coherence Protocol - A Case Study with FLASH.**[Citation Graph (0, 0)][DBLP] Workshop on Abstract State Machines, 1998, pp:111-126 [Conf] - Arnaud Durand, Ronald Fagin, Bernd Loescher
**Spectra with Only Unary Function Symbols.**[Citation Graph (0, 0)][DBLP] CSL, 1997, pp:189-202 [Conf] - Arnaud Durand, Frédéric Olive
**First-Order Queries over One Unary Function.**[Citation Graph (0, 0)][DBLP] CSL, 2006, pp:334-348 [Conf] - Arnaud Durand, Solomampionona Ranaivoson
**First-Order Spectra with One Binary Predicate.**[Citation Graph (0, 0)][DBLP] CSL, 1994, pp:177-189 [Conf] - Arnaud Durand, Miki Hermann, Laurent Juban
**On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.**[Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:92-102 [Conf] - Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
**Subtractive Reductions and Complete Problems for Counting Complexity Classes.**[Citation Graph (0, 0)][DBLP] MFCS, 2000, pp:323-332 [Conf] - Arnaud Durand, Miki Hermann
**The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:451-462 [Conf] - Arnaud Durand, Malika More
**Nonerasing, Counting, and Majority over the Linear Time Hierarchy.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:174, n:2, pp:132-142 [Journal] - Arnaud Durand
**Linear Time and the Power of One First-Order Universal Quantifier.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:178, n:1, pp:12-22 [Journal] - Arnaud Durand, Clemens Lautemann, Thomas Schwentick
**Subclasses of Binary NP.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 1998, v:8, n:2, pp:189-207 [Journal] - Étienne Ailloud, Arnaud Durand
**The Expressive Power of Bijections over Weakly Arithmetized Structures.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:2, pp:297-309 [Journal] - Arnaud Durand, Miki Hermann, Laurent Juban
**On the complexity of recognizing the Hilbert basis of a linear diophantine system.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:625-642 [Journal] - Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
**Subtractive reductions and complete problems for counting complexity classes.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:3, pp:496-513 [Journal] - Arnaud Durand, Solomampionona Ranaivoson
**First-Order Spectra with one Binary Predicate.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:160, n:1&2, pp:305-320 [Journal] - 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] - Arnaud Durand, Etienne Grandjean
**The complexity of acyclic conjunctive queries revisited**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - 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] **Efficient Enumeration for Conjunctive Queries over X-underbar Structures.**[Citation Graph (, )][DBLP]**Counting Results in Weak Formalisms.**[Citation Graph (, )][DBLP]**Trichotomy in the Complexity of Minimal Inference.**[Citation Graph (, )][DBLP]**First-order queries on structures of bounded degree are computable with constant delay**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |