--- _id: '17413' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: Fischer M. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Fischer, M. (2005). Design, analysis, and evaluation of a data structure for distributed virtual environments (Vol. 164). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Fischer_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Design, analysis, and evaluation of a data structure for distributed virtual environments}, volume={164}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Vol. 164. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: M. Fischer, Design, analysis, and evaluation of a data structure for distributed virtual environments, vol. 164. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Fischer, Matthias. Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: M. Fischer, Design, Analysis, and Evaluation of a Data Structure for Distributed Virtual Environments, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-07-27T12:01:54Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 164' language: - iso: eng publication_identifier: isbn: - 3-935433-73-5 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20050101109 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Design, analysis, and evaluation of a data structure for distributed virtual environments type: dissertation user_id: '5786' volume: 164 year: '2005' ... --- _id: '17414' abstract: - lang: eng text: "Nowadays companies operate in a difficult environment: the dynamics of innovations increase and product life cycles become shorter. Furthermore products and the corresponding manufacturing processes get more and more complex. Therefore, companies need new methods for the planning of manufacturing systems. One promising approach in this context is digital factory/virtual production\x97the modeling and analysis of computer models of the planned factory with the objective to reduce time and costs. For the modeling and analysis various simulation methods and programs have been developed. They are a highly valuable support for planning and visualizing the manufacturing system. But there is one major disadvantage: only experienced and long trained experts are able to operate with these programs. The graphical user interface is very complex and not intuitive to use. This results in an extensive and error-prone modeling of complex simulation models and a time-consuming interpretation of the simulation results.\r\n\r\nTo overcome these weak points, intuitive and understandable man\x96machine interfaces like augmented and virtual reality can be used. This paper describes the architecture of a system which uses the technologies of augmented and virtual reality to support the planning process of complex manufacturing systems. The proposed system assists the user in modeling, the validation of the simulation model, and the subsequent optimization of the production system. A general application of the VR- and AR-technologies and of the simulation is realized by the development of appropriate linking and integration mechanisms. For the visualization of the arising 3D-data within the VR- and AR-environments, a dedicated 3D-rendering library is used." author: - first_name: Wilhelm full_name: Dangelmaier, Wilhelm last_name: Dangelmaier - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jürgen full_name: Gausemeier, Jürgen last_name: Gausemeier - first_name: Michael full_name: Grafe, Michael last_name: Grafe - first_name: Carsten full_name: Matysczok, Carsten last_name: Matysczok - first_name: Bengt full_name: Mueck, Bengt last_name: Mueck citation: ama: Dangelmaier W, Fischer M, Gausemeier J, Grafe M, Matysczok C, Mueck B. Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry. 2005:371-383. doi:10.1016/j.compind.2005.01.007 apa: Dangelmaier, W., Fischer, M., Gausemeier, J., Grafe, M., Matysczok, C., & Mueck, B. (2005). Virtual and augmented reality support for discrete manufacturing system simulation. Computers in Industry, 371–383. https://doi.org/10.1016/j.compind.2005.01.007 bibtex: '@article{Dangelmaier_Fischer_Gausemeier_Grafe_Matysczok_Mueck_2005, title={Virtual and augmented reality support for discrete manufacturing system simulation}, DOI={10.1016/j.compind.2005.01.007}, journal={Computers in Industry}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Gausemeier, Jürgen and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt}, year={2005}, pages={371–383} }' chicago: Dangelmaier, Wilhelm, Matthias Fischer, Jürgen Gausemeier, Michael Grafe, Carsten Matysczok, and Bengt Mueck. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, 371–83. https://doi.org/10.1016/j.compind.2005.01.007. ieee: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, and B. Mueck, “Virtual and augmented reality support for discrete manufacturing system simulation,” Computers in Industry, pp. 371–383, 2005. mla: Dangelmaier, Wilhelm, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” Computers in Industry, 2005, pp. 371–83, doi:10.1016/j.compind.2005.01.007. short: W. Dangelmaier, M. Fischer, J. Gausemeier, M. Grafe, C. Matysczok, B. Mueck, Computers in Industry (2005) 371–383. date_created: 2020-07-27T12:11:32Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1016/j.compind.2005.01.007 language: - iso: eng page: 371-383 publication: Computers in Industry publication_identifier: issn: - 0166-3615 publication_status: published status: public title: Virtual and augmented reality support for discrete manufacturing system simulation type: journal_article user_id: '15415' year: '2005' ... --- _id: '17415' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: B. full_name: Mueck, B. last_name: Mueck - first_name: K. full_name: Mahajan, K. last_name: Mahajan - first_name: M. full_name: Kortenjan, M. last_name: Kortenjan - first_name: C. full_name: Laroque, C. last_name: Laroque - first_name: W. full_name: Dangelmaier, W. last_name: Dangelmaier citation: ama: 'Fischer M, Mueck B, Mahajan K, Kortenjan M, Laroque C, Dangelmaier W. Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In: Proceedings of the Winter Simulation Conference. ; 2005. doi:10.1109/wsc.2005.1574470' apa: Fischer, M., Mueck, B., Mahajan, K., Kortenjan, M., Laroque, C., & Dangelmaier, W. (2005). Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations. In Proceedings of the Winter Simulation Conference. https://doi.org/10.1109/wsc.2005.1574470 bibtex: '@inproceedings{Fischer_Mueck_Mahajan_Kortenjan_Laroque_Dangelmaier_2005, title={Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations}, DOI={10.1109/wsc.2005.1574470}, booktitle={Proceedings of the Winter Simulation Conference}, author={Fischer, Matthias and Mueck, B. and Mahajan, K. and Kortenjan, M. and Laroque, C. and Dangelmaier, W.}, year={2005} }' chicago: Fischer, Matthias, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” In Proceedings of the Winter Simulation Conference, 2005. https://doi.org/10.1109/wsc.2005.1574470. ieee: M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, and W. Dangelmaier, “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations,” in Proceedings of the Winter Simulation Conference, 2005. mla: Fischer, Matthias, et al. “Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations.” Proceedings of the Winter Simulation Conference, 2005, doi:10.1109/wsc.2005.1574470. short: 'M. Fischer, B. Mueck, K. Mahajan, M. Kortenjan, C. Laroque, W. Dangelmaier, in: Proceedings of the Winter Simulation Conference, 2005.' date_created: 2020-07-27T12:20:01Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' doi: 10.1109/wsc.2005.1574470 language: - iso: eng publication: Proceedings of the Winter Simulation Conference publication_identifier: isbn: - '0780395190' publication_status: published status: public title: Multi-User Support and Motion Planning of Humans and Humans Driven Vehicles in Interactive 3D Material Flow Simulations type: conference user_id: '15415' year: '2005' ... --- _id: '18763' abstract: - lang: eng text: "Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs . We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension , then the property has an efficient tester.\r\n\r\nWe apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size.\r\n\r\nOur framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties." author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Sohler C. Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing. 2005;34(3):580-615. doi:10.1137/s009753970444199x apa: Czumaj, A., & Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. SIAM Journal on Computing, 34(3), 580–615. https://doi.org/10.1137/s009753970444199x bibtex: '@article{Czumaj_Sohler_2005, title={Abstract Combinatorial Programs and Efficient Property Testers}, volume={34}, DOI={10.1137/s009753970444199x}, number={3}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={580–615} }' chicago: 'Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” SIAM Journal on Computing 34, no. 3 (2005): 580–615. https://doi.org/10.1137/s009753970444199x.' ieee: A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” SIAM Journal on Computing, vol. 34, no. 3, pp. 580–615, 2005. mla: Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” SIAM Journal on Computing, vol. 34, no. 3, 2005, pp. 580–615, doi:10.1137/s009753970444199x. short: A. Czumaj, C. Sohler, SIAM Journal on Computing 34 (2005) 580–615. date_created: 2020-09-01T11:35:41Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1137/s009753970444199x intvolume: ' 34' issue: '3' language: - iso: eng page: 580-615 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Abstract Combinatorial Programs and Efficient Property Testers type: journal_article user_id: '15415' volume: 34 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: '18787' abstract: - lang: eng text: A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points (a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly(ɛ −1, log m, log ∆) space and update time per insert/delete operation for constant k and dimension d. Having a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log(1/ɛ)/ɛ) d−1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1/ɛ) O(1))) time. For MaxST and average distance we require poly(log n, ɛ −1) time and for MaxWM we require O(n 3) time to do this. author: - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling citation: ama: 'Sohler C, Frahling G. Coresets in Dynamic Geometric Data Streams. In: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC). ; 2005:209-217.' apa: Sohler, C., & Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) (pp. 209–217). bibtex: '@inproceedings{Sohler_Frahling_2005, title={Coresets in Dynamic Geometric Data Streams}, booktitle={Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}, author={Sohler, Christian and Frahling, Gereon}, year={2005}, pages={209–217} }' chicago: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 209–17, 2005. ieee: C. Sohler and G. Frahling, “Coresets in Dynamic Geometric Data Streams,” in Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217. mla: Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–17. short: 'C. Sohler, G. Frahling, in: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217.' date_created: 2020-09-01T13:49:23Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' language: - iso: eng page: 209-217 publication: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC) status: public title: Coresets in Dynamic Geometric Data Streams type: conference user_id: '15415' year: '2005' ... --- _id: '18790' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Sohler C. Testing hypergraph colorability. Theoretical Computer Science. 2005;331(1):37-52. doi:10.1016/j.tcs.2004.09.031 apa: Czumaj, A., & Sohler, C. (2005). Testing hypergraph colorability. Theoretical Computer Science, 331(1), 37–52. https://doi.org/10.1016/j.tcs.2004.09.031 bibtex: '@article{Czumaj_Sohler_2005, title={Testing hypergraph colorability}, volume={331}, DOI={10.1016/j.tcs.2004.09.031}, number={1}, journal={Theoretical Computer Science}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={37–52} }' chicago: 'Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science 331, no. 1 (2005): 37–52. https://doi.org/10.1016/j.tcs.2004.09.031.' ieee: A. Czumaj and C. Sohler, “Testing hypergraph colorability,” Theoretical Computer Science, vol. 331, no. 1, pp. 37–52, 2005. mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” Theoretical Computer Science, vol. 331, no. 1, 2005, pp. 37–52, doi:10.1016/j.tcs.2004.09.031. short: A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52. date_created: 2020-09-01T14:00:37Z date_updated: 2022-01-06T06:53:52Z department: - _id: '63' doi: 10.1016/j.tcs.2004.09.031 intvolume: ' 331' issue: '1' language: - iso: eng page: 37-52 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Testing hypergraph colorability type: journal_article user_id: '15415' volume: 331 year: '2005' ... --- _id: '18855' abstract: - lang: eng text: "We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\\mathbb R^d$. We focus on the setting where 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 + \\eps$ using only $\\widetilde{\\O}(\\sqrt{n} \\, \\text{poly} (1/\\eps))$ 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 neighbor queries.\r\n\r\n\r\nRead More: https://epubs.siam.org/doi/10.1137/S0097539703435297\r\n" author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Funda full_name: Ergün, Funda last_name: Ergün - first_name: Lance full_name: Fortnow, Lance last_name: Fortnow - first_name: Avner full_name: Magen, Avner last_name: Magen - first_name: Ilan full_name: Newman, Ilan last_name: Newman - first_name: Ronitt full_name: Rubinfeld, Ronitt last_name: Rubinfeld - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 2005;35(1):91-109. doi:10.1137/s0097539703435297 apa: Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., & Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing, 35(1), 91–109. https://doi.org/10.1137/s0097539703435297 bibtex: '@article{Czumaj_Ergün_Fortnow_Magen_Newman_Rubinfeld_Sohler_2005, title={Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}, volume={35}, DOI={10.1137/s0097539703435297}, number={1}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}, year={2005}, pages={91–109} }' chicago: 'Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing 35, no. 1 (2005): 91–109. https://doi.org/10.1137/s0097539703435297.' ieee: A. Czumaj et al., “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” SIAM Journal on Computing, vol. 35, no. 1, pp. 91–109, 2005. mla: Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” SIAM Journal on Computing, vol. 35, no. 1, 2005, pp. 91–109, doi:10.1137/s0097539703435297. short: A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, C. Sohler, SIAM Journal on Computing 35 (2005) 91–109. date_created: 2020-09-02T12:13:26Z date_updated: 2022-01-06T06:53:53Z department: - _id: '63' doi: 10.1137/s0097539703435297 intvolume: ' 35' issue: '1' language: - iso: eng page: 91-109 publication: SIAM Journal on Computing publication_identifier: issn: - 0097-5397 - 1095-7111 publication_status: published status: public title: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time type: journal_article user_id: '15415' volume: 35 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: '18917' abstract: - lang: eng text: The page migration problem is one of subproblems of data management in networks. It occurs
in a distributed network of processors sharing one indivisible memory page of size D. During runtime,
the processors access a unit of data from the page, and the system is allowed to migrate the page
between the processors. The problem is to compute (on-line) a schedule of page movements
to minimize the total communication cost.

