[{"publication_identifier":{"isbn":["9783540406631","9783540451266"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Seifert","first_name":"Jean-Pierre","full_name":"Seifert, Jean-Pierre"}],"title":"Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)","year":"2003","status":"public","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","_id":"3018","publisher":"Springer Berlin Heidelberg","page":"162-181","doi":"10.1007/978-3-540-45126-6_12","user_id":"25078","citation":{"ieee":"J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181.","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>.","apa":"Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>","bibtex":"@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }","ama":"Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>","short":"J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>."},"publication":"Financial Cryptography","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:25:18Z","department":[{"_id":"64"}],"type":"book_chapter"},{"date_updated":"2022-01-06T06:54:52Z","intvolume":"      2832","title":"Smoothed Motion Complexity","status":"public","year":"2003","author":[{"full_name":"Damerow, Valentina","first_name":"Valentina","last_name":"Damerow"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"user_id":"14955","doi":"10.1007/978-3-540-39658-1_17","volume":2832,"page":"161--171","_id":"2128","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publisher":"Springer","publication":"ESA","citation":{"short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In <i>ESA</i>, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &#38; Sohler, C. (2003). Smoothed Motion Complexity. In <i>ESA</i> (Vol. 2832, pp. 161--171). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in <i>ESA</i>, 2003, vol. 2832, pp. 161--171.","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: <i>ESA</i>. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>","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={<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>}, 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.” <i>ESA</i>, vol. 2832, Springer, 2003, pp. 161--171, doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>."},"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T05:37:10Z"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:53Z","intvolume":"      2719","title":"Anycasting in Adversarial Systems: Routing and Admission Control","year":"2003","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T09:04:48Z","date_updated":"2018-04-12T09:04:48Z","relation":"main_file","file_size":154427,"access_level":"open_access","file_name":"ICALP-03.pdf","content_type":"application/pdf","file_id":"2307"}],"date_created":"2018-04-03T05:38:36Z","publication":"ICALP","ddc":["040"],"user_id":"14955","volume":2719,"page":"1153--1168","urn":"21297","_id":"2129","publisher":"Springer","has_accepted_license":"1","status":"public","oa":"1","file_date_updated":"2018-04-12T09:04:48Z","citation":{"short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In <i>ICALP</i>, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in <i>ICALP</i>, 2003, vol. 2719, pp. 1153--1168.","apa":"Awerbuch, B., Brinkmann, A., &#38; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In <i>ICALP</i> (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} }","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: <i>ICALP</i>. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” <i>ICALP</i>, vol. 2719, Springer, 2003, pp. 1153--1168."}},{"type":"conference","department":[{"_id":"79"}],"oa":"1","file":[{"creator":"florida","date_created":"2018-04-12T09:10:10Z","file_name":"PODC-03.pdf","access_level":"open_access","file_size":127013,"relation":"main_file","date_updated":"2018-04-12T09:10:10Z","file_id":"2308","content_type":"application/pdf"}],"date_created":"2018-04-03T05:39:48Z","file_date_updated":"2018-04-12T09:10:10Z","publication":"PODC","citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In <i>PODC</i>, 123--132. ACM, 2003.","short":"B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.","apa":"Awerbuch, B., &#38; Scheideler, C. (2003). Peer-to-peer systems for prefix search. In <i>PODC</i> (pp. 123--132). ACM.","ieee":"B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in <i>PODC</i>, 2003, pp. 123--132.","ama":"Awerbuch B, Scheideler C. Peer-to-peer systems for prefix search. In: <i>PODC</i>. ACM; 2003: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} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” <i>PODC</i>, ACM, 2003, pp. 123--132."},"user_id":"15504","ddc":["040"],"page":"123--132","_id":"2130","urn":"21303","publisher":"ACM","date_updated":"2022-01-06T06:54:53Z","has_accepted_license":"1","title":"Peer-to-peer systems for prefix search","year":"2003","status":"public","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}]},{"has_accepted_license":"1","status":"public","volume":2764,"user_id":"15504","ddc":["040"],"_id":"2131","urn":"21313","publisher":"Springer","page":"240--251","citation":{"apa":"Czumaj, A., Riley, C., &#38; Scheideler, C. (2003). Perfectly Balanced Allocation. In <i>RANDOM-APPROX</i> (Vol. 2764, pp. 240--251). Springer.","ieee":"A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in <i>RANDOM-APPROX</i>, 2003, vol. 2764, pp. 240--251.","chicago":"Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In <i>RANDOM-APPROX</i>, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.","short":"A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.","mla":"Czumaj, Artur, et al. “Perfectly Balanced Allocation.” <i>RANDOM-APPROX</i>, vol. 2764, Springer, 2003, pp. 240--251.","ama":"Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: <i>RANDOM-APPROX</i>. Vol 2764. Lecture Notes in Computer Science. Springer; 2003: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} }"},"file_date_updated":"2018-04-12T09:16:17Z","oa":"1","intvolume":"      2764","date_updated":"2022-01-06T06:54:54Z","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"first_name":"Chris","last_name":"Riley","full_name":"Riley, Chris"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"2003","title":"Perfectly Balanced Allocation","series_title":"Lecture Notes in Computer Science","publication":"RANDOM-APPROX","department":[{"_id":"79"}],"type":"conference","date_created":"2018-04-03T05:41:01Z","file":[{"date_updated":"2018-04-12T09:16:17Z","relation":"main_file","access_level":"open_access","file_size":112587,"file_name":"RANDOM-03.pdf","content_type":"application/pdf","file_id":"2310","creator":"florida","date_created":"2018-04-12T09:16:17Z"}]},{"user_id":"15504","ddc":["040"],"urn":"21320","_id":"2132","publisher":"ACM","page":"220--229","has_accepted_license":"1","date_updated":"2022-01-06T06:54:54Z","author":[{"last_name":"Jia","first_name":"Lujun","full_name":"Jia, Lujun"},{"full_name":"Rajaraman, Rajmohan","last_name":"Rajaraman","first_name":"Rajmohan"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"title":"On local algorithms for topology control and routing in ad hoc networks","status":"public","year":"2003","department":[{"_id":"79"}],"oa":"1","type":"conference","date_created":"2018-04-03T05:41:53Z","file":[{"date_updated":"2018-04-12T09:18:55Z","relation":"main_file","access_level":"open_access","file_size":224200,"file_name":"JRS-SPAA-03.pdf","content_type":"application/pdf","file_id":"2311","creator":"florida","date_created":"2018-04-12T09:18:55Z"}],"citation":{"ieee":"L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in <i>SPAA</i>, 2003, pp. 220--229.","mla":"Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” <i>SPAA</i>, ACM, 2003, pp. 220--229.","apa":"Jia, L., Rajaraman, R., &#38; Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In <i>SPAA</i> (pp. 220--229). ACM.","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} }","ama":"Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control and routing in ad hoc networks. In: <i>SPAA</i>. ACM; 2003:220--229.","short":"L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.","chicago":"Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In <i>SPAA</i>, 220--229. ACM, 2003."},"file_date_updated":"2018-04-12T09:18:55Z","publication":"SPAA"},{"status":"public","title":"Information gathering in adversarial systems: lines and cycles","year":"2003","author":[{"full_name":"Kothapalli, Kishore","first_name":"Kishore","last_name":"Kothapalli"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"date_updated":"2022-01-06T06:54:55Z","has_accepted_license":"1","page":"333--342","urn":"21338","_id":"2133","publisher":"ACM","ddc":["040"],"user_id":"15504","publication":"SPAA","file_date_updated":"2018-04-12T09:15:24Z","citation":{"chicago":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In <i>SPAA</i>, 333--342. ACM, 2003.","short":"K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.","ieee":"K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in <i>SPAA</i>, 2003, pp. 333--342.","apa":"Kothapalli, K., &#38; Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In <i>SPAA</i> (pp. 333--342). ACM.","bibtex":"@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM}, author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342} }","ama":"Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: <i>SPAA</i>. ACM; 2003:333--342.","mla":"Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” <i>SPAA</i>, ACM, 2003, pp. 333--342."},"file":[{"file_id":"2309","content_type":"application/pdf","file_name":"KS-SPAA-03.pdf","file_size":121448,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T09:15:24Z","date_created":"2018-04-12T09:13:43Z","creator":"florida"}],"date_created":"2018-04-03T05:42:48Z","type":"conference","oa":"1","department":[{"_id":"79"}]},{"date_created":"2020-07-28T08:05:14Z","type":"conference","department":[{"_id":"63"}],"publication":"15th European Simulation Symposium (ESS 2003)","citation":{"bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}, booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003}, pages={367–371} }","ama":"Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: <i>15th European Simulation Symposium (ESS 2003)</i>. SCS - Europe; 2003:367-371.","mla":"Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” <i>15th European Simulation Symposium (ESS 2003)</i>, SCS - Europe, 2003, pp. 367–71.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In <i>15th European Simulation Symposium (ESS 2003)</i>, 367–71. SCS - Europe, 2003.","short":"B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371.","ieee":"B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in <i>15th European Simulation Symposium (ESS 2003)</i>, 2003, pp. 367–371.","apa":"Mueck, B., Dangelmaier, W., &#38; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In <i>15th European Simulation Symposium (ESS 2003)</i> (pp. 367–371). SCS - Europe."},"page":"367-371","language":[{"iso":"eng"}],"_id":"17423","publisher":"SCS - Europe","user_id":"15415","title":"Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment","status":"public","year":"2003","author":[{"full_name":"Mueck, Bengt","first_name":"Bengt","last_name":"Mueck"},{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"}],"date_updated":"2022-01-06T06:53:11Z"},{"date_created":"2020-09-01T14:15:33Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)","citation":{"chicago":"Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 813–822, 2003.","short":"A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.","ieee":"A. Magen <i>et al.</i>, “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","apa":"Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &#38; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i> (pp. 813–822).","bibtex":"@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003, title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }","ama":"Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003:813–822.","mla":"Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822."},"abstract":[{"lang":"eng","text":"We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + ε using only \\~{O}(√ poly(1/ε)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries."}],"page":"813–822","_id":"18791","language":[{"iso":"eng"}],"user_id":"15415","title":"Sublinear Approximation of Euclidean Minimum Spanning Tree","status":"public","year":"2003","author":[{"full_name":"Magen, Avner","first_name":"Avner","last_name":"Magen"},{"first_name":"Funda","last_name":"Ergun","full_name":"Ergun, Funda"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Rubinfeld, Ronitt","first_name":"Ronitt","last_name":"Rubinfeld"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Newman","first_name":"Ilan","full_name":"Newman, Ilan"},{"full_name":"Fortnow, Lance","last_name":"Fortnow","first_name":"Lance"}],"publication_identifier":{"isbn":["0898715385"]},"date_updated":"2022-01-06T06:53:52Z"},{"date_updated":"2022-01-06T06:53:54Z","publication_status":"published","author":[{"last_name":"Bienkowski","first_name":"Marcin","full_name":"Bienkowski, Marcin"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"}],"publication_identifier":{"isbn":["1581136617"]},"status":"public","title":"A practical algorithm for constructing oblivious routing schemes","year":"2003","doi":"10.1145/777412.777418","user_id":"15415","_id":"18907","language":[{"iso":"eng"}],"abstract":[{"text":"In a (randomized) oblivious routing scheme the path chosen for a request <br>between a source $s$ and a target $t$ is independent from the current traffic <br>in the network. Hence, such a scheme consists of probability distributions<br>over $s-t$ paths for every source-target pair $s,t$ in the network.<br><br>In a recent result citeR02 it was shown that for any undirected network <br>there is an oblivious routing scheme that achieves a polylogarithmic<br>competitive ratio with respect to congestion. Subsequently, Azar et <br>al. citeACF+03 gave a polynomial time algorithm that for a given network <br>constructs the best oblivious routing scheme, i.e. the scheme that guarantees<br>the best possible competitive ratio.  <br>Unfortunately, the latter result is based on the Ellipsoid algorithm; hence <br>it is unpractical for large networks. <br><br>In this paper we present a combinatorial algorithm for constructing an<br>oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$<br>for undirected networks. Furthermore, our approach yields a proof <br>for the existence of an oblivious routing scheme with competitive ratio<br>$O(log^3n)$, which is much simpler than the original proof from citeR02.","lang":"eng"}],"citation":{"mla":"Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm for constructing oblivious routing schemes}, DOI={<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>}, booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, year={2003} }","ama":"Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>","ieee":"M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>, 2003.","apa":"Bienkowski, M., Korzeniowski, M., &#38; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>","short":"M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>."},"publication":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T07:44:01Z"},{"abstract":[{"lang":"eng","text":"In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents."}],"citation":{"bibtex":"@inproceedings{Rust_Stappert_Lukovszki_2003, title={A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}, booktitle={7th World Multiconference on Systemics, Cybernetics and Informatics}, author={Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}, year={2003} }","ama":"Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>. ; 2003.","mla":"Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","chicago":"Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","short":"C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.","ieee":"C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","apa":"Rust, C., Stappert, F., &#38; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>."},"publication":"7th World Multiconference on Systemics, Cybernetics and Informatics","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T11:50:06Z","date_updated":"2022-01-06T06:53:55Z","author":[{"first_name":"Carsten","last_name":"Rust","full_name":"Rust, Carsten"},{"full_name":"Stappert, Friedhelm","first_name":"Friedhelm","last_name":"Stappert"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"}],"year":"2003","status":"public","title":"A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture","user_id":"15415","_id":"18947","language":[{"iso":"eng"}]},{"_id":"18960","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1145/777412.777448","title":"Worst case mobility in ad hoc networks","year":"2003","status":"public","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"full_name":"Rührup, Stefan","last_name":"Rührup","first_name":"Stefan"},{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"}],"publication_identifier":{"isbn":["1581136617"]},"publication_status":"published","date_updated":"2022-01-06T06:53:55Z","date_created":"2020-09-03T13:10:50Z","type":"conference","department":[{"_id":"63"}],"publication":"Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)","citation":{"chicago":"Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>.","short":"C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.","ieee":"C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003.","apa":"Schindelhauer, C., Lukovszki, T., Rührup, S., &#38; Volbert, K. (2003). Worst case mobility in ad hoc networks. In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>","bibtex":"@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>}, booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, year={2003} }","ama":"Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>","mla":"Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>."},"abstract":[{"text":"We investigate distributed algorithms for mobile ad hoc networks for   moving radio stations with adjustable transmission power in a worst   case scenario. We consider two models to find a reasonable   restriction on the worst-case mobility. In the pedestrian model we   assume a maximum speed $v_max$ of the radio stations, while in   the vehicular model we assume a maximum acceleration $a_max$ of   the points.      Our goal is to maintain persistent routes with nice communication   network properties like hop-distance, energy-consumption, congestion   and number of interferences. A route is persistent, if we can   guarantee that all edges of this route can be uphold for a given   time span $Delta$, which is a parameter denoting the minimum time   the mobile network needs to adopt changes, i.e. update routing   tables, change directory entries, etc. This $Delta$ can be used as   the length of an update interval for a proactive routing scheme.      We extend some known notions such as transmission range,   interferences, spanner, power spanner and congestion to both   mobility models and introduce a new parameter called crowdedness   that states a lower bound on the number of radio interferences. Then   we prove that a mobile spanner hosts a path system that   polylogarithmically approximates the optimal congestion.    We present distributed algorithms based on a grid clustering   technique and a high-dimensional representation of the dynamical   start situation which construct mobile spanners with low congestion,   low interference number, low energy-consumption, and low degree.  We   measure the optimality of the output of our algorithm by comparing   it with the optimal choice of persistent routes under the same   circumstances with respect to pedestrian or vehicular worst-case   movements. Finally, we present solutions for dynamic position   information management under our mobility models.","lang":"eng"}]},{"title":"Optimal oblivious routing in polynomial time","year":"2003","status":"public","publication_identifier":{"isbn":["1581136749"]},"author":[{"last_name":"Azar","first_name":"Yossi","full_name":"Azar, Yossi"},{"full_name":"Cohen, Edith","first_name":"Edith","last_name":"Cohen"},{"first_name":"Amos","last_name":"Fiat","full_name":"Fiat, Amos"},{"full_name":"Kaplan, Haim","first_name":"Haim","last_name":"Kaplan"},{"first_name":"Harald","last_name":"Racke","full_name":"Racke, Harald"}],"date_updated":"2022-01-06T06:53:56Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"18966","doi":"10.1145/780542.780599","user_id":"15415","publication":"Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC '03","citation":{"bibtex":"@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious routing in polynomial time}, DOI={<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>}, booktitle={Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03}, author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}, year={2003} }","ama":"Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>","mla":"Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>.","chicago":"Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>.","short":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.","ieee":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>, 2003.","apa":"Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &#38; Racke, H. (2003). Optimal oblivious routing in polynomial time. In <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>"},"abstract":[{"lang":"eng","text":"A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network."}],"date_created":"2020-09-03T14:34:33Z","type":"conference","department":[{"_id":"63"}]},{"file":[{"date_created":"2020-09-04T08:03:11Z","creator":"koala","success":1,"content_type":"application/pdf","file_id":"18985","date_updated":"2020-09-04T08:03:11Z","relation":"main_file","access_level":"closed","file_size":703144,"file_name":"pub-hni-2464.pdf"}],"place":"Universität Paderborn","date_created":"2020-09-04T08:03:37Z","type":"mastersthesis","department":[{"_id":"63"}],"file_date_updated":"2020-09-04T08:03:11Z","citation":{"short":"J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java, Universität Paderborn, 2003.","chicago":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","ieee":"J. Gehweiler, <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","apa":"Gehweiler, J. (2003). <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn.","bibtex":"@book{Gehweiler_2003, place={Universität Paderborn}, title={Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}, author={Gehweiler, Joachim}, year={2003} }","ama":"Gehweiler J. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn; 2003.","mla":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. 2003."},"abstract":[{"lang":"ger","text":"In dieser Studienarbeit wurde ein System entworfen und implementiert, das der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch, dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet verteilt sind.<br>Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server \"häppchenweise\" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren."}],"_id":"18982","language":[{"iso":"eng"}],"ddc":["004"],"user_id":"15415","title":"Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java","status":"public","year":"2003","author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"}],"date_updated":"2022-01-06T06:53:56Z","has_accepted_license":"1"},{"publication":"Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember ","citation":{"bibtex":"@inproceedings{Fu_Chen_Festag_Karl_Schäfer_Fan_2003, title={Secure, QoS-Enabled Mobility Support for IP-based Networks}, booktitle={Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember }, author={Fu, X. and Chen, T. and Festag, A. and Karl, Holger and Schäfer, G. and Fan, C.}, year={2003} }","ama":"Fu X, Chen T, Festag A, Karl H, Schäfer G, Fan C. Secure, QoS-Enabled Mobility Support for IP-based Networks. In: <i>Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember </i>. ; 2003.","mla":"Fu, X., et al. “Secure, QoS-Enabled Mobility Support for IP-Based Networks.” <i>Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember </i>, 2003.","chicago":"Fu, X., T. Chen, A. Festag, Holger Karl, G. Schäfer, and C. Fan. “Secure, QoS-Enabled Mobility Support for IP-Based Networks.” In <i>Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember </i>, 2003.","short":"X. Fu, T. Chen, A. Festag, H. Karl, G. Schäfer, C. Fan, in: Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 2003.","ieee":"X. Fu, T. Chen, A. Festag, H. Karl, G. Schäfer, and C. Fan, “Secure, QoS-Enabled Mobility Support for IP-based Networks,” in <i>Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember </i>, 2003.","apa":"Fu, X., Chen, T., Festag, A., Karl, H., Schäfer, G., &#38; Fan, C. (2003). Secure, QoS-Enabled Mobility Support for IP-based Networks. In <i>Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember </i>."},"type":"conference","department":[{"_id":"75"}],"date_created":"2018-03-28T10:31:07Z","date_updated":"2022-01-06T06:53:58Z","status":"public","year":"2003","title":"Secure, QoS-Enabled Mobility Support for IP-based Networks","author":[{"last_name":"Fu","first_name":"X.","full_name":"Fu, X."},{"first_name":"T.","last_name":"Chen","full_name":"Chen, T."},{"full_name":"Festag, A.","last_name":"Festag","first_name":"A."},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"},{"last_name":"Schäfer","first_name":"G.","full_name":"Schäfer, G."},{"last_name":"Fan","first_name":"C.","full_name":"Fan, C."}],"user_id":"15572","main_file_link":[{"url":"http://citeseer.ist.psu.edu/viewdoc/download;jsessionid=A970489A85406D205EE59F71B67AB954?doi=10.1.1.10.5592&rep=rep1&type=pdf"}],"_id":"1913"},{"date_created":"2018-03-28T10:34:28Z","type":"conference","department":[{"_id":"75"}],"publication":"Proceedings of INOC 2003, Evry/Paris","citation":{"bibtex":"@inproceedings{Geerdes_Karl_2003, title={The Potential of Relaying in Cellular Networks }, booktitle={Proceedings of INOC 2003, Evry/Paris}, author={Geerdes, Hans-Florian and Karl, Holger}, year={2003} }","ama":"Geerdes H-F, Karl H. The Potential of Relaying in Cellular Networks . In: <i>Proceedings of INOC 2003, Evry/Paris</i>. ; 2003.","mla":"Geerdes, Hans-Florian, and Holger Karl. “The Potential of Relaying in Cellular Networks .” <i>Proceedings of INOC 2003, Evry/Paris</i>, 2003.","chicago":"Geerdes, Hans-Florian, and Holger Karl. “The Potential of Relaying in Cellular Networks .” In <i>Proceedings of INOC 2003, Evry/Paris</i>, 2003.","short":"H.-F. Geerdes, H. Karl, in: Proceedings of INOC 2003, Evry/Paris, 2003.","ieee":"H.-F. Geerdes and H. Karl, “The Potential of Relaying in Cellular Networks ,” in <i>Proceedings of INOC 2003, Evry/Paris</i>, 2003.","apa":"Geerdes, H.-F., &#38; Karl, H. (2003). The Potential of Relaying in Cellular Networks . In <i>Proceedings of INOC 2003, Evry/Paris</i>."},"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.4875"}],"_id":"1914","user_id":"15572","year":"2003","status":"public","title":"The Potential of Relaying in Cellular Networks ","author":[{"full_name":"Geerdes, Hans-Florian","first_name":"Hans-Florian","last_name":"Geerdes"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"date_updated":"2022-01-06T06:53:58Z"},{"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7861"}],"_id":"1917","user_id":"15572","title":"Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction","status":"public","year":"2003","author":[{"first_name":"Ana","last_name":"Aguiar","full_name":"Aguiar, Ana"},{"full_name":"Hoene, Christian","last_name":"Hoene","first_name":"Christian"},{"first_name":"Jirka","last_name":"Klaue","full_name":"Klaue, Jirka"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"full_name":"Miesmer, Horst","first_name":"Horst","last_name":"Miesmer"},{"full_name":"Wolisz, Adam","first_name":"Adam","last_name":"Wolisz"}],"date_updated":"2022-01-06T06:53:59Z","date_created":"2018-03-28T10:57:29Z","type":"conference","department":[{"_id":"75"}],"publication":"Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC'03)","citation":{"ieee":"A. Aguiar, C. Hoene, J. Klaue, H. Karl, H. Miesmer, and A. Wolisz, “Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction,” in <i>Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)</i>, 2003.","apa":"Aguiar, A., Hoene, C., Klaue, J., Karl, H., Miesmer, H., &#38; Wolisz, A. (2003). Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction. In <i>Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)</i>.","mla":"Aguiar, Ana, et al. “Channel-Aware Schedulers for VoIP and MPEG4 Based on Channel Prediction.” <i>Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)</i>, 2003.","bibtex":"@inproceedings{Aguiar_Hoene_Klaue_Karl_Miesmer_Wolisz_2003, title={Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction}, booktitle={Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)}, author={Aguiar, Ana and Hoene, Christian and Klaue, Jirka and Karl, Holger and Miesmer, Horst and Wolisz, Adam}, year={2003} }","chicago":"Aguiar, Ana, Christian Hoene, Jirka Klaue, Holger Karl, Horst Miesmer, and Adam Wolisz. “Channel-Aware Schedulers for VoIP and MPEG4 Based on Channel Prediction.” In <i>Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)</i>, 2003.","short":"A. Aguiar, C. Hoene, J. Klaue, H. Karl, H. Miesmer, A. Wolisz, in: Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03), 2003.","ama":"Aguiar A, Hoene C, Klaue J, Karl H, Miesmer H, Wolisz A. Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction. In: <i>Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03)</i>. ; 2003."}},{"intvolume":"        14","date_updated":"2022-01-06T06:54:27Z","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"title":"Definition and Behavior of Langton's Ant in Three Dimensions","status":"public","year":"2003","volume":14,"user_id":"15415","_id":"20435","language":[{"iso":"eng"}],"page":"263--268","citation":{"ieee":"H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” <i>Complex Systems</i>, vol. 14, no. 3, pp. 263--268, 2003.","apa":"Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>, <i>14</i>(3), 263--268.","short":"H. Hamann, Complex Systems 14 (2003) 263--268.","chicago":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i> 14, no. 3 (2003): 263--268.","mla":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i>, vol. 14, no. 3, 2003, pp. 263--268.","bibtex":"@article{Hamann_2003, title={Definition and Behavior of Langton’s Ant in Three Dimensions}, volume={14}, number={3}, journal={Complex Systems}, author={Hamann, Heiko}, year={2003}, pages={263--268} }","ama":"Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>. 2003;14(3):263--268."},"issue":"3","publication":"Complex Systems","department":[{"_id":"63"},{"_id":"238"}],"type":"journal_article","date_created":"2020-11-19T12:15:45Z"},{"abstract":[{"text":"Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors.","lang":"eng"}],"publication":"Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)","citation":{"mla":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–15, doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>.","bibtex":"@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion Polynomials}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>}, booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }","ama":"Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>","ieee":"M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–715.","apa":"Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i> (pp. 705–715). <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>","chicago":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>.","short":"M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T14:18:19Z","date_updated":"2022-01-06T06:53:27Z","publication_status":"published","title":"Quasi-optimal Arithmetic for Quaternion Polynomials","status":"public","year":"2003","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"isbn":["9783540206958","9783540245872"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-24587-2_72","user_id":"15415","page":"705-715","language":[{"iso":"eng"}],"_id":"18196","series_title":"Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg"},{"user_id":"15415","editor":[{"last_name":"Dehne","first_name":"F.","full_name":"Dehne, F."},{"last_name":"Sack","first_name":"JR.","full_name":"Sack, JR."},{"first_name":"M.","last_name":"Smid","full_name":"Smid, M."}],"volume":2748,"_id":"18258","publisher":"Springer","status":"public","place":"Berlin, Heidelberg","citation":{"bibtex":"@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Fast Relative Approximation of Potential Fields}, volume={2748}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler, Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer Science} }","ama":"Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>","mla":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>.","chicago":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>.","short":"M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.","ieee":"M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.","apa":"Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>"},"doi":"10.1007/978-3-540-45078-8_13","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:28Z","publication_status":"published","intvolume":"      2748","year":"2003","title":"Fast Relative Approximation of Potential Fields","corporate_editor":["Algorithms and Data Structures. WADS 2003"],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540405450","9783540450788"]},"author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-25T10:15:14Z","abstract":[{"text":"Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).","lang":"eng"}],"publication":"Lecture Notes in Computer Science"}]