Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Yuval Emek, Yuval Gil, Maciej Pacut, and Stefan Schmid. Online Algorithms with Randomly Infused Advice. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 44:1-44:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{emek_et_al:LIPIcs.ESA.2023.44, author = {Emek, Yuval and Gil, Yuval and Pacut, Maciej and Schmid, Stefan}, title = {{Online Algorithms with Randomly Infused Advice}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {44:1--44:19}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.44}, URN = {urn:nbn:de:0030-drops-186970}, doi = {10.4230/LIPIcs.ESA.2023.44}, annote = {Keywords: Online algorithms, competitive analysis, advice} }
Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)
Yuval Emek, Yuval Gil, and Noga Harlev. Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 27:1-27:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{emek_et_al:LIPIcs.OPODIS.2022.27, author = {Emek, Yuval and Gil, Yuval and Harlev, Noga}, title = {{Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach}}, booktitle = {26th International Conference on Principles of Distributed Systems (OPODIS 2022)}, pages = {27:1--27:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-265-5}, ISSN = {1868-8969}, year = {2023}, volume = {253}, editor = {Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2022.27}, URN = {urn:nbn:de:0030-drops-176474}, doi = {10.4230/LIPIcs.OPODIS.2022.27}, annote = {Keywords: self-stabilization, approximation algorithms, primal-dual} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Yuval Emek, Yuval Gil, and Shay Kutten. Locally Restricted Proof Labeling Schemes. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 20:1-20:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{emek_et_al:LIPIcs.DISC.2022.20, author = {Emek, Yuval and Gil, Yuval and Kutten, Shay}, title = {{Locally Restricted Proof Labeling Schemes}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {20:1--20:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.20}, URN = {urn:nbn:de:0030-drops-172111}, doi = {10.4230/LIPIcs.DISC.2022.20}, annote = {Keywords: proof labeling schemes, generic compilers, SLOCAL algorithms} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
Arun Ganesh and Jiazheng Zhao. Privately Answering Counting Queries with Generalized Gaussian Mechanisms. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 1:1-1:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{ganesh_et_al:LIPIcs.FORC.2021.1, author = {Ganesh, Arun and Zhao, Jiazheng}, title = {{Privately Answering Counting Queries with Generalized Gaussian Mechanisms}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.1}, URN = {urn:nbn:de:0030-drops-138698}, doi = {10.4230/LIPIcs.FORC.2021.1}, annote = {Keywords: Differential privacy, counting queries, Generalized Gaussians} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Yuval Emek and Yuval Gil. Twenty-Two New Approximate Proof Labeling Schemes. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 20:1-20:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{emek_et_al:LIPIcs.DISC.2020.20, author = {Emek, Yuval and Gil, Yuval}, title = {{Twenty-Two New Approximate Proof Labeling Schemes}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.20}, URN = {urn:nbn:de:0030-drops-130983}, doi = {10.4230/LIPIcs.DISC.2020.20}, annote = {Keywords: proof labeling schemes, distributed graph problems, approximation algorithms} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Shay Moran and Amir Yehudayoff. On Weak epsilon-Nets and the Radon Number. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 51:1-51:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{moran_et_al:LIPIcs.SoCG.2019.51, author = {Moran, Shay and Yehudayoff, Amir}, title = {{On Weak epsilon-Nets and the Radon Number}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.51}, URN = {urn:nbn:de:0030-drops-104551}, doi = {10.4230/LIPIcs.SoCG.2019.51}, annote = {Keywords: abstract convexity, weak epsilon nets, Radon number, VC dimension, Haussler packing lemma, Kneser graphs} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Jelena Marasevic, Clifford Stein, and Gil Zussman. A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 54:1-54:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{marasevic_et_al:LIPIcs.ICALP.2016.54, author = {Marasevic, Jelena and Stein, Clifford and Zussman, Gil}, title = {{A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {54:1--54:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.54}, URN = {urn:nbn:de:0030-drops-63344}, doi = {10.4230/LIPIcs.ICALP.2016.54}, annote = {Keywords: Fairness, distributed and stateless algorithms, resource allocation} }
Feedback for Dagstuhl Publishing