Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý. Fully-Scalable MPC Algorithms for Clustering in High Dimension. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 50:1-50:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{czumaj_et_al:LIPIcs.ICALP.2024.50, author = {Czumaj, Artur and Gao, Guichen and Jiang, Shaofeng H.-C. and Krauthgamer, Robert and Vesel\'{y}, Pavel}, title = {{Fully-Scalable MPC Algorithms for Clustering in High Dimension}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {50:1--50:20}, 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.50}, URN = {urn:nbn:de:0030-drops-201938}, doi = {10.4230/LIPIcs.ICALP.2024.50}, annote = {Keywords: Massively parallel computing, high dimension, facility location, k-median, k-means} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Austen Z. Fan, Paraschos Koutris, and Hangdong Zhao. The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 127:1-127:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fan_et_al:LIPIcs.ICALP.2023.127, author = {Fan, Austen Z. and Koutris, Paraschos and Zhao, Hangdong}, title = {{The Fine-Grained Complexity of Boolean Conjunctive Queries and Sum-Product Problems}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {127:1--127:20}, 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.127}, URN = {urn:nbn:de:0030-drops-181791}, doi = {10.4230/LIPIcs.ICALP.2023.127}, annote = {Keywords: Fine-grained complexity, conjunctive queries, semiring-oblivious reduction} }
Published in: LIPIcs, Volume 220, 25th International Conference on Database Theory (ICDT 2022)
Austen Z. Fan and Paraschos Koutris. Certifiable Robustness for Nearest Neighbor Classifiers. In 25th International Conference on Database Theory (ICDT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 220, pp. 6:1-6:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{fan_et_al:LIPIcs.ICDT.2022.6, author = {Fan, Austen Z. and Koutris, Paraschos}, title = {{Certifiable Robustness for Nearest Neighbor Classifiers}}, booktitle = {25th International Conference on Database Theory (ICDT 2022)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-223-5}, ISSN = {1868-8969}, year = {2022}, volume = {220}, editor = {Olteanu, Dan and Vortmeier, Nils}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2022.6}, URN = {urn:nbn:de:0030-drops-158809}, doi = {10.4230/LIPIcs.ICDT.2022.6}, annote = {Keywords: Inconsistent databases, k-NN classification, certifiable robustness} }
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)
Shaleen Deep, Xiao Hu, and Paraschos Koutris. Enumeration Algorithms for Conjunctive Queries with Projection. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{deep_et_al:LIPIcs.ICDT.2021.14, author = {Deep, Shaleen and Hu, Xiao and Koutris, Paraschos}, title = {{Enumeration Algorithms for Conjunctive Queries with Projection}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {14:1--14:17}, 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.14}, URN = {urn:nbn:de:0030-drops-137229}, doi = {10.4230/LIPIcs.ICDT.2021.14}, annote = {Keywords: Query result enumeration, joins, ranking} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Bruhathi Sundarmurthy, Paraschos Koutris, and Jeffrey Naughton. Locality-Aware Distribution Schemes. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 22:1-22:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{sundarmurthy_et_al:LIPIcs.ICDT.2021.22, author = {Sundarmurthy, Bruhathi and Koutris, Paraschos and Naughton, Jeffrey}, title = {{Locality-Aware Distribution Schemes}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {22:1--22:25}, 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.22}, URN = {urn:nbn:de:0030-drops-137302}, doi = {10.4230/LIPIcs.ICDT.2021.22}, annote = {Keywords: partitioning, parallel correctness, join queries} }
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.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 98, 21st International Conference on Database Theory (ICDT 2018)
Bas Ketsman, Aws Albarghouthi, and Paraschos Koutris. Distribution Policies for Datalog. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, pp. 17:1-17:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ketsman_et_al:LIPIcs.ICDT.2018.17, author = {Ketsman, Bas and Albarghouthi, Aws and Koutris, Paraschos}, title = {{Distribution Policies for Datalog}}, booktitle = {21st International Conference on Database Theory (ICDT 2018)}, pages = {17:1--17:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-063-7}, ISSN = {1868-8969}, year = {2018}, volume = {98}, editor = {Kimelfeld, Benny and Amsterdamer, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.17}, URN = {urn:nbn:de:0030-drops-86034}, doi = {10.4230/LIPIcs.ICDT.2018.17}, annote = {Keywords: Datalog queries, Distributed evaluation, Distribution policies} }
Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)
Shaleen Deep and Paraschos Koutris. The Design of Arbitrage-Free Data Pricing Schemes. In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{deep_et_al:LIPIcs.ICDT.2017.12, author = {Deep, Shaleen and Koutris, Paraschos}, title = {{The Design of Arbitrage-Free Data Pricing Schemes}}, booktitle = {20th International Conference on Database Theory (ICDT 2017)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-024-8}, ISSN = {1868-8969}, year = {2017}, volume = {68}, editor = {Benedikt, Michael and Orsi, Giorgio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.12}, URN = {urn:nbn:de:0030-drops-70574}, doi = {10.4230/LIPIcs.ICDT.2017.12}, annote = {Keywords: data pricing, determinacy, arbitrage} }
Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)
Bruhathi Sundarmurthy, Paraschos Koutris, Willis Lang, Jeffrey Naughton, and Val Tannen. m-tables: Representing Missing Data. In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 21:1-21:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{sundarmurthy_et_al:LIPIcs.ICDT.2017.21, author = {Sundarmurthy, Bruhathi and Koutris, Paraschos and Lang, Willis and Naughton, Jeffrey and Tannen, Val}, title = {{m-tables: Representing Missing Data}}, booktitle = {20th International Conference on Database Theory (ICDT 2017)}, pages = {21:1--21:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-024-8}, ISSN = {1868-8969}, year = {2017}, volume = {68}, editor = {Benedikt, Michael and Orsi, Giorgio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.21}, URN = {urn:nbn:de:0030-drops-70618}, doi = {10.4230/LIPIcs.ICDT.2017.21}, annote = {Keywords: missing values, incomplete data, c tables, representation systems} }
Published in: LIPIcs, Volume 48, 19th International Conference on Database Theory (ICDT 2016)
Paraschos Koutris, Paul Beame, and Dan Suciu. Worst-Case Optimal Algorithms for Parallel Query Processing. In 19th International Conference on Database Theory (ICDT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 48, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{koutris_et_al:LIPIcs.ICDT.2016.8, author = {Koutris, Paraschos and Beame, Paul and Suciu, Dan}, title = {{Worst-Case Optimal Algorithms for Parallel Query Processing}}, booktitle = {19th International Conference on Database Theory (ICDT 2016)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-002-6}, ISSN = {1868-8969}, year = {2016}, volume = {48}, editor = {Martens, Wim and Zeume, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2016.8}, URN = {urn:nbn:de:0030-drops-57771}, doi = {10.4230/LIPIcs.ICDT.2016.8}, annote = {Keywords: conjunctive query, parallel computation, worst-case bounds} }
Published in: LIPIcs, Volume 31, 18th International Conference on Database Theory (ICDT 2015)
Paraschos Koutris, Tova Milo, Sudeepa Roy, and Dan Suciu. Answering Conjunctive Queries with Inequalities. In 18th International Conference on Database Theory (ICDT 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 31, pp. 76-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{koutris_et_al:LIPIcs.ICDT.2015.76, author = {Koutris, Paraschos and Milo, Tova and Roy, Sudeepa and Suciu, Dan}, title = {{Answering Conjunctive Queries with Inequalities}}, booktitle = {18th International Conference on Database Theory (ICDT 2015)}, pages = {76--93}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2015.76}, URN = {urn:nbn:de:0030-drops-49781}, doi = {10.4230/LIPIcs.ICDT.2015.76}, annote = {Keywords: query evaluation, conjunctive query, inequality, treewidth} }
Feedback for Dagstuhl Publishing