Published in: Dagstuhl Reports, Volume 12, Issue 5 (2022)
Josu Ceberio Uribe, Benjamin Doerr, Carsten Witt, and Vicente P. Soloviev. Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182). In Dagstuhl Reports, Volume 12, Issue 5, pp. 17-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{uribe_et_al:DagRep.12.5.17, author = {Uribe, Josu Ceberio and Doerr, Benjamin and Witt, Carsten and Soloviev, Vicente P.}, title = {{Estimation-of-Distribution Algorithms: Theory and Applications (Dagstuhl Seminar 22182)}}, pages = {17--36}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {5}, editor = {Uribe, Josu Ceberio and Doerr, Benjamin and Witt, Carsten and Soloviev, Vicente P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.5.17}, URN = {urn:nbn:de:0030-drops-174421}, doi = {10.4230/DagRep.12.5.17}, annote = {Keywords: estimation-of-distribution algorithms, heuristic search and optimization, machine learning, probabilistic model building} }
Published in: LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Thomas Bläsius, Tobias Friedrich, and Martin Schirneck. The Minimization of Random Hypergraphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{blasius_et_al:LIPIcs.ESA.2020.21, author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Schirneck, Martin}, title = {{The Minimization of Random Hypergraphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.21}, URN = {urn:nbn:de:0030-drops-128871}, doi = {10.4230/LIPIcs.ESA.2020.21}, annote = {Keywords: Chernoff-Hoeffding theorem, maximum entropy, maximization, minimization, phase transition, random hypergraphs} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Dominik Scheder, Shuyang Tang, and Jiaheng Zhang. Searching for Cryptogenography Upper Bounds via Sum of Square Programming. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 31:1-31:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{scheder_et_al:LIPIcs.ISAAC.2019.31, author = {Scheder, Dominik and Tang, Shuyang and Zhang, Jiaheng}, title = {{Searching for Cryptogenography Upper Bounds via Sum of Square Programming}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {31:1--31:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.31}, URN = {urn:nbn:de:0030-drops-115276}, doi = {10.4230/LIPIcs.ISAAC.2019.31}, annote = {Keywords: Communication Complexity, Secret Leaking, Sum of Squares Programming} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Benjamin Doerr and Anatolii Kostrygin. Randomized Rumor Spreading Revisited. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 138:1-138:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{doerr_et_al:LIPIcs.ICALP.2017.138, author = {Doerr, Benjamin and Kostrygin, Anatolii}, title = {{Randomized Rumor Spreading Revisited}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {138:1--138:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.138}, URN = {urn:nbn:de:0030-drops-73798}, doi = {10.4230/LIPIcs.ICALP.2017.138}, annote = {Keywords: Epidemic algorithm, rumor spreading, dynamic graph} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Benjamin Doerr and Marvin Künnemann. Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 150:1-150:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{doerr_et_al:LIPIcs.ICALP.2016.150, author = {Doerr, Benjamin and K\"{u}nnemann, Marvin}, title = {{Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {150:1--150:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.150}, URN = {urn:nbn:de:0030-drops-62946}, doi = {10.4230/LIPIcs.ICALP.2016.150}, annote = {Keywords: randomized protocols, anonymous communication, computer-aided proofs, solitaire games} }
Published in: Dagstuhl Reports, Volume 3, Issue 7 (2013)
Benjamin Doerr, Nikolaus Hansen, Jonathan L. Shapiro, and L. Darrell Whitley. Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271). In Dagstuhl Reports, Volume 3, Issue 7, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{doerr_et_al:DagRep.3.7.1, author = {Doerr, Benjamin and Hansen, Nikolaus and Shapiro, Jonathan L. and Whitley, L. Darrell}, title = {{Theory of Evolutionary Algorithms (Dagstuhl Seminar 13271)}}, pages = {1--28}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {7}, editor = {Doerr, Benjamin and Hansen, Nikolaus and Shapiro, Jonathan L. and Whitley, L. Darrell}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.7.1}, URN = {urn:nbn:de:0030-drops-42603}, doi = {10.4230/DagRep.3.7.1}, annote = {Keywords: evolutionary algorithms, optimization, search heuristics, algorithms, artificial intelligence} }
Published in: Dagstuhl Reports, Volume 3, Issue 1 (2013)
Benjamin Doerr, Robert Elsässer, and Pierre Fraigniaud. Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). In Dagstuhl Reports, Volume 3, Issue 1, pp. 94-110, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{doerr_et_al:DagRep.3.1.94, author = {Doerr, Benjamin and Els\"{a}sser, Robert and Fraigniaud, Pierre}, title = {{Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042)}}, pages = {94--110}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {3}, number = {1}, editor = {Doerr, Benjamin and Els\"{a}sser, Robert and Fraigniaud, Pierre}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.1.94}, URN = {urn:nbn:de:0030-drops-40104}, doi = {10.4230/DagRep.3.1.94}, annote = {Keywords: Message dissemination, Epidemic spreading, Dynamic spreading processes} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Benjamin Doerr and Carola Winzen. Playing Mastermind With Constant-Size Memory. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 441-452, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{doerr_et_al:LIPIcs.STACS.2012.441, author = {Doerr, Benjamin and Winzen, Carola}, title = {{Playing Mastermind With Constant-Size Memory}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {441--452}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.441}, URN = {urn:nbn:de:0030-drops-34112}, doi = {10.4230/LIPIcs.STACS.2012.441}, annote = {Keywords: Algorithms, Mastermind, black-box complexity, memory-restricted algorithms, query complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 9371, Algorithmic Methods for Distributed Cooperative Systems (2010)
Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems. Dagstuhl Seminar Proceedings, Volume 9371, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{doerr_et_al:DagSemProc.09371.6, author = {Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, title = {{Stabilizing Consensus with the Power of Two Choices}}, booktitle = {Algorithmic Methods for Distributed Cooperative Systems}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9371}, editor = {S\'{a}ndor Fekete and Stefan Fischer and Martin Riedmiller and Suri Subhash}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09371.6}, URN = {urn:nbn:de:0030-drops-24290}, doi = {10.4230/DagSemProc.09371.6}, annote = {Keywords: Distributed consensus} }
Feedback for Dagstuhl Publishing