[{"type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"10271","language":[{"iso":"eng"}],"citation":{"chicago":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ieee":"N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","ama":"N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn; 2019.","short":"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} }","mla":"N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.","apa":"N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves</i>. Universität Paderborn."},"year":"2019","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2019-06-19T11:31:38Z","date_updated":"2022-01-06T06:50:33Z","publisher":"Universität Paderborn","title":"Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves"},{"year":"2019","citation":{"chicago":"Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.","ieee":"K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019.","ama":"Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In: <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. ; 2019. doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>","apa":"Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>. <a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>","bibtex":"@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>}, booktitle={33rd International Symposium on Distributed Computing (DISC 2019)}, author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, year={2019} }","short":"K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.","mla":"Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC 2019)</i>, 2019, doi:<a href=\"https://doi.org/10.4230/LIPICS.DISC.2019.23\">10.4230/LIPICS.DISC.2019.23</a>."},"title":"Fast Distributed Algorithms for LP-Type Problems of Low Dimension","doi":"10.4230/LIPICS.DISC.2019.23","date_updated":"2022-01-06T06:51:41Z","date_created":"2019-10-08T11:53:38Z","author":[{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Martijn","full_name":"Struijs, Martijn","last_name":"Struijs"}],"status":"public","type":"conference","publication":"33rd International Symposium on Distributed Computing (DISC 2019)","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"13652","user_id":"32229","department":[{"_id":"79"}]},{"publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"has_accepted_license":"1","publication_status":"accepted","citation":{"apa":"Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a href=\"https://doi.org/10.1145/3210377.3210399\">10.1145/3210377.3210399</a>","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, n.d. <a href=\"https://doi.org/10.1145/3210377.3210399\">https://doi.org/10.1145/3210377.3210399</a>.","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien."},"date_updated":"2022-01-06T06:59:16Z","author":[{"first_name":"Peter","full_name":"Robinson, Peter","last_name":"Robinson"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"doi":"10.1145/3210377.3210399","conference":{"end_date":"2018-07-18","location":"Wien","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","start_date":"2018-07-16"},"type":"conference","status":"public","_id":"3422","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"user_id":"11108","file_date_updated":"2018-10-31T13:30:40Z","year":"2018","date_created":"2018-07-04T08:55:45Z","title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","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."}],"file":[{"file_size":1675407,"access_level":"closed","file_name":"p173-robinson.pdf","file_id":"5215","date_updated":"2018-10-31T13:30:40Z","date_created":"2018-10-31T13:30:40Z","creator":"asetzer","success":1,"relation":"main_file","content_type":"application/pdf"}],"keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"ddc":["040"],"language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["978-1-4503-5799-9"]},"citation":{"apa":"Scheideler, C., &#38; Fineman, J. T. (Eds.). (2018). <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. Vienna, Austria: ACM.","mla":"Scheideler, Christian, and Jeremy T. Fineman, editors. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","bibtex":"@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018} }","short":"C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018.","ama":"Scheideler C, Fineman JT, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM; 2018.","ieee":"C. Scheideler and J. T. Fineman, Eds., <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018.","chicago":"Scheideler, Christian, and Jeremy T. Fineman, eds. <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures</i>. ACM, 2018."},"year":"2018","date_created":"2018-08-10T10:03:47Z","publisher":"ACM","date_updated":"2022-01-06T06:59:47Z","conference":{"location":"Vienna, Austria"},"title":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","type":"conference_editor","status":"public","editor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Jeremy T.","last_name":"Fineman","full_name":"Fineman, Jeremy T."}],"department":[{"_id":"79"}],"user_id":"15504","_id":"3874"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"1138","status":"public","type":"dissertation","doi":"10.17619/UNIPB/1-265","title":"Distributed Algorithms for Overlay Networks and Programmable Matter","author":[{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"}],"date_created":"2018-01-31T06:04:03Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:00Z","citation":{"ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>.","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }"},"year":"2018"},{"date_created":"2018-02-01T13:56:01Z","publisher":"IEEE","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","year":"2018","external_id":{"arxiv":["1710.08128"]},"language":[{"iso":"eng"}],"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"ddc":["040"],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5211","file_name":"08425258.pdf","access_level":"closed","file_size":239559,"date_created":"2018-10-31T13:25:37Z","creator":"mfeldma2","date_updated":"2018-10-31T13:25:37Z"}],"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"}],"author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"first_name":"Christina","full_name":"Kolb, Christina","id":"43647","last_name":"Kolb"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_updated":"2022-01-06T06:51:05Z","conference":{"location":"Vancouver","end_date":"2018-5-24","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"},"doi":"10.1109/IPDPS.2018.00114","has_accepted_license":"1","citation":{"ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>"},"department":[{"_id":"79"},{"_id":"66"}],"user_id":"11319","_id":"1163","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"file_date_updated":"2018-10-31T13:25:37Z","type":"conference","status":"public"},{"citation":{"ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>.","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>"},"has_accepted_license":"1","doi":"10.1109/IPDPS.2018.00113","conference":{"name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","end_date":"2018-5-24","location":"Vancouver"},"author":[{"first_name":"Michael","full_name":"Feldmann, Michael","id":"23538","last_name":"Feldmann"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"date_updated":"2022-01-06T06:51:05Z","status":"public","type":"conference","file_date_updated":"2018-10-31T13:29:26Z","department":[{"_id":"79"}],"user_id":"23538","_id":"1164","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"year":"2018","title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","date_created":"2018-02-01T14:00:36Z","publisher":"IEEE","file":[{"date_updated":"2018-10-31T13:29:26Z","date_created":"2018-10-31T13:29:26Z","creator":"mfeldma2","file_size":218420,"file_name":"08425257.pdf","file_id":"5212","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"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."}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","language":[{"iso":"eng"}],"ddc":["040"],"external_id":{"arxiv":["1802.07504"]}},{"status":"public","type":"journal_article","publication":"Natural Computing","language":[{"iso":"eng"}],"_id":"1796","user_id":"11319","department":[{"_id":"79"},{"_id":"66"}],"year":"2018","citation":{"apa":"J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. <i>Natural Computing</i>, (1), 81--96. <a href=\"https://doi.org/10.1007/s11047-017-9658-6\">https://doi.org/10.1007/s11047-017-9658-6</a>","bibtex":"@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018, title={On the runtime of universal coating for programmable matter}, DOI={<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>}, 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} }","short":"J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96.","mla":"J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” <i>Natural Computing</i>, no. 1, 2018, pp. 81--96, doi:<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>.","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.” <i>Natural Computing</i>, no. 1 (2018): 81--96. <a href=\"https://doi.org/10.1007/s11047-017-9658-6\">https://doi.org/10.1007/s11047-017-9658-6</a>.","ieee":"J. J. Daymude <i>et al.</i>, “On the runtime of universal coating for programmable matter,” <i>Natural Computing</i>, no. 1, pp. 81--96, 2018.","ama":"J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating for programmable matter. <i>Natural Computing</i>. 2018;(1):81--96. doi:<a href=\"https://doi.org/10.1007/s11047-017-9658-6\">10.1007/s11047-017-9658-6</a>"},"page":"81--96","issue":"1","title":"On the runtime of universal coating for programmable matter","doi":"10.1007/s11047-017-9658-6","date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Joshua","last_name":"J. Daymude","full_name":"J. Daymude, Joshua"},{"first_name":"Zahra","full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Alexandra","last_name":"Porter","full_name":"Porter, Alexandra"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann"}],"date_created":"2018-03-27T06:23:58Z"},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"18030","status":"public","type":"bachelorsthesis","title":"Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2020-08-18T08:44:22Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","citation":{"ieee":"N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn, 2018.","chicago":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn, 2018.","ama":"N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn; 2018.","short":"N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.","mla":"N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. 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} }","apa":"N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität Paderborn."},"year":"2018"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"18031","citation":{"chicago":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>, 2018.","ieee":"N. N., <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>. 2018.","ama":"N. N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>.; 2018.","mla":"N., N. <i>Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz</i>. 2018.","bibtex":"@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im Gitternetz}, author={N., N.}, year={2018} }","short":"N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.","apa":"N., N. (2018). <i>Gathering Strategien für mobile Roboterschwärme im Gitternetz</i>."},"year":"2018","title":"Gathering Strategien für mobile Roboterschwärme im Gitternetz","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2020-08-18T08:45:09Z","date_updated":"2022-01-06T06:53:25Z"},{"year":"2018","citation":{"apa":"N., N. (2018). <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.","bibtex":"@book{N._2018, title={Decontaminating Planar Regions with Finite Automaton Robots and Tiles}, author={N., N.}, year={2018} }","short":"N. N., Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.","mla":"N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>. 2018.","ama":"N. N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>.; 2018.","chicago":"N., N. <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>, 2018.","ieee":"N. N., <i>Decontaminating Planar Regions with Finite Automaton Robots and Tiles</i>. 2018."},"date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-18T08:45:53Z","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"title":"Decontaminating Planar Regions with Finite Automaton Robots and Tiles","type":"bachelorsthesis","status":"public","_id":"18032","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}]},{"title":"Load-Balanced Routing in Hybriden Kommunikationsnetzwerken","date_created":"2020-08-18T08:46:50Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Robin","full_name":"Wulfes, Robin","last_name":"Wulfes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:25Z","citation":{"chicago":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ieee":"R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","ama":"Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn; 2018.","bibtex":"@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken}, publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }","short":"R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität Paderborn, 2018.","mla":"Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn, 2018.","apa":"Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>. Universität Paderborn."},"year":"2018","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"18033","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","type":"bachelorsthesis"},{"status":"public","type":"conference","publication":"Proceedings of the 24th International Conference on DNA Computing and Molecular Programming","language":[{"iso":"eng"}],"user_id":"11319","department":[{"_id":"79"},{"_id":"66"}],"_id":"5764","citation":{"ama":"Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming Tile Shapes with Simple Robots. In: <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>. Springer International Publishing; 2018:122-138. doi:<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>","ieee":"R. Gmyr <i>et al.</i>, “Forming Tile Shapes with Simple Robots,” in <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, 2018, pp. 122–138.","chicago":"Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.” In <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, 122–38. Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">https://doi.org/10.1007/978-3-030-00030-1_8</a>.","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &#38; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i> (pp. 122–138). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">https://doi.org/10.1007/978-3-030-00030-1_8</a>","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2018, title={Forming Tile Shapes with Simple Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>}, 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.” <i>Proceedings of the 24th International Conference on DNA Computing and Molecular Programming</i>, Springer International Publishing, 2018, pp. 122–38, doi:<a href=\"https://doi.org/10.1007/978-3-030-00030-1_8\">10.1007/978-3-030-00030-1_8</a>.","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."},"page":"122-138","year":"2018","publication_status":"published","doi":"10.1007/978-3-030-00030-1_8","title":"Forming Tile Shapes with Simple Robots","author":[{"first_name":"Robert","last_name":"Gmyr","full_name":"Gmyr, Robert"},{"full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal","first_name":"Kristian"},{"first_name":"Irina","last_name":"Kostitsyna","full_name":"Kostitsyna, Irina"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","id":"11319","full_name":"Strothmann, Thim Frederik","last_name":"Strothmann"}],"date_created":"2018-11-19T15:35:45Z","publisher":"Springer International Publishing","date_updated":"2022-01-06T07:02:38Z"},{"type":"working_paper","abstract":[{"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.","lang":"eng"}],"status":"public","file":[{"file_id":"6435","file_name":"draft-2018.pdf","access_level":"closed","file_size":470968,"creator":"jbobolz","date_created":"2018-12-31T09:55:30Z","date_updated":"2018-12-31T09:55:30Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"_id":"5820","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"7"},{"_id":"64"},{"_id":"79"}],"user_id":"27207","ddc":["000"],"file_date_updated":"2018-12-31T09:55:30Z","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"draft","year":"2018","citation":{"ama":"Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","chicago":"Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>, n.d.","ieee":"J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>. .","apa":"Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>.","short":"J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.","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} }","mla":"Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>."},"date_updated":"2022-01-06T07:02:43Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"date_created":"2018-11-25T08:08:40Z","title":"Provably Anonymous Communication Based on Trusted Execution Environments"},{"status":"public","type":"journal_article","alternative_title":["Special Issue of SIROCCO 2015"],"file_date_updated":"2019-01-11T10:20:16Z","user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"5984","citation":{"mla":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018, p. 1, doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>.","bibtex":"@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>}, journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1} }","short":"C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.","apa":"Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>","ama":"Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">10.1016/j.tcs.2018.11.004</a>","chicago":"Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018): 1. <a href=\"https://doi.org/10.1016/j.tcs.2018.11.004\">https://doi.org/10.1016/j.tcs.2018.11.004</a>.","ieee":"C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018."},"intvolume":"       751","page":"1","has_accepted_license":"1","doi":"10.1016/j.tcs.2018.11.004","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"volume":751,"date_updated":"2022-01-06T07:02:49Z","file":[{"file_size":112676,"file_id":"6620","file_name":"Preface.pdf","access_level":"closed","date_updated":"2019-01-11T10:20:16Z","date_created":"2019-01-11T10:20:16Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Theor. Comput. Sci.","language":[{"iso":"eng"}],"ddc":["040"],"year":"2018","title":"Preface","date_created":"2018-11-30T08:08:23Z"},{"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","type":"conference","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-12-12T15:12:02Z","date_created":"2018-12-12T15:12:02Z","creator":"ups","file_size":1420210,"file_id":"6194","file_name":"p1-scheideler.pdf","access_level":"closed"}],"department":[{"_id":"79"}],"user_id":"477","_id":"5985","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-12T15:12:02Z","ddc":["004"],"has_accepted_license":"1","page":"1-2","citation":{"ieee":"C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,” in <i>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</i>, 2018, pp. 1–2.","chicago":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” In <i>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</i>, 1–2, 2018. <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>.","ama":"Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing. In: <i>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</i>. ; 2018:1-2. doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>","mla":"Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” <i>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</i>, 2018, pp. 1–2, doi:<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>.","bibtex":"@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for Robust and Secure Fog Computing}, DOI={<a href=\"https://doi.org/10.1145/3229774.3229781\">10.1145/3229774.3229781</a>}, 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} }","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.","apa":"Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. In <i>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</i> (pp. 1–2). <a href=\"https://doi.org/10.1145/3229774.3229781\">https://doi.org/10.1145/3229774.3229781</a>"},"year":"2018","date_created":"2018-11-30T08:11:27Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T07:02:49Z","doi":"10.1145/3229774.3229781","title":"Relays: Towards a Link Layer for Robust and Secure Fog Computing"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"5986","status":"public","type":"conference","publication":"43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK","doi":"10.4230/LIPIcs.MFCS.2018.52","title":"Shape Recognition by a Finite Automaton Robot","date_created":"2018-11-30T08:13:58Z","author":[{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229","first_name":"Kristian"},{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"first_name":"Fabian","last_name":"Kuhn","full_name":"Kuhn, Fabian"},{"full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T07:02:49Z","citation":{"ama":"Gmyr R, Hinnenthal K, Kostitsyna I, Kuhn F, Rudolph D, Scheideler C. Shape Recognition by a Finite Automaton Robot. In: <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>. ; 2018:52:1-52:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>","ieee":"R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, and C. Scheideler, “Shape Recognition by a Finite Automaton Robot,” in <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 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 <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 52:1-52:15, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>.","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.","bibtex":"@inproceedings{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_2018, title={Shape Recognition by a Finite Automaton Robot}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>}, 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.” <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i>, 2018, pp. 52:1-52:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">10.4230/LIPIcs.MFCS.2018.52</a>.","apa":"Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &#38; Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In <i>43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK</i> (pp. 52:1-52:15). <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2018.52\">https://doi.org/10.4230/LIPIcs.MFCS.2018.52</a>"},"page":"52:1-52:15","year":"2018"},{"series_title":"Lecture Notes of Computer Science","user_id":"39241","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4411","file_date_updated":"2018-11-02T14:38:37Z","type":"conference","status":"public","editor":[{"last_name":"Izumi","full_name":"Izumi, Taisuke","first_name":"Taisuke"},{"last_name":"Kuznetsov","full_name":"Kuznetsov, Petr","first_name":"Petr"}],"author":[{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"volume":11201,"date_updated":"2022-01-06T07:01:02Z","doi":"10.1007/978-3-030-03232-6_1","conference":{"start_date":"2018-11-04","name":"20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","location":"Tokyo","end_date":"2018-11-07"},"has_accepted_license":"1","citation":{"ama":"Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes of Computer Science. Springer, Cham; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>","ieee":"T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>.","apa":"Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201). Tokyo: Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">https://doi.org/10.1007/978-3-030-03232-6_1</a>","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>.","bibtex":"@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_1\">10.1007/978-3-030-03232-6_1</a>}, 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} }","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."},"intvolume":"     11201","external_id":{"arxiv":["1809.04923"]},"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Self-Stabilizing","Prefix Search","Distributed Data Structure"],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"date_updated":"2018-11-02T14:38:37Z","creator":"ups","date_created":"2018-11-02T14:38:37Z","file_size":500005,"access_level":"closed","file_name":"ASelf-stabilizingHashedPatrici.pdf","file_id":"5277","content_type":"application/pdf","success":1,"relation":"main_file"}],"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."}],"date_created":"2018-09-17T13:12:18Z","publisher":"Springer, Cham","title":"A Self-Stabilizing Hashed Patricia Trie","year":"2018"},{"conference":{"location":"Helsinki","end_date":"2018-08-24","start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) "},"title":"Competitive Routing in Hybrid Communication Networks","author":[{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"first_name":"Christina","last_name":"Kolb","id":"43647","full_name":"Kolb, Christina"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Jannik","last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705"}],"date_created":"2018-10-02T07:06:05Z","date_updated":"2022-01-06T07:01:11Z","publisher":"Springer","citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","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} }","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 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.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018.","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018."},"year":"2018","has_accepted_license":"1","file_date_updated":"2019-01-11T10:32:38Z","language":[{"iso":"eng"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"ddc":["000"],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"38705","_id":"4563","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-01-11T10:32:38Z","date_created":"2019-01-11T10:32:38Z","creator":"ups","file_size":349034,"access_level":"closed","file_name":"23hybrid.pdf","file_id":"6621"}],"abstract":[{"lang":"eng","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"}],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","type":"conference"},{"publisher":"ACM Press","date_updated":"2022-01-06T07:01:12Z","author":[{"id":"37827","full_name":"Jung, Daniel","last_name":"Jung","first_name":"Daniel"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Jannik","id":"38705","full_name":"Sundermeier, Jannik","last_name":"Sundermeier"}],"date_created":"2018-10-02T07:34:47Z","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","conference":{"name":"SPAA'18","start_date":"2018-07-17","end_date":"2018-07-18","location":"Wien"},"doi":"10.1145/3210377.3210663","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"year":"2018","citation":{"ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, 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.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","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.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4565","user_id":"38705","department":[{"_id":"63"},{"_id":"79"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:48:10Z","type":"conference","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"date_updated":"2018-11-02T13:48:10Z","creator":"ups","date_created":"2018-11-02T13:48:10Z","file_size":1025077,"access_level":"closed","file_id":"5254","file_name":"p231-jung-1.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public"}]