[{"oa":"1","_id":"2135","date_updated":"2022-01-06T06:54:55Z","urn":"21357","type":"conference","year":"2002","citation":{"short":"P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.","ieee":"P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.","apa":"Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.","ama":"Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. In: SODA. ACM/SIAM; 2002:184--193.","chicago":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.","bibtex":"@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and Scheideler, Christian}, year={2002}, pages={184--193} }","mla":"Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193."},"page":"184--193","user_id":"15504","title":"Improved bounds for the unsplittable flow problem","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:44:11Z","file":[{"access_level":"open_access","file_name":"SODA-02.pdf","date_created":"2018-04-12T08:59:58Z","content_type":"application/pdf","date_updated":"2018-04-12T08:59:58Z","relation":"main_file","file_size":246604,"creator":"florida","file_id":"2303"}],"author":[{"last_name":"Kolman","full_name":"Kolman, Petr","first_name":"Petr"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publisher":"ACM/SIAM","publication":"SODA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T08:59:58Z"},{"date_created":"2018-04-03T05:44:56Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-12T09:02:22Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_id":"2305","creator":"florida","file_size":123373,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T09:02:22Z","date_created":"2018-04-12T09:02:22Z","file_name":"BSS-SPAA-02.pdf","access_level":"open_access"}],"ddc":["040"],"title":"Compact, adaptive placement schemes for non-uniform requirements","user_id":"14955","page":"53--62","year":"2002","type":"conference","citation":{"ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.","mla":"Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62} }","ama":"Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes for non-uniform requirements. In: SPAA. ; 2002:53--62.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002."},"language":[{"iso":"eng"}],"oa":"1","urn":"21366","_id":"2136","date_updated":"2022-01-06T06:54:56Z"},{"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:45:44Z","file":[{"date_created":"2018-04-12T09:03:44Z","file_name":"BCKS-SPAA-02.pdf","access_level":"open_access","file_size":187124,"file_id":"2306","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T09:03:44Z","relation":"main_file"}],"author":[{"full_name":"Bagchi, Amitabha","first_name":"Amitabha","last_name":"Bagchi"},{"first_name":"Amitabh","full_name":"Chaudhary, Amitabh","last_name":"Chaudhary"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"}],"file_date_updated":"2018-04-12T09:03:44Z","department":[{"_id":"79"}],"publication":"SPAA","user_id":"15504","ddc":["040"],"title":"Algorithms for fault-tolerant routing in circuit switched networks","citation":{"ama":"Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant routing in circuit switched networks. In: SPAA. ; 2002:265--274.","apa":"Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).","chicago":"Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.","mla":"Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.","bibtex":"@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi, Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002}, pages={265--274} }","short":"A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.","ieee":"A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274."},"year":"2002","type":"conference","page":"265--274","oa":"1","date_updated":"2022-01-06T06:54:57Z","_id":"2137","urn":"21376"},{"series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:57Z","department":[{"_id":"79"}],"title":"Models and Techniques for Communication in Dynamic Networks","page":"27--49","citation":{"short":"C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.","ieee":"C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.","chicago":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.","ama":"Scheideler C. Models and Techniques for Communication in Dynamic Networks. In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.","apa":"Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.","mla":"Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.","bibtex":"@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science}, title={Models and Techniques for Communication in Dynamic Networks}, volume={2285}, booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002}, pages={27--49}, collection={Lecture Notes in Computer Science} }"},"type":"conference","year":"2002","urn":"21386","_id":"2138","intvolume":" 2285","volume":2285,"date_created":"2018-04-03T05:46:38Z","status":"public","has_accepted_license":"1","publication":"STACS","file_date_updated":"2018-04-12T09:01:03Z","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"Springer","file":[{"creator":"florida","file_id":"2304","file_size":273875,"relation":"main_file","date_updated":"2018-04-12T09:01:03Z","content_type":"application/pdf","date_created":"2018-04-12T09:01:03Z","file_name":"STACS-02.pdf","access_level":"open_access"}],"ddc":["040"],"user_id":"15504"},{"abstract":[{"lang":"eng","text":"The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure."}],"user_id":"15415","title":"Storage Management as Means to cope with Exponential Information Growth","ddc":["000"],"file":[{"file_id":"19793","creator":"koala","file_size":499057,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-09-30T12:03:57Z","file_name":"pub-hni-908.pdf","date_created":"2020-09-30T12:03:57Z","access_level":"closed"}],"department":[{"_id":"63"},{"_id":"58"},{"_id":"79"}],"publication":"Proceedings of SSGRR 2003","file_date_updated":"2020-09-30T12:03:57Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Salzwedel","first_name":"Kay","full_name":"Salzwedel, Kay"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"full_name":"Vodisek, Mario","first_name":"Mario","last_name":"Vodisek"},{"full_name":"Rückert, Ulrich","first_name":"Ulrich","last_name":"Rückert"}],"date_created":"2020-09-30T12:04:14Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:54:12Z","_id":"19790","language":[{"iso":"eng"}],"year":"2003","type":"conference","citation":{"short":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.","ieee":"C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.","apa":"Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.","ama":"Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M, Rückert U. Storage Management as Means to cope with Exponential Information Growth. In: Proceedings of SSGRR 2003. ; 2003.","chicago":"Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.","mla":"Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.","bibtex":"@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003, title={Storage Management as Means to cope with Exponential Information Growth}, booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel, Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario and Rückert, Ulrich}, year={2003} }"}},{"title":"Smoothed Motion Complexity","user_id":"14955","volume":2832,"date_created":"2018-04-03T05:37:10Z","status":"public","publication":"ESA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Damerow, Valentina","first_name":"Valentina","last_name":"Damerow"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"publisher":"Springer","doi":"10.1007/978-3-540-39658-1_17","date_updated":"2022-01-06T06:54:52Z","_id":"2128","intvolume":" 2832","page":"161--171","type":"conference","year":"2003","citation":{"short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer. https://doi.org/10.1007/978-3-540-39658-1_17","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={10.1007/978-3-540-39658-1_17}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17."},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"department":[{"_id":"79"},{"_id":"63"}],"title":"Anycasting in Adversarial Systems: Routing and Admission Control","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","oa":"1","date_updated":"2022-01-06T06:54:53Z","volume":2719,"status":"public","has_accepted_license":"1","date_created":"2018-04-03T05:38:36Z","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"publisher":"Springer","file_date_updated":"2018-04-12T09:04:48Z","publication":"ICALP","file":[{"file_name":"ICALP-03.pdf","date_created":"2018-04-12T09:04:48Z","access_level":"open_access","file_size":154427,"creator":"florida","file_id":"2307","date_updated":"2018-04-12T09:04:48Z","content_type":"application/pdf","relation":"main_file"}],"ddc":["040"],"user_id":"14955","year":"2003","type":"conference","citation":{"chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","apa":"Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168."},"page":"1153--1168","_id":"2129","intvolume":" 2719","urn":"21297"},{"_id":"2130","date_updated":"2022-01-06T06:54:53Z","urn":"21303","oa":"1","citation":{"mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.","bibtex":"@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2003}, pages={123--132} }","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: PODC. ACM; 2003:123--132.","apa":"Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.","ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132."},"type":"conference","year":"2003","page":"123--132","user_id":"15504","title":"Peer-to-peer systems for prefix search","ddc":["040"],"file":[{"file_name":"PODC-03.pdf","date_created":"2018-04-12T09:10:10Z","access_level":"open_access","file_size":127013,"creator":"florida","file_id":"2308","content_type":"application/pdf","date_updated":"2018-04-12T09:10:10Z","relation":"main_file"}],"author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"ACM","publication":"PODC","file_date_updated":"2018-04-12T09:10:10Z","department":[{"_id":"79"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:39:48Z"},{"title":"Perfectly Balanced Allocation","department":[{"_id":"79"}],"oa":"1","date_updated":"2022-01-06T06:54:54Z","series_title":"Lecture Notes in Computer Science","user_id":"15504","ddc":["040"],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T05:41:01Z","volume":2764,"file":[{"access_level":"open_access","file_name":"RANDOM-03.pdf","date_created":"2018-04-12T09:16:17Z","relation":"main_file","date_updated":"2018-04-12T09:16:17Z","content_type":"application/pdf","file_id":"2310","creator":"florida","file_size":112587}],"publisher":"Springer","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"first_name":"Chris","full_name":"Riley, Chris","last_name":"Riley"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"RANDOM-APPROX","file_date_updated":"2018-04-12T09:16:17Z","_id":"2131","intvolume":" 2764","urn":"21313","citation":{"chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX. Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.","apa":"Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.","bibtex":"@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX}, publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian}, year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science} }","short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251."},"type":"conference","year":"2003","page":"240--251"},{"file":[{"file_name":"JRS-SPAA-03.pdf","date_created":"2018-04-12T09:18:55Z","access_level":"open_access","creator":"florida","file_id":"2311","file_size":224200,"relation":"main_file","date_updated":"2018-04-12T09:18:55Z","content_type":"application/pdf"}],"publication":"SPAA","department":[{"_id":"79"}],"file_date_updated":"2018-04-12T09:18:55Z","publisher":"ACM","author":[{"first_name":"Lujun","full_name":"Jia, Lujun","last_name":"Jia"},{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T05:41:53Z","status":"public","has_accepted_license":"1","user_id":"15504","ddc":["040"],"title":"On local algorithms for topology control and routing in ad hoc networks","page":"220--229","type":"conference","year":"2003","citation":{"mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.","bibtex":"@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM}, author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003}, pages={220--229} }","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.","apa":"Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.","ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229."},"urn":"21320","_id":"2132","date_updated":"2022-01-06T06:54:54Z","oa":"1"}]