default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Durand 0001
Person information
- affiliation: Université Paris-Diderot, France
Other persons with the same name
- Arnaud Durand 0002 — SERTIT, France
- Arnaud Durand 0003
![[0000-0002-7629-2121]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-7629-2121")
— University of Fribourg, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Arnaud Durand, Juha Kontinen, Jouko Väänänen:
Modular SAT-based techniques for reasoning tasks in team semantics. J. Comput. Syst. Sci. 146: 103575 (2024)- [j26]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Special issue on logic and complexity. Math. Struct. Comput. Sci. 34(5): 344-345 (2024) - [c27]Melissa Antonelli, Arnaud Durand, Juha Kontinen:
Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper). ICTCS 2024: 166-172 - [c26]Melissa Antonelli, Arnaud Durand, Juha Kontinen:
A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. MFCS 2024: 10:1-10:18 - 2023
- [j25]Olivier Bournez, Arnaud Durand:
A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. 32(2): 7 (2023) - 2022
- [j24]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. 18(2) (2022) - [j23]Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen:
Tractability Frontier of Data Complexity in Team Semantics. ACM Trans. Comput. Log. 23(1): 3:1-3:21 (2022) - [c25]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. MFCS 2022: 38:1-38:14 - [i19]Arnaud Durand, Juha Kontinen, Jouko Väänänen:
Modular SAT-based techniques for reasoning tasks in team semantics. CoRR abs/2204.00576 (2022) - [i18]Nadia Creignou, Arnaud Durand, Heribert Vollmer:
Enumeration Classes Defined by Circuits. CoRR abs/2205.00539 (2022) - [i17]Olivier Bournez, Arnaud Durand:
A characterization of functions over the integers computable in polynomial time using discrete differential equations. CoRR abs/2209.12168 (2022) - 2021
- [j22]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. 116: 40-54 (2021) - 2020
- [c24]Arnaud Durand:
Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. PODS 2020: 331-346 - [i16]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR abs/2010.08382 (2020)
2010 – 2019
- 2019
- [c23]Olivier Bournez, Arnaud Durand:
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. MFCS 2019: 23:1-23:14 - 2018
- [j21]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4): 297-320 (2018) - [c22]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic Team Semantics. FoIKS 2018: 186-206 - [c21]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS 2018: 354-363 - [i15]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic team semantics. CoRR abs/1803.02180 (2018) - [i14]Olivier Bournez, Arnaud Durand, Sabrina Ouazzani:
Recursion schemes, discrete differential equations and characterization of polynomial time computation. CoRR abs/1810.02241 (2018) - 2017
- [i13]Arnaud Durand, Anselm Haak, Heribert Vollmer:
Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR abs/1710.01934 (2017) - 2016
- [j20]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j19]Florent Capelli, Arnaud Durand, Stefan Mengel:
The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. 58(4): 506-527 (2016) - [c20]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CSL 2016: 20:1-20:16 - [c19]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. FoIKS 2016: 271-291 - [p1]Arnaud Durand, Juha Kontinen, Heribert Vollmer:
Expressivity and Complexity of Dependence Logic. Dependence Logic 2016: 5-32 - [i12]Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. CoRR abs/1604.06617 (2016) - 2015
- [j18]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. 24(3): 289-305 (2015) - [j17]Arnaud Durand, Stefan Mengel:
Structural Tractability of Counting of Solutions to Conjunctive Queries. Theory Comput. Syst. 57(4): 1202-1249 (2015) - [c18]Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen:
Tractability Frontier of Data Complexity in Team Semantics. GandALF 2015: 73-85 - [i11]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Approximation and Dependence via Multiteam Semantics. CoRR abs/1510.09040 (2015) - 2014
- [j16]Arnaud Durand, Stefan Mengel:
The complexity of weighted counting for acyclic conjunctive queries. J. Comput. Syst. Sci. 80(1): 277-296 (2014) - [c17]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. FSTTCS 2014: 493-504 - [c16]Arnaud Durand, Nicole Schweikardt, Luc Segoufin:
Enumerating answers to first-order queries over databases of low degree. PODS 2014: 121-131 - [c15]Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. SAT 2014: 399-414 - [i10]Florent Capelli, Arnaud Durand, Stefan Mengel:
Hypergraph Acyclicity and Propositional Model Counting. CoRR abs/1401.6307 (2014) - [i9]Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism polynomials complete for VP. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c14]Arnaud Durand, Stefan Mengel:
Structural tractability of counting of solutions to conjunctive queries. ICDT 2013: 81-92 - [c13]Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. STACS 2013: 365-376 - [i8]Arnaud Durand, Stefan Mengel:
Structural Tractability of Counting of Solutions to Conjunctive Queries. CoRR abs/1303.2059 (2013) - 2012
- [j15]Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More:
Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. 18(4): 505-553 (2012) - [j14]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. 50(3): 446-491 (2012) - [j13]Arnaud Durand, Juha Kontinen:
Hierarchies in Dependence Logic. ACM Trans. Comput. Log. 13(4): 31:1-31:21 (2012) - [e1]Patrick Cégielski, Arnaud Durand:
Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France. LIPIcs 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-42-2 [contents] - [i7]Florent Capelli, Arnaud Durand, Stefan Mengel:
The arithmetic complexity of tensor contractions. CoRR abs/1209.4865 (2012) - 2011
- [j12]Arnaud Durand, Michel Habib:
Complexity issues for the sandwich homogeneous set problem. Discret. Appl. Math. 159(7): 574-580 (2011) - [c12]Arnaud Durand, Yann Strozecki:
Enumeration Complexity of Logical Query Problems with Second-order Variables. CSL 2011: 189-202 - [c11]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. FSTTCS 2011: 252-263 - [i6]Arnaud Durand, Juha Kontinen:
Hierarchies in Dependence Logic. CoRR abs/1105.3324 (2011) - [i5]Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer:
Dependence logic with a majority quantifier. CoRR abs/1109.4750 (2011) - [i4]Arnaud Durand, Stefan Mengel:
On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems. CoRR abs/1110.4201 (2011) - 2010
- [c10]Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin:
Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL 2010: 80-94
2000 – 2009
- 2009
- [c9]Arnaud Durand, Miki Hermann, Gustav Nordh:
Trichotomy in the Complexity of Minimal Inference. LICS 2009: 387-396 - 2008
- [j11]Arnaud Durand, Miki Hermann:
On the counting complexity of propositional circumscription. Inf. Process. Lett. 106(4): 164-170 (2008) - [j10]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
- [j9]Arnaud Durand, Clemens Lautemann, Malika More:
A simple proof of the polylog counting ability of first-order logic: guest column. SIGACT News 38(4): 40-45 (2007) - [j8]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) - [c8]Guillaume Bagan, Arnaud Durand, Etienne Grandjean:
On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL 2007: 208-222 - 2006
- [j7]Étienne Ailloud, Arnaud Durand:
The Expressive Power of Bijections over Weakly Arithmetized Structures. Theory Comput. Syst. 39(2): 297-309 (2006) - [c7]Arnaud Durand, Frédéric Olive:
First-Order Queries over One Unary Function. CSL 2006: 334-348 - [i3]Arnaud Durand, Clemens Lautemann, Malika More:
Counting Results in Weak Formalisms. Circuits, Logic, and Games 2006 - [i2]Arnaud Durand, Etienne Grandjean:
The complexity of acyclic conjunctive queries revisited. CoRR abs/cs/0605008 (2006) - 2005
- [j6]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. 340(3): 496-513 (2005) - [i1]Arnaud Durand, Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay. CoRR abs/cs/0507020 (2005) - 2003
- [c6]Arnaud Durand, Miki Hermann:
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS 2003: 451-462 - 2002
- [j5]Arnaud Durand, Malika More:
Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Inf. Comput. 174(2): 132-142 (2002) - [j4]Arnaud Durand:
Linear Time and the Power of One First-Order Universal Quantifier. Inf. Comput. 178(1): 12-22 (2002) - [j3]Arnaud Durand, Miki Hermann, Laurent Juban:
On the complexity of recognizing the Hilbert basis of a linear diophantine system. Theor. Comput. Sci. 270(1-2): 625-642 (2002) - 2000
- [c5]Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS 2000: 323-332
1990 – 1999
- 1999
- [c4]Arnaud Durand, Miki Hermann, Laurent Juban:
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. MFCS 1999: 92-102 - 1998
- [j2]Arnaud Durand, Clemens Lautemann, Thomas Schwentick:
Subclasses of Binary NP. J. Log. Comput. 8(2): 189-207 (1998) - [c3]Arnaud Durand:
Modeling Cache Coherence Protocol - A Case Study with FLASH. Workshop on Abstract State Machines 1998: 111-126 - 1997
- [c2]Arnaud Durand, Ronald Fagin, Bernd Loescher:
Spectra with Only Unary Function Symbols. CSL 1997: 189-202 - 1996
- [j1]Arnaud Durand, Solomampionona Ranaivoson:
First-Order Spectra with one Binary Predicate. Theor. Comput. Sci. 160(1&2): 305-320 (1996) - 1994
- [c1]Arnaud Durand, Solomampionona Ranaivoson:
First-Order Spectra with One Binary Predicate. CSL 1994: 177-189
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 2025-01-21 00:13 CET 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:
