[{"citation":{"short":"C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.","chicago":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” In <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, 5556:571--582. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">https://doi.org/10.1007/978-3-642-02930-1_47</a>.","apa":"Scheideler, C., &#38; Schmid, S. (2009). A Distributed and Oblivious Heap. In <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i> (Vol. 5556, pp. 571--582). Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">https://doi.org/10.1007/978-3-642-02930-1_47</a>","ieee":"C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, 2009, vol. 5556, pp. 571--582.","ama":"Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>. Vol 5556. Lecture Notes in Computer Science. Springer; 2009:571--582. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>","bibtex":"@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>}, booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer}, author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, vol. 5556, Springer, 2009, pp. 571--582, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>."},"publication":"Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II","date_created":"2018-03-29T09:08:14Z","department":[{"_id":"79"}],"type":"conference","publication_identifier":{"isbn":["978-3-642-02929-5"]},"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"title":"A Distributed and Oblivious Heap","status":"public","year":"2009","intvolume":"      5556","date_updated":"2022-01-06T06:54:01Z","_id":"1929","publisher":"Springer","series_title":"Lecture Notes in Computer Science","page":"571--582","volume":5556,"user_id":"15504","doi":"10.1007/978-3-642-02930-1_47"},{"oa":"1","citation":{"ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local Delaunay Graph Construction. In: <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>. Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>","bibtex":"@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction}, volume={5878}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>}, booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer Science} }","mla":"Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.” <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, vol. 5878, Springer, 2009, pp. 771--780, doi:<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.” In <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">https://doi.org/10.1007/978-3-642-10631-6_78</a>.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.","apa":"Jacob, R., Ritscher, S., Scheideler, C., &#38; Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i> (Vol. 5878, pp. 771--780). Springer. <a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">https://doi.org/10.1007/978-3-642-10631-6_78</a>","ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and Local Delaunay Graph Construction,” in <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, 2009, vol. 5878, pp. 771--780."},"file_date_updated":"2018-04-13T10:05:53Z","_id":"1930","publisher":"Springer","urn":"19304","page":"771--780","volume":5878,"ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1","date_created":"2018-03-29T09:12:59Z","file":[{"creator":"florida","date_created":"2018-04-13T10:05:53Z","file_name":"isaac09.pdf","access_level":"open_access","file_size":139275,"relation":"main_file","date_updated":"2018-04-13T10:05:53Z","file_id":"2342","content_type":"application/pdf"}],"department":[{"_id":"79"}],"type":"conference","publication":"Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-10631-6_78","author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"full_name":"Ritscher, Stephan","last_name":"Ritscher","first_name":"Stephan"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"year":"2009","title":"A Self-stabilizing and Local Delaunay Graph Construction","intvolume":"      5878","date_updated":"2022-01-06T06:54:02Z"},{"publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","citation":{"apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i> (pp. 131--140). <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>","ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140.","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 131--140, 2009. <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>.","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140, doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>. ; 2009:131--140. doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }"},"date_created":"2018-03-29T09:16:22Z","type":"conference","department":[{"_id":"79"}],"status":"public","year":"2009","title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","author":[{"last_name":"Jacob","first_name":"Riko","full_name":"Jacob, Riko"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Täubig","first_name":"Hanjo","full_name":"Täubig, Hanjo"}],"publication_identifier":{"isbn":["978-1-60558-396-9"]},"date_updated":"2022-01-06T06:54:02Z","page":"131--140","_id":"1932","doi":"10.1145/1582716.1582741","user_id":"15504"},{"user_id":"15504","doi":"10.1145/1583991.1584064","page":"300--309","_id":"1933","date_updated":"2022-01-06T06:54:02Z","title":"A DoS-resilient information system for dynamic data management","status":"public","year":"2009","publication_identifier":{"isbn":["978-1-60558-606-9"]},"author":[{"full_name":"Baumgart, Matthias","first_name":"Matthias","last_name":"Baumgart"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T09:18:06Z","publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","citation":{"ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 2009, pp. 300--309.","apa":"Baumgart, M., Scheideler, C., &#38; Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i> (pp. 300--309). <a href=\"https://doi.org/10.1145/1583991.1584064\">https://doi.org/10.1145/1583991.1584064</a>","chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 300--309, 2009. <a href=\"https://doi.org/10.1145/1583991.1584064\">https://doi.org/10.1145/1583991.1584064</a>.","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 2009, pp. 300--309, doi:<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>.","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>. ; 2009:300--309. doi:<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>"}},{"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T09:19:17Z","publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","citation":{"ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, 2009, vol. 5873, pp. 781--782.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i> (Vol. 5873, pp. 781--782). Springer. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">https://doi.org/10.1007/978-3-642-05118-0_58</a>","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” In <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, 5873:781--782. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">https://doi.org/10.1007/978-3-642-05118-0_58</a>.","mla":"Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, vol. 5873, Springer, 2009, pp. 781--782, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture Notes in Computer Science}, title={Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}, volume={5873}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture Notes in Computer Science} }","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In: <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>. Vol 5873. Lecture Notes in Computer Science. Springer; 2009:781--782. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>"},"user_id":"15504","doi":"10.1007/978-3-642-05118-0_58","volume":5873,"page":"781--782","_id":"1934","series_title":"Lecture Notes in Computer Science","publisher":"Springer","date_updated":"2022-01-06T06:54:02Z","intvolume":"      5873","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","year":"2009","status":"public","author":[{"last_name":"Gall","first_name":"Dominik","full_name":"Gall, Dominik"},{"full_name":"Jacob, Riko","first_name":"Riko","last_name":"Jacob"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Hanjo","last_name":"Täubig","full_name":"Täubig, Hanjo"}],"publication_identifier":{"isbn":["978-3-642-05117-3"]}},{"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T09:20:44Z","publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","citation":{"chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>.","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, 2009, vol. 09371.","apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i> (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>","bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices}, volume={09371}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings} }","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>."},"doi":"10.1145/1989493.1989516","user_id":"15504","volume":"09371","_id":"1935","series_title":"Dagstuhl Seminar Proceedings","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","date_updated":"2022-01-06T06:54:02Z","intvolume":"      9371","status":"public","title":"Stabilizing Consensus with the Power of Two Choices","year":"2009","author":[{"full_name":"Doerr, Benjamin","last_name":"Doerr","first_name":"Benjamin"},{"last_name":"Ann Goldberg","first_name":"Leslie","full_name":"Ann Goldberg, Leslie"},{"full_name":"Minder, Lorenz","last_name":"Minder","first_name":"Lorenz"},{"full_name":"Sauerwald, Thomas","first_name":"Thomas","last_name":"Sauerwald"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-29T09:01:31Z","citation":{"bibtex":"@inproceedings{Scheideler_W. Richa_Santi_2008, title={An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model}, DOI={<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>}, booktitle={Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008}, publisher={ACM}, author={Scheideler, Christian and W. Richa, Andr{\\’{e}}a and Santi, Paolo}, year={2008}, pages={91--100} }","ama":"Scheideler C, W. Richa A, Santi P. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>. ACM; 2008:91--100. doi:<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>","mla":"Scheideler, Christian, et al. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.” <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, ACM, 2008, pp. 91--100, doi:<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>.","chicago":"Scheideler, Christian, Andr{\\’{e}}a W. Richa, and Paolo Santi. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.” In <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, 91--100. ACM, 2008. <a href=\"https://doi.org/10.1145/1374618.1374632\">https://doi.org/10.1145/1374618.1374632</a>.","short":"C. Scheideler, A. W. Richa, P. Santi, in: Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, ACM, 2008, pp. 91--100.","ieee":"C. Scheideler, A. W. Richa, and P. Santi, “An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model,” in <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, 2008, pp. 91--100.","apa":"Scheideler, C., W. Richa, A., &#38; Santi, P. (2008). An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i> (pp. 91--100). ACM. <a href=\"https://doi.org/10.1145/1374618.1374632\">https://doi.org/10.1145/1374618.1374632</a>"},"publication":"Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008","doi":"10.1145/1374618.1374632","user_id":"15504","_id":"1926","publisher":"ACM","page":"91--100","date_updated":"2022-01-06T06:54:00Z","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a","last_name":"W. Richa"},{"last_name":"Santi","first_name":"Paolo","full_name":"Santi, Paolo"}],"publication_identifier":{"isbn":["978-1-60558-073-9"]},"title":"An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model","status":"public","year":"2008"},{"department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-29T09:28:22Z","citation":{"ieee":"C. Scheideler, “Algorithms for Overlay Networks,” <i>Bulletin of the EATCS</i>, pp. 130--152, 2008.","mla":"Scheideler, Christian. “Algorithms for Overlay Networks.” <i>Bulletin of the EATCS</i>, 2008, pp. 130--152.","apa":"Scheideler, C. (2008). Algorithms for Overlay Networks. <i>Bulletin of the EATCS</i>, 130--152.","bibtex":"@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }","short":"C. Scheideler, Bulletin of the EATCS (2008) 130--152.","ama":"Scheideler C. Algorithms for Overlay Networks. <i>Bulletin of the EATCS</i>. 2008:130--152.","chicago":"Scheideler, Christian. “Algorithms for Overlay Networks.” <i>Bulletin of the EATCS</i>, 2008, 130--152."},"publication":"Bulletin of the EATCS","user_id":"15504","_id":"1937","page":"130--152","date_updated":"2022-01-06T06:54:03Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"title":"Algorithms for Overlay Networks","year":"2008","status":"public"},{"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T09:29:06Z","publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","citation":{"bibtex":"@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant MAC protocol for single-hop wireless networks}, DOI={<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>}, booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM}, author={Awerbuch, Baruch and W. Richa, Andr{\\’{e}}a and Scheideler, Christian}, year={2008}, pages={45--54} }","short":"B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.","ama":"Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for single-hop wireless networks. In: <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>. ACM; 2008:45--54. doi:<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>","chicago":"Awerbuch, Baruch, Andr{\\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” In <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, 45--54. ACM, 2008. <a href=\"https://doi.org/10.1145/1400751.1400759\">https://doi.org/10.1145/1400751.1400759</a>.","ieee":"B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, 2008, pp. 45--54.","mla":"Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, ACM, 2008, pp. 45--54, doi:<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>.","apa":"Awerbuch, B., W. Richa, A., &#38; Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i> (pp. 45--54). ACM. <a href=\"https://doi.org/10.1145/1400751.1400759\">https://doi.org/10.1145/1400751.1400759</a>"},"doi":"10.1145/1400751.1400759","user_id":"15504","page":"45--54","publisher":"ACM","_id":"1938","date_updated":"2022-01-06T06:54:03Z","year":"2008","title":"A jamming-resistant MAC protocol for single-hop wireless networks","status":"public","publication_identifier":{"isbn":["978-1-59593-989-0"]},"author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a","last_name":"W. Richa"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_created":"2018-04-13T10:03:13Z","creator":"florida","file_id":"2341","content_type":"application/pdf","file_name":"SODA08.pdf","file_size":211264,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-13T10:03:13Z"}],"date_created":"2018-03-29T09:30:18Z","publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:03Z","year":"2008","title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems","author":[{"last_name":"Mense","first_name":"Mario","full_name":"Mense, Mario"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"oa":"1","file_date_updated":"2018-04-13T10:03:13Z","citation":{"chicago":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 1135--1144. SIAM, 2008.","short":"M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.","ieee":"M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 2008, pp. 1135--1144.","apa":"Mense, M., &#38; Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i> (pp. 1135--1144). SIAM.","bibtex":"@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense, Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }","ama":"Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>. SIAM; 2008:1135--1144.","mla":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, SIAM, 2008, pp. 1135--1144."},"user_id":"14955","ddc":["040"],"page":"1135--1144","urn":"19408","_id":"1940","publisher":"SIAM","has_accepted_license":"1","status":"public"},{"user_id":"15504","doi":"10.1007/978-3-540-89335-6_12","volume":5340,"page":"124--140","_id":"1941","series_title":"Lecture Notes in Computer Science","publisher":"Springer","date_updated":"2022-01-06T06:54:03Z","intvolume":"      5340","year":"2008","title":"Tiara: A Self-stabilizing Deterministic Skip List","status":"public","author":[{"full_name":"Clouser, Thomas","last_name":"Clouser","first_name":"Thomas"},{"full_name":"Nesterenko, Mikhail","last_name":"Nesterenko","first_name":"Mikhail"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publication_identifier":{"isbn":["978-3-540-89334-9"]},"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T09:31:18Z","publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","citation":{"mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, vol. 5340, Springer, 2008, pp. 124--140, doi:<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>.","apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i> (Vol. 5340, pp. 124--140). Springer. <a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">https://doi.org/10.1007/978-3-540-89335-6_12</a>","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, 2008, vol. 5340, pp. 124--140.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List.” In <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, 5340:124--140. Lecture Notes in Computer Science. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">https://doi.org/10.1007/978-3-540-89335-6_12</a>.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic Skip List. In: <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140. doi:<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>","short":"T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.","bibtex":"@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List}, volume={5340}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008}, pages={124--140}, collection={Lecture Notes in Computer Science} }"}},{"citation":{"mla":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” <i>Taschenbuch Der Algorithmen</i>, Springer, 2008, pp. 229--236, doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>.","ama":"Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: <i>Taschenbuch Der Algorithmen</i>. eXamen.press. Springer; 2008:229--236. doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>","bibtex":"@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie verbreite ich schnell Informationen?}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>}, booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler, Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }","apa":"Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In <i>Taschenbuch der Algorithmen</i> (pp. 229--236). Springer. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">https://doi.org/10.1007/978-3-540-76394-9_22</a>","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in <i>Taschenbuch der Algorithmen</i>, Springer, 2008, pp. 229--236.","chicago":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” In <i>Taschenbuch Der Algorithmen</i>, 229--236. EXamen.Press. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">https://doi.org/10.1007/978-3-540-76394-9_22</a>.","short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236."},"publication":"Taschenbuch der Algorithmen","department":[{"_id":"79"}],"type":"book_chapter","date_created":"2018-03-29T09:32:34Z","date_updated":"2022-01-06T06:54:03Z","publication_identifier":{"isbn":["978-3-540-76393-2"]},"author":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"status":"public","title":"Broadcasting: Wie verbreite ich schnell Informationen?","year":"2008","doi":"10.1007/978-3-540-76394-9_22","user_id":"15504","_id":"1942","series_title":"eXamen.press","publisher":"Springer","page":"229--236"},{"_id":"1943","series_title":"LNI","user_id":"15504","volume":133,"editor":[{"last_name":"Hegering","first_name":"Heinz-Gerd","full_name":"Hegering, Heinz-Gerd"},{"first_name":"Axel","last_name":"Lehmann","full_name":"Lehmann, Axel"},{"first_name":"Hans","last_name":"Jürgen Ohlbach","full_name":"Jürgen Ohlbach, Hans"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"year":"2008","title":"INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland","status":"public","publication_identifier":{"isbn":["978-3-88579-227-7"]},"date_updated":"2022-01-06T06:54:03Z","intvolume":"       133","date_created":"2018-03-29T09:33:42Z","type":"conference_editor","department":[{"_id":"79"}],"citation":{"apa":"Hegering, H.-G., Lehmann, A., Jürgen Ohlbach, H., &#38; Scheideler, C. (Eds.). (2008). <i>INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i> (Vol. 133).","ieee":"H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, and C. Scheideler, Eds., <i>INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>, vol. 133. 2008.","chicago":"Hegering, Heinz-Gerd, Axel Lehmann, Hans Jürgen Ohlbach, and Christian Scheideler, eds. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol. 133. LNI, 2008.","short":"H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, C. Scheideler, eds., INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland, 2008.","mla":"Hegering, Heinz-Gerd, et al., editors. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol. 133, 2008.","ama":"Hegering H-G, Lehmann A, Jürgen Ohlbach H, Scheideler C, eds. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol 133.; 2008.","bibtex":"@book{Hegering_Lehmann_Jürgen Ohlbach_Scheideler_2008, series={LNI}, title={INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland}, volume={133}, year={2008}, collection={LNI} }"}},{"date_updated":"2022-01-06T06:54:05Z","status":"public","title":"Taschenbuch der Algorithmen","year":"2008","author":[{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"full_name":"Alt, Helmut","last_name":"Alt","first_name":"Helmut"},{"full_name":"Dietzfelbinger, Martin","first_name":"Martin","last_name":"Dietzfelbinger"},{"full_name":"Reischuk, Rüdiger","last_name":"Reischuk","first_name":"Rüdiger"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Vollmer, Heribert","first_name":"Heribert","last_name":"Vollmer"},{"full_name":"Wagner, Dorothea","first_name":"Dorothea","last_name":"Wagner"}],"publication_identifier":{"isbn":["978-3-540-76393-2"]},"user_id":"15504","main_file_link":[{"url":"http://www.springer.com/de/book/9783540763932"}],"series_title":"eXamen.press","_id":"1945","citation":{"apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &#38; Wagner, D. (2008). <i>Taschenbuch der Algorithmen</i>.","mla":"Vöcking, Berthold, et al. <i>Taschenbuch Der Algorithmen</i>. 2008.","ieee":"B. Vöcking <i>et al.</i>, <i>Taschenbuch der Algorithmen</i>. 2008.","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Taschenbuch Der Algorithmen, 2008.","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Taschenbuch Der Algorithmen</i>.; 2008.","chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. <i>Taschenbuch Der Algorithmen</i>. EXamen.Press, 2008.","bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2008, series={eXamen.press}, title={Taschenbuch der Algorithmen}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2008}, collection={eXamen.press} }"},"type":"book","department":[{"_id":"79"}],"date_created":"2018-03-29T09:39:00Z"},{"issue":"1","publication":"SIAM J. Discrete Math.","citation":{"chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” <i>SIAM J. Discrete Math.</i>, no. 1 (2007): 141--157. <a href=\"https://doi.org/10.1137/S0895480102419743\">https://doi.org/10.1137/S0895480102419743</a>.","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks,” <i>SIAM J. Discrete Math.</i>, no. 1, pp. 141--157, 2007.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., &#38; Kolman, P. (2007). Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. <i>SIAM J. Discrete Math.</i>, (1), 141--157. <a href=\"https://doi.org/10.1137/S0895480102419743\">https://doi.org/10.1137/S0895480102419743</a>","bibtex":"@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={<a href=\"https://doi.org/10.1137/S0895480102419743\">10.1137/S0895480102419743</a>}, number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157} }","ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. <i>SIAM J Discrete Math</i>. 2007;(1):141--157. doi:<a href=\"https://doi.org/10.1137/S0895480102419743\">10.1137/S0895480102419743</a>","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” <i>SIAM J. Discrete Math.</i>, no. 1, 2007, pp. 141--157, doi:<a href=\"https://doi.org/10.1137/S0895480102419743\">10.1137/S0895480102419743</a>."},"date_created":"2018-03-29T11:50:23Z","type":"journal_article","department":[{"_id":"79"}],"title":"Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks","status":"public","year":"2007","author":[{"full_name":"Bagchi, Amitabha","first_name":"Amitabha","last_name":"Bagchi"},{"last_name":"Chaudhary","first_name":"Amitabh","full_name":"Chaudhary, Amitabh"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"}],"date_updated":"2022-01-06T06:54:20Z","page":"141--157","_id":"2017","user_id":"15504","doi":"10.1137/S0895480102419743"},{"type":"conference","department":[{"_id":"79"}],"date_created":"2018-03-29T11:54:37Z","publication":"Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007","citation":{"ieee":"M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing Sorting in Graphs,” in <i>Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007</i>, 2007.","apa":"Onus, M., W. Richa, A., &#38; Scheideler, C. (2007). Linearization: Locally Self-Stabilizing Sorting in Graphs. In <i>Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007</i>. <a href=\"https://doi.org/10.1137/1.9781611972870.10\">https://doi.org/10.1137/1.9781611972870.10</a>","mla":"Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” <i>Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007</i>, 2007, doi:<a href=\"https://doi.org/10.1137/1.9781611972870.10\">10.1137/1.9781611972870.10</a>.","bibtex":"@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally Self-Stabilizing Sorting in Graphs}, DOI={<a href=\"https://doi.org/10.1137/1.9781611972870.10\">10.1137/1.9781611972870.10</a>}, booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih and W. Richa, Andrea and Scheideler, Christian}, year={2007} }","chicago":"Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization: Locally Self-Stabilizing Sorting in Graphs.” In <i>Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007</i>, 2007. <a href=\"https://doi.org/10.1137/1.9781611972870.10\">https://doi.org/10.1137/1.9781611972870.10</a>.","short":"M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.","ama":"Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing Sorting in Graphs. In: <i>Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007</i>. ; 2007. doi:<a href=\"https://doi.org/10.1137/1.9781611972870.10\">10.1137/1.9781611972870.10</a>"},"doi":"10.1137/1.9781611972870.10","user_id":"15504","_id":"2020","date_updated":"2022-01-06T06:54:23Z","title":"Linearization: Locally Self-Stabilizing Sorting in Graphs","year":"2007","status":"public","publication_identifier":{"isbn":["978-1-61197-287-0"]},"author":[{"full_name":"Onus, Melih","first_name":"Melih","last_name":"Onus"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}]},{"has_accepted_license":"1","date_updated":"2022-01-06T06:54:23Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"year":"2007","status":"public","title":"Towards Scalable and Robust Overlay Networks","ddc":["040"],"user_id":"15504","_id":"2022","urn":"20228","citation":{"bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007} }","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” In <i>6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007</i>, 2007.","ama":"Awerbuch B, Scheideler C. Towards Scalable and Robust Overlay Networks. In: <i>6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007</i>. ; 2007.","short":"B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.","ieee":"B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in <i>6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007</i>, 2007.","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” <i>6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007</i>, 2007.","apa":"Awerbuch, B., &#38; Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In <i>6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007</i>."},"publication":"6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007","file_date_updated":"2018-04-13T10:00:55Z","oa":"1","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-29T11:55:52Z","file":[{"creator":"florida","date_created":"2018-04-13T10:00:55Z","file_name":"IPTPS07.pdf","access_level":"open_access","file_size":191943,"relation":"main_file","date_updated":"2018-04-13T10:00:55Z","file_id":"2338","content_type":"application/pdf"}]},{"file_date_updated":"2018-04-13T10:02:18Z","citation":{"ama":"Awerbuch B, Scheideler C. A denial-of-service resistant DHT. In: <i>Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007</i>. ACM; 2007:370--371. doi:<a href=\"https://doi.org/10.1145/1281100.1281178\">10.1145/1281100.1281178</a>","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant DHT}, DOI={<a href=\"https://doi.org/10.1145/1281100.1281178\">10.1145/1281100.1281178</a>}, booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={370--371} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” <i>Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007</i>, ACM, 2007, pp. 370--371, doi:<a href=\"https://doi.org/10.1145/1281100.1281178\">10.1145/1281100.1281178</a>.","short":"B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In <i>Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007</i>, 370--371. ACM, 2007. <a href=\"https://doi.org/10.1145/1281100.1281178\">https://doi.org/10.1145/1281100.1281178</a>.","apa":"Awerbuch, B., &#38; Scheideler, C. (2007). A denial-of-service resistant DHT. In <i>Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007</i> (pp. 370--371). ACM. <a href=\"https://doi.org/10.1145/1281100.1281178\">https://doi.org/10.1145/1281100.1281178</a>","ieee":"B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in <i>Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007</i>, 2007, pp. 370--371."},"oa":"1","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","page":"370--371","_id":"2023","publisher":"ACM","urn":"20237","publication":"Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007","type":"conference","department":[{"_id":"79"}],"file":[{"file_id":"2340","content_type":"application/pdf","file_name":"DISC-07.pdf","file_size":193097,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-13T10:02:18Z","date_created":"2018-04-13T10:02:18Z","creator":"florida"}],"date_created":"2018-03-29T11:56:35Z","date_updated":"2022-01-06T06:54:24Z","title":"A denial-of-service resistant DHT","year":"2007","publication_identifier":{"isbn":["978-1-59593-616-5"]},"author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"doi":"10.1145/1281100.1281178"},{"citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” <i>Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings</i>, vol. 4731, Springer, 2007, pp. 33--47, doi:<a href=\"https://doi.org/10.1007/978-3-540-75142-7_6\">10.1007/978-3-540-75142-7_6</a>.","ama":"Awerbuch B, Scheideler C. A Denial-of-Service Resistant DHT. In: <i>Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings</i>. Vol 4731. Lecture Notes in Computer Science. Springer; 2007:33--47. doi:<a href=\"https://doi.org/10.1007/978-3-540-75142-7_6\">10.1007/978-3-540-75142-7_6</a>","bibtex":"@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-75142-7_6\">10.1007/978-3-540-75142-7_6</a>}, booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture Notes in Computer Science} }","apa":"Awerbuch, B., &#38; Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In <i>Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings</i> (Vol. 4731, pp. 33--47). Springer. <a href=\"https://doi.org/10.1007/978-3-540-75142-7_6\">https://doi.org/10.1007/978-3-540-75142-7_6</a>","ieee":"B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in <i>Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings</i>, 2007, vol. 4731, pp. 33--47.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.” In <i>Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings</i>, 4731:33--47. Lecture Notes in Computer Science. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-75142-7_6\">https://doi.org/10.1007/978-3-540-75142-7_6</a>.","short":"B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47."},"publication":"Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings","date_created":"2018-03-29T11:57:42Z","department":[{"_id":"79"}],"type":"conference","publication_identifier":{"isbn":["978-3-540-75141-0"]},"author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"title":"A Denial-of-Service Resistant DHT","year":"2007","status":"public","intvolume":"      4731","date_updated":"2022-01-06T06:54:24Z","publisher":"Springer","_id":"2024","series_title":"Lecture Notes in Computer Science","page":"33--47","volume":4731,"user_id":"15504","doi":"10.1007/978-3-540-75142-7_6"},{"citation":{"chicago":"Aspnes, James, Christian Scheideler, Anish Arora, and Samuel Madden, eds. <i>Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings</i>. Vol. 4549. Lecture Notes in Computer Science, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73090-3\">https://doi.org/10.1007/978-3-540-73090-3</a>.","short":"J. Aspnes, C. Scheideler, A. Arora, S. Madden, eds., Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings, 2007.","ieee":"J. Aspnes, C. Scheideler, A. Arora, and S. Madden, Eds., <i>Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings</i>, vol. 4549. 2007.","apa":"Aspnes, J., Scheideler, C., Arora, A., &#38; Madden, S. (Eds.). (2007). <i>Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings</i> (Vol. 4549). <a href=\"https://doi.org/10.1007/978-3-540-73090-3\">https://doi.org/10.1007/978-3-540-73090-3</a>","bibtex":"@book{Aspnes_Scheideler_Arora_Madden_2007, series={Lecture Notes in Computer Science}, title={Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings}, volume={4549}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73090-3\">10.1007/978-3-540-73090-3</a>}, year={2007}, collection={Lecture Notes in Computer Science} }","ama":"Aspnes J, Scheideler C, Arora A, Madden S, eds. <i>Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings</i>. Vol 4549.; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73090-3\">10.1007/978-3-540-73090-3</a>","mla":"Aspnes, James, et al., editors. <i>Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings</i>. Vol. 4549, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73090-3\">10.1007/978-3-540-73090-3</a>."},"date_created":"2018-03-29T11:58:44Z","department":[{"_id":"79"}],"type":"conference_editor","publication_identifier":{"isbn":["978-3-540-73089-7"]},"title":"Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings","status":"public","year":"2007","intvolume":"      4549","date_updated":"2022-01-06T06:54:25Z","series_title":"Lecture Notes in Computer Science","_id":"2025","editor":[{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Arora, Anish","first_name":"Anish","last_name":"Arora"},{"first_name":"Samuel","last_name":"Madden","full_name":"Madden, Samuel"}],"volume":4549,"doi":"10.1007/978-3-540-73090-3","user_id":"15504"}]