Published in: Dagstuhl Reports, Volume 3, Issue 11 (2014)
Yishay Mansour, Benny Moldovanu, Noam Nisan, and Berthold Vöcking. Electronic Markets and Auctions (Dagstuhl Seminar 13461). In Dagstuhl Reports, Volume 3, Issue 11, pp. 58-78, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{mansour_et_al:DagRep.3.11.58, author = {Mansour, Yishay and Moldovanu, Benny and Nisan, Noam and V\"{o}cking, Berthold}, title = {{Electronic Markets and Auctions (Dagstuhl Seminar 13461)}}, pages = {58--78}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {3}, number = {11}, editor = {Mansour, Yishay and Moldovanu, Benny and Nisan, Noam and V\"{o}cking, Berthold}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.11.58}, URN = {urn:nbn:de:0030-drops-44379}, doi = {10.4230/DagRep.3.11.58}, annote = {Keywords: Algorithmic game theory, mechanism design, economics, electronic markets} }
Published in: Dagstuhl Seminar Proceedings, Volume 10211, Flexible Network Design (2010)
Anupam Gupta, Stefano Leonardi, Berthold Vöcking, and Roger Wattenhofer. 10211 Abstracts Collection – Flexible Network Design. In Flexible Network Design. Dagstuhl Seminar Proceedings, Volume 10211, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{gupta_et_al:DagSemProc.10211.1, author = {Gupta, Anupam and Leonardi, Stefano and V\"{o}cking, Berthold and Wattenhofer, Roger}, title = {{10211 Abstracts Collection – Flexible Network Design}}, booktitle = {Flexible Network Design}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10211}, editor = {Anupam Gupta and Stefano Leonardi and Berthold V\"{o}cking and Roger Wattenhofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10211.1}, URN = {urn:nbn:de:0030-drops-27279}, doi = {10.4230/DagSemProc.10211.1}, annote = {Keywords: Network Design, Approximation Algorithms, Game Theory and Mechanism Design, Wireless Networks} }
Published in: Dagstuhl Seminar Proceedings, Volume 10211, Flexible Network Design (2010)
Friedrich Eisenbrand, Nicolai Hähnle, Alexander Razborov, and Thomas Rothvoß. Diameter of Polyhedra: Limits of Abstraction. In Flexible Network Design. Dagstuhl Seminar Proceedings, Volume 10211, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{eisenbrand_et_al:DagSemProc.10211.2, author = {Eisenbrand, Friedrich and H\"{a}hnle, Nicolai and Razborov, Alexander and Rothvo{\ss}, Thomas}, title = {{Diameter of Polyhedra: Limits of Abstraction}}, booktitle = {Flexible Network Design}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10211}, editor = {Anupam Gupta and Stefano Leonardi and Berthold V\"{o}cking and Roger Wattenhofer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10211.2}, URN = {urn:nbn:de:0030-drops-27247}, doi = {10.4230/DagSemProc.10211.2}, annote = {Keywords: Polyhedra, Graphs} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Matthias Englert, Heiko Röglin, Jacob Spönemann, and Berthold Vöcking. Economical Caching. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 385-396, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{englert_et_al:LIPIcs.STACS.2009.1826, author = {Englert, Matthias and R\"{o}glin, Heiko and Sp\"{o}nemann, Jacob and V\"{o}cking, Berthold}, title = {{Economical Caching}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {385--396}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1826}, URN = {urn:nbn:de:0030-drops-18263}, doi = {10.4230/LIPIcs.STACS.2009.1826}, annote = {Keywords: Online algorithms, Competitive analysis, Storage management} }
Published in: Dagstuhl Seminar Proceedings, Volume 7391, Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Martin Dietzfelbinger, Shang-Hua Teng, Eli Upfal, and Berthold Vöcking. 07391 Abstracts Collection – Probabilistic Methods in the Design and Analysis of Algorithms. In Probabilistic Methods in the Design and Analysis of Algorithms. Dagstuhl Seminar Proceedings, Volume 7391, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{dietzfelbinger_et_al:DagSemProc.07391.1, author = {Dietzfelbinger, Martin and Teng, Shang-Hua and Upfal, Eli and V\"{o}cking, Berthold}, title = {{07391 Abstracts Collection – Probabilistic Methods in the Design and Analysis of Algorithms}}, booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7391}, editor = {Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V\"{o}cking}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.1}, URN = {urn:nbn:de:0030-drops-12915}, doi = {10.4230/DagSemProc.07391.1}, annote = {Keywords: Algorithms, Randomization, Probabilistic analysis, Complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 7391, Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Chaitanya Swamy and David Shmoys. Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. In Probabilistic Methods in the Design and Analysis of Algorithms. Dagstuhl Seminar Proceedings, Volume 7391, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{swamy_et_al:DagSemProc.07391.2, author = {Swamy, Chaitanya and Shmoys, David}, title = {{Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization}}, booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7391}, editor = {Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V\"{o}cking}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.2}, URN = {urn:nbn:de:0030-drops-12906}, doi = {10.4230/DagSemProc.07391.2}, annote = {Keywords: Stochastic optimization, approximation algorithms, randomized algorithms, linear programming} }
Published in: Dagstuhl Seminar Proceedings, Volume 7391, Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Bodo Manthey and Till Tantau. Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise. In Probabilistic Methods in the Design and Analysis of Algorithms. Dagstuhl Seminar Proceedings, Volume 7391, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{manthey_et_al:DagSemProc.07391.3, author = {Manthey, Bodo and Tantau, Till}, title = {{Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise}}, booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7391}, editor = {Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V\"{o}cking}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.3}, URN = {urn:nbn:de:0030-drops-12893}, doi = {10.4230/DagSemProc.07391.3}, annote = {Keywords: Smoothed Analysis, Binary Search Trees, Quicksort, Left-to-right Maxima} }
Feedback for Dagstuhl Publishing