Name
Papers
Collaborators
PABLO BARCELÓ
85
103
Citations 
PageRank 
Referers 
492
41.45
682
Referees 
References 
1016
1113
Search Limit
1001000
Title
Citations
PageRank
Year
On the expressiveness of Lara: A proposal for unifying linear and relational algebra00.342022
PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 202200.342022
The Tractability of SHAP-Score-Based Explanations for Classification over Deterministic and Decomposable Boolean Circuits00.342021
Attention is Turing-Complete.00.342021
Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk).00.342021
Special Issue on Database Theory00.342021
Regularizing conjunctive features for classification00.342021
The Complexity of Counting Problems Over Incomplete Databases00.342021
Foundations of Symbolic Languages for Model Interpretability.00.342021
Graph Neural Networks with Local Graph Parameters.00.342021
The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs00.342020
Chile's new interdisciplinary institute for foundational research on data00.342020
The Expressive Power of Graph Neural Networks as a Query Language10.352020
Model Interpretability through the lens of Computational Complexity00.342020
Counting Problems over Incomplete Databases00.342020
Semantic Optimization of Conjunctive Queries00.342020
The Logical Expressiveness of Graph Neural Networks10.342020
The Logical Expressiveness of Graph Neural Networks.00.342020
On the Expressiveness of LARA - A Unified Language for Linear and Relational Algebra.00.342020
On the Turing Completeness of Modern Neural Network Architectures.00.342019
22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal.00.342019
PTime Combined Complexity and FPT in Ontology-Mediated Querying.00.342019
Expressiveness of Matrix and Tensor Query Languages in terms of ML Operators00.342019
Regularizing Conjunctive Features for Classification00.342019
On the Turing Completeness of Modern Neural Network Architectures.10.362019
Boundedness of Conjunctive Regular Path Queries.00.342019
A Theoretical View on Reverse Engineering Problems for Database Query Languages.00.342019
Monadic Decomposability of Regular Relations.00.342019
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries.00.342018
A More General Theory of Static Approximations for Conjunctive Queries00.342018
G-CORE: A Core for Future Graph Query Languages.130.632018
Containment for Rule-Based Ontology-Mediated Queries.10.362018
Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).50.412018
Efficient Evaluation and Static Analysis for Well-Designed Pattern Trees with Projection.00.342018
First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries.00.342018
Bisimulations on Data Graphs.10.362018
Semantic Optimization in Tractable Classes of Conjunctive Queries.20.352017
Guarded Ontology-Mediated Queries Distributing Over Components.00.342017
21st Workshop on Logic, Language, Information and Computation (WoLLIC 2014)00.342017
Foundations of Modern Query Languages for Graph Databases.310.932017
The complexity of reverse engineering problems for conjunctive queries.40.422017
String solving with word equations and transducers: towards a logic for analysing mutation XSS.90.482016
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints.00.342016
Semantic Acyclicity Under Constraints.70.472016
Foundations of Modern Graph Query Languages.110.582016
Order-Invariant Types and Their Applications00.342016
Order-Invariant Types and Their Applications.00.342016
Research Directions for Principles of Data Management (Abridged).50.432016
Efficient Evaluation and Approximation of Well-designed Pattern Trees130.592015
String Solving with Word Equations and Transducers: Towards a Logic for Analysing Mutation XSS (Full Version)10.352015
  • 1
  • 2