Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid. Hash-And-Adjust (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@misc{dagpub-supp--paper-21643-urlgithub.com-inet-tub-Hash-And-Adjust, title = {{Hash-And-Adjust}}, author = {Pourdamghani, Arash and Avin, Chen and Sama, Robert and Shiran, Maryam and Schmid, Stefan}, note = {Software, version 1.0., This project has received funding from the European Research Council (ERC) under grant agreement No. 864228 (AdjustNet), 2020-2025., swhId: \href{https://archive.softwareheritage.org/swh:1:dir:77be335343d4a118b82953ed6c1bb8a05cd91335;origin=https://github.com/inet-tub/Hash-And-Adjust;visit=swh:1:snp:92f8dea41d62b077bdfcc74688522b8f0d67d68b;anchor=swh:1:rev:d680a69b5437c59d062d532743a3385e87d0e4f7}{\texttt{swh:1:dir:77be335343d4a118b82953ed6c1bb8a05cd91335}} (visited on 2025-01-08)}, url = {https://github.com/inet-tub/Hash-And-Adjust}, doi = {10.4230/artifacts.22600}, }
Published in: LIPIcs, Volume 324, 28th International Conference on Principles of Distributed Systems (OPODIS 2024)
Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, and Stefan Schmid. Hash & Adjust: Competitive Demand-Aware Consistent Hashing. In 28th International Conference on Principles of Distributed Systems (OPODIS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 324, pp. 24:1-24:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{pourdamghani_et_al:LIPIcs.OPODIS.2024.24, author = {Pourdamghani, Arash and Avin, Chen and Sama, Robert and Shiran, Maryam and Schmid, Stefan}, title = {{Hash \& Adjust: Competitive Demand-Aware Consistent Hashing}}, booktitle = {28th International Conference on Principles of Distributed Systems (OPODIS 2024)}, pages = {24:1--24:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-360-7}, ISSN = {1868-8969}, year = {2025}, volume = {324}, editor = {Bonomi, Silvia and Galletta, Letterio and Rivi\`{e}re, Etienne and Schiavoni, Valerio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2024.24}, URN = {urn:nbn:de:0030-drops-225607}, doi = {10.4230/LIPIcs.OPODIS.2024.24}, annote = {Keywords: Consistent hashing, demand-awareness, online algorithms} }
Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Chen Avin, Iosif Salem, and Stefan Schmid. Brief Announcement: On Self-Adjusting Skip List Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 35:1-35:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{avin_et_al:LIPIcs.DISC.2019.35, author = {Avin, Chen and Salem, Iosif and Schmid, Stefan}, title = {{Brief Announcement: On Self-Adjusting Skip List Networks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {35:1--35:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.35}, URN = {urn:nbn:de:0030-drops-113423}, doi = {10.4230/LIPIcs.DISC.2019.35}, annote = {Keywords: self-adjusting networks, skip lists, working set, online algorithms} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Chen Avin, Kaushik Mondal, and Stefan Schmid. Demand-Aware Network Designs of Bounded Degree. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{avin_et_al:LIPIcs.DISC.2017.5, author = {Avin, Chen and Mondal, Kaushik and Schmid, Stefan}, title = {{Demand-Aware Network Designs of Bounded Degree}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {5:1--5:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.5}, URN = {urn:nbn:de:0030-drops-80153}, doi = {10.4230/LIPIcs.DISC.2017.5}, annote = {Keywords: Network design, reconfigurable networks, datacenter topology, peer-topeer computing, entropy, sparse spanners} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin. Brief Announcement: Distributed SplayNets. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 58:1-58:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{peres_et_al:LIPIcs.DISC.2017.58, author = {Peres, Bruna S. and Goussevskaia, Olga and Schmid, Stefan and Avin, Chen}, title = {{Brief Announcement: Distributed SplayNets}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {58:1--58:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.58}, URN = {urn:nbn:de:0030-drops-79661}, doi = {10.4230/LIPIcs.DISC.2017.58}, annote = {Keywords: Decentralization, Concurrency, Reconfigurable Networks} }
Feedback for Dagstuhl Publishing