Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Papri Dey, Ravi Kannan, Nick Ryder, and Nikhil Srivastava. Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 42:1-42:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dey_et_al:LIPIcs.ITCS.2023.42, author = {Dey, Papri and Kannan, Ravi and Ryder, Nick and Srivastava, Nikhil}, title = {{Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {42:1--42:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.42}, URN = {urn:nbn:de:0030-drops-175450}, doi = {10.4230/LIPIcs.ITCS.2023.42}, annote = {Keywords: Symbolic algorithms, numerical algorithms, linear algebra} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Pablo Barceló. Explainability Queries for ML Models and its Connections with Data Management Problems (Invited Talk). In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{barcelo:LIPIcs.ICDT.2021.1, author = {Barcel\'{o}, Pablo}, title = {{Explainability Queries for ML Models and its Connections with Data Management Problems}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.1}, URN = {urn:nbn:de:0030-drops-137091}, doi = {10.4230/LIPIcs.ICDT.2021.1}, annote = {Keywords: ML models, Explainability, Shapley values, decision trees, OBDDs, deterministic and decomposable Boolean circuits} }
Published in: LIPIcs, Volume 155, 23rd International Conference on Database Theory (ICDT 2020)
Pablo Barceló, Nelson Higuera, Jorge Pérez, and Bernardo Subercaseaux. On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra. In 23rd International Conference on Database Theory (ICDT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 155, pp. 6:1-6:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{barcelo_et_al:LIPIcs.ICDT.2020.6, author = {Barcel\'{o}, Pablo and Higuera, Nelson and P\'{e}rez, Jorge and Subercaseaux, Bernardo}, title = {{On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra}}, booktitle = {23rd International Conference on Database Theory (ICDT 2020)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-139-9}, ISSN = {1868-8969}, year = {2020}, volume = {155}, editor = {Lutz, Carsten and Jung, Jean Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2020.6}, URN = {urn:nbn:de:0030-drops-119305}, doi = {10.4230/LIPIcs.ICDT.2020.6}, annote = {Keywords: languages for linear and relational algebra, expressive power, first order logic with aggregation, matrix convolution, matrix inverse, query genericity, locality of queries, safety} }
Published in: LIPIcs, Volume 147, 26th International Symposium on Temporal Representation and Reasoning (TIME 2019)
Pablo Cordero, Inmaculada Fortes, Inmaculada P. de Guzmán, and Sixto Sánchez. Simplifying Inductive Schemes in Temporal Logic. In 26th International Symposium on Temporal Representation and Reasoning (TIME 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 147, pp. 19:1-19:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cordero_et_al:LIPIcs.TIME.2019.19, author = {Cordero, Pablo and Fortes, Inmaculada and de Guzm\'{a}n, Inmaculada P. and S\'{a}nchez, Sixto}, title = {{Simplifying Inductive Schemes in Temporal Logic}}, booktitle = {26th International Symposium on Temporal Representation and Reasoning (TIME 2019)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-127-6}, ISSN = {1868-8969}, year = {2019}, volume = {147}, editor = {Gamper, Johann and Pinchinat, Sophie and Sciavicco, Guido}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2019.19}, URN = {urn:nbn:de:0030-drops-113773}, doi = {10.4230/LIPIcs.TIME.2019.19}, annote = {Keywords: Linear Temporal Logic, Inductive Schemes, Loop-check} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Pablo Barceló, Diego Figueira, and Miguel Romero. Boundedness of Conjunctive Regular Path Queries (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 104:1-104:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{barcelo_et_al:LIPIcs.ICALP.2019.104, author = {Barcel\'{o}, Pablo and Figueira, Diego and Romero, Miguel}, title = {{Boundedness of Conjunctive Regular Path Queries}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {104:1--104:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.104}, URN = {urn:nbn:de:0030-drops-106803}, doi = {10.4230/LIPIcs.ICALP.2019.104}, annote = {Keywords: regular path queries, boundedness, limitedness, distance automata} }
Published in: LIPIcs, Volume 128, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, and Brigitte Vallée. Dichotomic Selection on Words: A Probabilistic Analysis. In 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 128, pp. 19:1-19:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{akhavi_et_al:LIPIcs.CPM.2019.19, author = {Akhavi, Ali and Cl\'{e}ment, Julien and Darthenay, Dimitri and Lhote, Lo\"{i}ck and Vall\'{e}e, Brigitte}, title = {{Dichotomic Selection on Words: A Probabilistic Analysis}}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)}, pages = {19:1--19:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-103-0}, ISSN = {1868-8969}, year = {2019}, volume = {128}, editor = {Pisanti, Nadia and P. Pissis, Solon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2019.19}, URN = {urn:nbn:de:0030-drops-104903}, doi = {10.4230/LIPIcs.CPM.2019.19}, annote = {Keywords: dichotomic selection, text algorithms, analysis of algorithms, average case analysis of algorithms, trie, suffix array, lcp-array, information theory, numeration process, sources, entropy, coincidence, analytic combinatorics, depoissonization techniques} }
Published in: LIPIcs, Volume 127, 22nd International Conference on Database Theory (ICDT 2019)
Dan Olteanu. Learning Models over Relational Databases (Invited Talk). In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{olteanu:LIPIcs.ICDT.2019.1, author = {Olteanu, Dan}, title = {{Learning Models over Relational Databases}}, booktitle = {22nd International Conference on Database Theory (ICDT 2019)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-101-6}, ISSN = {1868-8969}, year = {2019}, volume = {127}, editor = {Barcelo, Pablo and Calautti, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.1}, URN = {urn:nbn:de:0030-drops-103034}, doi = {10.4230/LIPIcs.ICDT.2019.1}, annote = {Keywords: In-database analytics, Data complexity, Feature extraction queries, Database dependencies, Model reparameterization} }
Published in: LIPIcs, Volume 127, 22nd International Conference on Database Theory (ICDT 2019)
Lise Getoor. The Power of Relational Learning (Invited Talk). In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{getoor:LIPIcs.ICDT.2019.2, author = {Getoor, Lise}, title = {{The Power of Relational Learning}}, booktitle = {22nd International Conference on Database Theory (ICDT 2019)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-101-6}, ISSN = {1868-8969}, year = {2019}, volume = {127}, editor = {Barcelo, Pablo and Calautti, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.2}, URN = {urn:nbn:de:0030-drops-103048}, doi = {10.4230/LIPIcs.ICDT.2019.2}, annote = {Keywords: Machine learning, Probabilistic soft logic, Relational model} }
Published in: LIPIcs, Volume 127, 22nd International Conference on Database Theory (ICDT 2019)
Paraschos Koutris and Jef Wijsen. Consistent Query Answering for Primary Keys in Logspace. In 22nd International Conference on Database Theory (ICDT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 127, pp. 23:1-23:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{koutris_et_al:LIPIcs.ICDT.2019.23, author = {Koutris, Paraschos and Wijsen, Jef}, title = {{Consistent Query Answering for Primary Keys in Logspace}}, booktitle = {22nd International Conference on Database Theory (ICDT 2019)}, pages = {23:1--23:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-101-6}, ISSN = {1868-8969}, year = {2019}, volume = {127}, editor = {Barcelo, Pablo and Calautti, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2019.23}, URN = {urn:nbn:de:0030-drops-103252}, doi = {10.4230/LIPIcs.ICDT.2019.23}, annote = {Keywords: conjunctive queries, consistent query answering, Datalog, primary keys} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Fidaa Abed, Parinya Chalermsook, José Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, and Andreas Wiese. On Guillotine Cutting Sequences. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{abed_et_al:LIPIcs.APPROX-RANDOM.2015.1, author = {Abed, Fidaa and Chalermsook, Parinya and Correa, Jos\'{e} and Karrenbauer, Andreas and P\'{e}rez-Lantero, Pablo and Soto, Jos\'{e} A. and Wiese, Andreas}, title = {{On Guillotine Cutting Sequences}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {1--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.1}, URN = {urn:nbn:de:0030-drops-52917}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.1}, annote = {Keywords: Guillotine cuts, Rectangles, Squares, Independent Sets, Packing} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Pablo Barceló and Gaëlle Fontaine. On the Data Complexity of Consistent Query Answering over Graph Databases. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 380-397, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{barcelo_et_al:LIPIcs.ICDT.2015.380, author = {Barcel\'{o}, Pablo and Fontaine, Ga\"{e}lle}, title = {{On the Data Complexity of Consistent Query Answering over Graph Databases}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {380--397}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-79-8}, ISSN = {1868-8969}, year = {2015}, volume = {31}, editor = {Arenas, Marcelo and Ugarte, Mart{\'\i}n}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.380}, URN = {urn:nbn:de:0030-drops-49962}, doi = {10.4230/LIPIcs.ICDT.2015.380}, annote = {Keywords: graph databases, regular path queries, consistent query answering, description logics, rewrite systems} }
Published in: Dagstuhl Follow-Ups, Volume 4, Normative Multi-Agent Systems (2013)
Pablo Noriega, Amit K. Chopra, Nicoletta Fornara, Henrique Lopes Cardoso, and Munindar P. Singh. Regulated MAS: Social Perspective. In Normative Multi-Agent Systems. Dagstuhl Follow-Ups, Volume 4, pp. 93-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InCollection{noriega_et_al:DFU.Vol4.12111.93, author = {Noriega, Pablo and Chopra, Amit K. and Fornara, Nicoletta and Lopes Cardoso, Henrique and Singh, Munindar P.}, title = {{Regulated MAS: Social Perspective}}, booktitle = {Normative Multi-Agent Systems}, pages = {93--133}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-51-4}, ISSN = {1868-8977}, year = {2013}, volume = {4}, editor = {Andrighetto, Giulia and Governatori, Guido and Noriega, Pablo and van der Torre, Leendert W. N.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol4.12111.93}, URN = {urn:nbn:de:0030-drops-40017}, doi = {10.4230/DFU.Vol4.12111.93}, annote = {Keywords: NormMAS, Norms, Open Interaction} }
Published in: Dagstuhl Follow-Ups, Volume 4, Normative Multi-Agent Systems (2013)
Munindar P. Singh, Matthew Arrott, Tina Balke, Amit K. Chopra, Rob Christiaanse, Stephen Cranefield, Frank Dignum, Davide Eynard, Emilia Farcas, Nicoletta Fornara, Fabien Gandon, Guido Governatori, Hoa Khanh Dam, Joris Hulstijn, Ingolf Krueger, Ho-Pun Lam, Michael Meisinger, Pablo Noriega, Bastin Tony Roy Savarimuthu, Kartik Tadanki, Harko Verhagen, and Serena Villata. The Uses of Norms. In Normative Multi-Agent Systems. Dagstuhl Follow-Ups, Volume 4, pp. 191-229, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InCollection{singh_et_al:DFU.Vol4.12111.191, author = {Singh, Munindar P. and Arrott, Matthew and Balke, Tina and Chopra, Amit K. and Christiaanse, Rob and Cranefield, Stephen and Dignum, Frank and Eynard, Davide and Farcas, Emilia and Fornara, Nicoletta and Gandon, Fabien and Governatori, Guido and Khanh Dam, Hoa and Hulstijn, Joris and Krueger, Ingolf and Lam, Ho-Pun and Meisinger, Michael and Noriega, Pablo and Savarimuthu, Bastin Tony Roy and Tadanki, Kartik and Verhagen, Harko and Villata, Serena}, title = {{The Uses of Norms}}, booktitle = {Normative Multi-Agent Systems}, pages = {191--229}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-51-4}, ISSN = {1868-8977}, year = {2013}, volume = {4}, editor = {Andrighetto, Giulia and Governatori, Guido and Noriega, Pablo and van der Torre, Leendert W. N.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol4.12111.191}, URN = {urn:nbn:de:0030-drops-40047}, doi = {10.4230/DFU.Vol4.12111.191}, annote = {Keywords: Norms, MAS, Governance, Requirements engineering} }
Published in: Dagstuhl Seminar Proceedings, Volume 9121, Normative Multi-Agent Systems (2009)
Valerio Genovese, Dov M. Gabbay, Guido Boella, and Leendert van der Torre. FSL – Fibred Security Language. In Normative Multi-Agent Systems. Dagstuhl Seminar Proceedings, Volume 9121, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{genovese_et_al:DagSemProc.09121.16, author = {Genovese, Valerio and Gabbay, Dov M. and Boella, Guido and van der Torre, Leendert}, title = {{FSL – Fibred Security Language}}, booktitle = {Normative Multi-Agent Systems}, pages = {1--29}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9121}, editor = {Guido Boella and Pablo Noriega and Gabriella Pigozzi and Harko Verhagen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09121.16}, URN = {urn:nbn:de:0030-drops-19083}, doi = {10.4230/DagSemProc.09121.16}, annote = {Keywords: Access Control, Trust Management, Fibring Logics} }
Feedback for Dagstuhl Publishing