[{"date_updated":"2022-02-15T07:41:00Z","publication_status":"published","author":[{"id":"38705","full_name":"Castenow, Jannik","first_name":"Jannik","last_name":"Castenow"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"issn":["0890-5401"]},"year":"2022","status":"public","title":"A Discrete and Continuous Study of the Max-Chain-Formation Problem","doi":"10.1016/j.ic.2022.104877","user_id":"38705","_id":"29843","language":[{"iso":"eng"}],"publisher":"Elsevier BV","article_number":"104877","project":[{"name":"Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme","_id":"106"}],"citation":{"short":"J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, Information and Computation (2022).","ama":"Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>","chicago":"Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>.","bibtex":"@article{Castenow_Kling_Knollmann_Meyer auf der Heide_2022, title={A Discrete and Continuous Study of the Max-Chain-Formation Problem}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>}, number={104877}, journal={Information and Computation}, publisher={Elsevier BV}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till and Meyer auf der Heide, Friedhelm}, year={2022} }","mla":"Castenow, Jannik, et al. “A Discrete and Continuous Study of the Max-Chain-Formation Problem.” <i>Information and Computation</i>, 104877, Elsevier BV, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>.","apa":"Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. <i>Information and Computation</i>, Article 104877. <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">https://doi.org/10.1016/j.ic.2022.104877</a>","ieee":"J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “A Discrete and Continuous Study of the Max-Chain-Formation Problem,” <i>Information and Computation</i>, Art. no. 104877, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2022.104877\">10.1016/j.ic.2022.104877</a>."},"publication":"Information and Computation","department":[{"_id":"63"}],"keyword":["Computational Theory and Mathematics","Computer Science Applications","Information Systems","Theoretical Computer Science"],"type":"journal_article","date_created":"2022-02-15T07:38:28Z"},{"publication":"Information and Computation","citation":{"apa":"Knollmann, T., &#38; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>, Article 104697. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>","ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” <i>Information and Computation</i>, Art. no. 104697, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>.","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 104697, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }"},"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."}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2021-01-29T09:39:40Z","type":"journal_article","department":[{"_id":"63"},{"_id":"79"}],"year":"2022","title":"A self-stabilizing Hashed Patricia Trie","status":"public","publication_identifier":{"issn":["0890-5401"]},"author":[{"full_name":"Knollmann, Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","first_name":"Till","id":"39241"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2023-03-27T07:56:48Z","publication_status":"published","article_number":"104697","language":[{"iso":"eng"}],"_id":"21096","doi":"10.1016/j.ic.2021.104697","user_id":"15504"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-15T11:20:09Z","publication":"Information and Computation","citation":{"mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” <i>Information and Computation</i>, 1997, pp. 103–20, doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>. 1997:103-120. doi:<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={<a href=\"https://doi.org/10.1006/inco.1997.2642\">10.1006/inco.1997.2642</a>}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. <i>Information and Computation</i>, 103–120. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” <i>Information and Computation</i>, pp. 103–120, 1997.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” <i>Information and Computation</i>, 1997, 103–20. <a href=\"https://doi.org/10.1006/inco.1997.2642\">https://doi.org/10.1006/inco.1997.2642</a>."},"user_id":"15415","doi":"10.1006/inco.1997.2642","page":"103-120","_id":"16565","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","status":"public","year":"1997","title":"Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"issn":["0890-5401"]}},{"publication":"Information and Computation","citation":{"chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” <i>Information and Computation</i>, pp. 196–217, 1993.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. <i>Information and Computation</i>, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>","bibtex":"@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel Dictionary}, DOI={<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>}, journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1993}, pages={196–217} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. <i>Information and Computation</i>. 1993:196-217. doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, pp. 196–217, doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>."},"date_created":"2020-04-20T10:31:51Z","type":"journal_article","department":[{"_id":"63"}],"year":"1993","status":"public","title":"An Optimal Parallel Dictionary","author":[{"first_name":"M.","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M."},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","page":"196-217","_id":"16729","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1006/inco.1993.1007"},{"user_id":"15415","doi":"10.1016/0890-5401(88)90031-4","language":[{"iso":"eng"}],"_id":"16763","page":"99-107","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Babai, László","last_name":"Babai","first_name":"László"},{"first_name":"Bettina","last_name":"Just","full_name":"Just, Bettina"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0890-5401"]},"title":"On the limits of computations with the floor function","status":"public","year":"1988","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-21T08:50:17Z","citation":{"short":"L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988) 99–107.","ama":"Babai L, Just B, Meyer auf der Heide F. On the limits of computations with the floor function. <i>Information and Computation</i>. 1988:99-107. doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>","chicago":"Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>.","bibtex":"@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations with the floor function}, DOI={<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>}, journal={Information and Computation}, author={Babai, László and Just, Bettina and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }","apa":"Babai, L., Just, B., &#38; Meyer auf der Heide, F. (1988). On the limits of computations with the floor function. <i>Information and Computation</i>, 99–107. <a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">https://doi.org/10.1016/0890-5401(88)90031-4</a>","mla":"Babai, László, et al. “On the Limits of Computations with the Floor Function.” <i>Information and Computation</i>, 1988, pp. 99–107, doi:<a href=\"https://doi.org/10.1016/0890-5401(88)90031-4\">10.1016/0890-5401(88)90031-4</a>.","ieee":"L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations with the floor function,” <i>Information and Computation</i>, pp. 99–107, 1988."},"publication":"Information and Computation"}]