{"department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publication":"Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)","citation":{"ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In: <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>. Lecture Notes in Computer Science. ; 2013:165-176. doi:<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>}, booktitle={Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture Notes in Computer Science} }","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 2013, pp. 165–76, doi:<a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">10.1007/978-3-319-03578-9_14</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” In <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 165–76. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">https://doi.org/10.1007/978-3-319-03578-9_14</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 165–176). <a href=\"https://doi.org/10.1007/978-3-319-03578-9_14\">https://doi.org/10.1007/978-3-319-03578-9_14</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in <i>Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>, 2013, pp. 165–176."},"doi":"10.1007/978-3-319-03578-9_14","ddc":["040"],"has_accepted_license":"1","file":[{"file_size":168884,"file_id":"1277","success":1,"content_type":"application/pdf","date_updated":"2018-03-15T10:24:40Z","file_name":"564-SIROCCO13.pdf","date_created":"2018-03-15T10:24:40Z","creator":"florida","access_level":"closed","relation":"main_file"}],"series_title":"Lecture Notes in Computer Science","file_date_updated":"2018-03-15T10:24:40Z","abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds.","lang":"eng"}],"status":"public","date_created":"2017-10-17T12:42:42Z","user_id":"15504","year":"2013","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792","first_name":"Christian"}],"_id":"564","title":"A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery","date_updated":"2022-01-06T07:02:17Z","page":"165-176","type":"conference"}