--- _id: '16472' author: - first_name: Erik D. full_name: Demaine, Erik D. last_name: Demaine - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Rasmus full_name: Pagh, Rasmus last_name: Pagh - first_name: Mihai full_name: Pǎtraşcu, Mihai last_name: Pǎtraşcu citation: ama: 'Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: LATIN 2006: Theoretical Informatics. Berlin, Heidelberg; 2006. doi:10.1007/11682462_34' apa: 'Demaine, E. D., Meyer auf der Heide, F., Pagh, R., & Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/11682462_34' bibtex: '@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin, Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}, DOI={10.1007/11682462_34}, booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006} }' chicago: 'Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11682462_34.' ieee: 'E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' mla: 'Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.' short: 'E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:36:10Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11682462_34 language: - iso: eng place: Berlin, Heidelberg publication: 'LATIN 2006: Theoretical Informatics' publication_identifier: isbn: - '9783540327554' - '9783540327561' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space) type: book_chapter user_id: '15415' year: '2006' ... --- _id: '16473' author: - first_name: M. full_name: Dynia, M. last_name: Dynia - first_name: J. full_name: Kutyłowski, J. last_name: Kutyłowski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 2006. doi:10.1007/11821069_29' apa: Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., & Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/11821069_29 bibtex: '@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={10.1007/11821069_29}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }' chicago: Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11821069_29. ieee: M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006. mla: Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29. short: 'M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.' date_created: 2020-04-08T09:38:28Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1007/11821069_29 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540377917' - '9783540377931' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Smart Robot Teams Exploring Sparse Trees type: book_chapter user_id: '15415' year: '2006' ... --- _id: '15150' author: - first_name: Stefan full_name: Böttcher, Stefan id: '624' last_name: Böttcher - first_name: Rita full_name: Steinmetz, Rita id: '14961' last_name: Steinmetz citation: ama: 'Böttcher S, Steinmetz R. DTD-Driven Structure Preserving XML Compression. In: Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23. Berlin, Heidelberg; 2006:266-269. doi:10.1007/11788911_27' apa: Böttcher, S., & Steinmetz, R. (2006). DTD-Driven Structure Preserving XML Compression. In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23 (pp. 266–269). Berlin, Heidelberg. https://doi.org/10.1007/11788911_27 bibtex: '@inproceedings{Böttcher_Steinmetz_2006, place={Berlin, Heidelberg}, title={DTD-Driven Structure Preserving XML Compression}, DOI={10.1007/11788911_27}, booktitle={Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2006}, pages={266–269} }' chicago: Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.” In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 266–69. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11788911_27. ieee: S. Böttcher and R. Steinmetz, “DTD-Driven Structure Preserving XML Compression,” in Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–269. mla: Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.” Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–69, doi:10.1007/11788911_27. short: 'S. Böttcher, R. Steinmetz, in: Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, Berlin, Heidelberg, 2006, pp. 266–269.' date_created: 2019-11-22T09:21:07Z date_updated: 2022-01-06T06:52:16Z department: - _id: '69' doi: 10.1007/11788911_27 language: - iso: eng page: 266-269 place: Berlin, Heidelberg publication: Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23 publication_identifier: isbn: - '9783540359692' - '9783540359715' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: DTD-Driven Structure Preserving XML Compression type: conference user_id: '14961' year: '2006' ... --- _id: '15152' author: - first_name: Stefan full_name: Böttcher, Stefan id: '624' last_name: Böttcher - first_name: Rita full_name: Steinmetz, Rita id: '14961' last_name: Steinmetz citation: ama: 'Böttcher S, Steinmetz R. Information Disclosure by XPath Queries. In: Secure Data Management, Third VLDB Workshop, SDM 2006. Springer; 2006:160-174. doi:10.1007/11844662_12' apa: Böttcher, S., & Steinmetz, R. (2006). Information Disclosure by XPath Queries. In Secure Data Management, Third VLDB Workshop, SDM 2006 (pp. 160–174). Springer. https://doi.org/10.1007/11844662_12 bibtex: '@inproceedings{Böttcher_Steinmetz_2006, title={Information Disclosure by XPath Queries}, DOI={10.1007/11844662_12}, booktitle={Secure Data Management, Third VLDB Workshop, SDM 2006}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2006}, pages={160–174} }' chicago: Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.” In Secure Data Management, Third VLDB Workshop, SDM 2006, 160–74. Springer, 2006. https://doi.org/10.1007/11844662_12. ieee: S. Böttcher and R. Steinmetz, “Information Disclosure by XPath Queries,” in Secure Data Management, Third VLDB Workshop, SDM 2006, 2006, pp. 160–174. mla: Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.” Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–74, doi:10.1007/11844662_12. short: 'S. Böttcher, R. Steinmetz, in: Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–174.' date_created: 2019-11-22T09:22:46Z date_updated: 2022-01-06T06:52:16Z department: - _id: '69' doi: 10.1007/11844662_12 language: - iso: eng page: 160-174 publication: Secure Data Management, Third VLDB Workshop, SDM 2006 publication_identifier: isbn: - '9783540389842' - '9783540389873' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Information Disclosure by XPath Queries type: conference user_id: '14961' year: '2006' ... --- _id: '53181' author: - first_name: Willi full_name: Geiselmann, Willi last_name: Geiselmann - first_name: Fabian full_name: Januszewski, Fabian id: '81636' last_name: Januszewski - first_name: Hubert full_name: Köpfer, Hubert last_name: Köpfer - first_name: Jan full_name: Pelzl, Jan last_name: Pelzl - first_name: Rainer full_name: Steinwandt, Rainer last_name: Steinwandt citation: ama: 'Geiselmann W, Januszewski F, Köpfer H, Pelzl J, Steinwandt R. A Simpler Sieving Device: Combining ECM and TWIRL. In: Information Security and Cryptology – ICISC 2006. Springer Berlin Heidelberg; 2006. doi:10.1007/11927587_12' apa: 'Geiselmann, W., Januszewski, F., Köpfer, H., Pelzl, J., & Steinwandt, R. (2006). A Simpler Sieving Device: Combining ECM and TWIRL. In Information Security and Cryptology – ICISC 2006. Springer Berlin Heidelberg. https://doi.org/10.1007/11927587_12' bibtex: '@inbook{Geiselmann_Januszewski_Köpfer_Pelzl_Steinwandt_2006, place={Berlin, Heidelberg}, title={A Simpler Sieving Device: Combining ECM and TWIRL}, DOI={10.1007/11927587_12}, booktitle={Information Security and Cryptology – ICISC 2006}, publisher={Springer Berlin Heidelberg}, author={Geiselmann, Willi and Januszewski, Fabian and Köpfer, Hubert and Pelzl, Jan and Steinwandt, Rainer}, year={2006} }' chicago: 'Geiselmann, Willi, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, and Rainer Steinwandt. “A Simpler Sieving Device: Combining ECM and TWIRL.” In Information Security and Cryptology – ICISC 2006. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11927587_12.' ieee: 'W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, and R. Steinwandt, “A Simpler Sieving Device: Combining ECM and TWIRL,” in Information Security and Cryptology – ICISC 2006, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.' mla: 'Geiselmann, Willi, et al. “A Simpler Sieving Device: Combining ECM and TWIRL.” Information Security and Cryptology – ICISC 2006, Springer Berlin Heidelberg, 2006, doi:10.1007/11927587_12.' short: 'W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, R. Steinwandt, in: Information Security and Cryptology – ICISC 2006, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006.' date_created: 2024-04-03T16:36:47Z date_updated: 2024-04-03T17:11:55Z doi: 10.1007/11927587_12 extern: '1' language: - iso: eng place: Berlin, Heidelberg publication: Information Security and Cryptology – ICISC 2006 publication_identifier: isbn: - '9783540491125' - '9783540491149' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg status: public title: 'A Simpler Sieving Device: Combining ECM and TWIRL' type: book_chapter user_id: '81636' year: '2006' ... --- _id: '35958' abstract: - lang: eng text: We establish a link between some heuristic asymptotic formulas (due to Cohen and Lenstra) concerning the moments of the p–part of the class groups of quadratic fields and formulas giving the frequency of the values of the p–rank of these class groups. author: - first_name: Étienne full_name: Fouvry, Étienne last_name: Fouvry - first_name: Jürgen full_name: Klüners, Jürgen id: '21202' last_name: Klüners citation: ama: 'Fouvry É, Klüners J. Cohen–Lenstra Heuristics of Quadratic Number Fields. In: Lecture Notes in Computer Science. Springer Berlin Heidelberg; 2006. doi:10.1007/11792086_4' apa: Fouvry, É., & Klüners, J. (2006). Cohen–Lenstra Heuristics of Quadratic Number Fields. In Lecture Notes in Computer Science. Springer Berlin Heidelberg. https://doi.org/10.1007/11792086_4 bibtex: '@inbook{Fouvry_Klüners_2006, place={Berlin, Heidelberg}, title={Cohen–Lenstra Heuristics of Quadratic Number Fields}, DOI={10.1007/11792086_4}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Fouvry, Étienne and Klüners, Jürgen}, year={2006} }' chicago: 'Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.” In Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11792086_4.' ieee: 'É. Fouvry and J. Klüners, “Cohen–Lenstra Heuristics of Quadratic Number Fields,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.' mla: Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, doi:10.1007/11792086_4. short: 'É. Fouvry, J. Klüners, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006.' date_created: 2023-01-11T09:46:47Z date_updated: 2023-03-06T09:13:15Z department: - _id: '102' doi: 10.1007/11792086_4 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540360759' - '9783540360766' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg related_material: link: - relation: confirmation url: https://www.researchgate.net/profile/Juergen-Klueners/publication/221451567_Cohen-Lenstra_Heuristics_of_Quadratic_Number_Fields/links/0a85e53298eaed8777000000/Cohen-Lenstra-Heuristics-of-Quadratic-Number-Fields.pdf?origin=publication_detail status: public title: Cohen–Lenstra Heuristics of Quadratic Number Fields type: book_chapter user_id: '93826' year: '2006' ... --- _id: '19835' abstract: - lang: eng text: The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with
variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.
In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.

Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account.
Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion. author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Klaus full_name: Volbert, Klaus last_name: Volbert citation: ama: 'Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005). Vol 3738. ; 2005:244-257. doi:10.1007/11561354_21' apa: Rührup, S., Schindelhauer, C., & Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) (Vol. 3738, pp. 244–257). https://doi.org/10.1007/11561354_21 bibtex: '@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={10.1007/11561354_21}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }' chicago: Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 3738:244–57, 2005. https://doi.org/10.1007/11561354_21. ieee: S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257. mla: Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21. short: 'S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257.' date_created: 2020-10-01T11:31:14Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_21 intvolume: ' 3738' language: - iso: eng page: 244-257 publication: Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Performance Analysis of the Hierarchical Layer Graph for Wireless Networks type: conference user_id: '15415' volume: 3738 year: '2005' ... --- _id: '19836' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Kerstin full_name: Voß, Kerstin last_name: Voß citation: ama: 'Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005). 3738. ; 2005:271-284. doi:10.1007/11561354_23' apa: Schindelhauer, C., & Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) (pp. 271–284). https://doi.org/10.1007/11561354_23 bibtex: '@inbook{Schindelhauer_Voß_2005, series={3738}, title={Probability Distributions for Channel Utilisation}, DOI={10.1007/11561354_23}, booktitle={Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)}, author={Schindelhauer, Christian and Voß, Kerstin}, year={2005}, pages={271–284}, collection={3738} }' chicago: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” In Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 271–84. 3738, 2005. https://doi.org/10.1007/11561354_23. ieee: C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284. mla: Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23. short: 'C. Schindelhauer, K. Voß, in: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.' date_created: 2020-10-01T11:36:30Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11561354_23 language: - iso: eng page: 271-284 publication: Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005) publication_identifier: isbn: - '9783540291329' - '9783540320869' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: '3738' status: public title: Probability Distributions for Channel Utilisation type: book_chapter user_id: '15415' year: '2005' ... --- _id: '19912' author: - first_name: Chris full_name: Loeser, Chris last_name: Loeser - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer citation: ama: 'Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: Proceedings of the 4th International Conference on Networking. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:10.1007/978-3-540-31957-3_90' apa: Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., & Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_90 bibtex: '@inproceedings{Loeser_Schomaker_Brinkmann_Vodisek_Heidebuer_2005, place={Berlin, Heidelberg}, title={Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}, volume={3421}, DOI={10.1007/978-3-540-31957-3_90}, booktitle={Proceedings of the 4th International Conference on Networking}, author={Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, year={2005}, pages={800–810} }' chicago: Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” In Proceedings of the 4th International Conference on Networking, 3421:800–810. Berlin, Heidelberg, 2005. https://doi.org/10.1007/978-3-540-31957-3_90. ieee: C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810. mla: Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90. short: 'C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, M. Heidebuer, in: Proceedings of the 4th International Conference on Networking, Berlin, Heidelberg, 2005, pp. 800–810.' date_created: 2020-10-06T10:36:14Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1007/978-3-540-31957-3_90 intvolume: ' 3421' language: - iso: eng page: 800-810 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253389' - '9783540319573' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts type: conference user_id: '15415' volume: 3421 year: '2005' ... --- _id: '3006' 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. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15' apa: 'Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15' bibtex: '@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={10.1007/11426639_15}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }' chicago: 'Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_15.' ieee: 'J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.' mla: Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15. short: 'J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.' date_created: 2018-06-05T08:16:47Z date_updated: 2022-01-06T06:58:50Z ddc: - '000' department: - _id: '64' doi: 10.1007/11426639_15 file: - access_level: closed content_type: application/pdf creator: feidens date_created: 2018-06-05T08:18:20Z date_updated: 2018-06-05T08:18:20Z file_id: '3008' file_name: toolkit.pdf file_size: 333655 relation: main_file success: 1 file_date_updated: 2018-06-05T08:18:20Z has_accepted_license: '1' page: 251-267 place: Berlin, Heidelberg publication: EUROCRYPT 2005 publication_identifier: isbn: - '9783540259107' - '9783540320555' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg series_title: Lecture Notes in Computer Science status: public title: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers type: book_chapter user_id: '25078' year: '2005' ... --- _id: '3010' author: - first_name: Matthias full_name: Ernst, Matthias last_name: Ernst - first_name: Ellen full_name: Jochemsz, Ellen last_name: Jochemsz - first_name: Alexander full_name: May, Alexander last_name: May - first_name: Benne full_name: de Weger, Benne last_name: de Weger citation: ama: 'Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: EUROCRYPT 2005. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:10.1007/11426639_22' apa: 'Ernst, M., Jochemsz, E., May, A., & de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_22' bibtex: '@inbook{Ernst_Jochemsz_May_de Weger_2005, place={Berlin, Heidelberg}, series={LNCS}, title={Partial Key Exposure Attacks on RSA up to Full Size Exponents}, DOI={10.1007/11426639_22}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne}, year={2005}, pages={371–386}, collection={LNCS} }' chicago: 'Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. https://doi.org/10.1007/11426639_22.' ieee: 'M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.' mla: Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:10.1007/11426639_22. short: 'M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.' date_created: 2018-06-05T08:19:48Z date_updated: 2022-01-06T06:58:51Z department: - _id: '64' doi: 10.1007/11426639_22 page: 371-386 place: Berlin, Heidelberg publication: EUROCRYPT 2005 publication_identifier: isbn: - '9783540259107' - '9783540320555' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer Berlin Heidelberg series_title: LNCS status: public title: Partial Key Exposure Attacks on RSA up to Full Size Exponents type: book_chapter user_id: '25078' year: '2005' ... --- _id: '26991' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: Algorithms – ESA 2005. ; 2005. doi:10.1007/11561071_5' apa: Rührup, S., & Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_5 bibtex: '@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={10.1007/11561071_5}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In Algorithms – ESA 2005. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11561071_5. ieee: S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in Algorithms – ESA 2005, Berlin, Heidelberg, 2005. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5. short: 'S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.' date_created: 2021-10-28T10:22:39Z date_updated: 2022-01-06T06:57:31Z department: - _id: '63' - _id: '26' doi: 10.1007/11561071_5 language: - iso: eng place: Berlin, Heidelberg publication: Algorithms – ESA 2005 publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio type: book_chapter user_id: '15415' year: '2005' ... --- _id: '18768' author: - first_name: Mihai full_name: Bădoiu, Mihai last_name: Bădoiu - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg; 2005:866-877. doi:10.1007/11523468_70' apa: Bădoiu, M., Czumaj, A., Indyk, P., & Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg. https://doi.org/10.1007/11523468_70 bibtex: '@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={10.1007/11523468_70}, booktitle={Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, author={Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, year={2005}, pages={866–877} }' chicago: Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 866–77. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11523468_70. ieee: M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–877. mla: Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70. short: 'M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, in: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Berlin, Heidelberg, 2005, pp. 866–877.' date_created: 2020-09-01T11:53:19Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1007/11523468_70 language: - iso: eng page: 866-877 place: Berlin, Heidelberg publication: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) publication_identifier: isbn: - '9783540275800' - '9783540316916' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Facility Location in Sublinear Time type: conference user_id: '15415' year: '2005' ... --- _id: '18867' abstract: - lang: eng text: Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.
We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Jens full_name: Krokowski, Jens last_name: Krokowski citation: ama: 'Frahling G, Krokowski J. Online Occlusion Culling. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:10.1007/11561071_67' apa: 'Frahling, G., & Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. https://doi.org/10.1007/11561071_67' bibtex: '@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={10.1007/11561071_67}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }' chicago: 'Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:758–69. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/11561071_67.' ieee: G. Frahling and J. Krokowski, “Online Occlusion Culling,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 758–769. mla: Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67. short: 'G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.' date_created: 2020-09-02T13:26:52Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1007/11561071_67 intvolume: ' 3669' language: - iso: eng page: 758-769 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Online Occlusion Culling type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18912' abstract: - lang: eng text: 'We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg; 2005. doi:10.1007/11549468_105' apa: Bienkowski, M., & Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg. https://doi.org/10.1007/11549468_105 bibtex: '@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={10.1007/11549468_105}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }' chicago: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg, 2005. https://doi.org/10.1007/11549468_105. ieee: M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in Proc. of the European Conference in Parallel Processing (Euro-Par), 2005. mla: Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105. short: 'M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.' date_created: 2020-09-03T07:56:58Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11549468_105 language: - iso: eng place: Berlin, Heidelberg publication: Proc. of the European Conference in Parallel Processing (Euro-Par) publication_identifier: isbn: - '9783540287001' - '9783540319252' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Dynamic Page Migration Under Brownian Motion type: conference user_id: '15415' year: '2005' ... --- _id: '18915' abstract: - lang: eng text: We present a simple two-person Bucket Game, based on throwing balls into buckets, and we
discuss possible players' strategies.

