Published in: Dagstuhl Reports, Volume 12, Issue 11 (2023)
Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik. Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). In Dagstuhl Reports, Volume 12, Issue 11, pp. 124-145, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{dell_et_al:DagRep.12.11.124, author = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus}, title = {{Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)}}, pages = {124--145}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {12}, number = {11}, editor = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.11.124}, URN = {urn:nbn:de:0030-drops-178394}, doi = {10.4230/DagRep.12.11.124}, annote = {Keywords: Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes} }
Published in: LIPIcs, Volume 165, 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)
Lea Schönberger, Georg von der Brüggen, Kuan-Hsun Chen, Benjamin Sliwa, Hazem Youssef, Aswin Karthik Ramachandran Venkatapathy, Christian Wietfeld, Michael ten Hompel, and Jian-Jia Chen. Offloading Safety- and Mission-Critical Tasks via Unreliable Connections. In 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 165, pp. 18:1-18:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{schonberger_et_al:LIPIcs.ECRTS.2020.18, author = {Sch\"{o}nberger, Lea and von der Br\"{u}ggen, Georg and Chen, Kuan-Hsun and Sliwa, Benjamin and Youssef, Hazem and Ramachandran Venkatapathy, Aswin Karthik and Wietfeld, Christian and ten Hompel, Michael and Chen, Jian-Jia}, title = {{Offloading Safety- and Mission-Critical Tasks via Unreliable Connections}}, booktitle = {32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)}, pages = {18:1--18:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-152-8}, ISSN = {1868-8969}, year = {2020}, volume = {165}, editor = {V\"{o}lp, Marcus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2020.18}, URN = {urn:nbn:de:0030-drops-123811}, doi = {10.4230/LIPIcs.ECRTS.2020.18}, annote = {Keywords: internet of things, cyber-physical systems, real-time, mixed-criticality, self-suspension, computation offloading, scheduling, communication} }
Published in: Dagstuhl Reports, Volume 5, Issue 4 (2015)
David Hutchison, Klara Nahrstedt, Marcus Schöller, Indra Spiecker gen. Döhmann, and Markus Tauber. Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations (Dagstuhl Seminar 15151). In Dagstuhl Reports, Volume 5, Issue 4, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{hutchison_et_al:DagRep.5.4.1, author = {Hutchison, David and Nahrstedt, Klara and Sch\"{o}ller, Marcus and Spiecker gen. D\"{o}hmann, Indra and Tauber, Markus}, title = {{Assuring Resilience, Security and Privacy for Flexible Networked Systems and Organisations (Dagstuhl Seminar 15151)}}, pages = {1--17}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {5}, number = {4}, editor = {Hutchison, David and Nahrstedt, Klara and Sch\"{o}ller, Marcus and Spiecker gen. D\"{o}hmann, Indra and Tauber, Markus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.4.1}, URN = {urn:nbn:de:0030-drops-52725}, doi = {10.4230/DagRep.5.4.1}, annote = {Keywords: Resilience, security, privacy, legal aspects, networked systems, organisations, society} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Tomas Jelinek, Marcus Klaas, and Guido Schäfer. Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 433-444, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{jelinek_et_al:LIPIcs.STACS.2014.433, author = {Jelinek, Tomas and Klaas, Marcus and Sch\"{a}fer, Guido}, title = {{Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {433--444}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.433}, URN = {urn:nbn:de:0030-drops-44771}, doi = {10.4230/LIPIcs.STACS.2014.433}, annote = {Keywords: Network routing games, coordination mechanisms, network tolls, taxing subnetworks, heterogeneous players} }
Published in: OASIcs, Volume 34, German Conference on Bioinformatics 2013
Marcus Boden, Martin Schöneich, Sebastian Horwege, Sebastian Lindner, Chris Leimeister, and Burkhard Morgenstern. Alignment-free sequence comparison with spaced k-mers. In German Conference on Bioinformatics 2013. Open Access Series in Informatics (OASIcs), Volume 34, pp. 24-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{boden_et_al:OASIcs.GCB.2013.24, author = {Boden, Marcus and Sch\"{o}neich, Martin and Horwege, Sebastian and Lindner, Sebastian and Leimeister, Chris and Morgenstern, Burkhard}, title = {{Alignment-free sequence comparison with spaced k-mers}}, booktitle = {German Conference on Bioinformatics 2013}, pages = {24--34}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-59-0}, ISSN = {2190-6807}, year = {2013}, volume = {34}, editor = {Bei{\ss}barth, Tim and Kollmar, Martin and Leha, Andreas and Morgenstern, Burkhard and Schultz, Anne-Kathrin and Waack, Stephan and Wingender, Edgar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2013.24}, URN = {urn:nbn:de:0030-drops-42334}, doi = {10.4230/OASIcs.GCB.2013.24}, annote = {Keywords: Alignment-free sequence comparison, phylogeny reconstruction} }
Published in: OASIcs, Volume 20, 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2011)
Luciana Buriol, Marcus Ritt, Felix Rodrigues, and Guido Schäfer. On the Smoothed Price of Anarchy of the Traffic Assignment Problem. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. Open Access Series in Informatics (OASIcs), Volume 20, pp. 122-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{buriol_et_al:OASIcs.ATMOS.2011.122, author = {Buriol, Luciana and Ritt, Marcus and Rodrigues, Felix and Sch\"{a}fer, Guido}, title = {{On the Smoothed Price of Anarchy of the Traffic Assignment Problem}}, booktitle = {11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {122--133}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-33-0}, ISSN = {2190-6807}, year = {2011}, volume = {20}, editor = {Caprara, Alberto and Kontogiannis, Spyros}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2011.122}, URN = {urn:nbn:de:0030-drops-32727}, doi = {10.4230/OASIcs.ATMOS.2011.122}, annote = {Keywords: Traffic Assignment Problem, Smoothed Analysis, Price of Anarchy} }
Feedback for Dagstuhl Publishing