Luc Segoufin - RankMe

115 papers A* 25A 14B 6Journal 55Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language. CoRR Antoine Amarilli, Sven Dziadek, Luc Segoufin
2025	J	`jnl`	A Simple Algorithm for Consistent Query Answering under Primary Keys. Log. Methods Comput. Sci. Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
2024	J	`jnl`	A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. Proc. ACM Manag. Data Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
2023	J	`jnl`	A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. CoRR Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
2023	A	`conf`	A Simple Algorithm for Consistent Query Answering Under Primary Keys. ICDT Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
2023	J	`jnl`	A Simple Algorithm for Consistent Query Answering under Primary Keys. CoRR Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo
2023	A*	`conf`	Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis. PODS Nofar Carmeli, Luc Segoufin
2022	J	`jnl`	Conjunctive queries with self-joins, towards a fine-grained complexity analysis. CoRR Nofar Carmeli, Luc Segoufin
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	J	`jnl`	Enumeration for FO Queries over Nowhere Dense Graphs. J. ACM Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
2022	J	`jnl`	Tameness and the power of programs over monoids in DA. Log. Methods Comput. Sci. Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2021	J	`jnl`	Tameness and the power of programs over monoids in DA. CoRR Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2020	J	`jnl`	Enumerating Answers to First-Order Queries over Databases of Low Degree. CoRR Arnaud Durand, Nicole Schweikardt, Luc Segoufin
2020	J	`jnl`	First-order queries on classes of structures with bounded expansion. Log. Methods Comput. Sci. Wojciech Kazana, Luc Segoufin
2020	B	`conf`	Order-Invariant First-Order Logic over Hollow Trees. CSL Julien Grange, Luc Segoufin
2020	A*	`conf`	Projection Views of Register Automata. PODS Luc Segoufin, Victor Vianu
2018	A*	`conf`	Enumeration for FO Queries over Nowhere Dense Graphs. PODS Nicole Schweikardt, Luc Segoufin, Alexandre Vigny
2018	A*	`conf`	Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates. PODS Matthias Niewerth, Luc Segoufin
2018	J	`jnl`	First-order queries on classes of structures with bounded expansion. CoRR Wojciech Kazana, Luc Segoufin
2017	J	`jnl`	A survey on guarded negation. ACM SIGLOG News Luc Segoufin
2017	J	`jnl`	Bottom-up automata on data trees and vertical XPath. CoRR Diego Figueira, Luc Segoufin
2017	J	`jnl`	Bottom-up automata on data trees and vertical XPath. Log. Methods Comput. Sci. Diego Figueira, Luc Segoufin
2017	A	`conf`	Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. ICDT Luc Segoufin, Alexandre Vigny
2017	J	`jnl`	M. Grohe, Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, Cambridge University Press, Cambridge, 2017, x + 544 pp. Bull. Symb. Log. Luc Segoufin
2017	B	`conf`	The Power of Programs over Monoids in DA. MFCS Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2016	J	`jnl`	Decidable Characterization of FO2(<, +1) and locality of DA. CoRR Thomas Place, Luc Segoufin
2016	J	`jnl`	FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems. Log. Methods Comput. Sci. Florent Jacquemard, Luc Segoufin, Jerémie Dimino
2016	J	`jnl`	Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method. ACM Trans. Comput. Theory Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2016	J	`jnl`	Nondeterminism and an abstract formulation of Nečiporuk's lower bound method. CoRR Paul Beame, Nathan Grosshans, Pierre McKenzie, Luc Segoufin
2015	—	`conf`	Capturing MSO with One Quantifier. Fields of Logic and Computation II Anuj Dawar, Luc Segoufin
2015	J	`jnl`	Constant Delay Enumeration for Conjunctive Queries. SIGMOD Rec. Luc Segoufin
2015	J	`jnl`	Datalog Rewritings of Regular Path Queries using Views. Log. Methods Comput. Sci. Nadime Francis, Luc Segoufin, Cristina Sirangelo
2015	J	`jnl`	Deciding definability in FO2(<h, <v) on trees. Log. Methods Comput. Sci. Thomas Place, Luc Segoufin
2015	J	`jnl`	Guarded Negation. J. ACM Vince Bárány, Balder ten Cate, Luc Segoufin
2014	A	`conf`	A glimpse on constant delay enumeration (Invited Talk). STACS Luc Segoufin
2014	A	`conf`	Datalog Rewritings of Regular Path Queries using Views. ICDT Nadime Francis, Luc Segoufin, Cristina Sirangelo
2014	A*	`conf`	Enumerating answers to first-order queries over databases of low degree. PODS Arnaud Durand, Nicole Schweikardt, Luc Segoufin
2013	A	`conf`	Enumerating with constant delay the answers to a query. ICDT Luc Segoufin
2013	A*	`conf`	Enumeration of first-order queries on classes of structures with bounded expansion. PODS Wojciech Kazana, Luc Segoufin
2013	J	`jnl`	Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log. Wojciech Kazana, Luc Segoufin
2013	J	`jnl`	Unary negation. Log. Methods Comput. Sci. Luc Segoufin, Balder ten Cate
2013	A*	`conf`	Verification of database-driven systems via amalgamation. PODS Mikolaj Bojanczyk, Luc Segoufin, Szymon Torunczyk
2012	J	`jnl`	Locality from Circuit Lower Bounds. SIAM J. Comput. Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
2012	J	`jnl`	Piecewise testable tree languages Log. Methods Comput. Sci. Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2011	J	`jnl`	A decidable characterization of locally testable tree languages Log. Methods Comput. Sci. Thomas Place, Luc Segoufin
2011	A	`conf`	Automata based verification over linearly ordered data domains. STACS Luc Segoufin, Szymon Torunczyk
2011	A	`conf`	Bottom-up automata on data trees and vertical XPath. STACS Diego Figueira, Luc Segoufin
2011	J	`jnl`	First-order query evaluation on structures of bounded degree Log. Methods Comput. Sci. Wojciech Kazana, Luc Segoufin
2011	J	`jnl`	Foundations of distributed data management (Dagstuhl Seminar 11421). Dagstuhl Reports Serge Abiteboul, Alin Deutsch, Thomas Schwentick, Luc Segoufin
2011	—	`conf`	Guarded Negation. ICALP (2) Vince Bárány, Balder ten Cate, Luc Segoufin
2011	J	`jnl`	Locality from Circuit Lower Bounds. Electron. Colloquium Comput. Complex. Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
2011	—	`conf`	Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates. ICALP (2) Matthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin
2011	J	`jnl`	Two-variable logic on data words. ACM Trans. Comput. Log. Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2011	A	`conf`	Unary negation. STACS Balder ten Cate, Luc Segoufin
2010	A*	`conf`	Addition-Invariant FO and Regularity. LICS Nicole Schweikardt, Luc Segoufin
2010	A	`ed.`	Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings ICDT Luc Segoufin
2010	A*	`conf`	Deciding Definability in FO LICS Thomas Place, Luc Segoufin
2010	J	`jnl`	Transitive closure logic, nested tree walking automata, and XPath. J. ACM Balder ten Cate, Luc Segoufin
2010	J	`jnl`	Tree Languages Defined in First-Order Logic with One Quantifier Alternation Log. Methods Comput. Sci. Mikolaj Bojanczyk, Luc Segoufin
2010	J	`jnl`	Views and queries: Determinacy and rewriting. ACM Trans. Database Syst. Alan Nash, Luc Segoufin, Victor Vianu
2009	—	`conf`	A Decidable Characterization of Locally Testable Tree Languages. ICALP (2) Thomas Place, Luc Segoufin
2009	B	`conf`	Future-Looking Logics on Data Words and Trees. MFCS Diego Figueira, Luc Segoufin
2009	J	`jnl`	Modeling and Verifying Active XML Artifacts. IEEE Data Eng. Bull. Serge Abiteboul, Luc Segoufin, Victor Vianu
2009	J	`jnl`	Regular tree languages definable in FO and in FO ACM Trans. Comput. Log. Michael Benedikt, Luc Segoufin
2009	J	`jnl`	Static analysis of active XML systems. ACM Trans. Database Syst. Serge Abiteboul, Luc Segoufin, Victor Vianu
2009	J	`jnl`	Towards a characterization of order-invariant queries over tame graphs. J. Symb. Log. Michael Benedikt, Luc Segoufin
2009	J	`jnl`	Two-variable logic on data trees and XML reasoning. J. ACM Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2008	A*	`conf`	Piecewise Testable Tree Languages. LICS Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2008	A*	`conf`	Static analysis of active XML systems. PODS Serge Abiteboul, Luc Segoufin, Victor Vianu
2008	—	`conf`	Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ICALP (2) Mikolaj Bojanczyk, Luc Segoufin
2008	A*	`conf`	XPath, transitive closure logic, and nested tree walking automata. PODS Balder ten Cate, Luc Segoufin
2007	B	`conf`	Complexity of Pebble Tree-Walking Automata. FCT Mathias Samuelides, Luc Segoufin
2007	A	`conf`	Constant-Memory Validation of Streaming XML Documents Against DTDs. ICDT Luc Segoufin, Cristina Sirangelo
2007	A	`conf`	Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report. ICDT Alan Nash, Luc Segoufin, Victor Vianu
2007	J	`jnl`	Static analysis of XML processing with data values. SIGMOD Rec. Luc Segoufin
2006	J	`jnl`	Active Context-Free Games. Theory Comput. Syst. Anca Muscholl, Thomas Schwentick, Luc Segoufin
2006	B	`conf`	Automata and Logics for Words and Trees over an Infinite Alphabet. CSL Luc Segoufin
2006	J	`jnl`	Complementing deterministic tree-walking automata. Inf. Process. Lett. Anca Muscholl, Mathias Samuelides, Luc Segoufin
2006	—	`conf`	Expressive Power of Pebble Automata. ICALP (1) Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
2006	J	`jnl`	Representing and querying XML with incomplete information. ACM Trans. Database Syst. Serge Abiteboul, Luc Segoufin, Victor Vianu
2006	A*	`conf`	Two-Variable Logic on Words with Data. LICS Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David
2006	A*	`conf`	Two-variable logic on data trees and XML reasoning. PODS Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin
2005	A	`conf`	Regular Tree Languages Definable in FO. STACS Michael Benedikt, Luc Segoufin
2005	J	`jnl`	The complexity of XPath query evaluation and XML typing. J. ACM Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
2005	B	`conf`	Towards a Characterization of Order-Invariant Queries over Tame Structures. CSL Michael Benedikt, Luc Segoufin
2005	A*	`conf`	Views and queries: determinacy and rewriting. PODS Luc Segoufin, Victor Vianu
2004	A	`conf`	Active Context-Free Games. STACS Anca Muscholl, Thomas Schwentick, Luc Segoufin
2004	J	`jnl`	Order Independent Temporal Properties. J. Log. Comput. Nicole Bidoit, Sandra de Amo, Luc Segoufin
2003	J	`jnl`	Building a constraint-based spatial database system: model, languages, and implementation. Inf. Syst. Philippe Rigaux, Michel Scholl, Luc Segoufin, Stéphane Grumbach
2003	J	`jnl`	Definable relations and first-order query languages over strings. J. ACM Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2003	J	`jnl`	Handling Interpolated Data. Comput. J. Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
2003	J	`jnl`	Reachability and connectivity queries in constraint databases. J. Comput. Syst. Sci. Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
2003	A*	`conf`	Typing and querying XML documents: some complexity bounds. PODS Luc Segoufin
2002	J	`jnl`	On first-order topological queries. ACM Trans. Comput. Log. Martin Grohe, Luc Segoufin
2002	A*	`conf`	Validating Streaming XML Documents. PODS Luc Segoufin, Victor Vianu
2001	A*	`conf`	A Model-Theoretic Approach to Regular String Relations. LICS Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2001	—	`conf`	Propriétés temporelles indépendantes de l'ordre. BDA Nicole Bidoit, Sandra de Amo, Luc Segoufin
2001	A*	`conf`	Representing and Querying XML with Incomplete Information. PODS Serge Abiteboul, Luc Segoufin, Victor Vianu
2001	J	`jnl`	Spatio-Temporal Data Handling with Constraints. GeoInformatica Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
2001	A*	`conf`	String Operations in Query Languages. PODS Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
2001	A*	`conf`	When is the evaluation of conjunctive queries tractable? STOC Martin Grohe, Thomas Schwentick, Luc Segoufin
2000	A*	`conf`	Manipulating Interpolated Data is Easier than You Thought. VLDB Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
2000	A*	`conf`	On First-Order Topological Queries. LICS Martin Grohe, Luc Segoufin
2000	—	`ch.`	Optimization Techniques. Constraint Databases Stéphane Grumbach, Zoé Lacroix, Philippe Rigaux, Luc Segoufin
2000	J	`jnl`	Querying Spatial Databases via Topological Invariants. J. Comput. Syst. Sci. Luc Segoufin, Victor Vianu
2000	A*	`conf`	Reachability and Connectivity Queries in Constraint Databases. PODS Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
2000	—	`ch.`	The DEDALE Prototype. Constraint Databases Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin
1999	—	`conf`	Modeling and Querying Interpolated Spatial Data. Proc. 15èmes Journées Bases de Données Avancées, BDA Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
1999	A	`conf`	On the Orthographic Dimension of Constraint Databases. ICDT Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
1998	—	`conf`	Efficient multi-dimensional data handling in constraint databases. BDA Stéphane Grumbach, Luc Segoufin, Philippe Rigaux
1998	A*	`conf`	Querying Spatial Databases via Topological Invariants. PODS Luc Segoufin, Victor Vianu
1998	—	`conf`	Spatio-Temporal Data Handling with Constraints. ACM-GIS Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
1998	—	`conf`	The DEDALE System for Complex Spatial Queries. SIGMOD Conference Stéphane Grumbach, Philippe Rigaux, Luc Segoufin
1997	—	`conf`	DEDALE, A Spatial Constraint Database. BDA Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin
1997	—	`conf`	DEDALE, A Spatial Constraint Database. DBPL Stéphane Grumbach, Philippe Rigaux, Michel Scholl, Luc Segoufin