--- _id: '2914' author: - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: May A. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn; 2003. apa: May, A. (2003). New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn. bibtex: '@book{May_2003, title={New RSA Vulnerabilities Using Lattice Reduction Methods}, publisher={Universität Paderborn}, author={May, Alexander}, year={2003} }' chicago: May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003. ieee: A. May, New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003. mla: May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003. short: A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, Universität Paderborn, 2003. date_created: 2018-05-25T10:51:42Z date_updated: 2022-01-06T06:58:46Z department: - _id: '64' main_file_link: - url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20030101205 publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: New RSA Vulnerabilities Using Lattice Reduction Methods type: dissertation user_id: '25078' year: '2003' ... --- _id: '3016' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Alexander full_name: May, Alexander last_name: May citation: ama: 'Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:10.1007/978-3-540-45146-4_2' apa: 'Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2' bibtex: '@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={10.1007/978-3-540-45146-4_2}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }' chicago: 'Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45146-4_2.' ieee: 'J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.' mla: Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2. short: 'J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.' date_created: 2018-06-05T08:24:11Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-45146-4_2 page: 27-43 place: Berlin, Heidelberg publication: Advances in Cryptology - CRYPTO 2003 publication_identifier: isbn: - '9783540406747' - '9783540451464' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: New Partial Key Exposure Attacks on RSA type: book_chapter user_id: '25078' year: '2003' ... --- _id: '3018' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Jean-Pierre full_name: Seifert, Jean-Pierre last_name: Seifert citation: ama: 'Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:10.1007/978-3-540-45126-6_12' apa: 'Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12' bibtex: '@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={10.1007/978-3-540-45126-6_12}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }' chicago: 'Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. https://doi.org/10.1007/978-3-540-45126-6_12.' ieee: 'J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in Financial Cryptography, 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).” Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12. short: 'J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.' date_created: 2018-06-05T08:25:18Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/978-3-540-45126-6_12 page: 162-181 place: Berlin, Heidelberg publication: Financial Cryptography publication_identifier: isbn: - '9783540406631' - '9783540451266' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: Fault Based Cryptanalysis of the Advanced Encryption Standard (AES) type: book_chapter user_id: '25078' year: '2003' ... --- _id: '2128' author: - first_name: Valentina full_name: Damerow, Valentina last_name: Damerow - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: 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' 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 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} }' 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. 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. 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. short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.' date_created: 2018-04-03T05:37:10Z date_updated: 2022-01-06T06:54:52Z department: - _id: '79' - _id: '63' doi: 10.1007/978-3-540-39658-1_17 intvolume: ' 2832' language: - iso: eng page: 161--171 publication: ESA publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Smoothed Motion Complexity type: conference user_id: '14955' volume: 2832 year: '2003' ... --- _id: '2129' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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} }' 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.' ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.' 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.' date_created: 2018-04-03T05:38:36Z date_updated: 2022-01-06T06:54:53Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:04:48Z date_updated: 2018-04-12T09:04:48Z file_id: '2307' file_name: ICALP-03.pdf file_size: 154427 relation: main_file file_date_updated: 2018-04-12T09:04:48Z has_accepted_license: '1' intvolume: ' 2719' language: - iso: eng oa: '1' page: 1153--1168 publication: ICALP publisher: Springer series_title: Lecture Notes in Computer Science status: public title: 'Anycasting in Adversarial Systems: Routing and Admission Control' type: conference urn: '21297' user_id: '14955' volume: 2719 year: '2003' ... --- _id: '2130' author: - first_name: Baruch full_name: Awerbuch, Baruch last_name: Awerbuch - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 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. ieee: B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132. mla: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132. short: 'B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.' date_created: 2018-04-03T05:39:48Z date_updated: 2022-01-06T06:54:53Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:10:10Z date_updated: 2018-04-12T09:10:10Z file_id: '2308' file_name: PODC-03.pdf file_size: 127013 relation: main_file file_date_updated: 2018-04-12T09:10:10Z has_accepted_license: '1' oa: '1' page: 123--132 publication: PODC publisher: ACM status: public title: Peer-to-peer systems for prefix search type: conference urn: '21303' user_id: '15504' year: '2003' ... --- _id: '2131' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Chris full_name: Riley, Chris last_name: Riley - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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. 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} }' chicago: Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003. ieee: A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251. mla: Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251. short: 'A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.' date_created: 2018-04-03T05:41:01Z date_updated: 2022-01-06T06:54:54Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:16:17Z date_updated: 2018-04-12T09:16:17Z file_id: '2310' file_name: RANDOM-03.pdf file_size: 112587 relation: main_file file_date_updated: 2018-04-12T09:16:17Z has_accepted_license: '1' intvolume: ' 2764' oa: '1' page: 240--251 publication: RANDOM-APPROX publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Perfectly Balanced Allocation type: conference urn: '21313' user_id: '15504' volume: 2764 year: '2003' ... --- _id: '2132' author: - first_name: Lujun full_name: Jia, Lujun last_name: Jia - first_name: Rajmohan full_name: Rajaraman, Rajmohan last_name: Rajaraman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: 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.' 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. 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. 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. mla: Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229. short: 'L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.' date_created: 2018-04-03T05:41:53Z date_updated: 2022-01-06T06:54:54Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:18:55Z date_updated: 2018-04-12T09:18:55Z file_id: '2311' file_name: JRS-SPAA-03.pdf file_size: 224200 relation: main_file file_date_updated: 2018-04-12T09:18:55Z has_accepted_license: '1' oa: '1' page: 220--229 publication: SPAA publisher: ACM status: public title: On local algorithms for topology control and routing in ad hoc networks type: conference urn: '21320' user_id: '15504' year: '2003' ... --- _id: '2133' author: - first_name: Kishore full_name: Kothapalli, Kishore last_name: Kothapalli - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kothapalli K, Scheideler C. Information gathering in adversarial systems: lines and cycles. In: SPAA. ACM; 2003:333--342.' apa: 'Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (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} }' chicago: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.' ieee: 'K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.' mla: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.' short: 'K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.' date_created: 2018-04-03T05:42:48Z date_updated: 2022-01-06T06:54:55Z ddc: - '040' department: - _id: '79' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T09:13:43Z date_updated: 2018-04-12T09:15:24Z file_id: '2309' file_name: KS-SPAA-03.pdf file_size: 121448 relation: main_file file_date_updated: 2018-04-12T09:15:24Z has_accepted_license: '1' oa: '1' page: 333--342 publication: SPAA publisher: ACM status: public title: 'Information gathering in adversarial systems: lines and cycles' type: conference urn: '21338' user_id: '15504' year: '2003' ... --- _id: '17423' author: - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: 15th European Simulation Symposium (ESS 2003). SCS - Europe; 2003:367-371.' apa: Mueck, B., Dangelmaier, W., & Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In 15th European Simulation Symposium (ESS 2003) (pp. 367–371). SCS - Europe. 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} }' 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 15th European Simulation Symposium (ESS 2003), 367–71. SCS - Europe, 2003. 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 15th European Simulation Symposium (ESS 2003), 2003, pp. 367–371. mla: Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–71. short: 'B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371.' date_created: 2020-07-28T08:05:14Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' language: - iso: eng page: 367-371 publication: 15th European Simulation Symposium (ESS 2003) publisher: SCS - Europe status: public title: Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment type: conference user_id: '15415' year: '2003' ... --- _id: '18791' 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. author: - first_name: Avner full_name: Magen, Avner last_name: Magen - first_name: Funda full_name: Ergun, Funda last_name: Ergun - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Ronitt full_name: Rubinfeld, Ronitt last_name: Rubinfeld - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Ilan full_name: Newman, Ilan last_name: Newman - first_name: Lance full_name: Fortnow, Lance last_name: Fortnow citation: ama: 'Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). ; 2003:813–822.' apa: Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., & Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) (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} }' chicago: Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 813–822, 2003. ieee: A. Magen et al., “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822. mla: Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822. 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.' date_created: 2020-09-01T14:15:33Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 813–822 publication: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003) publication_identifier: isbn: - '0898715385' status: public title: Sublinear Approximation of Euclidean Minimum Spanning Tree type: conference user_id: '15415' year: '2003' ... --- _id: '18907' abstract: - lang: eng text: In a (randomized) oblivious routing scheme the path chosen for a request
between a source $s$ and a target $t$ is independent from the current traffic
in the network. Hence, such a scheme consists of probability distributions
over $s-t$ paths for every source-target pair $s,t$ in the network.

