Arnaud Durand - RankMe

82 papers A* 4A 4B 14Journal 50Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Towards new characterizations of small circuit classes via discrete ordinary differential equations. Theor. Comput. Sci. Melissa Antonelli, Arnaud Durand, Juha Kontinen
2025	J	`jnl`	Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations. CoRR Melissa Antonelli, Arnaud Durand, Juha Kontinen
2025	B	`conf`	Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations. MFCS Melissa Antonelli, Arnaud Durand, Juha Kontinen
2025	—	`conf`	Circuit Complexity Meets Discrete Ordinary Differential Equations: An Overview. OVERLAY Melissa Antonelli, Arnaud Durand, Juha Kontinen
2025	J	`jnl`	Enumeration Classes Defined by Circuits. ACM Trans. Comput. Theory Nadia Creignou, Arnaud Durand, Heribert Vollmer
2025	J	`jnl`	The flattening operator in team-based logics. CoRR Arnaud Durand, Juha Kontinen, Werner Mérian, Jouko Väänänen
2025	J	`jnl`	Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations. CoRR Melissa Antonelli, Arnaud Durand, Juha Kontinen
2024	B	`conf`	A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations. MFCS Melissa Antonelli, Arnaud Durand, Juha Kontinen
2024	J	`jnl`	Modular SAT-based techniques for reasoning tasks in team semantics. J. Comput. Syst. Sci. Arnaud Durand, Juha Kontinen, Jouko Väänänen
2024	J	`jnl`	Special issue on logic and complexity. Math. Struct. Comput. Sci. Nadia Creignou, Arnaud Durand, Heribert Vollmer
2024	—	`conf`	Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper). ICTCS Melissa Antonelli, Arnaud Durand, Juha Kontinen
2023	J	`jnl`	A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations. Comput. Complex. Olivier Bournez, Arnaud Durand
2022	J	`jnl`	A characterization of functions over the integers computable in polynomial time using discrete differential equations. CoRR Olivier Bournez, Arnaud Durand
2022	J	`jnl`	Enumerating Answers to First-Order Queries over Databases of Low Degree. Log. Methods Comput. Sci. Arnaud Durand, Nicole Schweikardt, Luc Segoufin
2022	B	`conf`	Enumeration Classes Defined by Circuits. MFCS Nadia Creignou, Arnaud Durand, Heribert Vollmer
2022	J	`jnl`	Enumeration Classes Defined by Circuits. CoRR Nadia Creignou, Arnaud Durand, Heribert Vollmer
2022	J	`jnl`	Modular SAT-based techniques for reasoning tasks in team semantics. CoRR Arnaud Durand, Juha Kontinen, Jouko Väänänen
2022	J	`jnl`	Tractability Frontier of Data Complexity in Team Semantics. ACM Trans. Comput. Log. Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen
2021	J	`jnl`	Descriptive complexity of #P functions: A new perspective. J. Comput. Syst. Sci. Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2020	J	`jnl`	Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR Arnaud Durand, Nicole Schweikardt, Luc Segoufin
2020	A*	`conf`	Fine-Grained Complexity Analysis of Queries: From Decision to Counting and Enumeration. PODS Arnaud Durand
2019	B	`conf`	Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. MFCS Olivier Bournez, Arnaud Durand
2018	J	`jnl`	Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018	A*	`conf`	Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth. LICS Arnaud Durand, Anselm Haak, Heribert Vollmer
2018	—	`conf`	Probabilistic Team Semantics. FoIKS Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018	J	`jnl`	Probabilistic team semantics. CoRR Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2018	J	`jnl`	Recursion schemes, discrete differential equations and characterization of polynomial time computation. CoRR Olivier Bournez, Arnaud Durand, Sabrina Ouazzani
2017	J	`jnl`	Model-Theoretic Characterizations of Boolean and Arithmetic Circuit Classes of Small Depth. CoRR Arnaud Durand, Anselm Haak, Heribert Vollmer
2016	—	`conf`	Approximation and Dependence via Multiteam Semantics. FoIKS Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2016	B	`conf`	Descriptive Complexity of #AC CSL Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2016	J	`jnl`	Descriptive Complexity of #AC CoRR Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer
2016	—	`ch.`	Expressivity and Complexity of Dependence Logic. Dependence Logic Arnaud Durand, Juha Kontinen, Heribert Vollmer
2016	J	`jnl`	Homomorphism Polynomials Complete for VP. Chic. J. Theor. Comput. Sci. Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2016	J	`jnl`	The Arithmetic Complexity of Tensor Contraction. Theory Comput. Syst. Florent Capelli, Arnaud Durand, Stefan Mengel
2015	J	`jnl`	Approximation and Dependence via Multiteam Semantics. CoRR Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema
2015	J	`jnl`	Dependence Logic with a Majority Quantifier. J. Log. Lang. Inf. Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2015	J	`jnl`	Structural Tractability of Counting of Solutions to Conjunctive Queries. Theory Comput. Syst. Arnaud Durand, Stefan Mengel
2015	—	`conf`	Tractability Frontier of Data Complexity in Team Semantics. GandALF Arnaud Durand, Juha Kontinen, Nicolas de Rugy-Altherre, Jouko Väänänen
2014	A*	`conf`	Enumerating answers to first-order queries over databases of low degree. PODS Arnaud Durand, Nicole Schweikardt, Luc Segoufin
2014	—	`conf`	Homomorphism Polynomials Complete for VP. FSTTCS Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2014	J	`jnl`	Homomorphism polynomials complete for VP. Electron. Colloquium Comput. Complex. Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh
2014	A	`conf`	Hypergraph Acyclicity and Propositional Model Counting. SAT Florent Capelli, Arnaud Durand, Stefan Mengel
2014	J	`jnl`	Hypergraph Acyclicity and Propositional Model Counting. CoRR Florent Capelli, Arnaud Durand, Stefan Mengel
2014	J	`jnl`	The complexity of weighted counting for acyclic conjunctive queries. J. Comput. Syst. Sci. Arnaud Durand, Stefan Mengel
2013	J	`jnl`	Structural Tractability of Counting of Solutions to Conjunctive Queries CoRR Arnaud Durand, Stefan Mengel
2013	A	`conf`	Structural tractability of counting of solutions to conjunctive queries. ICDT Arnaud Durand, Stefan Mengel
2013	A	`conf`	The arithmetic complexity of tensor contractions. STACS Florent Capelli, Arnaud Durand, Stefan Mengel
2012	B	`ed.`	Computer Science Logic - 26th International Workshop / 21st Annual Conference of the EACSL, CSL 2012, Fontainebleau, France, September 3-6, 2012 CSL Patrick Cégielski, Arnaud Durand
2012	J	`jnl`	Fifty years of the spectrum problem: survey and new results. Bull. Symb. Log. Arnaud Durand, Neil D. Jones, Johann A. Makowsky, Malika More
2012	J	`jnl`	Hierarchies in Dependence Logic. ACM Trans. Comput. Log. Arnaud Durand, Juha Kontinen
2012	J	`jnl`	The arithmetic complexity of tensor contractions CoRR Florent Capelli, Arnaud Durand, Stefan Mengel
2012	J	`jnl`	Trichotomies in the Complexity of Minimal Inference. Theory Comput. Syst. Arnaud Durand, Miki Hermann, Gustav Nordh
2011	J	`jnl`	Complexity issues for the sandwich homogeneous set problem. Discret. Appl. Math. Arnaud Durand, Michel Habib
2011	J	`jnl`	Dependence logic with a majority quantifier CoRR Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2011	—	`conf`	Dependence logic with a majority quantifier. FSTTCS Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer
2011	B	`conf`	Enumeration Complexity of Logical Query Problems with Second-order Variables. CSL Arnaud Durand, Yann Strozecki
2011	J	`jnl`	Hierarchies in Dependence Logic CoRR Arnaud Durand, Juha Kontinen
2011	J	`jnl`	On Polynomials Defined by Acyclic Conjunctive Queries and Weighted Counting Problems CoRR Arnaud Durand, Stefan Mengel
2010	B	`conf`	Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin
2009	A*	`conf`	Trichotomy in the Complexity of Minimal Inference. LICS Arnaud Durand, Miki Hermann, Gustav Nordh
2008	J	`jnl`	Computing the jth solution of a first-order query. RAIRO Theor. Informatics Appl. Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive
2008	J	`jnl`	On the counting complexity of propositional circumscription. Inf. Process. Lett. Arnaud Durand, Miki Hermann
2007	J	`jnl`	A simple proof of the polylog counting ability of first-order logic: guest column. SIGACT News Arnaud Durand, Clemens Lautemann, Malika More
2007	J	`jnl`	First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. Arnaud Durand, Etienne Grandjean
2007	B	`conf`	On Acyclic Conjunctive Queries and Constant Delay Enumeration. CSL Guillaume Bagan, Arnaud Durand, Etienne Grandjean
2006	—	`conf`	Counting Results in Weak Formalisms. Circuits, Logic, and Games Arnaud Durand, Clemens Lautemann, Malika More
2006	B	`conf`	First-Order Queries over One Unary Function. CSL Arnaud Durand, Frédéric Olive
2006	J	`jnl`	The Expressive Power of Bijections over Weakly Arithmetized Structures. Theory Comput. Syst. Étienne Ailloud, Arnaud Durand
2006	J	`jnl`	The complexity of acyclic conjunctive queries revisited CoRR Arnaud Durand, Etienne Grandjean
2005	J	`jnl`	First-order queries on structures of bounded degree are computable with constant delay CoRR Arnaud Durand, Etienne Grandjean
2005	J	`jnl`	Subtractive reductions and complete problems for counting complexity classes. Theor. Comput. Sci. Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
2003	A	`conf`	The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete. STACS Arnaud Durand, Miki Hermann
2002	J	`jnl`	Linear Time and the Power of One First-Order Universal Quantifier. Inf. Comput. Arnaud Durand
2002	J	`jnl`	Nonerasing, Counting, and Majority over the Linear Time Hierarchy. Inf. Comput. Arnaud Durand, Malika More
2002	J	`jnl`	On the complexity of recognizing the Hilbert basis of a linear diophantine system. Theor. Comput. Sci. Arnaud Durand, Miki Hermann, Laurent Juban
2000	B	`conf`	Subtractive Reductions and Complete Problems for Counting Complexity Classes. MFCS Arnaud Durand, Miki Hermann, Phokion G. Kolaitis
1999	B	`conf`	On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. MFCS Arnaud Durand, Miki Hermann, Laurent Juban
1998	—	`conf`	Modeling Cache Coherence Protocol - A Case Study with FLASH. Workshop on Abstract State Machines Arnaud Durand
1998	J	`jnl`	Subclasses of Binary NP. J. Log. Comput. Arnaud Durand, Clemens Lautemann, Thomas Schwentick
1997	B	`conf`	Spectra with Only Unary Function Symbols. CSL Arnaud Durand, Ronald Fagin, Bernd Loescher
1996	J	`jnl`	First-Order Spectra with one Binary Predicate. Theor. Comput. Sci. Arnaud Durand, Solomampionona Ranaivoson
1994	B	`conf`	First-Order Spectra with One Binary Predicate. CSL Arnaud Durand, Solomampionona Ranaivoson