Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Martin Hoefer and Kevin Schewior. Threshold Testing and Semi-Online Prophet Inequalities. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 62:1-62:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{hoefer_et_al:LIPIcs.ESA.2023.62, author = {Hoefer, Martin and Schewior, Kevin}, title = {{Threshold Testing and Semi-Online Prophet Inequalities}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {62:1--62:15}, 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.62}, URN = {urn:nbn:de:0030-drops-187159}, doi = {10.4230/LIPIcs.ESA.2023.62}, annote = {Keywords: Prophet Inequalities, Testing, Stochastic Probing} }
Published in: Dagstuhl Reports, Volume 11, Issue 10 (2022)
Simon Dejung, Mingyan Liu, Arndt Lüder, and Edgar Weippl. Managing Industrial Control Systems Security Risks for Cyber Insurance (Dagstuhl Seminar 21451). In Dagstuhl Reports, Volume 11, Issue 10, pp. 36-56, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{dejung_et_al:DagRep.11.10.36, author = {Dejung, Simon and Liu, Mingyan and L\"{u}der, Arndt and Weippl, Edgar}, title = {{Managing Industrial Control Systems Security Risks for Cyber Insurance (Dagstuhl Seminar 21451)}}, pages = {36--56}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {11}, number = {10}, editor = {Dejung, Simon and Liu, Mingyan and L\"{u}der, Arndt and Weippl, Edgar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.10.36}, URN = {urn:nbn:de:0030-drops-159273}, doi = {10.4230/DagRep.11.10.36}, annote = {Keywords: industrial control systems, security, cyber insurance, cyber risk quantification, production systems engineering, risk engineering, SCADA, Industry 4.0} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Daniel Hausmann, Stefan Milius, and Lutz Schröder. A Linear-Time Nominal μ-Calculus with Name Allocation. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 58:1-58:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hausmann_et_al:LIPIcs.MFCS.2021.58, author = {Hausmann, Daniel and Milius, Stefan and Schr\"{o}der, Lutz}, title = {{A Linear-Time Nominal \mu-Calculus with Name Allocation}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {58:1--58:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.58}, URN = {urn:nbn:de:0030-drops-144987}, doi = {10.4230/LIPIcs.MFCS.2021.58}, annote = {Keywords: Model checking, linear-time logic, nominal sets} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Caroline Mattes and Armin Weiß. Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 74:1-74:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mattes_et_al:LIPIcs.MFCS.2021.74, author = {Mattes, Caroline and Wei{\ss}, Armin}, title = {{Parallel Algorithms for Power Circuits and the Word Problem of the Baumslag Group}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {74:1--74:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.74}, URN = {urn:nbn:de:0030-drops-145148}, doi = {10.4230/LIPIcs.MFCS.2021.74}, annote = {Keywords: Word problem, Baumslag group, power circuit, parallel complexity} }
Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Robert S. R. Myers and Henning Urbat. Syntactic Minimization Of Nondeterministic Finite Automata. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 78:1-78:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{myers_et_al:LIPIcs.MFCS.2021.78, author = {Myers, Robert S. R. and Urbat, Henning}, title = {{Syntactic Minimization Of Nondeterministic Finite Automata}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {78:1--78:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.78}, URN = {urn:nbn:de:0030-drops-145186}, doi = {10.4230/LIPIcs.MFCS.2021.78}, annote = {Keywords: Algebraic language theory, Nondeterministic automata, NP-completeness} }
Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Paweł Gawrychowski, Maria Kosche, Tore Koß, Florin Manea, and Stefan Siemer. Efficiently Testing Simon’s Congruence. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2021.34, author = {Gawrychowski, Pawe{\l} and Kosche, Maria and Ko{\ss}, Tore and Manea, Florin and Siemer, Stefan}, title = {{Efficiently Testing Simon’s Congruence}}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)}, pages = {34:1--34:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-180-1}, ISSN = {1868-8969}, year = {2021}, volume = {187}, editor = {Bl\"{a}ser, Markus and Monmege, Benjamin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.34}, URN = {urn:nbn:de:0030-drops-136796}, doi = {10.4230/LIPIcs.STACS.2021.34}, annote = {Keywords: Simon’s congruence, Subsequence, Scattered factor, Efficient algorithms} }
Published in: LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)
Roland Meyer and Sören van der Wall. On the Complexity of Multi-Pushdown Games. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 182, pp. 52:1-52:35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{meyer_et_al:LIPIcs.FSTTCS.2020.52, author = {Meyer, Roland and van der Wall, S\"{o}ren}, title = {{On the Complexity of Multi-Pushdown Games}}, booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)}, pages = {52:1--52:35}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-174-0}, ISSN = {1868-8969}, year = {2020}, volume = {182}, editor = {Saxena, Nitin and Simon, Sunil}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.52}, URN = {urn:nbn:de:0030-drops-132930}, doi = {10.4230/LIPIcs.FSTTCS.2020.52}, annote = {Keywords: concurrency, complexity, games, infinite state, multi-pushdown} }
Published in: OASIcs, Volume 72, 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)
Phillip Raffeck, Christian Eichler, Peter Wägemann, and Wolfgang Schröder-Preikschat. Worst-Case Energy-Consumption Analysis by Microarchitecture-Aware Timing Analysis for Device-Driven Cyber-Physical Systems. In 19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019). Open Access Series in Informatics (OASIcs), Volume 72, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{raffeck_et_al:OASIcs.WCET.2019.4, author = {Raffeck, Phillip and Eichler, Christian and W\"{a}gemann, Peter and Schr\"{o}der-Preikschat, Wolfgang}, title = {{Worst-Case Energy-Consumption Analysis by Microarchitecture-Aware Timing Analysis for Device-Driven Cyber-Physical Systems}}, booktitle = {19th International Workshop on Worst-Case Execution Time Analysis (WCET 2019)}, pages = {4:1--4:12}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-118-4}, ISSN = {2190-6807}, year = {2019}, volume = {72}, editor = {Altmeyer, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2019.4}, URN = {urn:nbn:de:0030-drops-107699}, doi = {10.4230/OASIcs.WCET.2019.4}, annote = {Keywords: WCEC, WCRE, WCET, michroarchitecture analysis, whole-system analysis} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, and Naoki Katoh. An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 14:1-14:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2018.14, author = {Bhattacharya, Binay and Higashikawa, Yuya and Kameda, Tsunehiko and Katoh, Naoki}, title = {{An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {14:1--14:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.14}, URN = {urn:nbn:de:0030-drops-99624}, doi = {10.4230/LIPIcs.ISAAC.2018.14}, annote = {Keywords: Facility location, minsum sink, evacuation problem, minmax regret, dynamic flow path network} }
Published in: Dagstuhl Follow-Ups, Volume 4, Normative Multi-Agent Systems (2013)
Giulia Andrighetto, Cristiano Castelfranchi, Eunate Mayor, John McBreen, Maite Lopez-Sanchez, and Simon Parsons. (Social) Norm Dynamics. In Normative Multi-Agent Systems. Dagstuhl Follow-Ups, Volume 4, pp. 135-170, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InCollection{andrighetto_et_al:DFU.Vol4.12111.135, author = {Andrighetto, Giulia and Castelfranchi, Cristiano and Mayor, Eunate and McBreen, John and Lopez-Sanchez, Maite and Parsons, Simon}, title = {{(Social) Norm Dynamics}}, booktitle = {Normative Multi-Agent Systems}, pages = {135--170}, series = {Dagstuhl Follow-Ups}, ISBN = {978-3-939897-51-4}, ISSN = {1868-8977}, year = {2013}, volume = {4}, editor = {Andrighetto, Giulia and Governatori, Guido and Noriega, Pablo and van der Torre, Leendert W. N.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DFU.Vol4.12111.135}, URN = {urn:nbn:de:0030-drops-40023}, doi = {10.4230/DFU.Vol4.12111.135}, annote = {Keywords: Social norms, Norm generation, Norm spreading, Norm evolution, Trust, Culture} }
Published in: OASIcs, Volume 27, Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011
Simon Schröder, Harald Obermaier, Christoph Garth, and Kenneth I. Joy. Feature-based Visualization of Dense Integral Line Data. In Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011. Open Access Series in Informatics (OASIcs), Volume 27, pp. 71-87, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{schroder_et_al:OASIcs.VLUDS.2011.71, author = {Schr\"{o}der, Simon and Obermaier, Harald and Garth, Christoph and Joy, Kenneth I.}, title = {{Feature-based Visualization of Dense Integral Line Data}}, booktitle = {Visualization of Large and Unstructured Data Sets: Applications in Geospatial Planning, Modeling and Engineering - Proceedings of IRTG 1131 Workshop 2011}, pages = {71--87}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-46-0}, ISSN = {2190-6807}, year = {2012}, volume = {27}, editor = {Garth, Christoph and Middel, Ariane and Hagen, Hans}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.VLUDS.2011.71}, URN = {urn:nbn:de:0030-drops-37424}, doi = {10.4230/OASIcs.VLUDS.2011.71}, annote = {Keywords: flow simulation, feature-based visualization, dense lines, ambient occlusion} }
Published in: Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009)
Ruud van der Pas. The Past, Present and Future of High Performance Computing. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{vanderpas:DagSemProc.09061.20, author = {van der Pas, Ruud}, title = {{The Past, Present and Future of High Performance Computing}}, booktitle = {Combinatorial Scientific Computing}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9061}, editor = {Uwe Naumann and Olaf Schenk and Horst D. Simon and Sivan Toledo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.20}, URN = {urn:nbn:de:0030-drops-20836}, doi = {10.4230/DagSemProc.09061.20}, annote = {Keywords: High-Performance Scientific Computing} }
Feedback for Dagstuhl Publishing