[{"date_updated":"2022-01-06T06:53:21Z","_id":"17865","file_date_updated":"2020-08-12T13:27:33Z","status":"public","language":[{"iso":"eng"}],"year":"2000","type":"report","date_created":"2020-08-12T13:27:52Z","ddc":["000"],"department":[{"_id":"63"}],"user_id":"15415","citation":{"chicago":"Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","ieee":"M. Wand, M. Fischer, and F. Meyer auf der Heide, <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","apa":"Wand, M., Fischer, M., &#38; Meyer auf der Heide, F. (2000). <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn.","ama":"Wand M, Fischer M, Meyer auf der Heide F. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn; 2000.","short":"M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.","mla":"Wand, Michael, et al. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. 2000.","bibtex":"@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn}, title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2000} }"},"abstract":[{"lang":"eng","text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved."}],"has_accepted_license":"1","place":"Universität Paderborn","file":[{"creator":"koala","file_size":921817,"file_name":"tr-ri-00-217.pdf","file_id":"17866","access_level":"closed","content_type":"application/pdf","date_created":"2020-08-12T13:27:33Z","relation":"main_file","date_updated":"2020-08-12T13:27:33Z","success":1}],"author":[{"last_name":"Wand","full_name":"Wand, Michael","first_name":"Michael"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes"},{"_id":"18962","page":"585-614","date_updated":"2022-01-06T06:53:55Z","publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS","date_created":"2020-09-03T13:21:02Z","publication_identifier":{"issn":["0178-4617","1432-0541"]},"type":"conference","year":"2000","language":[{"iso":"eng"}],"status":"public","citation":{"chicago":"Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 585–614, 2000. <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>.","ieee":"S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614.","apa":"Govindarajan, S., Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i> (pp. 585–614). <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>","ama":"Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>. ; 2000:585-614. doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>","short":"S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.","mla":"Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614, doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>.","bibtex":"@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, year={2000}, pages={585–614} }"},"user_id":"15415","publication_status":"published","department":[{"_id":"63"}],"title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","author":[{"first_name":"Sathish","full_name":"Govindarajan, Sathish","last_name":"Govindarajan"},{"last_name":"Lukovszki","first_name":"Tamas","full_name":"Lukovszki, Tamas"},{"first_name":"Anil","full_name":"Maheshwari, Anil","last_name":"Maheshwari"},{"full_name":"Zeh, Norbert","first_name":"Norbert","last_name":"Zeh"}],"doi":"10.1007/s00453-005-1197-3"},{"date_created":"2020-08-14T13:48:54Z","publisher":"Springer","language":[{"iso":"eng"}],"year":"2000","publication_identifier":{"isbn":["9783540410041","9783540452539"],"issn":["0302-9743"]},"status":"public","_id":"17990","date_updated":"2022-01-06T06:53:24Z","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"place":"Berlin, Heidelberg","intvolume":"      4698","citation":{"apa":"Czumaj, A., Sohler, C., &#38; Ziegler, M. (2000). Property Testing in Computational Geometry. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i> (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>","ama":"Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>. Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>","ieee":"A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 2000, vol. 4698, pp. 155–166.","chicago":"Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>.","bibtex":"@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)}, publisher={Springer}, author={Czumaj, Artur and Sohler, Christian and Ziegler, Martin}, year={2000}, pages={155–166}, collection={Lecture Notes in Computer Science} }","mla":"Czumaj, Artur, et al. “Property Testing in Computational Geometry.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, vol. 4698, Springer, 2000, pp. 155–66, doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>.","short":"A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166."},"series_title":"Lecture Notes in Computer Science","publication_status":"published","department":[{"_id":"63"}],"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)","type":"conference","page":"155-166","volume":4698,"title":"Property Testing in Computational Geometry","abstract":[{"text":"We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.","lang":"eng"}],"doi":"10.1007/3-540-45253-2_15","user_id":"15415"},{"publication":"SOFSEM 2000: Theory and Practice of Informatics","type":"conference","page":"450-458","volume":1963,"title":"Computing the Dimension of Linear Subspaces","abstract":[{"text":"Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.","lang":"eng"}],"doi":"10.1007/3-540-44411-4_34","user_id":"15415","date_created":"2020-08-24T09:58:56Z","publisher":"Springer","language":[{"iso":"eng"}],"year":"2000","publication_identifier":{"isbn":["9783540413486","9783540444114"],"issn":["0302-9743"]},"status":"public","_id":"18146","date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"full_name":"Brattka, Vasco","first_name":"Vasco","last_name":"Brattka"}],"place":"Berlin, Heidelberg","intvolume":"      1963","citation":{"short":"M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.","bibtex":"@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>}, booktitle={SOFSEM 2000: Theory and Practice of Informatics}, publisher={Springer}, author={Ziegler, Martin and Brattka, Vasco}, year={2000}, pages={450–458} }","mla":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” <i>SOFSEM 2000: Theory and Practice of Informatics</i>, vol. 1963, Springer, 2000, pp. 450–58, doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>.","ieee":"M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 2000, vol. 1963, pp. 450–458.","chicago":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 1963:450–58. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>.","ama":"Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: <i>SOFSEM 2000: Theory and Practice of Informatics</i>. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>","apa":"Ziegler, M., &#38; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In <i>SOFSEM 2000: Theory and Practice of Informatics</i> (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>"},"publication_status":"published","department":[{"_id":"63"}]},{"publication":"Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)","date_created":"2020-08-24T10:10:40Z","year":"2000","type":"conference","language":[{"iso":"eng"}],"status":"public","page":"73-79","_id":"18150","date_updated":"2022-01-06T06:53:26Z","title":"Computing Cut Numbers","author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"abstract":[{"text":"What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.<br>This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).<br>We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.","lang":"eng"}],"citation":{"short":"M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.","bibtex":"@inproceedings{Ziegler_Sohler_2000, title={Computing Cut Numbers}, booktitle={Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)}, author={Ziegler, Martin and Sohler, Christian}, year={2000}, pages={73–79} }","mla":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79.","ieee":"M. Ziegler and C. Sohler, “Computing Cut Numbers,” in <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79.","chicago":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 73–79, 2000.","apa":"Ziegler, M., &#38; Sohler, C. (2000). Computing Cut Numbers. In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i> (pp. 73–79).","ama":"Ziegler M, Sohler C. Computing Cut Numbers. In: <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>. ; 2000:73-79."},"user_id":"15415","department":[{"_id":"63"}]},{"date_updated":"2022-01-06T06:53:32Z","volume":45,"page":"944-967","_id":"18446","status":"public","year":"2000","type":"journal_article","language":[{"iso":"eng"}],"publication":"Journal of the ACM","date_created":"2020-08-27T11:49:50Z","department":[{"_id":"63"}],"user_id":"15415","citation":{"mla":"Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” <i>Journal of the ACM</i>, vol. 45, 2000, pp. 944–67, doi:<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>.","bibtex":"@article{Lorys_Wanka_Oesterdiekhoff_Kutylowski_2000, title={Periodification Scheme: Constructing Sorting Networks with Constant Period}, volume={45}, DOI={<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>}, journal={Journal of the ACM}, author={Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, year={2000}, pages={944–967} }","short":"K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.","ama":"Lorys K, Wanka R, Oesterdiekhoff B, Kutylowski M. Periodification Scheme: Constructing Sorting Networks with Constant Period. <i>Journal of the ACM</i>. 2000;45:944-967. doi:<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>","apa":"Lorys, K., Wanka, R., Oesterdiekhoff, B., &#38; Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. <i>Journal of the ACM</i>, <i>45</i>, 944–967. <a href=\"https://doi.org/10.1145/355483.355490\">https://doi.org/10.1145/355483.355490</a>","chicago":"Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” <i>Journal of the ACM</i> 45 (2000): 944–67. <a href=\"https://doi.org/10.1145/355483.355490\">https://doi.org/10.1145/355483.355490</a>.","ieee":"K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” <i>Journal of the ACM</i>, vol. 45, pp. 944–967, 2000, doi: <a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>."},"abstract":[{"text":"We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.\r\n\r\nPreviously, very little was known on such networks. The fastest solutions required time O(nε) where the depth was roughly 1/ε. We introduce a general method called periodification scheme that converts automatically an arbitrary sorting network that sorts n items in time T(n) and that has layout area A(n) into a sorting network that has period 5, sorts ***(n • T(n) items in time O(T(<n)• log n), and has layout area O(A(n)) • T(n)). In particular, applying this scheme to Batcher's algorithms, we get practical period 5 comparator networks that sort in time O(log3n). For theoretical interest, one may use the AKS netork resulting in a period 5 comparator network with runtime O(log2n).","lang":"eng"}],"intvolume":"        45","doi":"10.1145/355483.355490","author":[{"last_name":"Lorys","first_name":"Krzysztof","full_name":"Lorys, Krzysztof"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"},{"last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte","first_name":"Brigitte"},{"last_name":"Kutylowski","first_name":"Miroslaw","full_name":"Kutylowski, Miroslaw"}],"title":"Periodification Scheme: Constructing Sorting Networks with Constant Period"},{"status":"public","year":"2000","type":"conference","language":[{"iso":"eng"}],"publication":"32nd ACM Symposium on Theory of Computing","ddc":["040"],"date_created":"2018-04-05T07:02:46Z","date_updated":"2022-01-06T06:55:26Z","file_date_updated":"2018-04-12T08:37:23Z","_id":"2211","page":"38-47","has_accepted_license":"1","file":[{"relation":"main_file","date_updated":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf","file_size":190083,"creator":"florida","date_created":"2018-04-12T08:37:23Z","content_type":"application/pdf","access_level":"open_access","file_id":"2296"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","urn":"22111","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","oa":"1","citation":{"bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: <i>32nd ACM Symposium on Theory of Computing</i>. ; 2000:38-47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In <i>32nd ACM Symposium on Theory of Computing</i> (pp. 38–47).","ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In <i>32nd ACM Symposium on Theory of Computing</i>, 38–47, 2000."}},{"title":"Data management in hierarchical bus networks","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"full_name":"Westermann, Matthias","first_name":"Matthias","last_name":"Westermann"}],"doi":"10.1145/341800.341814","citation":{"short":"F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.","mla":"Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000, doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management in hierarchical bus networks}, DOI={<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>}, booktitle={Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00}, author={Meyer auf der Heide, Friedhelm and Räcke, Harald and Westermann, Matthias}, year={2000} }","chicago":"Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>.","ieee":"F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: <a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>.","ama":"Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. ; 2000. doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>","apa":"Meyer auf der Heide, F., Räcke, H., &#38; Westermann, M. (2000). Data management in hierarchical bus networks. <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>"},"publication_status":"published","user_id":"15415","department":[{"_id":"63"}],"date_created":"2020-04-09T13:06:23Z","publication":"Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA '00","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["1581131852"]},"type":"conference","year":"2000","status":"public","_id":"16495","date_updated":"2022-01-06T06:52:51Z"},{"department":[{"_id":"63"}],"user_id":"15415","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Vöcking_Westermann_2000, title={Caching in networks}, booktitle={SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={2000}, pages={430–439} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2000, pp. 430–439.","short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2000:430–439.","apa":"Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (2000). Caching in networks. In <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 430–439).","ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i>, 2000, pp. 430–439.","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 430–439, 2000."},"abstract":[{"lang":"eng","text":"We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that none of these resources become a communication bottleneck. We give several examples of networks for which our framework yields efficient algorithms, including meshes, fat-trees, hypercubic networks, and complete networks. For example, our framework yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional meshes of size $n$ with respect to the congestion on the communication links, and an $O(1)$-competitive algorithms for complete networks with respect to the congestion at the memory modules due to remote accesses. Previous work on data management in networks either neglects memory capacity constraints or minimizes only the total communication load, i.e., the sum of the communication load over all resources, which may produce congestion as some of the links become bottlenecks."}],"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"},{"first_name":"Matthias","full_name":"Westermann, Matthias","last_name":"Westermann"}],"title":"Caching in networks","date_updated":"2022-01-06T06:52:51Z","_id":"16496","page":"430–439","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0898714532"]},"year":"2000","type":"conference","date_created":"2020-04-09T13:16:15Z","publication":"SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms"},{"department":[{"_id":"63"}],"user_id":"15415","publication_status":"published","citation":{"ama":"Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg; 2000. doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>","apa":"Meyer auf der Heide, F., Kutyłowski, M., &#38; Ragde, P. (2000). Complexity Theory and Algorithms. In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>","ieee":"F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in <i>Euro-Par 2000 Parallel Processing</i>, Berlin, Heidelberg, 2000.","chicago":"Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg, 2000. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>.","bibtex":"@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>}, booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” <i>Euro-Par 2000 Parallel Processing</i>, 2000, doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>.","short":"F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000."},"doi":"10.1007/3-540-44520-x_59","place":"Berlin, Heidelberg","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Kutyłowski","first_name":"Mirosław","full_name":"Kutyłowski, Mirosław"},{"full_name":"Ragde, Prabhakar","first_name":"Prabhakar","last_name":"Ragde"}],"title":"Complexity Theory and Algorithms","date_updated":"2022-01-06T06:52:51Z","_id":"16497","status":"public","year":"2000","type":"book_chapter","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540679561","9783540445203"]},"language":[{"iso":"eng"}],"publication":"Euro-Par 2000 Parallel Processing","date_created":"2020-04-09T13:30:45Z"},{"citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.","mla":"Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” <i>SIAM Journal on Computing</i>, 2000, pp. 1703–39, doi:<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>.","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution in Hashing Based Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={2000}, pages={1703–1739} }","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.” <i>SIAM Journal on Computing</i>, 2000, 1703–39. <a href=\"https://doi.org/10.1137/s009753979529564x\">https://doi.org/10.1137/s009753979529564x</a>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” <i>SIAM Journal on Computing</i>, pp. 1703–1739, 2000.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. <i>SIAM Journal on Computing</i>. 2000:1703-1739. doi:<a href=\"https://doi.org/10.1137/s009753979529564x\">10.1137/s009753979529564x</a>","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. <i>SIAM Journal on Computing</i>, 1703–1739. <a href=\"https://doi.org/10.1137/s009753979529564x\">https://doi.org/10.1137/s009753979529564x</a>"},"user_id":"15415","publication_status":"published","department":[{"_id":"63"}],"title":"Contention Resolution in Hashing Based Shared Memory Simulations","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"doi":"10.1137/s009753979529564x","page":"1703-1739","_id":"17010","date_updated":"2022-01-06T06:53:01Z","publication":"SIAM Journal on Computing","date_created":"2020-05-18T13:47:36Z","publication_identifier":{"issn":["0097-5397","1095-7111"]},"type":"journal_article","year":"2000","language":[{"iso":"eng"}],"status":"public"},{"_id":"16345","page":"112-116","file_date_updated":"2020-08-04T13:17:46Z","date_updated":"2022-01-06T06:52:49Z","date_created":"2020-03-24T10:59:27Z","ddc":["000"],"publication":"ForschungsForum Paderborn","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"unknown":["ISBN 978-3-942647-99-1"]},"year":"2000","status":"public","citation":{"apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. <i>ForschungsForum Paderborn</i>, 112–116.","ama":"Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. <i>ForschungsForum Paderborn</i>. 2000:112-116.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” <i>ForschungsForum Paderborn</i>, 2000, 112–16.","ieee":"F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” <i>ForschungsForum Paderborn</i>, pp. 112–116, 2000.","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” <i>ForschungsForum Paderborn</i>, 2000, pp. 112–16.","bibtex":"@article{Meyer auf der Heide_Wanka_2000, title={Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik}, journal={ForschungsForum Paderborn}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2000}, pages={112–116} }","short":"F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116."},"user_id":"15415","department":[{"_id":"63"}],"title":"Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik","article_type":"original","file":[{"success":1,"relation":"main_file","date_updated":"2020-08-04T13:17:46Z","content_type":"application/pdf","file_id":"17588","access_level":"closed","date_created":"2020-08-04T13:17:46Z","creator":"koala","file_size":477845,"file_name":"FFP-06-2000.pdf"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"has_accepted_license":"1"},{"citation":{"short":"C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.","bibtex":"@book{Scheideler_2000, title={Probabilistic Methods for Coordination Problems}, author={Scheideler, Christian}, year={2000} }","mla":"Scheideler, Christian. <i>Probabilistic Methods for Coordination Problems</i>. 2000.","ieee":"C. Scheideler, <i>Probabilistic Methods for Coordination Problems</i>. 2000.","chicago":"Scheideler, Christian. <i>Probabilistic Methods for Coordination Problems</i>, 2000.","apa":"Scheideler, C. (2000). <i>Probabilistic Methods for Coordination Problems</i>.","ama":"Scheideler C. <i>Probabilistic Methods for Coordination Problems</i>.; 2000."},"user_id":"1112","department":[{"_id":"63"},{"_id":"26"}],"title":"Probabilistic Methods for Coordination Problems","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"_id":"19784","date_updated":"2024-07-12T07:00:50Z","date_created":"2020-09-30T10:05:34Z","language":[{"iso":"eng"}],"year":"2000","publication_identifier":{"isbn":["3-931466-77-9"]},"type":"habilitation","status":"public"},{"department":[{"_id":"63"}],"publication_status":"published","user_id":"15415","citation":{"mla":"Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 1999, pp. 99–104, doi:<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>.","bibtex":"@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn university BSP (PUB) library-design, implementation and performance}, DOI={<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>}, booktitle={Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}, author={Bonorden, Olaf and Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}, year={1999}, pages={99–104} }","short":"O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.","ama":"Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP (PUB) library-design, implementation and performance. In: <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>. ; 1999:99-104. doi:<a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>","apa":"Bonorden, O., Juurlink, B., Von Otte, I., &#38; Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 99–104. <a href=\"https://doi.org/10.1109/ipps.1999.760442\">https://doi.org/10.1109/ipps.1999.760442</a>","chicago":"Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” In <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 99–104, 1999. <a href=\"https://doi.org/10.1109/ipps.1999.760442\">https://doi.org/10.1109/ipps.1999.760442</a>.","ieee":"O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in <i>Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing</i>, 1999, pp. 99–104, doi: <a href=\"https://doi.org/10.1109/ipps.1999.760442\">10.1109/ipps.1999.760442</a>."},"abstract":[{"lang":"eng","text":"The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries."}],"doi":"10.1109/ipps.1999.760442","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"last_name":"Juurlink","full_name":"Juurlink, Bernhardus","first_name":"Bernhardus"},{"last_name":"Von Otte","first_name":"I.","full_name":"Von Otte, I."},{"first_name":"Ingo","full_name":"Rieping, Ingo","last_name":"Rieping"}],"title":"The Paderborn university BSP (PUB) library-design, implementation and performance","date_updated":"2022-01-06T06:54:10Z","_id":"19732","page":"99-104","status":"public","language":[{"iso":"eng"}],"year":"1999","publication_identifier":{"isbn":["0769501435"]},"type":"conference","date_created":"2020-09-28T12:11:30Z","publication":"Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing"},{"title":"Simple, Efficient Routing Schemes for All-Optical Networks","author":[{"last_name":"Flammini","full_name":"Flammini, Michele","first_name":"Michele"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"doi":"10.1007/s002240000123","intvolume":"        32","citation":{"apa":"Flammini, M., &#38; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput. Syst.</i>, <i>32</i>(3), 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. <i>Theory Comput Syst</i>. 1999;32(3):387--420. doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i> 32, no. 3 (1999): 387--420. <a href=\"https://doi.org/10.1007/s002240000123\">https://doi.org/10.1007/s002240000123</a>.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, pp. 387--420, 1999.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” <i>Theory Comput. Syst.</i>, vol. 32, no. 3, 1999, pp. 387--420, doi:<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={<a href=\"https://doi.org/10.1007/s002240000123\">10.1007/s002240000123</a>}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }","short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420."},"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T06:22:14Z","publication":"Theory Comput. Syst.","language":[{"iso":"eng"}],"year":"1999","type":"journal_article","status":"public","page":"387--420","_id":"2151","volume":32,"issue":"3","date_updated":"2022-01-06T06:55:02Z"},{"ddc":["040"],"publication":"SODA","date_created":"2018-04-03T08:56:06Z","type":"conference","year":"1999","language":[{"iso":"eng"}],"status":"public","file_date_updated":"2018-04-12T07:34:50Z","_id":"2164","page":"112--121","date_updated":"2022-01-06T06:55:09Z","title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","urn":"21649","file":[{"creator":"florida","file_size":179058,"file_name":"SODA-99.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"2288","date_created":"2018-04-12T07:34:50Z","date_updated":"2018-04-12T07:34:50Z","relation":"main_file"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"has_accepted_license":"1","citation":{"mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” <i>SODA</i>, 1999, pp. 112--121.","bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","apa":"Berenbrink, P., &#38; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In <i>SODA</i> (pp. 112--121).","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: <i>SODA</i>. ; 1999:112--121.","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In <i>SODA</i>, 112--121, 1999.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in <i>SODA</i>, 1999, pp. 112--121."},"oa":"1","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}]},{"_id":"2165","file_date_updated":"2018-04-12T07:36:27Z","page":"33--42","date_updated":"2022-01-06T06:55:09Z","date_created":"2018-04-03T08:56:45Z","ddc":["040"],"publication":"SPAA","status":"public","language":[{"iso":"eng"}],"year":"1999","type":"conference","user_id":"14955","oa":"1","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” <i>SPAA</i>, 1999, pp. 33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in <i>SPAA</i>, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In <i>SPAA</i>, 33--42, 1999.","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: <i>SPAA</i>. ; 1999:33--42.","apa":"Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In <i>SPAA</i> (pp. 33--42)."},"department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Riedel, Marco","first_name":"Marco","last_name":"Riedel"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file":[{"relation":"main_file","date_updated":"2018-04-12T07:36:27Z","date_created":"2018-04-12T07:36:27Z","content_type":"application/pdf","file_id":"2290","access_level":"open_access","file_name":"SPAA-99.pdf","file_size":144422,"creator":"florida"}],"title":"Simple Competitive Request Scheduling Strategies","urn":"21658","has_accepted_license":"1"},{"citation":{"mla":"Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1999, place={Vancouver}, title={Partitioned neighborhood spanners of minimal outdegree}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}, year={1999} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.","ama":"Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal outdegree. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver; 1999.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver, 1999.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999."},"department":[{"_id":"63"}],"author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Lukovszki, Tamas","first_name":"Tamas","last_name":"Lukovszki"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"place":"Vancouver","file_date_updated":"2020-08-27T11:14:43Z","_id":"17864","date_updated":"2022-01-06T06:53:21Z","date_created":"2020-08-12T13:12:00Z","related_material":{"link":[{"url":"http://www.cccg.ca/proceedings/1999/fp36.pdf","relation":"confirmation"}]},"status":"public","language":[{"iso":"eng"}],"year":"1999","user_id":"15415","file":[{"access_level":"closed","file_id":"18438","content_type":"application/pdf","date_created":"2020-08-27T11:14:43Z","creator":"koala","file_name":"hni-id-729.pdf","file_size":209419,"success":1,"relation":"main_file","date_updated":"2020-08-27T11:14:43Z"}],"title":"Partitioned neighborhood spanners of minimal outdegree","has_accepted_license":"1","abstract":[{"text":"A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the “quality” of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:\r\n\r\n* k determines the amount of space required for storing PNGs.\r\n\r\n* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.\r\n\r\nOur results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.\r\n","lang":"eng"}],"ddc":["000"],"publication":"Proceedings of the 11th Canadian Conference on Computational Geometry","type":"conference"},{"abstract":[{"text":"We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.","lang":"eng"}],"title":"Fast Reconstruction of Delaunay Triangulations","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"department":[{"_id":"63"}],"citation":{"chicago":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 136–41, 1999.","ieee":"C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 1999, pp. 136–141.","ama":"Sohler C. Fast Reconstruction of Delaunay Triangulations. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>. ; 1999:136-141.","apa":"Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i> (pp. 136–141).","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.","mla":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)</i>, 1999, pp. 136–41.","bibtex":"@inproceedings{Sohler_1999, title={Fast Reconstruction of Delaunay Triangulations}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={136–141} }"},"user_id":"15415","language":[{"iso":"eng"}],"type":"conference","year":"1999","status":"public","date_created":"2020-09-01T10:43:10Z","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)","date_updated":"2022-01-06T06:53:51Z","page":"136-141","_id":"18747"},{"author":[{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"}],"intvolume":"        63","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"citation":{"ama":"Lukovszki T. <i>New Results on Geometric Spanners and Their Applications</i>. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.","apa":"Lukovszki, T. (1999). <i>New Results on Geometric Spanners and Their Applications</i> (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"T. Lukovszki, <i>New Results on Geometric Spanners and Their Applications</i>, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","chicago":"Lukovszki, Tamás. <i>New Results on Geometric Spanners and Their Applications</i>. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","bibtex":"@book{Lukovszki_1999, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New Results on Geometric Spanners and Their Applications}, volume={63}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lukovszki, Tamás}, year={1999}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Lukovszki, Tamás. <i>New Results on Geometric Spanners and Their Applications</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","short":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999."},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-03T11:41:51Z","status":"public","language":[{"iso":"eng"}],"year":"1999","publication_identifier":{"isbn":["3-931466-62-0 "]},"file_date_updated":"2020-09-22T13:12:09Z","_id":"18942","date_updated":"2022-01-06T06:53:55Z","file":[{"date_updated":"2020-09-22T13:12:09Z","relation":"main_file","success":1,"creator":"koala","file_name":"pub-hni-495.pdf","file_size":1077329,"access_level":"closed","content_type":"application/pdf","file_id":"19641","date_created":"2020-09-22T13:12:09Z"}],"title":"New Results on Geometric Spanners and Their Applications","has_accepted_license":"1","user_id":"5786","ddc":["000"],"type":"dissertation","volume":63}]