We use these strategies to create an approximation algorithm for a generalization of
the well known Set Cover problem, where we need to cover each element by at least $k$ sets.
Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration
problem achieving the optimal competitive ratio against an oblivious adversary. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Jarosław full_name: Byrka, Jarosław last_name: Byrka citation: ama: 'Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72' apa: 'Bienkowski, M., & Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . https://doi.org/10.1007/11561071_72' bibtex: '@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={10.1007/11561071_72}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer }, author={Bienkowski, Marcin and Byrka, Jarosław}, year={2005}, pages={815–826} }' chicago: 'Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 3669:815–26. Berlin, Heidelberg: Springer , 2005. https://doi.org/10.1007/11561071_72.' ieee: M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), 2005, vol. 3669, pp. 815–826. mla: Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72. short: 'M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.' date_created: 2020-09-03T08:11:11Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/11561071_72 intvolume: ' 3669' language: - iso: eng page: 815-826 place: Berlin, Heidelberg publication: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) publication_identifier: isbn: - '9783540291183' - '9783540319511' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: 'Springer ' status: public title: Bucket Game with Applications to Set Multicover and Dynamic Page Migration type: conference user_id: '15415' volume: 3669 year: '2005' ... --- _id: '18924' abstract: - lang: eng text: Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski - first_name: Orhan full_name: Orhan, Orhan last_name: Orhan citation: ama: 'Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49' apa: 'Bienkowski, M., Brinkmann, A., Korzeniowski, M., & Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In Proceedings of the 4th International Conference on Networking (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-31956-6_49' bibtex: '@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={10.1007/978-3-540-31956-6_49}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }' chicago: 'Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In Proceedings of the 4th International Conference on Networking, 3420:413–20. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. https://doi.org/10.1007/978-3-540-31956-6_49.' ieee: M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3420, pp. 413–420. mla: Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49. short: 'M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.' date_created: 2020-09-03T09:52:33Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31956-6_49 intvolume: ' 3420' language: - iso: eng page: 413-420 place: Berlin, Heidelberg publication: Proceedings of the 4th International Conference on Networking publication_identifier: isbn: - '9783540253396' - '9783540319566' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: ' Lecture Notes in Computer Science' status: public title: Cube Connected Cycles Based Bluetooth Scatternet Formation type: conference user_id: '15415' volume: 3420 year: '2005' ... --- _id: '18925' abstract: - lang: eng text: The dynamic page migration problem citedynamic-page-migration is defined in
a distributed network of $n$ mobile nodes sharing one indivisible memory page
of size $D$. During runtime, the nodes can both access a unit of data from
the page and move with a constant speed, thus changing the costs of communication.
The problem is to compute online a schedule of page movements
to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.
We prove that it achieves an (up to a constant factor) optimal competitive ratio
$O(n cdot sqrtD)$. We show that the randomization of this algorithm
improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).
This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.
We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Miroslaw full_name: Dynia, Miroslaw last_name: Dynia - first_name: Miroslaw full_name: Korzeniowski, Miroslaw last_name: Korzeniowski citation: ama: 'Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30' apa: Bienkowski, M., Dynia, M., & Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 365–376). https://doi.org/10.1007/978-3-540-31856-9_30 bibtex: '@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={10.1007/978-3-540-31856-9_30}, booktitle={Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, year={2005}, pages={365–376}, collection={Lecture Notes in Computer Science} }' chicago: Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 365–76. Lecture Notes in Computer Science, 2005. https://doi.org/10.1007/978-3-540-31856-9_30. ieee: M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376. mla: Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30. short: 'M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376.' date_created: 2020-09-03T10:01:03Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' doi: 10.1007/978-3-540-31856-9_30 language: - iso: eng page: 365-376 publication: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) publication_identifier: isbn: - '9783540249986' - '9783540318569' issn: - 0302-9743 - 1611-3349 publication_status: published series_title: Lecture Notes in Computer Science status: public title: Improved Algorithms for Dynamic Page Migration type: conference user_id: '15415' year: '2005' ... --- _id: '17988' author: - first_name: Sven full_name: Köhler, Sven last_name: Köhler - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40' apa: Köhler, S., Schindelhauer, C., & Ziegler, M. (2005). On Approximating Real-World Halting Problems. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_40 bibtex: '@inbook{Köhler_Schindelhauer_Ziegler_2005, place={Berlin, Heidelberg}, title={On Approximating Real-World Halting Problems}, DOI={10.1007/11537311_40}, booktitle={Fundamentals of Computation Theory}, author={Köhler, Sven and Schindelhauer, Christian and Ziegler, Martin}, year={2005} }' chicago: Köhler, Sven, Christian Schindelhauer, and Martin Ziegler. “On Approximating Real-World Halting Problems.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_40. ieee: S. Köhler, C. Schindelhauer, and M. Ziegler, “On Approximating Real-World Halting Problems,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Köhler, Sven, et al. “On Approximating Real-World Halting Problems.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40. short: 'S. Köhler, C. Schindelhauer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:44:48Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_40 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: On Approximating Real-World Halting Problems type: book_chapter user_id: '15415' year: '2005' ... --- _id: '17989' author: - first_name: Klaus full_name: Meer, Klaus last_name: Meer - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41' apa: Meer, K., & Ziegler, M. (2005). An Explicit Solution to Post’s Problem over the Reals. In Fundamentals of Computation Theory. Berlin, Heidelberg. https://doi.org/10.1007/11537311_41 bibtex: '@inbook{Meer_Ziegler_2005, place={Berlin, Heidelberg}, title={An Explicit Solution to Post’s Problem over the Reals}, DOI={10.1007/11537311_41}, booktitle={Fundamentals of Computation Theory}, author={Meer, Klaus and Ziegler, Martin}, year={2005} }' chicago: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” In Fundamentals of Computation Theory. Berlin, Heidelberg, 2005. https://doi.org/10.1007/11537311_41. ieee: K. Meer and M. Ziegler, “An Explicit Solution to Post’s Problem over the Reals,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 2005. mla: Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.” Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41. short: 'K. Meer, M. Ziegler, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 2005.' date_created: 2020-08-14T13:46:23Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/11537311_41 language: - iso: eng place: Berlin, Heidelberg publication: Fundamentals of Computation Theory publication_identifier: isbn: - '9783540281931' - '9783540318736' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: An Explicit Solution to Post’s Problem over the Reals type: book_chapter user_id: '15415' year: '2005' ...