Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
François Sellier. Parameterized Matroid-Constrained Maximum Coverage. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 94:1-94:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{sellier:LIPIcs.ESA.2023.94, author = {Sellier, Fran\c{c}ois}, title = {{Parameterized Matroid-Constrained Maximum Coverage}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {94:1--94:16}, 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.94}, URN = {urn:nbn:de:0030-drops-187475}, doi = {10.4230/LIPIcs.ESA.2023.94}, annote = {Keywords: Matroids, approximate kernel, maximum coverage} }
Published in: LIPIcs, Volume 199, 2nd Conference on Information-Theoretic Cryptography (ITC 2021)
Megumi Ando, Anna Lysyanskaya, and Eli Upfal. On the Complexity of Anonymous Communication Through Public Networks. In 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 199, pp. 9:1-9:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ando_et_al:LIPIcs.ITC.2021.9, author = {Ando, Megumi and Lysyanskaya, Anna and Upfal, Eli}, title = {{On the Complexity of Anonymous Communication Through Public Networks}}, booktitle = {2nd Conference on Information-Theoretic Cryptography (ITC 2021)}, pages = {9:1--9:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-197-9}, ISSN = {1868-8969}, year = {2021}, volume = {199}, editor = {Tessaro, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2021.9}, URN = {urn:nbn:de:0030-drops-143282}, doi = {10.4230/LIPIcs.ITC.2021.9}, annote = {Keywords: Anonymity, privacy, onion routing} }
Published in: LIPIcs, Volume 113, 18th International Workshop on Algorithms in Bioinformatics (WABI 2018)
Morteza Chalabi Hajkarim, Eli Upfal, and Fabio Vandin. Differentially Mutated Subnetworks Discovery. In 18th International Workshop on Algorithms in Bioinformatics (WABI 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 113, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hajkarim_et_al:LIPIcs.WABI.2018.18, author = {Hajkarim, Morteza Chalabi and Upfal, Eli and Vandin, Fabio}, title = {{Differentially Mutated Subnetworks Discovery}}, booktitle = {18th International Workshop on Algorithms in Bioinformatics (WABI 2018)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-082-8}, ISSN = {1868-8969}, year = {2018}, volume = {113}, editor = {Parida, Laxmi and Ukkonen, Esko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.18}, URN = {urn:nbn:de:0030-drops-93202}, doi = {10.4230/LIPIcs.WABI.2018.18}, annote = {Keywords: Cancer genomics, network analysis, combinatorial algorithm} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Megumi Ando, Anna Lysyanskaya, and Eli Upfal. Practical and Provably Secure Onion Routing. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 144:1-144:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ando_et_al:LIPIcs.ICALP.2018.144, author = {Ando, Megumi and Lysyanskaya, Anna and Upfal, Eli}, title = {{Practical and Provably Secure Onion Routing}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {144:1--144:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.144}, URN = {urn:nbn:de:0030-drops-91482}, doi = {10.4230/LIPIcs.ICALP.2018.144}, annote = {Keywords: Anonymity, traffic analysis, statistical privacy, differential privacy} }
Published in: Dagstuhl Reports, Volume 7, Issue 4 (2018)
Bodo Manthey, Claire Mathieu, Heiko Röglin, and Eli Upfal. Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141). In Dagstuhl Reports, Volume 7, Issue 4, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@Article{manthey_et_al:DagRep.7.4.1, author = {Manthey, Bodo and Mathieu, Claire and R\"{o}glin, Heiko and Upfal, Eli}, title = {{Probabilistic Methods in the Design and Analysis of Algorithms (Dagstuhl Seminar 17141)}}, pages = {1--22}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2017}, volume = {7}, number = {4}, editor = {Manthey, Bodo and Mathieu, Claire and R\"{o}glin, Heiko and Upfal, Eli}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.7.4.1}, URN = {urn:nbn:de:0030-drops-75452}, doi = {10.4230/DagRep.7.4.1}, annote = {Keywords: analysis of algorithms, average-case analysis, random graphs, randomized algorithms, smoothed analysis, sub-linear algorithms} }
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