In a recent result citeR02 it was shown that for any undirected network
there is an oblivious routing scheme that achieves a polylogarithmic
competitive ratio with respect to congestion. Subsequently, Azar et
al. citeACF+03 gave a polynomial time algorithm that for a given network
constructs the best oblivious routing scheme, i.e. the scheme that guarantees
the best possible competitive ratio.
Unfortunately, the latter result is based on the Ellipsoid algorithm; hence
it is unpractical for large networks.

In this paper we present a combinatorial algorithm for constructing an
oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$
for undirected networks. Furthermore, our approach yields a proof
for the existence of an oblivious routing scheme with competitive ratio
$O(log^3n)$, which is much simpler than the original proof from citeR02. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Harald full_name: Räcke, Harald last_name: Räcke citation: ama: 'Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03. ; 2003. doi:10.1145/777412.777418' apa: Bienkowski, M., Korzeniowski, M., & Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03. https://doi.org/10.1145/777412.777418 bibtex: '@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm for constructing oblivious routing schemes}, DOI={10.1145/777412.777418}, 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} }' chicago: Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003. https://doi.org/10.1145/777412.777418. ieee: M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03, 2003. mla: Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003, doi:10.1145/777412.777418. short: 'M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.' date_created: 2020-09-03T07:44:01Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1145/777412.777418 language: - iso: eng publication: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03 publication_identifier: isbn: - '1581136617' publication_status: published status: public title: A practical algorithm for constructing oblivious routing schemes type: conference user_id: '15415' year: '2003' ... --- _id: '18947' 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. author: - first_name: Carsten full_name: Rust, Carsten last_name: Rust - first_name: Friedhelm full_name: Stappert, Friedhelm last_name: Stappert - first_name: Tamás full_name: Lukovszki, Tamás last_name: Lukovszki citation: ama: 'Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: 7th World Multiconference on Systemics, Cybernetics and Informatics. ; 2003.' apa: Rust, C., Stappert, F., & Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In 7th World Multiconference on Systemics, Cybernetics and Informatics. 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} }' 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 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 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003. mla: Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003. short: 'C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.' date_created: 2020-09-03T11:50:06Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' language: - iso: eng publication: 7th World Multiconference on Systemics, Cybernetics and Informatics status: public title: A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture type: conference user_id: '15415' year: '2003' ... --- _id: '18960' abstract: - lang: eng 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. author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Tamás full_name: Lukovszki, Tamás last_name: Lukovszki - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: 'Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03). ; 2003. doi:10.1145/777412.777448' apa: Schindelhauer, C., Lukovszki, T., Rührup, S., & Volbert, K. (2003). Worst case mobility in ad hoc networks. In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03). https://doi.org/10.1145/777412.777448 bibtex: '@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={10.1145/777412.777448}, 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} }' chicago: Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003. https://doi.org/10.1145/777412.777448. ieee: C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003. mla: Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003, doi:10.1145/777412.777448. short: 'C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.' date_created: 2020-09-03T13:10:50Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' doi: 10.1145/777412.777448 language: - iso: eng publication: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03) publication_identifier: isbn: - '1581136617' publication_status: published status: public title: Worst case mobility in ad hoc networks type: conference user_id: '15415' year: '2003' ... --- _id: '18966' 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. author: - first_name: Yossi full_name: Azar, Yossi last_name: Azar - first_name: Edith full_name: Cohen, Edith last_name: Cohen - first_name: Amos full_name: Fiat, Amos last_name: Fiat - first_name: Haim full_name: Kaplan, Haim last_name: Kaplan - first_name: Harald full_name: Racke, Harald last_name: Racke citation: ama: 'Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03. ; 2003. doi:10.1145/780542.780599' apa: Azar, Y., Cohen, E., Fiat, A., Kaplan, H., & Racke, H. (2003). Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03. https://doi.org/10.1145/780542.780599 bibtex: '@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious routing in polynomial time}, DOI={10.1145/780542.780599}, 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} }' chicago: Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003. https://doi.org/10.1145/780542.780599. ieee: Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03, 2003. mla: Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003, doi:10.1145/780542.780599. 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.' date_created: 2020-09-03T14:34:33Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' doi: 10.1145/780542.780599 language: - iso: eng publication: Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC '03 publication_identifier: isbn: - '1581136749' publication_status: published status: public title: Optimal oblivious routing in polynomial time type: conference user_id: '15415' year: '2003' ... --- _id: '18982' 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.
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. author: - first_name: Joachim full_name: Gehweiler, Joachim last_name: Gehweiler citation: ama: Gehweiler J. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. Universität Paderborn; 2003. apa: Gehweiler, J. (2003). Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. 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} }' chicago: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. Universität Paderborn, 2003. ieee: J. Gehweiler, Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java. Universität Paderborn, 2003. mla: Gehweiler, Joachim. Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java. 2003. short: J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java, Universität Paderborn, 2003. date_created: 2020-09-04T08:03:37Z date_updated: 2022-01-06T06:53:56Z ddc: - '004' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-09-04T08:03:11Z date_updated: 2020-09-04T08:03:11Z file_id: '18985' file_name: pub-hni-2464.pdf file_size: 703144 relation: main_file success: 1 file_date_updated: 2020-09-04T08:03:11Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn status: public title: Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java type: mastersthesis user_id: '15415' year: '2003' ... --- _id: '1913' author: - first_name: X. full_name: Fu, X. last_name: Fu - first_name: T. full_name: Chen, T. last_name: Chen - first_name: A. full_name: Festag, A. last_name: Festag - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: G. full_name: Schäfer, G. last_name: Schäfer - first_name: C. full_name: Fan, C. last_name: Fan citation: ama: 'Fu X, Chen T, Festag A, Karl H, Schäfer G, Fan C. Secure, QoS-Enabled Mobility Support for IP-based Networks. In: Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember . ; 2003.' apa: Fu, X., Chen, T., Festag, A., Karl, H., Schäfer, G., & Fan, C. (2003). Secure, QoS-Enabled Mobility Support for IP-based Networks. In Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember . 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} }' 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 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 Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 2003. mla: Fu, X., et al. “Secure, QoS-Enabled Mobility Support for IP-Based Networks.” Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember , 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.' date_created: 2018-03-28T10:31:07Z date_updated: 2022-01-06T06:53:58Z department: - _id: '75' main_file_link: - url: http://citeseer.ist.psu.edu/viewdoc/download;jsessionid=A970489A85406D205EE59F71B67AB954?doi=10.1.1.10.5592&rep=rep1&type=pdf publication: 'Proceedings IP Based Cellular Network Conference IPCN, Paris / France, Dezember ' status: public title: Secure, QoS-Enabled Mobility Support for IP-based Networks type: conference user_id: '15572' year: '2003' ... --- _id: '1914' author: - first_name: Hans-Florian full_name: Geerdes, Hans-Florian last_name: Geerdes - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Geerdes H-F, Karl H. The Potential of Relaying in Cellular Networks . In: Proceedings of INOC 2003, Evry/Paris. ; 2003.' apa: Geerdes, H.-F., & Karl, H. (2003). The Potential of Relaying in Cellular Networks . In Proceedings of INOC 2003, Evry/Paris. 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} }' chicago: Geerdes, Hans-Florian, and Holger Karl. “The Potential of Relaying in Cellular Networks .” In Proceedings of INOC 2003, Evry/Paris, 2003. ieee: H.-F. Geerdes and H. Karl, “The Potential of Relaying in Cellular Networks ,” in Proceedings of INOC 2003, Evry/Paris, 2003. mla: Geerdes, Hans-Florian, and Holger Karl. “The Potential of Relaying in Cellular Networks .” Proceedings of INOC 2003, Evry/Paris, 2003. short: 'H.-F. Geerdes, H. Karl, in: Proceedings of INOC 2003, Evry/Paris, 2003.' date_created: 2018-03-28T10:34:28Z date_updated: 2022-01-06T06:53:58Z department: - _id: '75' main_file_link: - url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.4875 publication: Proceedings of INOC 2003, Evry/Paris status: public title: 'The Potential of Relaying in Cellular Networks ' type: conference user_id: '15572' year: '2003' ... --- _id: '1917' author: - first_name: Ana full_name: Aguiar, Ana last_name: Aguiar - first_name: Christian full_name: Hoene, Christian last_name: Hoene - first_name: Jirka full_name: Klaue, Jirka last_name: Klaue - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Horst full_name: Miesmer, Horst last_name: Miesmer - first_name: Adam full_name: Wolisz, Adam last_name: Wolisz citation: 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: Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03). ; 2003.' apa: Aguiar, A., Hoene, C., Klaue, J., Karl, H., Miesmer, H., & Wolisz, A. (2003). Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction. In Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03). 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 Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03), 2003. 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 Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03), 2003. mla: Aguiar, Ana, et al. “Channel-Aware Schedulers for VoIP and MPEG4 Based on Channel Prediction.” Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC’03), 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.' date_created: 2018-03-28T10:57:29Z date_updated: 2022-01-06T06:53:59Z department: - _id: '75' main_file_link: - url: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7861 publication: Proc. of 8th Intl. Workshop on Mobile Multimedia Communications (MoMuC'03) status: public title: Channel-aware Schedulers for VoIP and MPEG4 based on Channel Prediction type: conference user_id: '15572' year: '2003' ... --- _id: '20435' author: - first_name: Heiko full_name: Hamann, Heiko last_name: Hamann citation: ama: Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems. 2003;14(3):263--268. apa: Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. Complex Systems, 14(3), 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} }' chicago: 'Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems 14, no. 3 (2003): 263--268.' ieee: H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” Complex Systems, vol. 14, no. 3, pp. 263--268, 2003. mla: Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” Complex Systems, vol. 14, no. 3, 2003, pp. 263--268. short: H. Hamann, Complex Systems 14 (2003) 263--268. date_created: 2020-11-19T12:15:45Z date_updated: 2022-01-06T06:54:27Z department: - _id: '63' - _id: '238' intvolume: ' 14' issue: '3' language: - iso: eng page: 263--268 publication: Complex Systems status: public title: Definition and Behavior of Langton's Ant in Three Dimensions type: journal_article user_id: '15415' volume: 14 year: '2003' ...