[{"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"type":"bachelorsthesis","citation":{"chicago":"Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.","ama":"Decking L. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite.; 2023.","apa":"Decking, L. (2023). Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite.","mla":"Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite. 2023.","bibtex":"@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }","short":"L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.","ieee":"L. Decking, Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite. 2023."},"year":"2023","_id":"48430","date_updated":"2023-10-24T13:25:05Z","date_created":"2023-10-24T13:22:08Z","status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Decking, Leo","first_name":"Leo","last_name":"Decking"}],"user_id":"15578","title":"Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite","abstract":[{"text":"Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen\r\nZugriffswahrscheinlichkeiten auf Speicher mit verschiedenen Bandbreiten\r\nund Kapazitäten aufgeteilt, dabei sind Replikate erlaubt.\r\nEs wird die nach Zugriffswahrscheinlichkeit gewichtete kleinste Bandbreite der Daten maximiert.\r\nWir zeigen, dass sowohl das diskrete Speicherproblem, bei dem die Bandbreite der Speicher jeweils\r\ngleichmäßig auf die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche\r\nSpeicherproblem, bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden\r\ndarf, NP-schwer ist.\r\nEs können also, wenn P ̸ = NP, keine effizienten Algorithmen für eine optimale Lösung existieren.\r\nStattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus.","lang":"eng"}]},{"date_updated":"2023-12-05T15:23:12Z","_id":"49494","type":"bachelorsthesis","citation":{"short":"A. Nickel, Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.","ieee":"A. Nickel, Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames. 2023.","ama":"Nickel A. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames.; 2023.","apa":"Nickel, A. (2023). Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames.","chicago":"Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.","bibtex":"@book{Nickel_2023, title={Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}, author={Nickel, Alexander}, year={2023} }","mla":"Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames. 2023."},"year":"2023","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"}],"language":[{"iso":"eng"}],"title":"Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"last_name":"Nickel","first_name":"Alexander","full_name":"Nickel, Alexander"}],"date_created":"2023-12-05T15:22:55Z","status":"public"},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"last_name":"Telaprolu","first_name":"Vipasyan","full_name":"Telaprolu, Vipasyan"}],"date_created":"2023-12-05T15:19:46Z","status":"public","title":"Reconstruction of 3D Surfels from Neural Radiance Fields","user_id":"15578","year":"2023","type":"mastersthesis","citation":{"bibtex":"@book{Telaprolu_2023, title={Reconstruction of 3D Surfels from Neural Radiance Fields}, author={Telaprolu, Vipasyan}, year={2023} }","mla":"Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.","apa":"Telaprolu, V. (2023). Reconstruction of 3D Surfels from Neural Radiance Fields.","ama":"Telaprolu V. Reconstruction of 3D Surfels from Neural Radiance Fields.; 2023.","chicago":"Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.","ieee":"V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.","short":"V. Telaprolu, Reconstruction of 3D Surfels from Neural Radiance Fields, 2023."},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"_id":"49493","date_updated":"2023-12-05T15:20:10Z"},{"date_created":"2023-12-05T15:18:17Z","status":"public","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"author":[{"full_name":"Friemel, Jonas","first_name":"Jonas","last_name":"Friemel"}],"title":"Shape Reconfiguration by Hybrid Programmable Matter","user_id":"15578","type":"mastersthesis","year":"2023","citation":{"mla":"Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter. 2023.","bibtex":"@book{Friemel_2023, title={Shape Reconfiguration by Hybrid Programmable Matter}, author={Friemel, Jonas}, year={2023} }","apa":"Friemel, J. (2023). Shape Reconfiguration by Hybrid Programmable Matter.","ama":"Friemel J. Shape Reconfiguration by Hybrid Programmable Matter.; 2023.","chicago":"Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter, 2023.","ieee":"J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter. 2023.","short":"J. Friemel, Shape Reconfiguration by Hybrid Programmable Matter, 2023."},"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"date_updated":"2023-12-05T15:18:41Z","_id":"49492"},{"title":"Self-Stabilizing Skip-Graph with Growth-bounded Metric","user_id":"15578","status":"public","date_created":"2024-03-05T12:48:39Z","author":[{"full_name":"Beckendorf, Björn","first_name":"Björn","last_name":"Beckendorf"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"52317","date_updated":"2024-03-05T12:49:22Z","year":"2023","type":"mastersthesis","citation":{"ieee":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-bounded Metric. 2023.","short":"B. Beckendorf, Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.","bibtex":"@book{Beckendorf_2023, title={Self-Stabilizing Skip-Graph with Growth-bounded Metric}, author={Beckendorf, Björn}, year={2023} }","mla":"Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric. 2023.","chicago":"Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.","apa":"Beckendorf, B. (2023). Self-Stabilizing Skip-Graph with Growth-bounded Metric.","ama":"Beckendorf B. Self-Stabilizing Skip-Graph with Growth-Bounded Metric.; 2023."},"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"department":[{"_id":"79"}],"author":[{"first_name":"Rajanna","full_name":"Roopa, Rajanna","last_name":"Roopa"}],"date_created":"2022-02-28T07:46:23Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public","user_id":"15504","title":"Evaluation of Algorithms for the Node Capacitated Clique","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"year":"2022","citation":{"short":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.","ieee":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique. 2022.","chicago":"Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique, 2022.","apa":"Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.","ama":"Roopa R. Evaluation of Algorithms for the Node Capacitated Clique.; 2022.","mla":"Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique. 2022.","bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }"},"type":"mastersthesis","date_updated":"2022-02-28T07:46:53Z","_id":"30152"},{"title":"Aufarbeitung und lmplementierung von DAG-Rider","user_id":"15504","status":"public","date_created":"2022-03-03T07:47:00Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"author":[{"last_name":"Korzeczek","full_name":"Korzeczek, Sebastian","first_name":"Sebastian"}],"department":[{"_id":"79"}],"_id":"30198","date_updated":"2022-03-03T07:51:02Z","type":"bachelorsthesis","citation":{"ieee":"S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","mla":"Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider. 2022.","apa":"Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.","ama":"Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.","chicago":"Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider, 2022."},"year":"2022","supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}]},{"user_id":"15504","title":"Hybrid Routing in Three Dimensions","department":[{"_id":"79"}],"author":[{"full_name":"Nachtigall, Marcel","first_name":"Marcel","last_name":"Nachtigall"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2022-03-03T07:50:45Z","status":"public","date_updated":"2022-03-03T07:50:59Z","_id":"30199","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"year":"2022","citation":{"ieee":"M. Nachtigall, Hybrid Routing in Three Dimensions. 2022.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.","bibtex":"@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall, Marcel}, year={2022} }","mla":"Nachtigall, Marcel. Hybrid Routing in Three Dimensions. 2022.","chicago":"Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.","apa":"Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.","ama":"Nachtigall M. Hybrid Routing in Three Dimensions.; 2022."},"type":"mastersthesis"},{"page":"317–343","citation":{"apa":"Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343. https://doi.org/10.1089/cmb.2021.0363","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. J Comput Biol. 2022;29(4):317–343. doi:10.1089/cmb.2021.0363","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol. 29, no. 4 (2022): 317–343. https://doi.org/10.1089/cmb.2021.0363.","bibtex":"@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={10.1089/cmb.2021.0363}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi: 10.1089/cmb.2021.0363."},"type":"journal_article","year":"2022","language":[{"iso":"eng"}],"_id":"31060","date_updated":"2022-05-04T12:31:27Z","intvolume":" 29","doi":"10.1089/cmb.2021.0363","issue":"4","publication":"J. Comput. Biol.","department":[{"_id":"79"}],"author":[{"last_name":"Feldmann","first_name":"Michael","full_name":"Feldmann, Michael"},{"last_name":"Padalkin","id":"88238","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Shlomi","full_name":"Dolev, Shlomi","last_name":"Dolev"}],"volume":29,"date_created":"2022-05-04T12:29:22Z","status":"public","title":"Coordinating Amoebots via Reconfigurable Circuits","user_id":"15504"},{"year":"2022","citation":{"short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","ieee":"H. Hillebrandt, Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen. 2022.","apa":"Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen.","ama":"Hillebrandt H. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen.; 2022.","chicago":"Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }","mla":"Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen. 2022."},"type":"bachelorsthesis","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"_id":"31947","date_updated":"2022-06-20T06:16:49Z","author":[{"last_name":"Hillebrandt","full_name":"Hillebrandt, Henning","first_name":"Henning"}],"file_date_updated":"2022-06-20T06:16:09Z","department":[{"_id":"79"}],"file":[{"file_name":"BA_Hillebrandt.pdf","date_created":"2022-06-20T06:16:09Z","access_level":"closed","file_id":"31950","creator":"florida","file_size":1585281,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2022-06-20T06:16:09Z"}],"status":"public","has_accepted_license":"1","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"date_created":"2022-06-20T06:16:32Z","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","ddc":["000"],"user_id":"15504"},{"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"date_updated":"2022-11-17T14:18:24Z","doi":"10.4230/LIPIcs.DNA.28.8","department":[{"_id":"79"}],"editor":[{"full_name":"Ouldridge, Thomas E.","first_name":"Thomas E.","last_name":"Ouldridge"},{"full_name":"Wickham, Shelley F. J.","first_name":"Shelley F. J.","last_name":"Wickham"}],"publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"place":"Dagstuhl, Germany","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","year":"2022","type":"conference","citation":{"chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.8.","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8","apa":"Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8","bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.8}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.","short":"A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8."},"page":"8:1–8:22","_id":"32602","intvolume":" 238","author":[{"first_name":"Andreas","full_name":"Padalkin, Andreas","last_name":"Padalkin","id":"88238"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Warner","id":"3902","first_name":"Daniel","full_name":"Warner, Daniel"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","volume":238,"status":"public","date_created":"2022-08-08T17:32:19Z","user_id":"477"},{"department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"publication_identifier":{"isbn":["978-3-95977-253-2"],"issn":["1868-8969"]},"editor":[{"full_name":"Ouldridge, Thomas E.","first_name":"Thomas E.","last_name":"Ouldridge"},{"last_name":"Wickham","first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J."}],"place":"Dagstuhl, Germany","title":"Fault-Tolerant Shape Formation in the Amoebot Model","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"date_updated":"2022-11-17T14:17:09Z","doi":"10.4230/LIPIcs.DNA.28.9","publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","author":[{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Warner","id":"3902","first_name":"Daniel","full_name":"Warner, Daniel"}],"date_created":"2022-08-08T17:42:43Z","status":"public","volume":238,"user_id":"477","page":"9:1–9:22","year":"2022","type":"conference","citation":{"mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={10.4230/LIPIcs.DNA.28.9}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.DNA.28.9.","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9","apa":"Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.9","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22."},"_id":"32603","intvolume":" 238"},{"department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"editor":[{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"first_name":"Othon","full_name":"Michail, Othon","last_name":"Michail"}],"title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","series_title":"LIPIcs","language":[{"iso":"eng"}],"date_updated":"2022-08-30T06:33:44Z","doi":"10.4230/LIPIcs.SAND.2022.12","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","author":[{"last_name":"Daymude","first_name":"Joshua J.","full_name":"Daymude, Joshua J."},{"last_name":"Richa","full_name":"Richa, Andréa W.","first_name":"Andréa W."},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2022-08-30T06:31:21Z","status":"public","volume":221,"user_id":"15504","page":"12:1–12:19","citation":{"apa":"Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12","ama":"Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.12.","mla":"Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.","bibtex":"@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19}, collection={LIPIcs} }","short":"J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.","ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12."},"year":"2022","type":"conference","intvolume":" 221","_id":"33230"},{"doi":"10.1145/3490148.3538556","_id":"33240","date_updated":"2022-09-01T07:57:53Z","language":[{"iso":"eng"}],"type":"conference","year":"2022","citation":{"chicago":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.","ama":"Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556","apa":"Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.","bibtex":"@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={10.1145/3490148.3538556}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }","short":"T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.","ieee":"T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101, doi: 10.1145/3490148.3538556."},"page":"99–101","user_id":"15504","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"date_created":"2022-09-01T07:55:00Z","editor":[{"last_name":"Agrawal","full_name":"Agrawal, Kunal","first_name":"Kunal"},{"last_name":"Lee","full_name":"Lee, I-Ting Angelina","first_name":"I-Ting Angelina"}],"publisher":"ACM","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022"},{"place":"Dagstuhl, Germany","title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","department":[{"_id":"79"}],"editor":[{"first_name":"James","full_name":"Aspnes, James","last_name":"Aspnes"},{"last_name":"Michail","first_name":"Othon","full_name":"Michail, Othon"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-224-2"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"date_updated":"2022-10-27T08:45:52Z","doi":"10.4230/LIPIcs.SAND.2022.23","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"user_id":"15504","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","author":[{"full_name":"Kostitsyna, Irina","first_name":"Irina","last_name":"Kostitsyna"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Daniel","full_name":"Warner, Daniel","last_name":"Warner","id":"3902"}],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","volume":221,"status":"public","date_created":"2022-05-03T00:13:06Z","intvolume":" 221","_id":"30987","citation":{"ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi: 10.4230/LIPIcs.SAND.2022.23.","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.","mla":"Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={10.4230/LIPIcs.SAND.2022.23}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.SAND.2022.23.","apa":"Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.23","ama":"Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23"},"type":"conference","year":"2022","page":"23:1–23:3"},{"_id":"33967","date_updated":"2022-11-02T08:56:16Z","doi":"10.1145/3519270.3538411","language":[{"iso":"eng"}],"year":"2022","citation":{"ieee":"M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “2022 Edsger W. Dijkstra Prize in Distributed Computing,” in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi: 10.1145/3519270.3538411.","short":"M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.","mla":"Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.","bibtex":"@inproceedings{Aguiliera_Richa_Schwarzmann_Panconesi_Scheideler_Woelfel_2022, title={2022 Edsger W. Dijkstra Prize in Distributed Computing}, DOI={10.1145/3519270.3538411}, booktitle={PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, publisher={ACM}, author={Aguiliera, Marcos and Richa, Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler, Christian and Woelfel, Philipp}, editor={Milani, Alessia and Woelfel, Philipp}, year={2022}, pages={1} }","apa":"Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., & Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani & P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM. https://doi.org/10.1145/3519270.3538411","ama":"Aguiliera M, Richa AW, Schwarzmann AA, Panconesi A, Scheideler C, Woelfel P. 2022 Edsger W. Dijkstra Prize in Distributed Computing. In: Milani A, Woelfel P, eds. PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM; 2022:1. doi:10.1145/3519270.3538411","chicago":"Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, and Philipp Woelfel. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022. https://doi.org/10.1145/3519270.3538411."},"type":"conference","page":"1","user_id":"15504","title":"2022 Edsger W. Dijkstra Prize in Distributed Computing","author":[{"last_name":"Aguiliera","full_name":"Aguiliera, Marcos","first_name":"Marcos"},{"full_name":"Richa, Andréa W.","first_name":"Andréa W.","last_name":"Richa"},{"last_name":"Schwarzmann","first_name":"Alexander A.","full_name":"Schwarzmann, Alexander A."},{"last_name":"Panconesi","full_name":"Panconesi, Alessandro","first_name":"Alessandro"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Woelfel","full_name":"Woelfel, Philipp","first_name":"Philipp"}],"publisher":"ACM","department":[{"_id":"79"}],"publication":"PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"date_created":"2022-11-02T08:53:37Z","editor":[{"last_name":"Milani","full_name":"Milani, Alessia","first_name":"Alessia"},{"first_name":"Philipp","full_name":"Woelfel, Philipp","last_name":"Woelfel"}]},{"user_id":"15504","title":"36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA","status":"public","date_created":"2022-11-02T08:55:30Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"editor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publication_identifier":{"isbn":["978-3-95977-255-6"]},"volume":246,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"79"}],"_id":"33968","date_updated":"2022-11-02T08:56:13Z","intvolume":" 246","language":[{"iso":"eng"}],"type":"conference_editor","year":"2022","citation":{"apa":"Scheideler, C. (Ed.). (2022). 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","ama":"Scheideler C, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022.","chicago":"Scheideler, Christian, ed. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Vol. 246. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","mla":"Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","bibtex":"@book{Scheideler_2022, series={LIPIcs}, title={36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}, volume={246}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year={2022}, collection={LIPIcs} }","short":"C. Scheideler, ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ieee":"C. Scheideler, Ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, vol. 246. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"series_title":"LIPIcs"},{"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"year":"2022","citation":{"bibtex":"@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={10.17619/UNIPB/1-1673 }, author={Kolb, Christina}, year={2022} }","mla":"Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 .","apa":"Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. https://doi.org/10.17619/UNIPB/1-1673 ","ama":"Kolb C. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks.; 2022. doi:10.17619/UNIPB/1-1673 ","chicago":"Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022. https://doi.org/10.17619/UNIPB/1-1673 .","ieee":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks. 2022.","short":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022."},"type":"dissertation","doi":"10.17619/UNIPB/1-1673 ","date_updated":"2023-03-17T07:22:04Z","_id":"30239","date_created":"2022-03-11T06:05:54Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Kolb, Christina","first_name":"Christina","last_name":"Kolb"}],"user_id":"15504","title":"Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks"},{"doi":"10.1016/j.ic.2021.104697","article_number":"104697","_id":"21096","date_updated":"2023-03-27T07:56:48Z","type":"journal_article","citation":{"short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” Information and Computation, Art. no. 104697, 2022, doi: 10.1016/j.ic.2021.104697.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 2022. https://doi.org/10.1016/j.ic.2021.104697.","ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. Information and Computation. Published online 2022. doi:10.1016/j.ic.2021.104697","apa":"Knollmann, T., & Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697. https://doi.org/10.1016/j.ic.2021.104697","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={10.1016/j.ic.2021.104697}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697."},"year":"2022","language":[{"iso":"eng"}],"title":"A self-stabilizing Hashed Patricia Trie","user_id":"15504","abstract":[{"lang":"eng","text":"While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys."}],"publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2021-01-29T09:39:40Z","status":"public","publication":"Information and Computation","department":[{"_id":"63"},{"_id":"79"}],"author":[{"id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","first_name":"Till"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"title":"Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter","user_id":"15504","department":[{"_id":"79"}],"author":[{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-09-22T12:33:44Z","status":"public","_id":"24887","date_updated":"2022-01-06T06:56:40Z","doi":"10.17619/UNIPB/1-1169 ","type":"dissertation","citation":{"ama":"Hinnenthal K. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.; 2021. doi:10.17619/UNIPB/1-1169 ","apa":"Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. https://doi.org/10.17619/UNIPB/1-1169 ","chicago":"Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021. https://doi.org/10.17619/UNIPB/1-1169 .","bibtex":"@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={10.17619/UNIPB/1-1169 }, author={Hinnenthal, Kristian}, year={2021} }","mla":"Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 .","short":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.","ieee":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021."},"year":"2021","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:56:53Z","_id":"25126","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"citation":{"ama":"Liedtke DJ. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.","apa":"Liedtke, D. J. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.","chicago":"Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","mla":"Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021} }","short":"D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","ieee":"D. J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021."},"year":"2021","type":"mastersthesis","abstract":[{"lang":"eng","text":"Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\\O$-convexity in $\\O(n)$ rounds, but cannot detect weak $\\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\\O$-hull of any given configuration of size $n$ can be constructed in $\\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles."}],"user_id":"55557","ddc":["000"],"title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","file":[{"access_level":"local","date_created":"2021-09-29T12:34:47Z","file_name":"Master - Thesis.pdf","relation":"main_file","date_updated":"2021-09-29T12:34:47Z","content_type":"application/pdf","file_id":"25128","creator":"liedtke","file_size":10114825}],"author":[{"full_name":"Liedtke, David Jan","first_name":"David Jan","id":"55557","last_name":"Liedtke"}],"file_date_updated":"2021-09-29T12:34:47Z","keyword":["Robot Exploration","Finite Automaton","Hybrid Model for Programmable Matter","Convex Hull"],"department":[{"_id":"79"}],"status":"public","has_accepted_license":"1","date_created":"2021-09-29T12:37:39Z"},{"doi":"10.1007/978-3-030-91081-5\\_34","intvolume":" 13046","_id":"28917","date_updated":"2022-01-06T06:58:41Z","language":[{"iso":"eng"}],"type":"conference","citation":{"bibtex":"@inproceedings{Feldmann_Padalkin_Scheideler_Dolev_2021, series={Lecture Notes in Computer Science}, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={13046}, DOI={10.1007/978-3-030-91081-5\\_34}, booktitle={Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings}, publisher={Springer}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, editor={Johnen, Colette and Michael Schiller, Elad and Schmid, Stefan}, year={2021}, pages={484–488}, collection={Lecture Notes in Computer Science} }","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5\\_34.","apa":"Feldmann, M., Padalkin, A., Scheideler, C., & Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, & S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings (Vol. 13046, pp. 484–488). Springer. https://doi.org/10.1007/978-3-030-91081-5\\_34","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. In: Johnen C, Michael Schiller E, Schmid S, eds. Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings. Vol 13046. Lecture Notes in Computer Science. Springer; 2021:484-488. doi:10.1007/978-3-030-91081-5\\_34","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5\\_34.","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” in Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, 2021, vol. 13046, pp. 484–488, doi: 10.1007/978-3-030-91081-5\\_34.","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488."},"year":"2021","page":"484-488","series_title":"Lecture Notes in Computer Science","user_id":"15504","title":"Coordinating Amoebots via Reconfigurable Circuits","status":"public","date_created":"2021-12-15T09:37:38Z","editor":[{"first_name":"Colette","full_name":"Johnen, Colette","last_name":"Johnen"},{"last_name":"Michael Schiller","full_name":"Michael Schiller, Elad","first_name":"Elad"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"volume":13046,"author":[{"last_name":"Feldmann","first_name":"Michael","full_name":"Feldmann, Michael"},{"last_name":"Padalkin","id":"88238","first_name":"Andreas","full_name":"Padalkin, Andreas"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Shlomi","full_name":"Dolev, Shlomi","last_name":"Dolev"}],"publisher":"Springer","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings"},{"title":"Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"date_created":"2021-12-16T06:41:25Z","status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Suermann","full_name":"Suermann, Dennis","first_name":"Dennis"}],"date_updated":"2022-01-06T06:58:43Z","_id":"28998","type":"bachelorsthesis","year":"2021","citation":{"ieee":"D. Suermann, Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers. 2021.","short":"D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.","bibtex":"@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }","mla":"Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers. 2021.","chicago":"Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.","apa":"Suermann, D. (2021). Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers.","ama":"Suermann D. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers.; 2021."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}]},{"user_id":"15504","title":"Selbststabilisierender Bakery Algorithmus für verteilte Systeme","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-11-02T10:13:51Z","author":[{"last_name":"Everling","first_name":"Leon","full_name":"Everling, Leon"}],"department":[{"_id":"79"}],"date_updated":"2022-01-06T06:57:33Z","_id":"27053","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"bachelorsthesis","citation":{"ieee":"L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme. 2021.","short":"L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.","mla":"Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021.","bibtex":"@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }","ama":"Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021.","apa":"Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme.","chicago":"Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021."},"year":"2021"},{"type":"mastersthesis","year":"2021","citation":{"ieee":"V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021.","short":"V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.","bibtex":"@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }","mla":"Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021.","apa":"Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems.","ama":"Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021.","chicago":"Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021."},"language":[{"iso":"eng"}],"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"_id":"27072","date_updated":"2022-01-06T06:57:33Z","date_created":"2021-11-03T06:12:47Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","department":[{"_id":"79"}],"author":[{"first_name":"Vaibhav","full_name":"Adsul, Vaibhav","last_name":"Adsul"}],"title":"Peer-to-Peer Matching for Distributed Systems","user_id":"15504"},{"author":[{"full_name":"Werthmann, Julian","first_name":"Julian","id":"50024","last_name":"Werthmann"}],"department":[{"_id":"79"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2021-01-26T13:58:14Z","title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","user_id":"15504","type":"mastersthesis","citation":{"chicago":"Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","ama":"Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021.","apa":"Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","mla":"Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.","short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","ieee":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021."},"year":"2021","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:44Z","_id":"21084"},{"author":[{"full_name":"Mengshi, Ma","first_name":"Ma","last_name":"Mengshi"}],"department":[{"_id":"79"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2021-02-09T07:09:22Z","title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","user_id":"15504","citation":{"ieee":"M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.","short":"M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }","mla":"Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.","ama":"Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021.","apa":"Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.","chicago":"Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021."},"type":"bachelorsthesis","year":"2021","language":[{"iso":"eng"}],"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"_id":"21197","date_updated":"2022-01-06T06:54:49Z"},{"title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","user_id":"15504","department":[{"_id":"79"}],"author":[{"first_name":"David","full_name":"Liedtke, David","last_name":"Liedtke"}],"date_created":"2021-04-15T05:51:43Z","status":"public","_id":"21627","date_updated":"2022-01-06T06:55:08Z","year":"2021","citation":{"apa":"Liedtke, D. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.","ama":"Liedtke D. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.; 2021.","chicago":"Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","mla":"Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }","short":"D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","ieee":"D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021."},"type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}]},{"has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-04-15T08:23:52Z","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"}],"department":[{"_id":"79"}],"file_date_updated":"2021-04-15T08:21:15Z","file":[{"file_size":2617069,"file_id":"21629","creator":"mfeldma2","content_type":"application/pdf","date_updated":"2021-04-15T08:21:15Z","success":1,"relation":"main_file","file_name":"Dissertation_Michael_Feldmann.pdf","date_created":"2021-04-15T08:21:15Z","access_level":"closed"}],"ddc":["006"],"title":"Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks","user_id":"23538","abstract":[{"lang":"eng","text":"This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.\r\nWe furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach of those protocols comes with unique properties that makes it interesting for certain distributed applications.\r\nGeneralized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.\r\n"}],"type":"dissertation","year":"2021","citation":{"ieee":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021.","short":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.","bibtex":"@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113}, author={Feldmann, Michael}, year={2021} }","mla":"Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.","chicago":"Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113.","ama":"Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113","apa":"Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113"},"language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"doi":"10.17619/UNIPB/1-1113","date_updated":"2022-01-06T06:55:08Z","_id":"21628"},{"user_id":"15504","title":"Near-Shortest Path Routing in Hybrid Communication Networks","status":"public","date_created":"2022-03-09T10:43:28Z","editor":[{"last_name":"Bramas","full_name":"Bramas, Quentin","first_name":"Quentin"},{"full_name":"Gramoli, Vincent","first_name":"Vincent","last_name":"Gramoli"},{"full_name":"Milani, Alessia","first_name":"Alessia","last_name":"Milani"}],"volume":217,"author":[{"full_name":"Coy, Sam","first_name":"Sam","last_name":"Coy"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"},{"last_name":"Struijs","first_name":"Martijn","full_name":"Struijs, Martijn"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"79"}],"publication":"25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France","doi":"10.4230/LIPIcs.OPODIS.2021.11","intvolume":" 217","_id":"30217","date_updated":"2022-03-09T10:46:34Z","language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.” 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11.","bibtex":"@inproceedings{Coy_Czumaj_Feldmann_Hinnenthal_Kuhn_Scheideler_Schneider_Struijs_2021, series={LIPIcs}, title={Near-Shortest Path Routing in Hybrid Communication Networks}, volume={217}, DOI={10.4230/LIPIcs.OPODIS.2021.11}, booktitle={25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Coy, Sam and Czumaj, Artur and Feldmann, Michael and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp and Struijs, Martijn}, editor={Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, year={2021}, pages={11:1–11:23}, collection={LIPIcs} }","apa":"Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., & Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11","ama":"Coy S, Czumaj A, Feldmann M, et al. Near-Shortest Path Routing in Hybrid Communication Networks. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. Vol 217. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:11:1–11:23. doi:10.4230/LIPIcs.OPODIS.2021.11","chicago":"Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.” In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.OPODIS.2021.11.","ieee":"S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,” in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi: 10.4230/LIPIcs.OPODIS.2021.11.","short":"S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23."},"year":"2021","page":"11:1–11:23","series_title":"LIPIcs"},{"date_updated":"2022-01-06T06:54:23Z","_id":"20221","year":"2020","citation":{"short":"P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.","ieee":"P. K. Yeole, Plurality Consensus in Hybrid Networks. 2020.","chicago":"Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.","ama":"Yeole PK. Plurality Consensus in Hybrid Networks.; 2020.","apa":"Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.","mla":"Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.","bibtex":"@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole, Paresh Kishor}, year={2020} }"},"type":"mastersthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"Plurality Consensus in Hybrid Networks","user_id":"15504","department":[{"_id":"79"}],"author":[{"first_name":"Paresh Kishor","full_name":"Yeole, Paresh Kishor","last_name":"Yeole"}],"date_created":"2020-10-29T07:45:57Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public"},{"date_updated":"2022-01-06T06:53:20Z","_id":"17836","intvolume":" 12156","doi":"10.1007/978-3-030-54921-3","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"citation":{"short":"A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 2020.","ieee":"A. Werneck Richa and C. Scheideler, Eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, vol. 12156. Springer, 2020.","apa":"Werneck Richa, A., & Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer. https://doi.org/10.1007/978-3-030-54921-3","ama":"Werneck Richa A, Scheideler C, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol 12156. Springer; 2020. doi:10.1007/978-3-030-54921-3","chicago":"Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-54921-3.","bibtex":"@book{Werneck Richa_Scheideler_2020, series={Lecture Notes in Computer Science}, title={Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}, volume={12156}, DOI={10.1007/978-3-030-54921-3}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","mla":"Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3."},"type":"conference_editor","year":"2020","user_id":"15504","title":"Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings","department":[{"_id":"79"}],"publisher":"Springer","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2020-08-12T07:54:22Z","status":"public","publication_identifier":{"isbn":["978-3-030-54920-6"]},"volume":12156,"editor":[{"first_name":"Andrea","full_name":"Werneck Richa, Andrea","last_name":"Werneck Richa"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"year":"2020","type":"conference_editor","citation":{"chicago":"Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020. https://doi.org/10.1145/3350755.","apa":"Scheideler, C., & Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM. https://doi.org/10.1145/3350755","ama":"Scheideler C, Spear M, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM; 2020. doi:10.1145/3350755","bibtex":"@book{Scheideler_Spear_2020, title={SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}, DOI={10.1145/3350755}, publisher={ACM}, year={2020} }","mla":"Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.","short":"C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.","ieee":"C. Scheideler and M. Spear, Eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020."},"language":[{"iso":"eng"}],"doi":"10.1145/3350755","date_updated":"2022-01-06T06:53:20Z","_id":"17839","publication_identifier":{"isbn":["978-1-4503-6935-0"]},"editor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Spear","first_name":"Michael","full_name":"Spear, Michael"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-08-12T07:57:10Z","status":"public","department":[{"_id":"79"}],"publisher":"ACM","title":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020","user_id":"15504"},{"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"year":"2020","type":"mastersthesis","citation":{"short":"M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.","ieee":"M. Jochmaring, A self stabilizing protocol for well-formed trees in hybrid networks. 2020.","ama":"Jochmaring M. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks.; 2020.","apa":"Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks.","chicago":"Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.","mla":"Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020.","bibtex":"@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }"},"_id":"20495","date_updated":"2022-01-06T06:54:27Z","date_created":"2020-11-25T07:03:16Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Jochmaring","full_name":"Jochmaring, Moritz","first_name":"Moritz"}],"user_id":"15504","title":"A self stabilizing protocol for well-formed trees in hybrid networks"},{"ddc":["000"],"user_id":"23538","abstract":[{"text":"We consider the problem of computing shortest paths in \\emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.\r\n","lang":"eng"}],"date_created":"2020-12-16T10:20:18Z","status":"public","has_accepted_license":"1","file_date_updated":"2020-12-16T10:18:50Z","publication":"Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)","author":[{"id":"23538","last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","id":"32229","last_name":"Hinnenthal"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"file_name":"Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf","date_created":"2020-12-16T10:18:50Z","access_level":"closed","file_id":"20756","creator":"mfeldma2","file_size":867373,"success":1,"relation":"main_file","date_updated":"2020-12-16T10:18:50Z","content_type":"application/pdf"}],"_id":"20755","citation":{"ieee":"M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020.","short":"M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","mla":"Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.","bibtex":"@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31}, booktitle={Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}, year={2020} }","ama":"Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31","apa":"Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31","chicago":"Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31."},"year":"2020","type":"conference","title":"Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs","external_id":{"arxiv":["2007.01191"]},"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"79"}],"doi":"10.4230/LIPIcs.OPODIS.2020.31","date_updated":"2022-01-06T06:54:36Z","language":[{"iso":"eng"}]},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2020-08-20T07:40:58Z","publisher":"Universität Paderborn","author":[{"full_name":"Skowronek, Michael","first_name":"Michael","last_name":"Skowronek"}],"department":[{"_id":"79"}],"user_id":"477","title":"Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"year":"2020","type":"bachelorsthesis","citation":{"short":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.","ieee":"M. Skowronek, Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.","chicago":"Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.","apa":"Skowronek, M. (2020). Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn.","ama":"Skowronek M. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn; 2020.","mla":"Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.","bibtex":"@book{Skowronek_2020, title={Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität Paderborn}, author={Skowronek, Michael}, year={2020} }"},"_id":"18066","date_updated":"2022-01-06T06:53:25Z"},{"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"year":"2020","type":"dissertation","citation":{"chicago":"Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020. https://doi.org/10.17619/UNIPB/1-1026.","ama":"Setzer A. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn; 2020. doi:10.17619/UNIPB/1-1026","apa":"Setzer, A. (2020). Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1026","mla":"Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-1026.","bibtex":"@book{Setzer_2020, title={Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks}, DOI={10.17619/UNIPB/1-1026}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }","short":"A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks, Universität Paderborn, 2020.","ieee":"A. Setzer, Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020."},"doi":"10.17619/UNIPB/1-1026","date_updated":"2022-01-06T06:53:36Z","_id":"18520","date_created":"2020-08-28T06:50:29Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"publisher":"Universität Paderborn","user_id":"477","title":"Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks"},{"date_updated":"2022-01-06T06:53:50Z","_id":"18648","supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"mla":"Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.","bibtex":"@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}, publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }","chicago":"Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.","apa":"Guggenmos, A. (2020). Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn.","ama":"Guggenmos A. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn; 2020.","ieee":"A. Guggenmos, Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.","short":"A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen, Universität Paderborn, 2020."},"year":"2020","user_id":"477","title":"Algorithmen für selbststabilisierende Skip+-Delaunaygraphen","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2020-08-31T07:14:51Z","status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Guggenmos, Andreas","first_name":"Andreas","last_name":"Guggenmos"}],"publisher":"Universität Paderborn"},{"date_updated":"2022-01-06T06:52:58Z","_id":"16902","doi":"10.1145/3397190","language":[{"iso":"eng"}],"year":"2020","type":"journal_article","citation":{"ieee":"M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020.","short":"M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).","mla":"Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.","bibtex":"@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190}, journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian and Schmid, Stefan}, year={2020} }","chicago":"Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys, 2020. https://doi.org/10.1145/3397190.","apa":"Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190","ama":"Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190"},"abstract":[{"lang":"eng","text":"The maintenance of efficient and robust overlay networks is one\r\nof the most fundamental and reoccurring themes in networking.\r\nThis paper presents a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto preserve connectivity, review algorithms for the fundamental\r\nproblem of graph linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable topologies. \r\nWe also identify open problems and avenues for future research.\r\n"}],"user_id":"23538","title":"Survey on Algorithms for Self-Stabilizing Overlay Networks","publisher":"ACM","author":[{"last_name":"Feldmann","id":"23538","first_name":"Michael","full_name":"Feldmann, Michael"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"publication":"ACM Computing Surveys","department":[{"_id":"79"}],"status":"public","date_created":"2020-04-29T07:09:50Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"language":[{"iso":"eng"}],"type":"conference","year":"2020","citation":{"short":"M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.","ieee":"M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model,” in Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.","apa":"Feldmann, M., Khazraei, A., & Scheideler, C. (2020). Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM. https://doi.org/10.1145/3350755.3400246","ama":"Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246","chicago":"Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2020. https://doi.org/10.1145/3350755.3400246.","mla":"Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.” Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.","bibtex":"@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model}, DOI={10.1145/3350755.3400246}, booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei, Ardalan and Scheideler, Christian}, year={2020} }"},"date_updated":"2022-01-06T06:52:58Z","_id":"16903","doi":"10.1145/3350755.3400246","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"first_name":"Ardalan","full_name":"Khazraei, Ardalan","last_name":"Khazraei"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","department":[{"_id":"79"}],"publication":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","project":[{"_id":"96","name":"Algorithmen für programmierbare Materie in einem physiologischen Medium"}],"date_created":"2020-04-29T07:16:35Z","abstract":[{"text":"We consider the clock synchronization problem in the (discrete) beeping model: Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in \\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes such that they have the same value in any round.\r\nAs is standard in clock synchronization, we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing} solutions for the clock synchronization problem: We first show lower bounds of $\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$ bits of memory required for any such protocol.\r\nAfterwards we present a protocol that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$ bits at each node, which is asymptotically optimal with regards to both, runtime and memory requirements.","lang":"eng"}],"external_id":{"arxiv":["2005.07388"]},"user_id":"23538","title":"Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model"},{"date_updated":"2022-01-06T06:52:32Z","_id":"15770","year":"2020","type":"mastersthesis","citation":{"ieee":"D. Warner, On the complexity of local transformations in SDN overlays. Universität Paderborn, 2020.","short":"D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität Paderborn, 2020.","bibtex":"@book{Warner_2020, title={On the complexity of local transformations in SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020} }","mla":"Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020.","ama":"Warner D. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn; 2020.","apa":"Warner, D. (2020). On the complexity of local transformations in SDN overlays. Universität Paderborn.","chicago":"Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020."},"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"On the complexity of local transformations in SDN overlays","user_id":"477","author":[{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel"}],"publisher":"Universität Paderborn","department":[{"_id":"79"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"date_created":"2020-02-04T13:47:02Z"},{"year":"2020","citation":{"short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.","apa":"Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM.","mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)}, publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian} }"},"type":"conference","language":[{"iso":"eng"}],"conference":{"location":"Kolkata, Indien","name":"21st International Conference on Distributed Computing and Networking ","start_date":"04.01.2020","end_date":"07.01.2020"},"_id":"15169","date_updated":"2022-01-06T06:52:16Z","publication":"Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN)","department":[{"_id":"63"},{"_id":"79"}],"author":[{"first_name":"Jannik","full_name":"Castenow, Jannik","last_name":"Castenow","id":"38705"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"ACM","publication_status":"accepted","date_created":"2019-11-25T12:18:41Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477"},{"status":"public","date_created":"2020-08-11T11:06:28Z","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"department":[{"_id":"79"}],"user_id":"15504","title":"Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}],"citation":{"short":"N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.","ieee":"N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems. 2019.","apa":"N., N. (2019). Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems.","ama":"N. N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems.; 2019.","chicago":"N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.","bibtex":"@book{N._2019, title={Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems}, author={N., N.}, year={2019} }","mla":"N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems. 2019."},"type":"mastersthesis","year":"2019","date_updated":"2022-01-06T06:53:20Z","_id":"17809"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","external_id":{"arxiv":["1805.03472"]},"language":[{"iso":"eng"}],"doi":"10.1145/3323165.3323193","date_updated":"2022-01-06T07:03:56Z","date_created":"2019-03-21T14:37:26Z","status":"public","has_accepted_license":"1","file":[{"file_name":"p287-feldmann.pdf","date_created":"2019-08-26T09:14:32Z","access_level":"closed","file_id":"12954","creator":"ups","file_size":1295095,"relation":"main_file","success":1,"date_updated":"2019-08-26T09:14:32Z","content_type":"application/pdf"}],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2019-08-26T09:14:32Z","publisher":"ACM","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"477","ddc":["004"],"abstract":[{"lang":"eng","text":"We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages."}],"page":"287--296","citation":{"ieee":"M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp. 287--296.","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.","mla":"Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.","bibtex":"@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }","ama":"Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296. doi:10.1145/3323165.3323193","apa":"Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 287--296). ACM. https://doi.org/10.1145/3323165.3323193","chicago":"Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193."},"year":"2019","type":"conference","_id":"8534"},{"citation":{"ieee":"J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79.","short":"J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.","bibtex":"@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }","mla":"Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.","chicago":"Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195.","ama":"Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195","apa":"Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., & Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195"},"type":"conference","year":"2019","page":"69--79","_id":"8871","has_accepted_license":"1","status":"public","date_created":"2019-04-10T08:20:34Z","file":[{"file_size":1275192,"creator":"ups","file_id":"12964","date_updated":"2019-08-26T11:17:58Z","content_type":"application/pdf","success":1,"relation":"main_file","date_created":"2019-08-26T11:17:58Z","file_name":"p69-augustine.pdf","access_level":"closed"}],"author":[{"last_name":"Augustine","full_name":"Augustine, John","first_name":"John"},{"last_name":"Ghaffari","full_name":"Ghaffari, Mohsen","first_name":"Mohsen"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"id":"32229","last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"},{"first_name":"Jason","full_name":"Li, Jason","last_name":"Li"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"ACM","publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","file_date_updated":"2019-08-26T11:17:58Z","user_id":"477","ddc":["004"],"language":[{"iso":"eng"}],"doi":"10.1145/3323165.3323195","date_updated":"2022-01-06T07:04:04Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"title":"Distributed Computation in Node-Capacitated Networks"},{"date_updated":"2022-01-06T07:03:25Z","language":[{"iso":"eng"}],"title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_status":"accepted","_id":"6976","conference":{"end_date":"24.05.19","name":"2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","start_date":"20.05.19","location":"Rio de Janeiro, Brazil"},"year":"2019","citation":{"ieee":"T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.","short":"T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.","bibtex":"@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE}, author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian} }","mla":"Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), IEEE.","chicago":"Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). IEEE, n.d.","apa":"Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil: IEEE.","ama":"Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). IEEE."},"type":"conference","abstract":[{"text":"We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes joining and leaving the network. We assume an adversary that may churn a\r\nconstant fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds. In particular, the adversary has an almost up-to-date information of\r\nthe network topology as it can observe an only slightly outdated topology that\r\nis at least $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction that new nodes can only join the network via nodes that have taken\r\npart in the network for at least one round.\r\n Our contributions are as follows: First, we show that it is impossible to\r\nmaintain a connected topology if adversary has up-to-date information about the\r\nnodes' connections. Further, we show that our restriction concerning the join\r\nis also necessary. As our main result present an algorithm that constructs a\r\nnew overlay- completely independent of all previous overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which will be maintained by the\r\nalgorithm. However, our approaches can be transferred to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval.","lang":"eng"}],"user_id":"34727","ddc":["000"],"file":[{"access_level":"closed","date_created":"2019-01-26T16:09:08Z","file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","content_type":"application/pdf","date_updated":"2019-01-26T16:09:08Z","relation":"main_file","success":1,"file_size":638020,"creator":"thgoette","file_id":"7007"}],"publisher":"IEEE","author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"last_name":"Vijayalakshmi","full_name":"Vijayalakshmi, Vipin Ravindran","first_name":"Vipin Ravindran"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2019-01-26T16:09:08Z","publication":"Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","status":"public","has_accepted_license":"1","date_created":"2019-01-24T18:53:11Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_status":"published","department":[{"_id":"79"}],"title":"On the Complexity of Local Graph Transformations","language":[{"iso":"eng"}],"series_title":"LIPIcs","doi":"10.4230/LIPICS.ICALP.2019.150","date_updated":"2022-01-06T06:50:45Z","status":"public","has_accepted_license":"1","date_created":"2019-07-08T17:19:01Z","volume":132,"file":[{"content_type":"application/pdf","date_updated":"2019-08-26T09:21:27Z","relation":"main_file","success":1,"file_size":537649,"creator":"ups","file_id":"12955","access_level":"closed","file_name":"LIPIcs-ICALP-2019-150.pdf","date_created":"2019-08-26T09:21:27Z"}],"publisher":"Dagstuhl Publishing","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"file_date_updated":"2019-08-26T09:21:27Z","user_id":"477","ddc":["004"],"abstract":[{"text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.","lang":"eng"}],"citation":{"apa":"Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14."},"type":"conference","year":"2019","page":"150:1--150:14","intvolume":" 132","_id":"10586","conference":{"end_date":"2019-07-12","location":"Patras, Greece","start_date":"2019-07-09","name":"ICALP 2019"}},{"title":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019","user_id":"477","editor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"}],"publication_identifier":{"isbn":["978-1-4503-6184-2"]},"status":"public","date_created":"2019-11-06T10:43:41Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"publisher":"ACM","department":[{"_id":"79"}],"doi":"10.1145/3323165","_id":"14829","date_updated":"2022-01-06T06:52:07Z","type":"conference_editor","year":"2019","citation":{"ama":"Scheideler C, Berenbrink P, eds. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM; 2019. doi:10.1145/3323165","apa":"Scheideler, C., & Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM. https://doi.org/10.1145/3323165","chicago":"Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019. https://doi.org/10.1145/3323165.","mla":"Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019, doi:10.1145/3323165.","bibtex":"@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}, DOI={10.1145/3323165}, publisher={ACM}, year={2019} }","short":"C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019.","ieee":"C. Scheideler and P. Berenbrink, Eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019."},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"page":"177-199","citation":{"ama":"Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4","apa":"Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4","chicago":"Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.","bibtex":"@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs}, volume={63}, DOI={10.1007/s00224-017-9823-4}, number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre, Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }","short":"R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.","ieee":"R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019."},"type":"journal_article","year":"2019","issue":"2","doi":"10.1007/s00224-017-9823-4","date_updated":"2022-01-06T06:52:07Z","_id":"14830","intvolume":" 63","date_created":"2019-11-06T10:54:58Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"status":"public","volume":63,"publication":"Theory Comput. Syst.","department":[{"_id":"79"}],"author":[{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"last_name":"Lefevre","first_name":"Jonas","full_name":"Lefevre, Jonas"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"user_id":"15504","title":"Self-Stabilizing Metric Graphs"},{"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","user_id":"477","status":"public","date_created":"2019-11-04T10:09:35Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"author":[{"full_name":"Castenow, Jannik","first_name":"Jannik","id":"38705","last_name":"Castenow"},{"last_name":"Kolb","id":"43647","first_name":"Christina","full_name":"Kolb, Christina"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)","department":[{"_id":"79"},{"_id":"63"}],"doi":"10.1007/978-3-030-24922-9\\_26","date_updated":"2022-01-06T06:52:00Z","_id":"14539","conference":{"location":"L'Aquila, Italy","name":"SIROCCO 2019","start_date":"2019-07-01","end_date":"2019-07-04"},"year":"2019","type":"conference","citation":{"mla":"Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9\\_26.","bibtex":"@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\\_26}, booktitle={Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina and Scheideler, Christian}, year={2019}, pages={345–348} }","chicago":"Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\\_26.","ama":"Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO). ; 2019:345-348. doi:10.1007/978-3-030-24922-9\\_26","apa":"Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\\_26","ieee":"J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), L’Aquila, Italy, 2019, pp. 345–348.","short":"J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348."},"page":"345-348","language":[{"iso":"eng"}]},{"user_id":"23538","ddc":["000"],"abstract":[{"text":"We consider congestion control in peer-to-peer distributed systems. \r\nThe problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \\emph{clients} in this paper) that want to send messages to a fixed common peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages per round and excess messages are dropped.\r\nThe server can modify these probabilities when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state. \r\nOur protocol lets the system converge from \\emph{any} initial state to a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)| \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$ rounds in expectation.\r\nIn particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.\r\nFinally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).\r\n","lang":"eng"}],"status":"public","has_accepted_license":"1","date_created":"2019-09-10T12:48:33Z","file":[{"access_level":"closed","date_created":"2019-09-11T11:20:16Z","file_name":"main.pdf","content_type":"application/pdf","date_updated":"2019-09-11T11:20:16Z","relation":"main_file","success":1,"file_size":428908,"file_id":"13188","creator":"mfeldma2"}],"author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"first_name":"Thorsten","full_name":"Götte, Thorsten","last_name":"Götte","id":"34727"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer, Cham","publication":"Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2019-09-11T11:20:16Z","_id":"13182","year":"2019","type":"conference","citation":{"ieee":"M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory,” in Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2019, pp. 149–164.","short":"M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.","mla":"Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13.","bibtex":"@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}, DOI={https://doi.org/10.1007/978-3-030-34992-9_13}, booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164}, collection={Lecture Notes in Computer Science} }","ama":"Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164. doi:https://doi.org/10.1007/978-3-030-34992-9_13","apa":"Feldmann, M., Götte, T., & Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 149–164). Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_13","chicago":"Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-34992-9_13."},"page":"149-164","title":"A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory","external_id":{"arxiv":["1909.04544"]},"project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"79"}],"doi":"https://doi.org/10.1007/978-3-030-34992-9_13","date_updated":"2022-01-06T06:51:30Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"_id":"10271","date_updated":"2022-01-06T06:50:33Z","type":"mastersthesis","year":"2019","citation":{"ama":"N. N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn; 2019.","apa":"N., N. (2019). Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn.","chicago":"N., N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019.","mla":"N., N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019.","bibtex":"@book{N._2019, title={Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N., N.}, year={2019} }","short":"N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves, Universität Paderborn, 2019.","ieee":"N. N., Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019."},"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"title":"Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves","user_id":"477","publisher":"Universität Paderborn","author":[{"full_name":"N., N.","first_name":"N.","last_name":"N."}],"department":[{"_id":"79"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"date_created":"2019-06-19T11:31:38Z"},{"doi":"10.4230/LIPICS.DISC.2019.23","date_updated":"2022-01-06T06:51:41Z","_id":"13652","citation":{"mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }","ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: 33rd International Symposium on Distributed Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23","apa":"Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23","chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23.","ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019."},"year":"2019","type":"conference","language":[{"iso":"eng"}],"title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","user_id":"32229","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2019-10-08T11:53:38Z","author":[{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Struijs","first_name":"Martijn","full_name":"Struijs, Martijn"}],"publication":"33rd International Symposium on Distributed Computing (DISC 2019)","department":[{"_id":"79"}]},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:16Z","doi":"10.1145/3210377.3210399","department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"publication_status":"accepted","publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","year":"2018","type":"conference","citation":{"ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399","apa":"Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien. https://doi.org/10.1145/3210377.3210399","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d. https://doi.org/10.1145/3210377.3210399.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien."},"_id":"3422","conference":{"location":"Wien","start_date":"2018-07-16","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","end_date":"2018-07-18"},"author":[{"last_name":"Robinson","first_name":"Peter","full_name":"Robinson, Peter"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"id":"11108","last_name":"Setzer","full_name":"Setzer, Alexander","first_name":"Alexander"}],"keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"file_date_updated":"2018-10-31T13:30:40Z","publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T13:30:40Z","creator":"asetzer","file_id":"5215","file_size":1675407,"access_level":"closed","file_name":"p173-robinson.pdf","date_created":"2018-10-31T13:30:40Z"}],"has_accepted_license":"1","status":"public","date_created":"2018-07-04T08:55:45Z","abstract":[{"lang":"eng","text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes."}],"ddc":["040"],"user_id":"11108"},{"type":"conference_editor","citation":{"ieee":"C. Scheideler and J. T. Fineman, Eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.","short":"C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018.","bibtex":"@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018} }","mla":"Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.","chicago":"Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.","ama":"Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM; 2018.","apa":"Scheideler, C., & Fineman, J. T. (Eds.). (2018). Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. Vienna, Austria: ACM."},"year":"2018","conference":{"location":"Vienna, Austria"},"_id":"3874","date_updated":"2022-01-06T06:59:47Z","department":[{"_id":"79"}],"publisher":"ACM","date_created":"2018-08-10T10:03:47Z","status":"public","publication_identifier":{"isbn":["978-1-4503-5799-9"]},"editor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Fineman","full_name":"Fineman, Jeremy T.","first_name":"Jeremy T."}],"user_id":"15504","title":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"},{"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2018-01-31T06:04:03Z","publisher":"Universität Paderborn","author":[{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"}],"department":[{"_id":"79"}],"user_id":"477","title":"Distributed Algorithms for Overlay Networks and Programmable Matter","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"year":"2018","citation":{"short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","ieee":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018.","ama":"Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265","apa":"Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265","chicago":"Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.","mla":"Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={10.17619/UNIPB/1-265}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }"},"type":"dissertation","doi":"10.17619/UNIPB/1-265","_id":"1138","date_updated":"2022-01-06T06:51:00Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"},{"_id":"66"}],"title":"Self-Stabilizing Supervised Publish-Subscribe Systems","external_id":{"arxiv":["1710.08128"]},"language":[{"iso":"eng"}],"doi":"10.1109/IPDPS.2018.00114","date_updated":"2022-01-06T06:51:05Z","date_created":"2018-02-01T13:56:01Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-10-31T13:25:37Z","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"author":[{"last_name":"Feldmann","id":"23538","first_name":"Michael","full_name":"Feldmann, Michael"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"publisher":"IEEE","file":[{"file_name":"08425258.pdf","date_created":"2018-10-31T13:25:37Z","access_level":"closed","creator":"mfeldma2","file_id":"5211","file_size":239559,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-10-31T13:25:37Z"}],"ddc":["040"],"user_id":"11319","abstract":[{"lang":"eng","text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n"}],"type":"conference","year":"2018","citation":{"bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.","apa":"Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00114","ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018."},"conference":{"start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","location":"Vancouver","end_date":"2018-5-24"},"_id":"1163"},{"date_updated":"2022-01-06T06:51:05Z","doi":"10.1109/IPDPS.2018.00113","language":[{"iso":"eng"}],"external_id":{"arxiv":["1802.07504"]},"title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"conference":{"end_date":"2018-5-24","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","location":"Vancouver"},"_id":"1164","type":"conference","year":"2018","citation":{"chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.","apa":"Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE. https://doi.org/10.1109/IPDPS.2018.00113","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113}, booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018."},"abstract":[{"lang":"eng","text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests."}],"user_id":"23538","ddc":["040"],"file":[{"file_name":"08425257.pdf","date_created":"2018-10-31T13:29:26Z","access_level":"closed","file_id":"5212","creator":"mfeldma2","file_size":218420,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T13:29:26Z"}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","file_date_updated":"2018-10-31T13:29:26Z","author":[{"id":"23538","last_name":"Feldmann","full_name":"Feldmann, Michael","first_name":"Michael"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Setzer","id":"11108","first_name":"Alexander","full_name":"Setzer, Alexander"}],"publisher":"IEEE","date_created":"2018-02-01T14:00:36Z","status":"public","has_accepted_license":"1"},{"title":"On the runtime of universal coating for programmable matter","user_id":"11319","status":"public","date_created":"2018-03-27T06:23:58Z","author":[{"full_name":"J. Daymude, Joshua","first_name":"Joshua","last_name":"J. Daymude"},{"last_name":"Derakhshandeh","first_name":"Zahra","full_name":"Derakhshandeh, Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"last_name":"Porter","full_name":"Porter, Alexandra","first_name":"Alexandra"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"department":[{"_id":"79"},{"_id":"66"}],"publication":"Natural Computing","doi":"10.1007/s11047-017-9658-6","issue":"1","_id":"1796","date_updated":"2022-01-06T06:53:24Z","type":"journal_article","citation":{"ieee":"J. J. Daymude et al., “On the runtime of universal coating for programmable matter,” Natural Computing, no. 1, pp. 81--96, 2018.","short":"J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96.","bibtex":"@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018, title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6}, number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }","mla":"J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.","chicago":"J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1 (2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.","ama":"J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6","apa":"J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6"},"year":"2018","page":"81--96","language":[{"iso":"eng"}]},{"year":"2018","citation":{"short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","ieee":"N. N., Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn, 2018.","apa":"N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.","ama":"N. N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn; 2018.","chicago":"N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.","bibtex":"@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={N., N.}, year={2018} }","mla":"N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018."},"type":"bachelorsthesis","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"_id":"18030","date_updated":"2022-01-06T06:53:25Z","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_created":"2020-08-18T08:44:22Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"publisher":"Universität Paderborn","department":[{"_id":"79"}],"title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","user_id":"477"},{"year":"2018","citation":{"mla":"N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz. 2018.","bibtex":"@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im Gitternetz}, author={N., N.}, year={2018} }","ama":"N. N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz.; 2018.","apa":"N., N. (2018). Gathering Strategien für mobile Roboterschwärme im Gitternetz.","chicago":"N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.","ieee":"N. N., Gathering Strategien für mobile Roboterschwärme im Gitternetz. 2018.","short":"N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018."},"type":"bachelorsthesis","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"_id":"18031","date_updated":"2022-01-06T06:53:25Z","department":[{"_id":"79"}],"author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2020-08-18T08:45:09Z","status":"public","title":"Gathering Strategien für mobile Roboterschwärme im Gitternetz","user_id":"15504"},{"_id":"18032","date_updated":"2022-01-06T06:53:25Z","supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"year":"2018","citation":{"short":"N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.","ieee":"N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles. 2018.","apa":"N., N. (2018). Decontaminating Planar Regions with Finite Automaton Robots and Tiles.","ama":"N. N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles.; 2018.","chicago":"N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.","bibtex":"@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton Robots and Tiles}, author={N., N.}, year={2018} }","mla":"N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles. 2018."},"type":"bachelorsthesis","user_id":"15504","title":"Decontaminating Planar Regions with Finite Automaton Robots and Tiles","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"department":[{"_id":"79"}],"status":"public","date_created":"2020-08-18T08:45:53Z"},{"user_id":"477","title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-08-18T08:46:50Z","status":"public","department":[{"_id":"79"}],"author":[{"full_name":"Wulfes, Robin","first_name":"Robin","last_name":"Wulfes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","_id":"18033","supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"ieee":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.","short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","mla":"Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","chicago":"Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn.","ama":"Wulfes R. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn; 2018."},"year":"2018"},{"language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018, title={Forming Tile Shapes with Simple Robots}, DOI={10.1007/978-3-030-00030-1_8}, booktitle={Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}, publisher={Springer International Publishing}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}, pages={122–138} }","mla":"Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.” In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 122–38. Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-00030-1_8.","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple Robots. In: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming. Springer International Publishing; 2018:122-138. doi:10.1007/978-3-030-00030-1_8","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., & Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing. https://doi.org/10.1007/978-3-030-00030-1_8","ieee":"R. Gmyr et al., “Forming Tile Shapes with Simple Robots,” in Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 2018, pp. 122–138.","short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–138."},"year":"2018","type":"conference","page":"122-138","doi":"10.1007/978-3-030-00030-1_8","_id":"5764","date_updated":"2022-01-06T07:02:38Z","status":"public","date_created":"2018-11-19T15:35:45Z","publication_status":"published","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"full_name":"Kostitsyna, Irina","first_name":"Irina","last_name":"Kostitsyna"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"publisher":"Springer International Publishing","publication":"Proceedings of the 24th International Conference on DNA Computing and Molecular Programming","department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319","title":"Forming Tile Shapes with Simple Robots"},{"language":[{"iso":"eng"}],"year":"2018","type":"working_paper","citation":{"short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .","ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.","apa":"Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","mla":"Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.","bibtex":"@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander} }"},"_id":"5820","date_updated":"2022-01-06T07:02:43Z","file":[{"file_name":"draft-2018.pdf","date_created":"2018-12-31T09:55:30Z","access_level":"closed","file_id":"6435","creator":"jbobolz","file_size":470968,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-12-31T09:55:30Z"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"file_date_updated":"2018-12-31T09:55:30Z","author":[{"last_name":"Blömer","id":"23","first_name":"Johannes","full_name":"Blömer, Johannes"},{"full_name":"Bobolz, Jan","first_name":"Jan","id":"27207","last_name":"Bobolz"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"date_created":"2018-11-25T08:08:40Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","has_accepted_license":"1","publication_status":"draft","abstract":[{"lang":"eng","text":"In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks.\r\nFor this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes.\r\nIn our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. \r\nOur techniques are very general and can be used as a basis for future constructions with similar goals."}],"user_id":"27207","title":"Provably Anonymous Communication Based on Trusted Execution Environments","ddc":["000"]},{"intvolume":" 751","_id":"5984","citation":{"ieee":"C. Scheideler, “Preface,” Theor. Comput. Sci., vol. 751, p. 1, 2018.","short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","mla":"Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={10.1016/j.tcs.2018.11.004}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","chicago":"Scheideler, Christian. “Preface.” Theor. Comput. Sci. 751 (2018): 1. https://doi.org/10.1016/j.tcs.2018.11.004.","ama":"Scheideler C. Preface. Theor Comput Sci. 2018;751:1. doi:10.1016/j.tcs.2018.11.004","apa":"Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1. https://doi.org/10.1016/j.tcs.2018.11.004"},"year":"2018","type":"journal_article","page":"1","ddc":["040"],"user_id":"15504","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2019-01-11T10:20:16Z","publication":"Theor. Comput. Sci.","file":[{"access_level":"closed","date_created":"2019-01-11T10:20:16Z","file_name":"Preface.pdf","date_updated":"2019-01-11T10:20:16Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":112676,"file_id":"6620","creator":"florida"}],"alternative_title":["Special Issue of SIROCCO 2015"],"volume":751,"has_accepted_license":"1","status":"public","date_created":"2018-11-30T08:08:23Z","date_updated":"2022-01-06T07:02:49Z","doi":"10.1016/j.tcs.2018.11.004","language":[{"iso":"eng"}],"title":"Preface","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"_id":"5985","date_updated":"2022-01-06T07:02:49Z","doi":"10.1145/3229774.3229781","language":[{"iso":"eng"}],"page":"1-2","year":"2018","type":"conference","citation":{"ieee":"C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.","short":"C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.","mla":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2, doi:10.1145/3229774.3229781.","bibtex":"@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={10.1145/3229774.3229781}, booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }","chicago":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 1–2, 2018. https://doi.org/10.1145/3229774.3229781.","ama":"Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018. ; 2018:1-2. doi:10.1145/3229774.3229781","apa":"Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018 (pp. 1–2). https://doi.org/10.1145/3229774.3229781"},"user_id":"477","ddc":["004"],"title":"Relays: Towards a Link Layer for Robust and Secure Fog Computing","file":[{"access_level":"closed","file_name":"p1-scheideler.pdf","date_created":"2018-12-12T15:12:02Z","date_updated":"2018-12-12T15:12:02Z","content_type":"application/pdf","relation":"main_file","file_size":1420210,"creator":"ups","file_id":"6194"}],"publication":"Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018","department":[{"_id":"79"}],"file_date_updated":"2018-12-12T15:12:02Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-11-30T08:11:27Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"status":"public","has_accepted_license":"1"},{"title":"Shape Recognition by a Finite Automaton Robot","user_id":"15504","date_created":"2018-11-30T08:13:58Z","status":"public","department":[{"_id":"79"}],"publication":"43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK","author":[{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","id":"32229"},{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"last_name":"Rudolph","full_name":"Rudolph, Dorian","first_name":"Dorian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"doi":"10.4230/LIPIcs.MFCS.2018.52","_id":"5986","date_updated":"2022-01-06T07:02:49Z","page":"52:1-52:15","type":"conference","year":"2018","citation":{"short":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, in: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.","ieee":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler, “Shape Recognition by a Finite Automaton Robot,” in 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.” In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.52.","ama":"Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape Recognition by a Finite Automaton Robot. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK. ; 2018:52:1-52:15. doi:10.4230/LIPIcs.MFCS.2018.52","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., & Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15). https://doi.org/10.4230/LIPIcs.MFCS.2018.52","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018, title={Shape Recognition by a Finite Automaton Robot}, DOI={10.4230/LIPIcs.MFCS.2018.52}, booktitle={43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}, author={Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}, year={2018}, pages={52:1-52:15} }","mla":"Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52."},"language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T07:01:02Z","doi":"10.1007/978-3-030-03232-6_1","series_title":"Lecture Notes of Computer Science","language":[{"iso":"eng"}],"external_id":{"arxiv":["1809.04923"]},"title":"A Self-Stabilizing Hashed Patricia Trie","department":[{"_id":"63"},{"_id":"79"}],"editor":[{"first_name":"Taisuke","full_name":"Izumi, Taisuke","last_name":"Izumi"},{"last_name":"Kuznetsov","first_name":"Petr","full_name":"Kuznetsov, Petr"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4411","intvolume":" 11201","conference":{"end_date":"2018-11-07","location":"Tokyo","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2018-11-04"},"type":"conference","year":"2018","citation":{"apa":"Knollmann, T., & Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi & P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_1","ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:10.1007/978-3-030-03232-6_1","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_1.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={10.1007/978-3-030-03232-6_1}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann, Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors}, year={2018}, collection={Lecture Notes of Computer Science} }","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.","short":"T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Tokyo, 2018, vol. 11201."},"abstract":[{"lang":"eng","text":"While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures.\r\nConsidering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact.\r\nIn this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys."}],"ddc":["000"],"user_id":"39241","publisher":"Springer, Cham","author":[{"first_name":"Till","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-11-02T14:38:37Z","keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"file":[{"file_size":500005,"file_id":"5277","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T14:38:37Z","relation":"main_file","success":1,"file_name":"ASelf-stabilizingHashedPatrici.pdf","date_created":"2018-11-02T14:38:37Z","access_level":"closed"}],"volume":11201,"status":"public","has_accepted_license":"1","date_created":"2018-09-17T13:12:18Z"},{"date_updated":"2022-01-06T07:01:11Z","language":[{"iso":"eng"}],"title":"Competitive Routing in Hybrid Communication Networks","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"department":[{"_id":"63"},{"_id":"79"}],"conference":{"end_date":"2018-08-24","start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","location":"Helsinki"},"_id":"4563","citation":{"chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018."},"year":"2018","type":"conference","ddc":["000"],"user_id":"38705","abstract":[{"text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n","lang":"eng"}],"date_created":"2018-10-02T07:06:05Z","has_accepted_license":"1","status":"public","file_date_updated":"2019-01-11T10:32:38Z","keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","publisher":"Springer","author":[{"id":"37827","last_name":"Jung","full_name":"Jung, Daniel","first_name":"Daniel"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Jannik","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","id":"38705"}],"file":[{"content_type":"application/pdf","date_updated":"2019-01-11T10:32:38Z","success":1,"relation":"main_file","file_size":349034,"file_id":"6621","creator":"ups","access_level":"closed","date_created":"2019-01-11T10:32:38Z","file_name":"23hybrid.pdf"}]},{"ddc":["000"],"user_id":"38705","author":[{"id":"37827","last_name":"Jung","full_name":"Jung, Daniel","first_name":"Daniel"},{"first_name":"Christina","full_name":"Kolb, Christina","last_name":"Kolb","id":"43647"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"38705","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"publisher":"ACM Press","file_date_updated":"2018-11-02T13:48:10Z","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"relation":"main_file","success":1,"date_updated":"2018-11-02T13:48:10Z","content_type":"application/pdf","creator":"ups","file_id":"5254","file_size":1025077,"access_level":"closed","date_created":"2018-11-02T13:48:10Z","file_name":"p231-jung-1.pdf"}],"has_accepted_license":"1","status":"public","date_created":"2018-10-02T07:34:47Z","_id":"4565","conference":{"end_date":"2018-07-18","name":"SPAA'18","start_date":"2018-07-17","location":"Wien"},"year":"2018","type":"conference","citation":{"bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.","apa":"Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018."},"title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","department":[{"_id":"63"},{"_id":"79"}],"publication_identifier":{"isbn":["9781450357999"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"date_updated":"2022-01-06T07:01:12Z","doi":"10.1145/3210377.3210663","language":[{"iso":"eng"}]},{"title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","external_id":{"arxiv":["1808.10300"]},"publication_identifier":{"unknown":["978-3-030-03231-9"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"doi":"10.1007/978-3-030-03232-6_2","date_updated":"2022-01-06T07:00:58Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","ddc":["040"],"user_id":"23538","abstract":[{"text":"\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n","lang":"eng"}],"volume":11201,"date_created":"2018-09-04T14:15:39Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-10-31T13:24:17Z","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","publisher":"Springer, Cham","author":[{"full_name":"Feldmann, Michael","first_name":"Michael","id":"23538","last_name":"Feldmann"},{"id":"43647","last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file":[{"file_id":"5210","creator":"mfeldma2","file_size":329823,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2018-10-31T13:24:17Z","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","date_created":"2018-10-31T13:24:17Z","access_level":"closed"}],"_id":"4351","intvolume":" 11201","page":"16-31 ","type":"conference","year":"2018","citation":{"short":"M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.","ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31.","apa":"Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_2.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }"}},{"_id":"4375","conference":{"end_date":"2018-08-21","location":"Helsinki","start_date":"2018-08-20","name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)"},"type":"conference","citation":{"ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018.","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={10.1007/978-3-030-19759-9_4}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.","ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4."},"year":"2018","abstract":[{"text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers.","lang":"eng"}],"ddc":["000"],"user_id":"14955","author":[{"last_name":"Benter","first_name":"Markus","full_name":"Benter, Markus"},{"first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","last_name":"Knollmann","id":"39241"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"},{"first_name":"Jannik","full_name":"Sundermeier, Jannik","last_name":"Sundermeier","id":"38705"}],"file_date_updated":"2018-11-27T10:03:33Z","keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","file":[{"access_level":"closed","date_created":"2018-11-27T10:03:33Z","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","relation":"main_file","success":1,"date_updated":"2018-11-27T10:03:33Z","content_type":"application/pdf","file_id":"5863","creator":"tillk","file_size":1122875}],"status":"public","has_accepted_license":"1","date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","doi":"10.1007/978-3-030-19759-9_4","language":[{"iso":"eng"}],"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}]},{"citation":{"chicago":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.","apa":"Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16","ama":"Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018. doi:10.1007/978-3-030-03232-6_16","bibtex":"@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian and Setzer, Alexander}, year={2018} }","mla":"Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018, doi:10.1007/978-3-030-03232-6_16.","short":"C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.","ieee":"C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018."},"year":"2018","type":"conference","conference":{"name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","location":"Tokyo, Japan"},"_id":"5216","date_created":"2018-10-31T13:33:05Z","status":"public","has_accepted_license":"1","file":[{"file_id":"5223","creator":"asetzer","file_size":369818,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-10-31T16:09:48Z","file_name":"Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf","date_created":"2018-10-31T15:51:45Z","access_level":"closed"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file_date_updated":"2018-10-31T16:09:48Z","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"id":"11108","last_name":"Setzer","full_name":"Setzer, Alexander","first_name":"Alexander"}],"user_id":"11108","ddc":["040"],"abstract":[{"lang":"eng","text":"A fundamental problem for overlay networks is to safely exclude leaving nodes, i.e., the nodes requesting to leave the overlay network are excluded from it without affecting its connectivity. To rigorously study self-stabilizing solutions to this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the FDP we are given a network of processes in an arbitrary state, and the goal is to eventually arrive at (and stay in) a state in which all leaving processes irrevocably decided to leave the system while for all weakly-connected components in the initial overlay network, all staying processes in that component will still form a weakly connected component. In the standard interconnection model, the FDP is known to be unsolvable by local control protocols, so oracles have been investigated that allow the problem to be solved [9]. To avoid the use of oracles, we introduce a new interconnection model based on relays. Despite the relay model appearing to be rather restrictive, we show that it is universal, i.e., it is possible to transform any weakly-connected topology into any other weakly-connected topology, which is important for being a useful interconnection model for overlay networks. Apart from this, our model allows processes to grant and revoke access rights, which is why we believe it to be of interest beyond the scope of this paper. We show how to implement the relay layer in a self-stabilizing way and identify properties protocols need to satisfy so that the relay layer can recover while serving protocol requests."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-03232-6_16","date_updated":"2022-01-06T07:01:47Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_status":"published","department":[{"_id":"79"}],"title":"Relays: A New Approach for the Finite Departure Problem in Overlay Networks"},{"date_updated":"2022-01-06T07:01:47Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"On Underlay-Aware Self-Stabilizing Overlay Networks","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"conference":{"location":"Tokyo, Japan","name":" 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)"},"intvolume":" 11201","_id":"5222","page":"50-64","citation":{"ieee":"T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018, vol. 11201, pp. 50–64.","short":"T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.","mla":"Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64.","bibtex":"@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte, Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64}, collection={Lecture Notes in Computer Science} }","chicago":"Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.","apa":"Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.","ama":"Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay Networks. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture Notes in Computer Science. Springer; 2018:50-64."},"year":"2018","type":"conference","ddc":["040"],"user_id":"477","abstract":[{"lang":"eng","text":"We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. "}],"volume":11201,"date_created":"2018-10-31T15:44:30Z","has_accepted_license":"1","status":"public","publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)","file_date_updated":"2018-10-31T15:59:26Z","publisher":"Springer","author":[{"first_name":"Thorsten","full_name":"Götte, Thorsten","last_name":"Götte","id":"34727"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"file":[{"access_level":"closed","date_created":"2018-10-31T15:59:26Z","file_name":"sss18_camera.pdf","content_type":"application/pdf","date_updated":"2018-10-31T15:59:26Z","relation":"main_file","success":1,"file_size":367812,"creator":"thgoette","file_id":"5224"}]},{"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"bachelorsthesis","citation":{"short":"M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","ieee":"M. Jochmaring, Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn, 2018.","apa":"Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.","ama":"Jochmaring M. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn; 2018.","chicago":"Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.","mla":"Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.","bibtex":"@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität Paderborn}, author={Jochmaring, Moritz}, year={2018} }"},"year":"2018","_id":"5368","date_updated":"2022-01-06T07:01:50Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2018-11-06T06:21:37Z","status":"public","department":[{"_id":"79"}],"publisher":"Universität Paderborn","author":[{"full_name":"Jochmaring, Moritz","first_name":"Moritz","last_name":"Jochmaring"}],"user_id":"477","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten"},{"user_id":"15504","abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.","lang":"eng"}],"volume":31,"status":"public","date_created":"2018-08-10T07:05:12Z","publisher":"Springer Nature","author":[{"last_name":"Ogierman","full_name":"Ogierman, Adrian","first_name":"Adrian"},{"last_name":"Richa","first_name":"Andrea","full_name":"Richa, Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publication":"Distributed Computing","issue":"3","_id":"3872","intvolume":" 31","type":"journal_article","citation":{"ieee":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp. 241–254, 2017.","short":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254.","bibtex":"@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1}, number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2017}, pages={241–254} }","mla":"Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.","apa":"Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3), 241–254. https://doi.org/10.1007/s00446-017-0307-1","ama":"Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1","chicago":"Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing 31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1."},"year":"2017","page":"241-254","title":"Sade: competitive MAC under adversarial SINR","publication_status":"published","publication_identifier":{"issn":["0178-2770","1432-0452"]},"department":[{"_id":"79"}],"doi":"10.1007/s00446-017-0307-1","date_updated":"2022-01-06T06:59:47Z"},{"type":"bachelorsthesis","year":"2017","citation":{"short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","ieee":"M. Burkhardt, Untersuchungen zum Cone-Hashing. Universität Paderborn, 2017.","chicago":"Burkhardt, Michél . Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017.","ama":"Burkhardt M. Untersuchungen Zum Cone-Hashing. Universität Paderborn; 2017.","apa":"Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michél }, year={2017} }","mla":"Burkhardt, Michél. Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017."},"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:25Z","_id":"18026","department":[{"_id":"79"}],"author":[{"last_name":"Burkhardt","first_name":"Michél ","full_name":"Burkhardt, Michél "}],"publisher":"Universität Paderborn","date_created":"2020-08-18T08:39:19Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","title":"Untersuchungen zum Cone-Hashing","user_id":"477"},{"user_id":"477","title":"An Asynchronous Adaption of a Churn-resistant Overlay Network","status":"public","date_created":"2020-08-18T08:40:19Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publisher":"Universität Paderborn","author":[{"last_name":"Banh","full_name":"Banh, Ngoc Chi","first_name":"Ngoc Chi"}],"department":[{"_id":"79"}],"date_updated":"2022-01-06T06:53:25Z","_id":"18027","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","year":"2017","citation":{"ieee":"N. C. Banh, An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn, 2017.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }","mla":"Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn, 2017.","apa":"Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn.","ama":"Banh NC. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn; 2017."}},{"date_created":"2020-08-18T08:41:42Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","department":[{"_id":"79"}],"author":[{"last_name":"Schenk","first_name":"Andreas","full_name":"Schenk, Andreas"}],"publisher":"Universität Paderborn","title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","user_id":"477","type":"bachelorsthesis","year":"2017","citation":{"short":"A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.","ieee":"A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn, 2017.","chicago":"Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.","ama":"Schenk A. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn; 2017.","apa":"Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn.","mla":"Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }"},"language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2022-01-06T06:53:25Z","_id":"18028"},{"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"citation":{"chicago":"Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.","ama":"Beckendorf B. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn; 2017.","apa":"Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn.","mla":"Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.","bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","ieee":"B. Beckendorf, Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn, 2017."},"year":"2017","type":"bachelorsthesis","_id":"18029","date_updated":"2022-01-06T06:53:25Z","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-08-18T08:42:36Z","publisher":"Universität Paderborn","author":[{"last_name":"Beckendorf","first_name":"Björn","full_name":"Beckendorf, Björn"}],"department":[{"_id":"79"}],"user_id":"477","title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme"},{"language":[{"iso":"eng"}],"type":"journal_article","citation":{"ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” Inf. Comput., pp. 408--424, 2017.","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.","bibtex":"@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006}, journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }","mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006.","apa":"Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for the finite departure problem in overlay networks. Inf Comput. 2017:408--424. doi:10.1016/j.ic.2016.12.006"},"year":"2017","page":"408--424","_id":"1812","date_updated":"2022-01-06T06:53:26Z","doi":"10.1016/j.ic.2016.12.006","author":[{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"publication":"Inf. Comput.","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-27T11:23:36Z","user_id":"15504","title":"Towards a universal approach for the finite departure problem in overlay networks"},{"title":"Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271","user_id":"15504","author":[{"last_name":"P. Fekete","first_name":"Sandor","full_name":"P. Fekete, Sandor"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"first_name":"Kay","full_name":"Römer, Kay","last_name":"Römer"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"SIGACT News","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-27T11:24:15Z","date_updated":"2022-01-06T06:53:26Z","_id":"1813","doi":"10.1145/3106700.3106713","issue":"2","year":"2017","citation":{"ieee":"S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp. 87--94, 2017.","short":"S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.","mla":"P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.","bibtex":"@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713}, number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }","apa":"P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94. https://doi.org/10.1145/3106700.3106713","ama":"P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94. doi:10.1145/3106700.3106713","chicago":"P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713."},"type":"journal_article","page":"87--94"},{"status":"public","date_created":"2018-03-27T11:24:57Z","author":[{"last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra","first_name":"Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","id":"11319"}],"department":[{"_id":"79"}],"publication":"Theor. Comput. Sci.","user_id":"15504","title":"Universal coating for programmable matter","language":[{"iso":"eng"}],"year":"2017","citation":{"bibtex":"@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039}, journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={56--68} }","mla":"Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039.","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68. https://doi.org/10.1016/j.tcs.2016.02.039","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68, 2017.","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor. Comput. Sci. (2017) 56--68."},"type":"journal_article","page":"56--68","doi":"10.1016/j.tcs.2016.02.039","date_updated":"2022-01-06T06:53:26Z","_id":"1814"},{"title":"Improved Leader Election for Self-organizing Programmable Matter","user_id":"15504","date_created":"2018-03-27T11:25:58Z","status":"public","publication":"Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers","department":[{"_id":"79"}],"author":[{"full_name":"J. Daymude, Joshua","first_name":"Joshua","last_name":"J. Daymude"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"doi":"10.1007/978-3-319-72751-6_10","date_updated":"2022-01-06T06:53:26Z","_id":"1815","page":"127--140","citation":{"bibtex":"@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={127--140} }","mla":"J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.","apa":"J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10","ama":"J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader Election for Self-organizing Programmable Matter. In: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers. ; 2017:127--140. doi:10.1007/978-3-319-72751-6_10","chicago":"J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable Matter.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10.","ieee":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Improved Leader Election for Self-organizing Programmable Matter,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.","short":"J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140."},"type":"conference","year":"2017","language":[{"iso":"eng"}]},{"doi":"10.1145/3087556","date_updated":"2022-01-06T06:53:27Z","_id":"1820","year":"2017","type":"conference_editor","citation":{"short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017.","ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. 2017.","chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017. https://doi.org/10.1145/3087556.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017.; 2017. doi:10.1145/3087556","apa":"Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. https://doi.org/10.1145/3087556","bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={10.1145/3087556}, year={2017} }","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. 2017, doi:10.1145/3087556."},"title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","user_id":"15504","editor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Taghi Hajiaghayi","full_name":"Taghi Hajiaghayi, Mohammad","first_name":"Mohammad"}],"publication_identifier":{"isbn":["978-1-4503-4593-4"]},"status":"public","date_created":"2018-03-27T11:29:10Z","department":[{"_id":"79"}]},{"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"citation":{"ieee":"L. Luo, MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn, 2017.","short":"L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained, Universität Paderborn, 2017.","mla":"Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.","bibtex":"@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2017} }","chicago":"Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.","apa":"Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn.","ama":"Luo L. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn; 2017."},"year":"2017","type":"mastersthesis","_id":"81","date_updated":"2022-01-06T07:03:50Z","publisher":"Universität Paderborn","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"}],"department":[{"_id":"79"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:41:07Z","user_id":"477","title":"MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained"},{"year":"2017","citation":{"bibtex":"@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017}, DOI={10.1145/3087556}, publisher={ACM}, year={2017} }","mla":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017, doi:10.1145/3087556.","chicago":"Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017. https://doi.org/10.1145/3087556.","ama":"Scheideler C, Taghi Hajiaghayi M, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM; 2017. doi:10.1145/3087556","apa":"Scheideler, C., & Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM. https://doi.org/10.1145/3087556","ieee":"C. Scheideler and M. Taghi Hajiaghayi, Eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017.","short":"C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, ACM, 2017."},"type":"conference_editor","language":[{"iso":"eng"}],"doi":"10.1145/3087556","_id":"5980","date_updated":"2022-01-06T07:02:48Z","publication_identifier":{"isbn":["978-1-4503-4593-4"]},"editor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Taghi Hajiaghayi","first_name":"Mohammad","full_name":"Taghi Hajiaghayi, Mohammad"}],"date_created":"2018-11-29T10:23:12Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","department":[{"_id":"7"},{"_id":"79"}],"publisher":"ACM","title":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017","user_id":"477"},{"type":"dissertation","citation":{"mla":"Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-150.","bibtex":"@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems}, DOI={10.17619/UNIPB/1-150}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017} }","apa":"Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-150","ama":"Strothmann TF. Self-* Algorithms for Distributed Systems. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-150","chicago":"Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-150.","ieee":"T. F. Strothmann, Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017.","short":"T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn, 2017."},"year":"2017","supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"_id":"61","date_updated":"2022-01-06T07:02:52Z","doi":"10.17619/UNIPB/1-150","author":[{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"publisher":"Universität Paderborn","department":[{"_id":"79"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:41:03Z","title":"Self-* Algorithms for Distributed Systems","user_id":"477"},{"supervisor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"language":[{"iso":"eng"}],"citation":{"short":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.","ieee":"J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.","ama":"Sundermeier J. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn; 2017.","apa":"Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn.","chicago":"Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.","mla":"Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.","bibtex":"@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität Paderborn}, author={Sundermeier, Jannik}, year={2017} }"},"type":"mastersthesis","year":"2017","_id":"699","date_updated":"2022-01-06T07:03:25Z","department":[{"_id":"79"}],"publisher":"Universität Paderborn","author":[{"id":"38705","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"date_created":"2017-11-14T08:03:45Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","user_id":"38705","title":"Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions"},{"user_id":"477","title":"A Self-Stabilizing Protocol for Graphs of Diameter Two","department":[{"_id":"79"}],"author":[{"full_name":"Knollmann, Till","first_name":"Till","last_name":"Knollmann"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-11-14T08:04:35Z","status":"public","_id":"700","date_updated":"2022-01-06T07:03:26Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"language":[{"iso":"eng"}],"year":"2017","citation":{"ama":"Knollmann T. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn; 2017.","apa":"Knollmann, T. (2017). A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn.","chicago":"Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.","bibtex":"@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017} }","mla":"Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.","short":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität Paderborn, 2017.","ieee":"T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017."},"type":"mastersthesis"},{"_id":"701","date_updated":"2022-01-06T07:03:26Z","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"type":"mastersthesis","year":"2017","citation":{"short":"T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn, 2017.","ieee":"T. Götte, Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.","chicago":"Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.","apa":"Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn.","ama":"Götte T. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn; 2017.","mla":"Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.","bibtex":"@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität Paderborn}, author={Götte, Thorsten}, year={2017} }"},"user_id":"477","title":"Self-Stabilizing Spanners for Tree Metrics","status":"public","date_created":"2017-11-14T09:32:39Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","author":[{"id":"34727","last_name":"Götte","full_name":"Götte, Thorsten","first_name":"Thorsten"}],"department":[{"_id":"79"}]},{"author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"publication":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)","file_date_updated":"2018-03-13T09:23:11Z","file":[{"access_level":"closed","file_name":"105-ICALP17-GHSS.pdf","date_created":"2018-03-13T09:23:11Z","relation":"main_file","success":1,"date_updated":"2018-03-13T09:23:11Z","content_type":"application/pdf","file_id":"1207","creator":"florida","file_size":504161}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:12Z","abstract":[{"text":"We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.","lang":"eng"}],"ddc":["040"],"user_id":"20792","citation":{"ieee":"R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.","short":"R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring of Network Properties: The Power of Hybrid Networks}, DOI={10.4230/LIPIcs.ICALP.2017.137}, booktitle={Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.","ama":"Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137","apa":"Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137","chicago":"Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137."},"type":"conference","year":"2017","page":"137:1--137:15","_id":"105","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"title":"Distributed Monitoring of Network Properties: The Power of Hybrid Networks","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:42Z","doi":"10.4230/LIPIcs.ICALP.2017.137"},{"doi":"10.1007/978-3-319-69084-1_17","date_updated":"2022-01-06T06:51:19Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"A Self-Stabilizing General De Bruijn Graph","external_id":{"arxiv":["1708.06542"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publication_identifier":{"isbn":["978-3-319-69083-4"]},"publication_status":"published","department":[{"_id":"79"}],"_id":"125","intvolume":" 10616","page":"250-264 ","year":"2017","type":"conference","citation":{"mla":"Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17.","bibtex":"@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616}, DOI={10.1007/978-3-319-69084-1_17}, booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture Notes in Computer Science} }","chicago":"Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-69084-1_17.","apa":"Feldmann, M., & Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_17","ama":"Feldmann M, Scheideler C. A Self-Stabilizing General De Bruijn Graph. In: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 10616. Lecture Notes in Computer Science. Springer, Cham; 2017:250-264. doi:10.1007/978-3-319-69084-1_17","ieee":"M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,” in Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264.","short":"M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2017, pp. 250–264."},"user_id":"23538","ddc":["040"],"abstract":[{"lang":"eng","text":"Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \\sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\\mathcal O(\\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\\mathcal O(\\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant."}],"date_created":"2017-10-17T12:41:16Z","has_accepted_license":"1","status":"public","volume":10616,"file":[{"file_size":311204,"file_id":"5214","creator":"mfeldma2","date_updated":"2018-10-31T13:30:13Z","content_type":"application/pdf","relation":"main_file","success":1,"file_name":"Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf","date_created":"2018-10-31T13:30:13Z","access_level":"closed"}],"file_date_updated":"2018-10-31T13:30:13Z","publication":"Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","author":[{"first_name":"Michael","full_name":"Feldmann, Michael","last_name":"Feldmann","id":"23538"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer, Cham"},{"_id":"215","year":"2016","citation":{"short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016. https://doi.org/10.1145/2935764.2935783.","apa":"Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427). https://doi.org/10.1145/2935764.2935783","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783","bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783."},"type":"conference","page":"417--427","abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"user_id":"14955","ddc":["040"],"file":[{"access_level":"closed","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","date_created":"2018-03-21T10:41:40Z","relation":"main_file","success":1,"date_updated":"2018-03-21T10:41:40Z","content_type":"application/pdf","creator":"florida","file_id":"1518","file_size":352996}],"author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","file_date_updated":"2018-03-21T10:41:40Z","has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:33Z","date_updated":"2022-01-06T06:55:02Z","doi":"10.1145/2935764.2935783","language":[{"iso":"eng"}],"title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"user_id":"15504","title":"Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem","author":[{"last_name":"Heuchler","full_name":"Heuchler, Sebastian","first_name":"Sebastian"}],"department":[{"_id":"79"}],"status":"public","date_created":"2020-08-18T08:38:22Z","date_updated":"2022-01-06T06:53:25Z","_id":"18025","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"citation":{"short":"S. Heuchler, Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.","ieee":"S. Heuchler, Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem. 2016.","apa":"Heuchler, S. (2016). Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem.","ama":"Heuchler S. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem.; 2016.","chicago":"Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.","bibtex":"@book{Heuchler_2016, title={Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}, author={Heuchler, Sebastian}, year={2016} }","mla":"Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem. 2016."},"type":"bachelorsthesis","year":"2016"},{"issue":"3","doi":"10.1109/TNET.2015.2410313","date_updated":"2022-01-06T06:53:29Z","_id":"1835","page":"1421--1433","year":"2016","citation":{"mla":"Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.","bibtex":"@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet: Towards Locally Self-Adjusting Networks}, DOI={10.1109/TNET.2015.2410313}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}, year={2016}, pages={1421--1433} }","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433. https://doi.org/10.1109/TNET.2015.2410313.","ama":"Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans Netw. 2016;(3):1421--1433. doi:10.1109/TNET.2015.2410313","apa":"Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., & Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433. https://doi.org/10.1109/TNET.2015.2410313","ieee":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw., no. 3, pp. 1421--1433, 2016.","short":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433."},"type":"journal_article","user_id":"15504","title":"SplayNet: Towards Locally Self-Adjusting Networks","date_created":"2018-03-27T12:40:24Z","status":"public","publication":"IEEE/ACM Trans. Netw.","department":[{"_id":"79"}],"author":[{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Avin","full_name":"Avin, Chen","first_name":"Chen"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Michael","full_name":"Borokhovich, Michael","last_name":"Borokhovich"},{"last_name":"Haeupler","full_name":"Haeupler, Bernhard","first_name":"Bernhard"},{"full_name":"Lotker, Zvi","first_name":"Zvi","last_name":"Lotker"}]},{"user_id":"15504","title":"On the Runtime of Universal Coating for Programmable Matter","date_created":"2018-03-27T12:41:45Z","status":"public","volume":9818,"publication_identifier":{"unknown":["978-3-319-43993-8"]},"publication":"DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings","department":[{"_id":"79"}],"author":[{"first_name":"Zahra","full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh"},{"last_name":"Gmyr","first_name":"Robert","full_name":"Gmyr, Robert"},{"full_name":"Porter, Alexandra","first_name":"Alexandra","last_name":"Porter"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Strothmann","id":"11319","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik"}],"doi":"10.1007/978-3-319-43994-5_10","date_updated":"2022-01-06T06:53:30Z","_id":"1836","intvolume":" 9818","language":[{"iso":"eng"}],"page":"148--164","year":"2016","citation":{"ieee":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F. Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, vol. 9818, pp. 148--164.","short":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, in: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016, series={Lecture Notes in Computer Science}, title={On the Runtime of Universal Coating for Programmable Matter}, volume={9818}, DOI={10.1007/978-3-319-43994-5_10}, booktitle={DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture Notes in Computer Science} }","mla":"Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016, pp. 148--164, doi:10.1007/978-3-319-43994-5_10.","apa":"Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164). https://doi.org/10.1007/978-3-319-43994-5_10","ama":"Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF. On the Runtime of Universal Coating for Programmable Matter. In: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings. Vol 9818. Lecture Notes in Computer Science. ; 2016:148--164. doi:10.1007/978-3-319-43994-5_10","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 9818:148--164. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-43994-5_10."},"type":"conference","series_title":"Lecture Notes in Computer Science"},{"publication_identifier":{"unknown":["978-1-4503-4210-0"]},"status":"public","date_created":"2018-03-27T12:44:09Z","publisher":"ACM","author":[{"full_name":"Derakhshandeh, Zahra","first_name":"Zahra","last_name":"Derakhshandeh"},{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","id":"11319"}],"department":[{"_id":"79"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","title":"Universal Shape Formation for Programmable Matter","user_id":"15504","year":"2016","type":"conference","citation":{"chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 289--299. ACM, 2016. https://doi.org/10.1145/2935764.2935784.","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299). ACM. https://doi.org/10.1145/2935764.2935784","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. ACM; 2016:289--299. doi:10.1145/2935764.2935784","mla":"Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299, doi:10.1145/2935764.2935784.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={10.1145/2935764.2935784}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={289--299} }","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299.","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016, pp. 289--299."},"page":"289--299","language":[{"iso":"eng"}],"doi":"10.1145/2935764.2935784","date_updated":"2022-01-06T06:53:30Z","_id":"1837"},{"date_updated":"2022-01-06T06:53:32Z","_id":"1844","doi":"10.1145/2935764","citation":{"ieee":"C. Scheideler and S. Gilbert, Eds., Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. 2016.","short":"C. Scheideler, S. Gilbert, eds., Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016.","mla":"Scheideler, Christian, and Seth Gilbert, editors. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. 2016, doi:10.1145/2935764.","bibtex":"@book{Scheideler_Gilbert_2016, title={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, DOI={10.1145/2935764}, year={2016} }","chicago":"Scheideler, Christian, and Seth Gilbert, eds. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016. https://doi.org/10.1145/2935764.","apa":"Scheideler, C., & Gilbert, S. (Eds.). (2016). Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016. https://doi.org/10.1145/2935764","ama":"Scheideler C, Gilbert S, eds. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016.; 2016. doi:10.1145/2935764"},"year":"2016","type":"conference_editor","user_id":"15504","title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","department":[{"_id":"79"}],"date_created":"2018-03-28T05:44:12Z","status":"public","publication_identifier":{"isbn":["978-1-4503-4210-0"]},"editor":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Gilbert, Seth","first_name":"Seth","last_name":"Gilbert"}]}]