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