LIPIcs, Volume 148
IPEC 2019, September 11-13, 2019, Munich, Germany
Editors: Bart M. P. Jansen and Jan Arne Telle
LIPIcs, Volume 116
APPROX/RANDOM 2018, August 20-22, 2018, Princeton, NJ, USA
Editors: Eric Blais, Klaus Jansen, José D. P. Rolim, and David Steurer
LIPIcs, Volume 81
APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA
Editors: Klaus Jansen, José D. P. Rolim, David P. Williamson, and Santosh S. Vempala
LIPIcs, Volume 60
APPROX/RANDOM 2016, September 7-9, 2016, Paris, France
Editors: Klaus Jansen, Claire Mathieu, José D. P. Rolim, and Chris Umans
LIPIcs, Volume 40
APPROX/RANDOM 2015, August 24-26, 2015, Princeton, USA
Editors: Naveen Garg, Klaus Jansen, Anup Rao, and José D. P. Rolim
Published in: Dagstuhl Reports, Volume 13, Issue 9 (2024)
Nathanaël Fijalkow, Bernd Finkbeiner, Guillermo A. Pérez, Elizabeth Polgreen, and Rémi Morvan. The Futures of Reactive Synthesis (Dagstuhl Seminar 23391). In Dagstuhl Reports, Volume 13, Issue 9, pp. 166-184, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{fijalkow_et_al:DagRep.13.9.166, author = {Fijalkow, Nathana\"{e}l and Finkbeiner, Bernd and P\'{e}rez, Guillermo A. and Polgreen, Elizabeth and Morvan, R\'{e}mi}, title = {{The Futures of Reactive Synthesis (Dagstuhl Seminar 23391)}}, pages = {166--184}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {9}, editor = {Fijalkow, Nathana\"{e}l and Finkbeiner, Bernd and P\'{e}rez, Guillermo A. and Polgreen, Elizabeth and Morvan, R\'{e}mi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.9.166}, URN = {urn:nbn:de:0030-drops-198259}, doi = {10.4230/DagRep.13.9.166}, annote = {Keywords: program synthesis, program verification, reactive synthesis, temporal synthesis} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Andreas Pieris. Rule-Based Ontologies: From Semantics to Syntax (Invited Talk). In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{pieris:LIPIcs.ICDT.2024.3, author = {Pieris, Andreas}, title = {{Rule-Based Ontologies: From Semantics to Syntax}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.3}, URN = {urn:nbn:de:0030-drops-197857}, doi = {10.4230/LIPIcs.ICDT.2024.3}, annote = {Keywords: ontologies, tuple-generating dependencies, equality-generating dependencies, model theory, model-theoretic characterizations} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Sanjay Krishnan and Stavros Sintos. Range Entropy Queries and Partitioning. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{krishnan_et_al:LIPIcs.ICDT.2024.6, author = {Krishnan, Sanjay and Sintos, Stavros}, title = {{Range Entropy Queries and Partitioning}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {6:1--6:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.6}, URN = {urn:nbn:de:0030-drops-197883}, doi = {10.4230/LIPIcs.ICDT.2024.6}, annote = {Keywords: Shannon entropy, range query, data structure, data partitioning} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Sungjin Im, Benjamin Moseley, Hung Ngo, and Kirk Pruhs. On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{im_et_al:LIPIcs.ICDT.2024.11, author = {Im, Sungjin and Moseley, Benjamin and Ngo, Hung and Pruhs, Kirk}, title = {{On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.11}, URN = {urn:nbn:de:0030-drops-197939}, doi = {10.4230/LIPIcs.ICDT.2024.11}, annote = {Keywords: Datalog, convergence rate, semiring} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Florent Capelli and Oliver Irwin. Direct Access for Conjunctive Queries with Negations. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{capelli_et_al:LIPIcs.ICDT.2024.13, author = {Capelli, Florent and Irwin, Oliver}, title = {{Direct Access for Conjunctive Queries with Negations}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {13:1--13:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.13}, URN = {urn:nbn:de:0030-drops-197958}, doi = {10.4230/LIPIcs.ICDT.2024.13}, annote = {Keywords: Conjunctive queries, factorized databases, direct access, hypertree decomposition} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Sylvain Salvati and Sophie Tison. Containment of Regular Path Queries Under Path Constraints. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 17:1-17:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{salvati_et_al:LIPIcs.ICDT.2024.17, author = {Salvati, Sylvain and Tison, Sophie}, title = {{Containment of Regular Path Queries Under Path Constraints}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {17:1--17:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.17}, URN = {urn:nbn:de:0030-drops-197994}, doi = {10.4230/LIPIcs.ICDT.2024.17}, annote = {Keywords: Graph databases, rational path queries, query containment, TGDs, word constraints, rewrite systems, finite controllability, decision problems} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Pankaj K. Agarwal, Rahul Raychaudhury, Stavros Sintos, and Jun Yang. Computing Data Distribution from Query Selectivities. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 18:1-18:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{agarwal_et_al:LIPIcs.ICDT.2024.18, author = {Agarwal, Pankaj K. and Raychaudhury, Rahul and Sintos, Stavros and Yang, Jun}, title = {{Computing Data Distribution from Query Selectivities}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {18:1--18:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.18}, URN = {urn:nbn:de:0030-drops-198007}, doi = {10.4230/LIPIcs.ICDT.2024.18}, annote = {Keywords: selectivity queries, discrete distributions, Multiplicative Weights Update, eps-approximation, learnable functions, depth problem, arrangement} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Ru Wang and Yufei Tao. Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wang_et_al:LIPIcs.ICDT.2024.23, author = {Wang, Ru and Tao, Yufei}, title = {{Join Sampling Under Acyclic Degree Constraints and (Cyclic) Subgraph Sampling}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {23:1--23:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.23}, URN = {urn:nbn:de:0030-drops-198054}, doi = {10.4230/LIPIcs.ICDT.2024.23}, annote = {Keywords: Join Sampling, Subgraph Sampling, Degree Constraints, Polymatroid Bounds} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Xiao Hu and Stavros Sintos. Finding Smallest Witnesses for Conjunctive Queries. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{hu_et_al:LIPIcs.ICDT.2024.24, author = {Hu, Xiao and Sintos, Stavros}, title = {{Finding Smallest Witnesses for Conjunctive Queries}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-312-6}, ISSN = {1868-8969}, year = {2024}, volume = {290}, editor = {Cormode, Graham and Shekelyan, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.24}, URN = {urn:nbn:de:0030-drops-198066}, doi = {10.4230/LIPIcs.ICDT.2024.24}, annote = {Keywords: conjunctive query, smallest witness, head-cluster, head-domination} }
Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
Igor C. Oliveira. Polynomial-Time Pseudodeterministic Constructions (Invited Talk). In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{oliveira:LIPIcs.STACS.2024.1, author = {Oliveira, Igor C.}, title = {{Polynomial-Time Pseudodeterministic Constructions}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-311-9}, ISSN = {1868-8969}, year = {2024}, volume = {289}, editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.1}, URN = {urn:nbn:de:0030-drops-197112}, doi = {10.4230/LIPIcs.STACS.2024.1}, annote = {Keywords: Pseudorandomness, Explicit Constructions, Pseudodeterministic Algorithms} }
Feedback for Dagstuhl Publishing