Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, and Peter Strulo. Decremental Sensitivity Oracles for Covering and Packing Minors. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 44:1-44:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kanesh_et_al:LIPIcs.STACS.2024.44, author = {Kanesh, Lawqueen and Panolan, Fahad and Ramanujan, M. S. and Strulo, Peter}, title = {{Decremental Sensitivity Oracles for Covering and Packing Minors}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {44:1--44:19}, 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.44}, URN = {urn:nbn:de:0030-drops-197544}, doi = {10.4230/LIPIcs.STACS.2024.44}, annote = {Keywords: Sensitivity oracles, Data Structures, FPT algorithms} }
Published in: Dagstuhl Reports, Volume 13, Issue 7 (2024)
Arie Gurfinkel, Isabella Mastroeni, Antoine Miné, Peter Müller, and Anna Becchi. Theoretical Advances and Emerging Applications in Abstract Interpretation (Dagstuhl Seminar 23281). In Dagstuhl Reports, Volume 13, Issue 7, pp. 66-95, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{gurfinkel_et_al:DagRep.13.7.66, author = {Gurfinkel, Arie and Mastroeni, Isabella and Min\'{e}, Antoine and M\"{u}ller, Peter and Becchi, Anna}, title = {{Theoretical Advances and Emerging Applications in Abstract Interpretation (Dagstuhl Seminar 23281)}}, pages = {66--95}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {7}, editor = {Gurfinkel, Arie and Mastroeni, Isabella and Min\'{e}, Antoine and M\"{u}ller, Peter and Becchi, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.66}, URN = {urn:nbn:de:0030-drops-197759}, doi = {10.4230/DagRep.13.7.66}, annote = {Keywords: abstract domains, abstract interpretation, program semantics, program verification, static program analysis} }
Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. The Message Complexity of Distributed Graph Optimization. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 41:1-41:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2024.41, author = {Dufoulon, Fabien and Pai, Shreyas and Pandurangan, Gopal and Pemmaraju, Sriram V. and Robinson, Peter}, title = {{The Message Complexity of Distributed Graph Optimization}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {41:1--41:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41}, URN = {urn:nbn:de:0030-drops-195690}, doi = {10.4230/LIPIcs.ITCS.2024.41}, annote = {Keywords: Distributed graph algorithm, message complexity, distributed approximation} }
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, and Roohani Sharma. Parameterized Complexity Classification for Interval Constraints. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dabrowski_et_al:LIPIcs.IPEC.2023.11, author = {Dabrowski, Konrad K. and Jonsson, Peter and Ordyniak, Sebastian and Osipov, George and Pilipczuk, Marcin and Sharma, Roohani}, title = {{Parameterized Complexity Classification for Interval Constraints}}, booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-305-8}, ISSN = {1868-8969}, year = {2023}, volume = {285}, editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.11}, URN = {urn:nbn:de:0030-drops-194306}, doi = {10.4230/LIPIcs.IPEC.2023.11}, annote = {Keywords: (minimum) constraint satisfaction problem, Allen’s interval algebra, parameterized complexity, cut problems} }
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Ben Jourdan, Peter Macgregor, and He Sun. Is the Algorithmic Kadison-Singer Problem Hard?. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 43:1-43:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{jourdan_et_al:LIPIcs.ISAAC.2023.43, author = {Jourdan, Ben and Macgregor, Peter and Sun, He}, title = {{Is the Algorithmic Kadison-Singer Problem Hard?}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {43:1--43:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.43}, URN = {urn:nbn:de:0030-drops-193457}, doi = {10.4230/LIPIcs.ISAAC.2023.43}, annote = {Keywords: Kadison-Singer problem, spectral sparsification} }
Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Jia Wang, Itohan Osayande, Peter M. Macharia, Prestige Tatenda Makanga, Kerry L. M. Wong, Tope Olubodun, Uchenna Gwacham-Anisiobi, Olakunmi Ogunyemi, Abimbola Olaniran, Ibukun-Oluwa O. Abejirinde, Lenka Beňová, Bosede B. Afolabi, and Aduragbemi Banke-Thomas. Application of GIS in Public Health Practice: A Consortium’s Approach to Tackling Travel Delays in Obstetric Emergencies in Urban Areas (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 79:1-79:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{wang_et_al:LIPIcs.GIScience.2023.79, author = {Wang, Jia and Osayande, Itohan and Macharia, Peter M. and Makanga, Prestige Tatenda and Wong, Kerry L. M. and Olubodun, Tope and Gwacham-Anisiobi, Uchenna and Ogunyemi, Olakunmi and Olaniran, Abimbola and Abejirinde, Ibukun-Oluwa O. and Be\v{n}ov\'{a}, Lenka and Afolabi, Bosede B. and Banke-Thomas, Aduragbemi}, title = {{Application of GIS in Public Health Practice: A Consortium’s Approach to Tackling Travel Delays in Obstetric Emergencies in Urban Areas}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {79:1--79:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-288-4}, ISSN = {1868-8969}, year = {2023}, volume = {277}, editor = {Beecham, Roger and Long, Jed A. and Smith, Dianna and Zhao, Qunshan and Wise, Sarah}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2023.79}, URN = {urn:nbn:de:0030-drops-189748}, doi = {10.4230/LIPIcs.GIScience.2023.79}, annote = {Keywords: GIS, Public Health, Accessibility, OnTIME, EmOC, Public Participation GIS, Big Data, Google} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Joakim Blikstad and Peter Kiss. Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 22:1-22:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{blikstad_et_al:LIPIcs.ESA.2023.22, author = {Blikstad, Joakim and Kiss, Peter}, title = {{Incremental (1-\epsilon)-Approximate Dynamic Matching in O(poly(1/\epsilon)) Update Time}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {22:1--22:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.22}, URN = {urn:nbn:de:0030-drops-186756}, doi = {10.4230/LIPIcs.ESA.2023.22}, annote = {Keywords: Bipartite Matching, Incremental Matching, Dynamic Algorithms, Approximation Algorithms, EDCS} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Demian Hespe, Peter Sanders, Sabine Storandt, and Carina Truschel. Pareto Sums of Pareto Sets. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 60:1-60:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{hespe_et_al:LIPIcs.ESA.2023.60, author = {Hespe, Demian and Sanders, Peter and Storandt, Sabine and Truschel, Carina}, title = {{Pareto Sums of Pareto Sets}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {60:1--60:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.60}, URN = {urn:nbn:de:0030-drops-187132}, doi = {10.4230/LIPIcs.ESA.2023.60}, annote = {Keywords: Minkowski sum, Skyline, Successive Algorithm} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz, Tim A. Hartmann, Petr Hliněný, Jan Kratochvíl, Tomasz Krawczyk, and Peter Zeman. Recognizing H-Graphs - Beyond Circular-Arc Graphs. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{agaoglucagirici_et_al:LIPIcs.MFCS.2023.8, author = {A\u{g}ao\u{g}lu \c{C}a\u{g}{\i}r{\i}c{\i}, Deniz and \c{C}a\u{g}{\i}r{\i}c{\i}, Onur and Derbisz, Jan and Hartmann, Tim A. and Hlin\v{e}n\'{y}, Petr and Kratochv{\'\i}l, Jan and Krawczyk, Tomasz and Zeman, Peter}, title = {{Recognizing H-Graphs - Beyond Circular-Arc Graphs}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-292-1}, ISSN = {1868-8969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.8}, URN = {urn:nbn:de:0030-drops-185420}, doi = {10.4230/LIPIcs.MFCS.2023.8}, annote = {Keywords: H-graphs, Intersection Graphs, Helly Property} }
Published in: LIPIcs, Volume 269, 28th International Conference on Types for Proofs and Programs (TYPES 2022)
Max Zeuner and Anders Mörtberg. A Univalent Formalization of Constructive Affine Schemes. In 28th International Conference on Types for Proofs and Programs (TYPES 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 269, pp. 14:1-14:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{zeuner_et_al:LIPIcs.TYPES.2022.14, author = {Zeuner, Max and M\"{o}rtberg, Anders}, title = {{A Univalent Formalization of Constructive Affine Schemes}}, booktitle = {28th International Conference on Types for Proofs and Programs (TYPES 2022)}, pages = {14:1--14:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-285-3}, ISSN = {1868-8969}, year = {2023}, volume = {269}, editor = {Kesner, Delia and P\'{e}drot, Pierre-Marie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2022.14}, URN = {urn:nbn:de:0030-drops-184574}, doi = {10.4230/LIPIcs.TYPES.2022.14}, annote = {Keywords: Affine Schemes, Homotopy Type Theory and Univalent Foundations, Cubical Agda, Constructive Mathematics} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Anders Aamand, Adam Karczmarz, Jakub Łącki, Nikos Parotsidis, Peter M. R. Rasmussen, and Mikkel Thorup. Optimal Decremental Connectivity in Non-Sparse Graphs. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{aamand_et_al:LIPIcs.ICALP.2023.6, author = {Aamand, Anders and Karczmarz, Adam and {\L}\k{a}cki, Jakub and Parotsidis, Nikos and Rasmussen, Peter M. R. and Thorup, Mikkel}, title = {{Optimal Decremental Connectivity in Non-Sparse Graphs}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {6:1--6: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.6}, URN = {urn:nbn:de:0030-drops-180581}, doi = {10.4230/LIPIcs.ICALP.2023.6}, annote = {Keywords: decremental connectivity, dynamic connectivity} }
Published in: OASIcs, Volume 109, Eelco Visser Commemorative Symposium (EVCS 2023)
Danny M. Groenewegen, Elmer van Chastelet, Max M. de Krieger, Daniel A. A. Pelsmaeker, and Craig Anslow. Conf Researchr: A Domain-Specific Content Management System for Managing Large Conference Websites. In Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), Volume 109, pp. 12:1-12:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{groenewegen_et_al:OASIcs.EVCS.2023.12, author = {Groenewegen, Danny M. and van Chastelet, Elmer and de Krieger, Max M. and Pelsmaeker, Daniel A. A. and Anslow, Craig}, title = {{Conf Researchr: A Domain-Specific Content Management System for Managing Large Conference Websites}}, booktitle = {Eelco Visser Commemorative Symposium (EVCS 2023)}, pages = {12:1--12:6}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-267-9}, ISSN = {2190-6807}, year = {2023}, volume = {109}, editor = {L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.EVCS.2023.12}, URN = {urn:nbn:de:0030-drops-177823}, doi = {10.4230/OASIcs.EVCS.2023.12}, annote = {Keywords: Conf Researchr, conferences, WebDSL, Eelco Visser} }
Published in: OASIcs, Volume 109, Eelco Visser Commemorative Symposium (EVCS 2023)
Danny M. Groenewegen, Elmer van Chastelet, Max M. de Krieger, and Daniel A. A. Pelsmaeker. Eating Your Own Dog Food: WebDSL Case Studies to Improve Academic Workflows. In Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), Volume 109, pp. 13:1-13:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{groenewegen_et_al:OASIcs.EVCS.2023.13, author = {Groenewegen, Danny M. and van Chastelet, Elmer and de Krieger, Max M. and Pelsmaeker, Daniel A. A.}, title = {{Eating Your Own Dog Food: WebDSL Case Studies to Improve Academic Workflows}}, booktitle = {Eelco Visser Commemorative Symposium (EVCS 2023)}, pages = {13:1--13:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-267-9}, ISSN = {2190-6807}, year = {2023}, volume = {109}, editor = {L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.EVCS.2023.13}, URN = {urn:nbn:de:0030-drops-177838}, doi = {10.4230/OASIcs.EVCS.2023.13}, annote = {Keywords: WebDSL, WebLab, Spoofax, Eelco Visser, education} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Miriam Münch, Ignaz Rutter, and Peter Stumpf. Partial and Simultaneous Transitive Orientations via Modular Decompositions. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 51:1-51:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{munch_et_al:LIPIcs.ISAAC.2022.51, author = {M\"{u}nch, Miriam and Rutter, Ignaz and Stumpf, Peter}, title = {{Partial and Simultaneous Transitive Orientations via Modular Decompositions}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {51:1--51:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.51}, URN = {urn:nbn:de:0030-drops-173369}, doi = {10.4230/LIPIcs.ISAAC.2022.51}, annote = {Keywords: representation extension, simultaneous representation, comparability graph, permutation graph, circular permutation graph, modular decomposition} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Peter Mörters, Christian Sohler, and Stefan Walzer. A Sublinear Local Access Implementation for the Chinese Restaurant Process. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{morters_et_al:LIPIcs.APPROX/RANDOM.2022.28, author = {M\"{o}rters, Peter and Sohler, Christian and Walzer, Stefan}, title = {{A Sublinear Local Access Implementation for the Chinese Restaurant Process}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {28:1--28:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, 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.2022.28}, URN = {urn:nbn:de:0030-drops-171500}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.28}, annote = {Keywords: Chinese restaurant process, Dirichlet process, sublinear time algorithm, random recursive tree, random permutation, random partition, Ewens distribution, simulation, local access implementation, continuous time embedding} }
Feedback for Dagstuhl Publishing