{"ddc":["040"],"date_updated":"2022-01-06T07:02:17Z","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in *Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)*, 2013, pp. 165–176.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.","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={10.1007/978-3-319-03578-9_14}, 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.” *Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)*, 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In *Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)* (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In: *Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)*. Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” In *Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)*, 165–76. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-319-03578-9_14."},"status":"public","file_date_updated":"2018-03-15T10:24:40Z","title":"A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery","year":"2013","file":[{"date_updated":"2018-03-15T10:24:40Z","relation":"main_file","file_id":"1277","file_name":"564-SIROCCO13.pdf","creator":"florida","content_type":"application/pdf","date_created":"2018-03-15T10:24:40Z","file_size":168884,"access_level":"closed","success":1}],"_id":"564","type":"conference","page":"165-176","user_id":"15504","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-319-03578-9_14","department":[{"_id":"79"}],"abstract":[{"lang":"eng","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."}],"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"has_accepted_license":"1","date_created":"2017-10-17T12:42:42Z","publication":"Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]}