Published in: Dagstuhl Reports, Volume 13, Issue 7 (2024)
Armando Castañeda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, and Ulrich Schmid. Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). In Dagstuhl Reports, Volume 13, Issue 7, pp. 34-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{castaneda_et_al:DagRep.13.7.34, author = {Casta\~{n}eda, Armando and van Ditmarsch, Hans and Kuznets, Roman and Moses, Yoram and Schmid, Ulrich}, title = {{Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272)}}, pages = {34--65}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {7}, editor = {Casta\~{n}eda, Armando and van Ditmarsch, Hans and Kuznets, Roman and Moses, Yoram and Schmid, Ulrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.34}, URN = {urn:nbn:de:0030-drops-197742}, doi = {10.4230/DagRep.13.7.34}, annote = {Keywords: combinatorial topology, distributed systems, epistemic logic, multi-agent systems, interpreted systems, dynamic epistemic logic, simplicial semantics, knowledge-based approach, distributed computing} }
Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
Matt Earnshaw, James Hefford, and Mario Román. The Produoidal Algebra of Process Decomposition. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 25:1-25:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{earnshaw_et_al:LIPIcs.CSL.2024.25, author = {Earnshaw, Matt and Hefford, James and Rom\'{a}n, Mario}, title = {{The Produoidal Algebra of Process Decomposition}}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)}, pages = {25:1--25:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-310-2}, ISSN = {1868-8969}, year = {2024}, volume = {288}, editor = {Murano, Aniello and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.25}, URN = {urn:nbn:de:0030-drops-196688}, doi = {10.4230/LIPIcs.CSL.2024.25}, annote = {Keywords: monoidal categories, profunctors, lenses, duoidal categories} }
Published in: LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)
Éric Goubault, Roman Kniazev, and Jérémy Ledent. A Many-Sorted Epistemic Logic for Chromatic Hypergraphs. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 30:1-30:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{goubault_et_al:LIPIcs.CSL.2024.30, author = {Goubault, \'{E}ric and Kniazev, Roman and Ledent, J\'{e}r\'{e}my}, title = {{A Many-Sorted Epistemic Logic for Chromatic Hypergraphs}}, booktitle = {32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)}, pages = {30:1--30:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-310-2}, ISSN = {1868-8969}, year = {2024}, volume = {288}, editor = {Murano, Aniello and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.30}, URN = {urn:nbn:de:0030-drops-196730}, doi = {10.4230/LIPIcs.CSL.2024.30}, annote = {Keywords: Modal logics, epistemic logics, multi-agent systems, hypergraphs} }
Published in: LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023)
Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafael Pinot, and Sasha Voitovych. On the Inherent Anonymity of Gossiping. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 24:1-24:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{guerraoui_et_al:LIPIcs.DISC.2023.24, author = {Guerraoui, Rachid and Kermarrec, Anne-Marie and Kucherenko, Anastasiia and Pinot, Rafael and Voitovych, Sasha}, title = {{On the Inherent Anonymity of Gossiping}}, booktitle = {37th International Symposium on Distributed Computing (DISC 2023)}, pages = {24:1--24:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-301-0}, ISSN = {1868-8969}, year = {2023}, volume = {281}, editor = {Oshman, Rotem}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.24}, URN = {urn:nbn:de:0030-drops-191504}, doi = {10.4230/LIPIcs.DISC.2023.24}, annote = {Keywords: Gossip protocol, Source anonymity, Differential privacy} }
Published in: LIPIcs, Volume 277, 12th International Conference on Geographic Information Science (GIScience 2023)
Cheng Fu, Zhiyong Zhou, Jan Winkler, Nicolas Beglinger, and Robert Weibel. Progress in Constructing an Open Map Generalization Data Set for Deep Learning (Short Paper). In 12th International Conference on Geographic Information Science (GIScience 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 277, pp. 30:1-30:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{fu_et_al:LIPIcs.GIScience.2023.30, author = {Fu, Cheng and Zhou, Zhiyong and Winkler, Jan and Beglinger, Nicolas and Weibel, Robert}, title = {{Progress in Constructing an Open Map Generalization Data Set for Deep Learning}}, booktitle = {12th International Conference on Geographic Information Science (GIScience 2023)}, pages = {30:1--30: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.30}, URN = {urn:nbn:de:0030-drops-189257}, doi = {10.4230/LIPIcs.GIScience.2023.30}, annote = {Keywords: open data, deep learning, map generalization} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Faisal N. Abu-Khzam, Henning Fernau, and Kevin Mann. Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{abukhzam_et_al:LIPIcs.MFCS.2023.6, author = {Abu-Khzam, Faisal N. and Fernau, Henning and Mann, Kevin}, title = {{Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {6:1--6:15}, 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.6}, URN = {urn:nbn:de:0030-drops-185400}, doi = {10.4230/LIPIcs.MFCS.2023.6}, annote = {Keywords: special graph classes, counting problems, enumeration problems, domination problems, Roman domination} }
Published in: LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
Matthew Earnshaw and Paweł Sobociński. String Diagrammatic Trace Theory. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 43:1-43:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{earnshaw_et_al:LIPIcs.MFCS.2023.43, author = {Earnshaw, Matthew and Soboci\'{n}ski, Pawe{\l}}, title = {{String Diagrammatic Trace Theory}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {43:1--43:15}, 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.43}, URN = {urn:nbn:de:0030-drops-185770}, doi = {10.4230/LIPIcs.MFCS.2023.43}, annote = {Keywords: symmetric monoidal categories, Mazurkiewicz traces, asynchronous automata} }
Published in: OASIcs, Volume 110, 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)
Amit Chaudhary, Roman Kozhan, and Ganesh Viswanath-Natraj. Interest Rate Rules in Decentralized Finance: Evidence from Compound. In 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022). Open Access Series in Informatics (OASIcs), Volume 110, pp. 5:1-5:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chaudhary_et_al:OASIcs.Tokenomics.2022.5, author = {Chaudhary, Amit and Kozhan, Roman and Viswanath-Natraj, Ganesh}, title = {{Interest Rate Rules in Decentralized Finance: Evidence from Compound}}, booktitle = {4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)}, pages = {5:1--5:6}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-274-7}, ISSN = {2190-6807}, year = {2023}, volume = {110}, editor = {Amoussou-Guenou, Yackolley and Kiayias, Aggelos and Verdier, Marianne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2022.5}, URN = {urn:nbn:de:0030-drops-184226}, doi = {10.4230/OASIcs.Tokenomics.2022.5}, annote = {Keywords: Cryptocurrency, decentralized finance lending protocols, monetary policy, stablecoins, governance token} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, and David Schindl. Locally Checkable Problems Parameterized by Clique-Width. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{baghirova_et_al:LIPIcs.ISAAC.2022.31, author = {Baghirova, Narmina and Gonzalez, Carolina Luc{\'\i}a and Ries, Bernard and Schindl, David}, title = {{Locally Checkable Problems Parameterized by Clique-Width}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {31:1--31:20}, 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.31}, URN = {urn:nbn:de:0030-drops-173167}, doi = {10.4230/LIPIcs.ISAAC.2022.31}, annote = {Keywords: locally checkable problem, clique-width, dynamic programming, coloring} }
Published in: OASIcs, Volume 97, 3rd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2021)
Roman Kozhan and Ganesh Viswanath-Natraj. Fundamentals of the MakerDAO Governance Token. In 3rd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2021). Open Access Series in Informatics (OASIcs), Volume 97, pp. 11:1-11:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kozhan_et_al:OASIcs.Tokenomics.2021.11, author = {Kozhan, Roman and Viswanath-Natraj, Ganesh}, title = {{Fundamentals of the MakerDAO Governance Token}}, booktitle = {3rd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2021)}, pages = {11:1--11:5}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-220-4}, ISSN = {2190-6807}, year = {2022}, volume = {97}, editor = {Gramoli, Vincent and Halaburda, Hanna and Pass, Rafael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2021.11}, URN = {urn:nbn:de:0030-drops-159082}, doi = {10.4230/OASIcs.Tokenomics.2021.11}, annote = {Keywords: Cryptocurrency, monetary policy, stablecoins, governance token} }
Published in: LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021)
Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, and Maximilian Sonneborn. PACE Solver Description: PACA-JAVA. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 30:1-30:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dirks_et_al:LIPIcs.IPEC.2021.30, author = {Dirks, Jona and Grobler, Mario and Rabinovich, Roman and Schnaubelt, Yannik and Siebertz, Sebastian and Sonneborn, Maximilian}, title = {{PACE Solver Description: PACA-JAVA}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {30:1--30:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.30}, URN = {urn:nbn:de:0030-drops-154138}, doi = {10.4230/LIPIcs.IPEC.2021.30}, annote = {Keywords: Cluster editing, parameterized complexity, PACE 2021} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Sankeerth Rao Karingula and Shachar Lovett. Singularity of Random Integer Matrices with Large Entries. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{karingula_et_al:LIPIcs.APPROX/RANDOM.2021.33, author = {Karingula, Sankeerth Rao and Lovett, Shachar}, title = {{Singularity of Random Integer Matrices with Large Entries}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, 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.2021.33}, URN = {urn:nbn:de:0030-drops-147260}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.33}, annote = {Keywords: Coding Theory, Random matrix theory, Singularity probability MDS codes, Error correction codes, Littlewood Offord, Fourier Analysis} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Marvin Williams, Peter Sanders, and Roman Dementiev. Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 81:1-81:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{williams_et_al:LIPIcs.ESA.2021.81, author = {Williams, Marvin and Sanders, Peter and Dementiev, Roman}, title = {{Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {81:1--81:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.81}, URN = {urn:nbn:de:0030-drops-146627}, doi = {10.4230/LIPIcs.ESA.2021.81}, annote = {Keywords: concurrent data structure, priority queues, randomized algorithms, wait-free locking} }
Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Ken-ichi Kawarabayashi, Bojan Mohar, Roman Nedela, and Peter Zeman. Automorphisms and Isomorphisms of Maps in Linear Time. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 86:1-86:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kawarabayashi_et_al:LIPIcs.ICALP.2021.86, author = {Kawarabayashi, Ken-ichi and Mohar, Bojan and Nedela, Roman and Zeman, Peter}, title = {{Automorphisms and Isomorphisms of Maps in Linear Time}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {86:1--86:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.86}, URN = {urn:nbn:de:0030-drops-141558}, doi = {10.4230/LIPIcs.ICALP.2021.86}, annote = {Keywords: maps on surfaces, automorphisms, isomorphisms, algorithm} }
Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)
Carl Einarson and Felix Reidl. A General Kernelization Technique for Domination and Independence Problems in Sparse Classes. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{einarson_et_al:LIPIcs.IPEC.2020.11, author = {Einarson, Carl and Reidl, Felix}, title = {{A General Kernelization Technique for Domination and Independence Problems in Sparse Classes}}, booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-172-6}, ISSN = {1868-8969}, year = {2020}, volume = {180}, editor = {Cao, Yixin and Pilipczuk, Marcin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.11}, URN = {urn:nbn:de:0030-drops-133142}, doi = {10.4230/LIPIcs.IPEC.2020.11}, annote = {Keywords: Dominating Set, Independence, Kernelization, Bounded Expansion} }
Feedback for Dagstuhl Publishing