LIPIcs, Volume 186
ICDT 2021, March 23-26, 2021, Nicosia, Cyprus
Editors: Ke Yi and Zhewei Wei
Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)
Patrick Dinklage, Johnnes Fischer, and Nicola Prezza. Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 9:1-9:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dinklage_et_al:LIPIcs.SEA.2024.9, author = {Dinklage, Patrick and Fischer, Johnnes and Prezza, Nicola}, title = {{Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression}}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, pages = {9:1--9:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-325-6}, ISSN = {1868-8969}, year = {2024}, volume = {301}, editor = {Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.9}, URN = {urn:nbn:de:0030-drops-203748}, doi = {10.4230/LIPIcs.SEA.2024.9}, annote = {Keywords: compression, streaming, heavy hitters, algorithm engineering} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak, and Piotr Sankowski. Dynamic PageRank: Algorithms and Lower Bounds. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 90:1-90:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{jayaram_et_al:LIPIcs.ICALP.2024.90, author = {Jayaram, Rajesh and {\L}\k{a}cki, Jakub and Mitrovi\'{c}, Slobodan and Onak, Krzysztof and Sankowski, Piotr}, title = {{Dynamic PageRank: Algorithms and Lower Bounds}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {90:1--90:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.90}, URN = {urn:nbn:de:0030-drops-202336}, doi = {10.4230/LIPIcs.ICALP.2024.90}, annote = {Keywords: PageRank, dynamic algorithms, graph algorithms} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Benjamin Scheidt. On Homomorphism Indistinguishability and Hypertree Depth. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 152:1-152:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{scheidt:LIPIcs.ICALP.2024.152, author = {Scheidt, Benjamin}, title = {{On Homomorphism Indistinguishability and Hypertree Depth}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {152:1--152:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.152}, URN = {urn:nbn:de:0030-drops-202958}, doi = {10.4230/LIPIcs.ICALP.2024.152}, annote = {Keywords: homomorphism indistinguishability, counting logics, guarded logics, hypergraphs, incidence graphs, tree depth, elimination forest, hypertree width} }
Published in: LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024)
Zhewei Wei, Ji-Rong Wen, and Mingji Yang. Approximating Single-Source Personalized PageRank with Absolute Error Guarantees. In 27th International Conference on Database Theory (ICDT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 290, pp. 9:1-9:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wei_et_al:LIPIcs.ICDT.2024.9, author = {Wei, Zhewei and Wen, Ji-Rong and Yang, Mingji}, title = {{Approximating Single-Source Personalized PageRank with Absolute Error Guarantees}}, booktitle = {27th International Conference on Database Theory (ICDT 2024)}, pages = {9:1--9: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.9}, URN = {urn:nbn:de:0030-drops-197911}, doi = {10.4230/LIPIcs.ICDT.2024.9}, annote = {Keywords: Graph Algorithms, Sublinear Algorithms, Personalized PageRank} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Peyman Afshani, Pingan Cheng, Aniket Basu Roy, and Zhewei Wei. On Range Summary Queries. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{afshani_et_al:LIPIcs.ICALP.2023.7, author = {Afshani, Peyman and Cheng, Pingan and Basu Roy, Aniket and Wei, Zhewei}, title = {{On Range Summary Queries}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.7}, URN = {urn:nbn:de:0030-drops-180590}, doi = {10.4230/LIPIcs.ICALP.2023.7}, annote = {Keywords: Computational Geometry, Range Searching, Random Sampling, Geometric Approximation, Data Structures and Algorithms} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 1-438, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{yi_et_al:LIPIcs.ICDT.2021, title = {{LIPIcs, Volume 186, ICDT 2021, Complete Volume}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {1--438}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021}, URN = {urn:nbn:de:0030-drops-137076}, doi = {10.4230/LIPIcs.ICDT.2021}, annote = {Keywords: LIPIcs, Volume 186, ICDT 2021, Complete Volume} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{yi_et_al:LIPIcs.ICDT.2021.0, author = {Yi, Ke and Wei, Zhewei}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {0:i--0:xvi}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.0}, URN = {urn:nbn:de:0030-drops-137086}, doi = {10.4230/LIPIcs.ICDT.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
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.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 186, 24th International Conference on Database Theory (ICDT 2021)
Julia Stoyanovich. Comparing Apples and Oranges: Fairness and Diversity in Ranking (Invited Talk). In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{stoyanovich:LIPIcs.ICDT.2021.2, author = {Stoyanovich, Julia}, title = {{Comparing Apples and Oranges: Fairness and Diversity in Ranking}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {2:1--2: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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.2}, URN = {urn:nbn:de:0030-drops-137104}, doi = {10.4230/LIPIcs.ICDT.2021.2}, annote = {Keywords: fairness, diversity, ranking, set selection, responsible data management} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Kaleb Alway, Eric Blais, and Semih Salihoglu. Box Covers and Domain Orderings for Beyond Worst-Case Join Processing. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 3:1-3:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{alway_et_al:LIPIcs.ICDT.2021.3, author = {Alway, Kaleb and Blais, Eric and Salihoglu, Semih}, title = {{Box Covers and Domain Orderings for Beyond Worst-Case Join Processing}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {3:1--3:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.3}, URN = {urn:nbn:de:0030-drops-137114}, doi = {10.4230/LIPIcs.ICDT.2021.3}, annote = {Keywords: Beyond worst-case join algorithms, Tetris, Box covers, Domain orderings} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Markus L. Schmid and Nicole Schweikardt. A Purely Regular Approach to Non-Regular Core Spanners. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{schmid_et_al:LIPIcs.ICDT.2021.4, author = {Schmid, Markus L. and Schweikardt, Nicole}, title = {{A Purely Regular Approach to Non-Regular Core Spanners}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {4:1--4:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.4}, URN = {urn:nbn:de:0030-drops-137124}, doi = {10.4230/LIPIcs.ICDT.2021.4}, annote = {Keywords: Document spanners, regular expressions with backreferences} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Shaleen Deep and Paraschos Koutris. Ranked Enumeration of Conjunctive Query Results. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deep_et_al:LIPIcs.ICDT.2021.5, author = {Deep, Shaleen and Koutris, Paraschos}, title = {{Ranked Enumeration of Conjunctive Query Results}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {5:1--5:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.5}, URN = {urn:nbn:de:0030-drops-137139}, doi = {10.4230/LIPIcs.ICDT.2021.5}, annote = {Keywords: Query result enumeration, joins, ranking} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Shangqi Lu and Yufei Tao. Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lu_et_al:LIPIcs.ICDT.2021.6, author = {Lu, Shangqi and Tao, Yufei}, title = {{Towards Optimal Dynamic Indexes for Approximate (and Exact) Triangle Counting}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {6:1--6:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.6}, URN = {urn:nbn:de:0030-drops-137146}, doi = {10.4230/LIPIcs.ICDT.2021.6}, annote = {Keywords: Triangle Counting, Data Structures, Lower Bounds, Graph Algorithms} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Liat Peterfreund. Grammars for Document Spanners. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{peterfreund:LIPIcs.ICDT.2021.7, author = {Peterfreund, Liat}, title = {{Grammars for Document Spanners}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {7:1--7:18}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.7}, URN = {urn:nbn:de:0030-drops-137154}, doi = {10.4230/LIPIcs.ICDT.2021.7}, annote = {Keywords: Information Extraction, Document Spanners, Context-Free Grammars, Constant-Delay Enumeration, Regular Expressions, Pushdown Automata} }