The Dynamic Page Migration problem is an extension to the page migration.
It attempts to model the network dynamics, occurring, for example, in mobile networks.
However, the pace of changes is restricted, i.e. the distances between processors can
change only by a constant per round.

The movement of the nodes induce changes in the communication cost between each pair of nodes,
which is proportional to the distance between them raised to some power $alpha$.
This is typical for mobile wireless networks, where nodes can move with a constant speed,
and the cost of communication is measured in terms of energy used for sending the data.
Thus, by setting $alpha$ equal to the propagation exponent of the medium,
cost minimization becomes minimizing the total energy consumption in the system.

However, as proven in citedynamic-page-migration, if both network mobility and
request sequence are created by an adversary, then the competitive ratio is polynomially large in D and
in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we
consider a scenario in which the network mobility is adversarial, but the requests are
generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,
and prove that it is O(1)-competitive, on expectation and with high probability. author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski citation: ama: 'Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005). ACM Press, NY, USA; 2005:270-278.' apa: 'Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.' bibtex: '@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }' chicago: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), 270–78. ACM Press, NY, USA, 2005. ieee: M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas, Nevada, USA, 2005, pp. 270–278. mla: Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–78. short: 'M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278.' conference: location: Las Vegas, Nevada, USA date_created: 2020-09-03T08:19:31Z date_updated: 2022-01-06T06:53:54Z department: - _id: '63' language: - iso: eng page: 270-278 publication: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005) publisher: ACM Press, NY, USA status: public title: Dynamic Page Migration with Stochastic Requests type: conference user_id: '15415' 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: '18967' author: - first_name: Harald full_name: Räcke, Harald last_name: Räcke citation: ama: Räcke H. Data Management and Routing in General Networks. Vol 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005. apa: Räcke, H. (2005). Data Management and Routing in General Networks (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Räcke_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Management and Routing in General Networks}, volume={154}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Räcke, Harald}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Räcke, Harald. Data Management and Routing in General Networks. Vol. 154. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. ieee: H. Räcke, Data Management and Routing in General Networks, vol. 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. mla: Räcke, Harald. Data Management and Routing in General Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. short: H. Räcke, Data Management and Routing in General Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005. date_created: 2020-09-03T14:44:08Z date_updated: 2022-01-06T06:53:56Z department: - _id: '63' - _id: '26' intvolume: ' 154' language: - iso: eng publication_identifier: isbn: - 3-935433-63-8 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20030101262 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Data Management and Routing in General Networks type: dissertation user_id: '5786' volume: 154 year: '2005' ... --- _id: '23883' abstract: - lang: eng text: A dynamic geometric data stream is a sequence of m Add/Remove operations of points from a discrete geometric space (1,...,Δ)d [21]. Add(p) inserts a point p from (1,...,Δ)d into the current point set, Remove(p) deletes p from P. We develop low-storage data structures to (i) maintain ε-approximations of range spaces of P with constant VC-dimension and (ii) maintain an ε-approximation of the weight of the Euclidean minimum spanning tree of P. Our data structures use O(log3ε • log3(1/ε) • log(1/ε)/ε2) and O(log (1/δ) • (log Δ/ε)O(d)) bits of memory, respectively (we assume that the dimension d is a constant), and they are correct with probability 1-δ. These results are based on a new data structure that maintains a set of elements chosen (almost) uniformly at random from P. author: - first_name: Gereon full_name: Frahling, Gereon last_name: Frahling - first_name: Piotr full_name: Indyk, Piotr last_name: Indyk - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Frahling G, Indyk P, Sohler C. Sampling in dynamic data streams and applications. In: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05. ; 2005. doi:10.1145/1064092.1064116' apa: Frahling, G., Indyk, P., & Sohler, C. (2005). Sampling in dynamic data streams and applications. In Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05. https://doi.org/10.1145/1064092.1064116 bibtex: '@inproceedings{Frahling_Indyk_Sohler_2005, title={Sampling in dynamic data streams and applications}, DOI={10.1145/1064092.1064116}, booktitle={Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05}, author={Frahling, Gereon and Indyk, Piotr and Sohler, Christian}, year={2005} }' chicago: Frahling, Gereon, Piotr Indyk, and Christian Sohler. “Sampling in Dynamic Data Streams and Applications.” In Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005. https://doi.org/10.1145/1064092.1064116. ieee: G. Frahling, P. Indyk, and C. Sohler, “Sampling in dynamic data streams and applications,” in Proceedings of the twenty-first annual symposium on Computational geometry  - SCG ’05, 2005. mla: Frahling, Gereon, et al. “Sampling in Dynamic Data Streams and Applications.” Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005, doi:10.1145/1064092.1064116. short: 'G. Frahling, P. Indyk, C. Sohler, in: Proceedings of the Twenty-First Annual Symposium on Computational Geometry  - SCG ’05, 2005.' date_created: 2021-09-07T13:10:15Z date_updated: 2022-01-06T06:56:02Z department: - _id: '63' doi: 10.1145/1064092.1064116 language: - iso: eng publication: Proceedings of the twenty-first annual symposium on Computational geometry - SCG '05 publication_status: published status: public title: Sampling in dynamic data streams and applications 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' ... --- _id: '18280' abstract: - lang: eng text: The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computability for the purpose of treating also discontinuous functions f:R->R:
*) non-deterministic computation;
*) relativized computation, specifically given access to oracles like 0' or 0'';
*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.
It turns out that, among these approaches, only the first one provides the required power. author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68' apa: 'Ziegler, M. (2005). Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In Proc. CiE 2005: New Computational Paradigms (Vol. 3526, pp. 562–571). Springer. https://doi.org/10.1007/11494645_68' bibtex: '@inproceedings{Ziegler_2005, title={Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism}, volume={3526}, DOI={10.1007/11494645_68}, booktitle={Proc. CiE 2005: New Computational Paradigms}, publisher={Springer}, author={Ziegler, Martin}, year={2005}, pages={562–571} }' chicago: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” In Proc. CiE 2005: New Computational Paradigms, 3526:562–71. Springer, 2005. https://doi.org/10.1007/11494645_68.' ieee: 'M. Ziegler, “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism,” in Proc. CiE 2005: New Computational Paradigms, 2005, vol. 3526, pp. 562–571.' mla: 'Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.” Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.' short: 'M. Ziegler, in: Proc. CiE 2005: New Computational Paradigms, Springer, 2005, pp. 562–571.' date_created: 2020-08-25T12:38:49Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/11494645_68 intvolume: ' 3526' language: - iso: eng page: 562-571 publication: 'Proc. CiE 2005: New Computational Paradigms' publication_identifier: isbn: - '9783540261797' - '9783540322665' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer status: public title: Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism type: conference user_id: '15415' volume: 3526 year: '2005' ... --- _id: '18282' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: Ziegler M. Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics. 2005;44(11):2059-2071. doi:10.1007/s10773-005-8984-0 apa: Ziegler, M. (2005). Computational Power of Infinite Quantum Parallelism. International Journal of Theoretical Physics, 44(11), 2059–2071. https://doi.org/10.1007/s10773-005-8984-0 bibtex: '@article{Ziegler_2005, title={Computational Power of Infinite Quantum Parallelism}, volume={44}, DOI={10.1007/s10773-005-8984-0}, number={11}, journal={International Journal of Theoretical Physics}, author={Ziegler, Martin}, year={2005}, pages={2059–2071} }' chicago: 'Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” International Journal of Theoretical Physics 44, no. 11 (2005): 2059–71. https://doi.org/10.1007/s10773-005-8984-0.' ieee: M. Ziegler, “Computational Power of Infinite Quantum Parallelism,” International Journal of Theoretical Physics, vol. 44, no. 11, pp. 2059–2071, 2005. mla: Ziegler, Martin. “Computational Power of Infinite Quantum Parallelism.” International Journal of Theoretical Physics, vol. 44, no. 11, 2005, pp. 2059–71, doi:10.1007/s10773-005-8984-0. short: M. Ziegler, International Journal of Theoretical Physics 44 (2005) 2059–2071. date_created: 2020-08-25T12:47:12Z date_updated: 2022-01-06T06:53:28Z department: - _id: '63' doi: 10.1007/s10773-005-8984-0 intvolume: ' 44' issue: '11' language: - iso: eng page: 2059-2071 publication: International Journal of Theoretical Physics publication_identifier: issn: - 0020-7748 - 1572-9575 publication_status: published status: public title: Computational Power of Infinite Quantum Parallelism type: journal_article user_id: '15415' volume: 44 year: '2005' ...