[{"language":[{"iso":"eng"}],"year":"2002","type":"journal_article","citation":{"short":"C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.","ieee":"C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property Testers,” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), pp. 83–92, 2002.","chicago":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, 83–92.","ama":"Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS). 2002:83-92.","apa":"Sohler, C., & Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 83–92.","bibtex":"@article{Sohler_Czumaj_2002, title={Abstract Combinatorial Programs and Efficient Property Testers}, journal={Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2002}, pages={83–92} }","mla":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS), 2002, pp. 83–92."},"page":"83-92","_id":"18853","date_updated":"2022-01-06T06:53:52Z","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"}],"publication":"Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)","department":[{"_id":"63"}],"status":"public","date_created":"2020-09-02T12:08:22Z","user_id":"15415","title":"Abstract Combinatorial Programs and Efficient Property Testers"},{"year":"2002","type":"report","citation":{"ieee":"T. Lukovszki and A. Benczúr, A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.","short":"T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.","mla":"Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. 2002.","bibtex":"@book{Lukovszki_Benczúr_2002, place={Paderborn}, title={A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing}, author={Lukovszki, Tamás and Benczúr, A.}, year={2002} }","ama":"Lukovszki T, Benczúr A. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn; 2002.","apa":"Lukovszki, T., & Benczúr, A. (2002). A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn.","chicago":"Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:55Z","_id":"18961","author":[{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"},{"last_name":"Benczúr","full_name":"Benczúr, A.","first_name":"A."}],"department":[{"_id":"63"}],"status":"public","date_created":"2020-09-03T13:16:48Z","place":"Paderborn","title":"A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing","user_id":"15415"},{"_id":"18169","intvolume":" 115","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"citation":{"ieee":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","short":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","bibtex":"@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler, Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","chicago":"Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme. Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","apa":"Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002."},"type":"dissertation","year":"2002","user_id":"5786","abstract":[{"lang":"ger","text":"Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder) stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur entnommener ad-hoc Ansätze ergibt."},{"text":"Quite often, the implementation of well-known algorithms for solving geometric problems in Euclidean space (such as convex hull computation or intersecting two polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites the underlying numerical numerical instabilities can be avoided or are rather inherent to the problem is investigated by the present work in a model of computation dating back to Alan Turing himself. Other than algebraic approaches, this does not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects the property of actual digital computers to only approximate real numbers by rationals. In this framework, we devise and present provably stable algorithms for solving systems of linear equations, matrix diagonalization, and lineare as well as non-linear optimization. As major technical tool, a new notion of computability for regular infinite sets of real numbers is introduced that arises from formalizing and systematically comparing several ad-hoc notions found in previous literature.","lang":"eng"}],"date_created":"2020-08-24T11:36:55Z","status":"public","volume":115,"author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"ger"}],"series_title":"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-20020101320"}]},"title":"Zur Berechenbarkeit reeller geometrischer Probleme","publication_identifier":{"isbn":["3-935433-24-7"]},"department":[{"_id":"63"},{"_id":"26"}]},{"doi":"10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}],"title":"Computability on Regular Subsets of Euclidean Space","publication_status":"published","publication_identifier":{"issn":["0942-5616","1521-3870"]},"department":[{"_id":"63"}],"issue":"S1","intvolume":" 48","_id":"18176","year":"2002","citation":{"mla":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” Mathematical Logic Quarterly (MLQ), vol. 48, no. S1, 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.","bibtex":"@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean Space}, volume={48}, DOI={10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4}, number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin}, year={2002}, pages={157–181} }","chicago":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” Mathematical Logic Quarterly (MLQ) 48, no. S1 (2002): 157–81. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.","ama":"Ziegler M. Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ). 2002;48(S1):157-181. doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4","apa":"Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. Mathematical Logic Quarterly (MLQ), 48(S1), 157–181. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4","ieee":"M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical Logic Quarterly (MLQ), vol. 48, no. S1, pp. 157–181, 2002.","short":"M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181."},"type":"journal_article","page":"157-181","user_id":"15415","volume":48,"status":"public","date_created":"2020-08-24T12:05:40Z","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"publication":"Mathematical Logic Quarterly (MLQ)"},{"language":[{"iso":"eng"}],"citation":{"mla":"Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","bibtex":"@inproceedings{Ziegler_Damerow_Finschi_2002, title={Point Location Algorithms of Minimum Size}, booktitle={Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)}, author={Ziegler, Martin and Damerow, Valentina and Finschi, Lukas}, year={2002} }","ama":"Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size. In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02). ; 2002.","apa":"Ziegler, M., Damerow, V., & Finschi, L. (2002). Point Location Algorithms of Minimum Size. In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02).","chicago":"Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location Algorithms of Minimum Size.” In Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","ieee":"M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","short":"M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002."},"year":"2002","type":"conference","date_updated":"2022-01-06T06:53:26Z","_id":"18177","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"full_name":"Damerow, Valentina","first_name":"Valentina","last_name":"Damerow"},{"first_name":"Lukas","full_name":"Finschi, Lukas","last_name":"Finschi"}],"publication":"Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02)","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-24T12:09:15Z","publication_status":"published","abstract":[{"text":"Consider the classical point location problem: for a fixed arrangement of m hyperplanes and its induced partition of d-space report, upon input of some point, which face it lies in. With sufficient memory, this is easy to solve in logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision Trees) of *minimum* size be? The present work gives lower and upper bounds for the time complexity of point location under this constraint. They show that, in addition to m, the maximum number w of walls of a cell turns out to be a crucial parameter. We also consider a relaxation of the strict minimum-size condition allowing for constant factor overhead.","lang":"eng"}],"user_id":"15415","title":"Point Location Algorithms of Minimum Size"},{"place":"Boston, MA","abstract":[{"lang":"eng","text":"Do the solutions of linear equations depend computably on their coefficients? Implicitly, this has been one of the central questions in linear algebra since the very beginning of the subject and the famous Gauß algorithm is one of its numerical answers. Today there exists a tremendous number of algorithms which solve this problem for different types of linear equations. However, actual implementations in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned inputs. This situation raises the question which of these instabilities are intrinsic, thus caused by the very nature of the problem, and which are just side effects of specific algorithms. To approach this principle question we revisit linear equations from the rigorous point of view of computability. Therefore we apply methods of computable analysis, which is the Turing machine based theory of computable real number functions. It turns out that, given the coefficients of a system of linear equations, we can compute the space of solutions, if and only if the dimension of the solution space is known in advance. Especially, this explains why there cannot exist any stable algorithms under weaker assumptions."}],"title":"Computability of Linear Equations","user_id":"15415","author":[{"full_name":"Brattka, Vasco","first_name":"Vasco","last_name":"Brattka"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science","publication_status":"published","status":"public","date_created":"2020-08-24T12:11:07Z","date_updated":"2022-01-06T06:53:26Z","_id":"18179","doi":"10.1007/978-0-387-35608-2_9","type":"conference","year":"2002","citation":{"ieee":"V. Brattka and M. Ziegler, “Computability of Linear Equations,” in Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106.","short":"V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.","mla":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.","bibtex":"@inproceedings{Brattka_Ziegler_2002, place={Boston, MA}, title={Computability of Linear Equations}, DOI={10.1007/978-0-387-35608-2_9}, booktitle={Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science}, author={Brattka, Vasco and Ziegler, Martin}, year={2002}, pages={95–106} }","chicago":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, 95–106. Boston, MA, 2002. https://doi.org/10.1007/978-0-387-35608-2_9.","ama":"Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9","apa":"Brattka, V., & Ziegler, M. (2002). Computability of Linear Equations. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (pp. 95–106). Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_9"},"page":"95-106","language":[{"iso":"eng"}]},{"place":"Ghent, BE","abstract":[{"text":"Visualising is a method used to help experiencing and understanding causal cohesions in simulation processes. For this purpose, tools for visualising are already implemented in prevalent simulation systems. The user creates his simulation model and generates a 3-dimensional (2,5-dimensional) visualising by means of the simulation system. This helps examining the process which makes it easier for the viewer to understand it. Simulation tools usually only provide the opportunity for a unidirectional visualising. In a 3-dimensional surrounding the viewer can not implement an interaction with the simulation while the system is running. Though an interaction during the simulation run enables the user to gain a better understanding of causal cohesions. Solutions via HLA are sophisticated and therefore rather suited for extensive projects.\r\nWe present a distributed system consisting of a commercial manufacturing simulation tool, a coupling module and a walkthrough system. The distributed system in conjunctions with the coupling module guarantees generality and a wide field of applications of the walkthrough system. Further it guarantees flexibility and selection of the specialized graphics hardware for the walkthrough system. A further contribution of this paper is the solution of the time synchronisation problem caused by simulation tool and walkthrough system.\r\n","lang":"eng"}],"user_id":"15415","title":"Bi-directional Coupling of Simulation Tools with a Walkthrough-System","publisher":"SCS European Publishing House","author":[{"first_name":"Bengt","full_name":"Mueck, Bengt","last_name":"Mueck"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Klemisch, Wolfram","first_name":"Wolfram","last_name":"Klemisch"}],"department":[{"_id":"63"}],"publication":"Simulation und Visualisierung","status":"public","date_created":"2020-08-26T13:01:43Z","date_updated":"2022-01-06T06:53:30Z","_id":"18369","language":[{"iso":"eng"}],"year":"2002","type":"conference","citation":{"short":"B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.","ieee":"B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung, 2002, pp. 71–84.","ama":"Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: Simulation Und Visualisierung. Ghent, BE: SCS European Publishing House; 2002:71-84.","apa":"Mueck, B., Dangelmaier, W., Fischer, M., & Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In Simulation und Visualisierung (pp. 71–84). Ghent, BE: SCS European Publishing House.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In Simulation Und Visualisierung, 71–84. Ghent, BE: SCS European Publishing House, 2002.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_Klemisch_2002, place={Ghent, BE}, title={Bi-directional Coupling of Simulation Tools with a Walkthrough-System}, booktitle={Simulation und Visualisierung}, publisher={SCS European Publishing House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and Klemisch, Wolfram}, year={2002}, pages={71–84} }","mla":"Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” Simulation Und Visualisierung, SCS European Publishing House, 2002, pp. 71–84."},"page":"71-84"},{"language":[{"iso":"eng"}],"citation":{"chicago":"Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45465-9_77.","ama":"Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77","apa":"Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_77","bibtex":"@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin, Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={10.1007/3-540-45465-9_77}, booktitle={Proceedings of the 29th International Colloquium on Automata, Languages and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold}, year={2002} }","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, doi:10.1007/3-540-45465-9_77.","short":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.","ieee":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002."},"type":"conference","year":"2002","_id":"18566","date_updated":"2022-01-06T06:53:40Z","doi":"10.1007/3-540-45465-9_77","department":[{"_id":"63"}],"publication":"Proceedings of the 29th International Colloquium on Automata, Languages and Programming","author":[{"last_name":"Adler","full_name":"Adler, Micah","first_name":"Micah"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"last_name":"Sivadasan","first_name":"Naveen","full_name":"Sivadasan, Naveen"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"date_created":"2020-08-28T12:04:12Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540438649","9783540454656"],"issn":["0302-9743"]},"abstract":[{"lang":"eng","text":"We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O\r\n(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits."}],"place":"Berlin, Heidelberg","user_id":"15415","title":"Randomized Pursuit-Evasion in Graphs"},{"citation":{"chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard Vöcking, and Matthias’ Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002, 217–45. https://doi.org/10.1007/s00224-001-1045-z.","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of Computing Systems. Published online 2002:217-245. doi:10.1007/s00224-001-1045-z","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45, doi:10.1007/s00224-001-1045-z.","bibtex":"@article{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_2002, title={Data Management in Networks: Experimental Evaluation of a Provably Good Strategy}, DOI={10.1007/s00224-001-1045-z}, journal={Theory of Computing Systems}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Bernhard and Westermann, Matthias’ }, year={2002}, pages={217–245} }","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,” Theory of Computing Systems, pp. 217–245, 2002, doi: 10.1007/s00224-001-1045-z."},"year":"2002","type":"journal_article","page":"217-245","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:51Z","_id":"16489","doi":"10.1007/s00224-001-1045-z","author":[{"full_name":"Krick, Christof","first_name":"Christof","last_name":"Krick"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"last_name":"Vöcking","full_name":"Vöcking, Bernhard","first_name":"Bernhard"},{"last_name":"Westermann","full_name":"Westermann, Matthias' ","first_name":"Matthias' "}],"department":[{"_id":"63"}],"publication":"Theory of Computing Systems","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"status":"public","date_created":"2020-04-09T10:03:55Z","title":"Data Management in Networks: Experimental Evaluation of a Provably Good Strategy","user_id":"15415"},{"_id":"16490","date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/585740.585764","type":"conference","year":"2002","citation":{"ieee":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments,” in Proceedings of the ACM symposium on Virtual reality software and technology - VRST ’02, 2002.","short":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002.","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002, doi:10.1145/585740.585764.","bibtex":"@inproceedings{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2002, title={The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments}, DOI={10.1145/585740.585764}, booktitle={Proceedings of the ACM symposium on Virtual reality software and technology - VRST ’02}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2002} }","apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In Proceedings of the ACM symposium on Virtual reality software and technology - VRST ’02. https://doi.org/10.1145/585740.585764","ama":"Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In: Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02. ; 2002. doi:10.1145/585740.585764","chicago":"Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” In Proceedings of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002. https://doi.org/10.1145/585740.585764."},"language":[{"iso":"eng"}],"abstract":[{"text":"We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.\r\n\r\nFor the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.","lang":"eng"}],"title":"The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments","user_id":"15415","author":[{"last_name":"Klein","first_name":"Jan","full_name":"Klein, Jan"},{"first_name":"Jens","full_name":"Krokowski, Jens","last_name":"Krokowski"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Wand, Michael","first_name":"Michael","last_name":"Wand"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Proceedings of the ACM symposium on Virtual reality software and technology - VRST '02","publication_status":"published","publication_identifier":{"isbn":["1581135300"]},"status":"public","date_created":"2020-04-09T10:10:36Z"},{"type":"conference","year":"2002","citation":{"ieee":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, congestion and dilation in radio networks,” in Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA ’02, 2002.","short":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002.","mla":"Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002, doi:10.1145/564870.564910.","bibtex":"@inproceedings{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2002, title={Energy, congestion and dilation in radio networks}, DOI={10.1145/564870.564910}, booktitle={Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA ’02}, author={Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2002} }","chicago":"Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.” In Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02, 2002. https://doi.org/10.1145/564870.564910.","ama":"Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion and dilation in radio networks. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’02. ; 2002. doi:10.1145/564870.564910","apa":"Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., & Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA ’02. https://doi.org/10.1145/564870.564910"},"language":[{"iso":"eng"}],"doi":"10.1145/564870.564910","_id":"16491","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","publication_identifier":{"isbn":["1581135297"]},"status":"public","date_created":"2020-04-09T10:30:23Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"last_name":"Volbert","first_name":"Klaus","full_name":"Volbert, Klaus"},{"full_name":"Grünewald, Matthias","first_name":"Matthias","last_name":"Grünewald"}],"publication":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02","department":[{"_id":"63"}],"title":"Energy, congestion and dilation in radio networks","user_id":"15415"},{"publication_status":"published","publication_identifier":{"isbn":["9783540440499","9783540457060"],"issn":["0302-9743"]},"status":"public","date_created":"2020-04-17T11:40:33Z","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Kumar, Mohan","first_name":"Mohan","last_name":"Kumar"},{"first_name":"Sotiris","full_name":"Nikoletseas, Sotiris","last_name":"Nikoletseas"},{"last_name":"Spirakis","first_name":"Paul","full_name":"Spirakis, Paul"}],"department":[{"_id":"63"}],"publication":"Euro-Par 2002 Parallel Processing","edition":"Lecture Notes in Computer Science, vol 2400","title":"Mobile Computing, Mobile Networks","user_id":"15415","place":"Berlin, Heidelberg","type":"book_chapter","year":"2002","citation":{"ieee":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.","short":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.","mla":"Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, 2002, doi:10.1007/3-540-45706-2_133.","bibtex":"@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile Computing, Mobile Networks}, DOI={10.1007/3-540-45706-2_133}, booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }","apa":"Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002). Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133","ama":"Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: Euro-Par 2002 Parallel Processing. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133","chicago":"Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133."},"language":[{"iso":"eng"}],"doi":"10.1007/3-540-45706-2_133","date_updated":"2022-01-06T06:52:55Z","_id":"16723"},{"title":"Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing","user_id":"5786","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222","relation":"confirmation"}]},"publication_identifier":{"isbn":["3-931466-88-4"]},"volume":89,"date_created":"2020-09-22T10:18:39Z","status":"public","department":[{"_id":"63"},{"_id":"26"}],"author":[{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:08Z","_id":"19622","intvolume":" 89","year":"2001","citation":{"ama":"Schröder K. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2001.","apa":"Schröder, K. (2001). Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing (Vol. 89). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Vol. 89. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","mla":"Schröder, Klaus. Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","bibtex":"@book{Schröder_2001, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing}, volume={89}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Schröder, Klaus}, year={2001}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ieee":"K. Schröder, Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001."},"type":"dissertation","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"date_updated":"2022-01-06T06:54:12Z","_id":"19797","intvolume":" 1","page":"463-470","type":"conference","year":"2001","citation":{"short":"K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.","ieee":"K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN),” in Proceedings of the PDPTA 2001, 2001, vol. 1, pp. 463–470.","ama":"Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: Proceedings of the PDPTA 2001. Vol 1. ; 2001:463-470.","apa":"Salzwedel, K., Hartmann, G., Wolff, C., & Preis, R. (2001). Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In Proceedings of the PDPTA 2001 (Vol. 1, pp. 463–470).","chicago":"Salzwedel, Kay, Georg Hartmann, Carsten Wolff, and Robert Preis. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” In Proceedings of the PDPTA 2001, 1:463–70, 2001.","bibtex":"@inproceedings{Salzwedel_Hartmann_Wolff_Preis_2001, title={Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)}, volume={1}, booktitle={Proceedings of the PDPTA 2001}, author={Salzwedel, Kay and Hartmann, Georg and Wolff, Carsten and Preis, Robert}, year={2001}, pages={463–470} }","mla":"Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” Proceedings of the PDPTA 2001, vol. 1, 2001, pp. 463–70."},"language":[{"iso":"eng"}],"title":"Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)","user_id":"15415","volume":1,"date_created":"2020-09-30T12:34:44Z","status":"public","department":[{"_id":"63"},{"_id":"70"}],"publication":"Proceedings of the PDPTA 2001","author":[{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"first_name":"Georg","full_name":"Hartmann, Georg","last_name":"Hartmann"},{"last_name":"Wolff","full_name":"Wolff, Carsten","first_name":"Carsten"},{"full_name":"Preis, Robert","first_name":"Robert","last_name":"Preis"}]},{"issue":"1","doi":"10.1007/s004930170007","intvolume":" 21","_id":"2139","date_updated":"2022-01-06T06:54:57Z","language":[{"iso":"eng"}],"citation":{"bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.","apa":"Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138. https://doi.org/10.1007/s004930170007","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138. doi:10.1007/s004930170007","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica 21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138."},"type":"journal_article","year":"2001","page":"95--138","user_id":"14955","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","status":"public","date_created":"2018-04-03T05:47:20Z","volume":21,"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Combinatorica"},{"title":"SIMLAB-A Simulation Environment for Storage Area Networks","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"14955","date_created":"2018-04-03T05:49:21Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T08:39:01Z","publication":"PDP","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publisher":"IEEE Computer Society","file":[{"relation":"main_file","date_updated":"2018-04-12T08:39:01Z","content_type":"application/pdf","file_id":"2298","creator":"florida","file_size":85778,"access_level":"open_access","date_created":"2018-04-12T08:39:01Z","file_name":"PDP-00.pdf"}],"urn":"21415","_id":"2141","page":"227--234","citation":{"mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in PDP, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234."},"type":"conference","year":"2001"},{"publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","department":[{"_id":"63"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422877","9783540482246"]},"publication_status":"published","date_created":"2020-09-01T10:48:38Z","status":"public","title":"Testing Hypergraph Coloring","user_id":"15415","page":"493-505","year":"2001","citation":{"bibtex":"@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={10.1007/3-540-48224-5_41}, journal={Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001}, pages={493–505} }","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.","apa":"Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 493–505. https://doi.org/10.1007/3-540-48224-5_41","ama":"Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505. doi:10.1007/3-540-48224-5_41","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.","ieee":"A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 493–505, 2001.","short":"A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505."},"type":"journal_article","language":[{"iso":"eng"}],"_id":"18749","date_updated":"2022-01-06T06:53:51Z","doi":"10.1007/3-540-48224-5_41"},{"_id":"18750","date_updated":"2022-01-06T06:53:51Z","language":[{"iso":"eng"}],"page":"865-872","type":"conference","citation":{"ieee":"C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.","mla":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.","bibtex":"@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures}, booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }","apa":"Sohler, C., & Czumaj, A. (2001). Soft Kinetic Data Structures. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (pp. 865–872).","ama":"Sohler C, Czumaj A. Soft Kinetic Data Structures. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.","chicago":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 865–72, 2001."},"year":"2001","user_id":"15415","title":"Soft Kinetic Data Structures","date_created":"2020-09-01T10:56:39Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"}]},{"_id":"18857","date_updated":"2022-01-06T06:53:53Z","doi":"10.1007/3-540-44676-1_22","language":[{"iso":"eng"}],"year":"2001","citation":{"ieee":"C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277, 2001.","short":"C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.","mla":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), 2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.","bibtex":"@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries}, DOI={10.1007/3-540-44676-1_22}, journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }","chicago":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), 2001, 266–77. https://doi.org/10.1007/3-540-44676-1_22.","ama":"Sohler C, Czumaj A. Property Testing with Geometric Queries. Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01). 2001:266-277. doi:10.1007/3-540-44676-1_22","apa":"Sohler, C., & Czumaj, A. (2001). Property Testing with Geometric Queries. Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01), 266–277. https://doi.org/10.1007/3-540-44676-1_22"},"type":"journal_article","page":"266-277","abstract":[{"text":"This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is “far” from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is “far” or it is “close”; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects.\r\n\r\nThe main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers. We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area.\r\n\r\nWe shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability.","lang":"eng"}],"user_id":"15415","title":"Property Testing with Geometric Queries","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)","status":"public","date_created":"2020-09-02T12:24:25Z"},{"user_id":"15415","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","date_created":"2020-09-03T13:26:01Z","status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540430025","9783540452942"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS","author":[{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"},{"full_name":"Maheshwari, Anil","first_name":"Anil","last_name":"Maheshwari"},{"first_name":"Norbert","full_name":"Zeh, Norbert","last_name":"Zeh"}],"doi":"10.1007/3-540-45294-x_21","_id":"18964","date_updated":"2022-01-06T06:53:55Z","language":[{"iso":"eng"}],"citation":{"mla":"Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001, doi:10.1007/3-540-45294-x_21.","bibtex":"@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21}, booktitle={Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }","ama":"Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21","apa":"Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21","chicago":"Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.","ieee":"T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.","short":"T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001."},"type":"conference","year":"2001"},{"doi":"10.1145/504331.504333","_id":"23731","date_updated":"2022-01-06T06:55:58Z","language":[{"iso":"eng"}],"type":"journal_article","year":"2001","citation":{"ama":"Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333","apa":"Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18. https://doi.org/10.1145/504331.504333","chicago":"Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin, 2001, 16–18. https://doi.org/10.1145/504331.504333.","bibtex":"@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={10.1145/504331.504333}, journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }","mla":"Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.","short":"O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.","ieee":"O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18, 2001."},"page":"16-18","user_id":"15415","title":"Factoring a binary polynomial of degree over one million","abstract":[{"text":"\r\n On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z\r\n 2\r\n was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication.\r\n ","lang":"eng"}],"status":"public","date_created":"2021-09-03T09:08:27Z","publication_identifier":{"issn":["0163-5824"]},"publication_status":"published","author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"first_name":"Joachim","full_name":"von zur Gathen, Joachim","last_name":"von zur Gathen"},{"full_name":"Gerhard, Jürgen","first_name":"Jürgen","last_name":"Gerhard"},{"last_name":"Müller","first_name":"Olaf","full_name":"Müller, Olaf"}],"publication":"ACM SIGSAM Bulletin","department":[{"_id":"63"}]},{"citation":{"chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.","ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23","apa":"Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000) (Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23}, booktitle={Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001}, pages={378–388} }","short":"M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.","ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388."},"type":"conference","year":"2001","page":"378-388","_id":"18152","intvolume":" 2064","volume":2064,"status":"public","date_created":"2020-08-24T10:14:06Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"first_name":"Vasco","full_name":"Brattka, Vasco","last_name":"Brattka"}],"publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","user_id":"15415","abstract":[{"lang":"eng","text":"Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions."}],"language":[{"iso":"eng"}],"doi":"10.1007/3-540-45335-0_23","date_updated":"2022-01-06T06:53:26Z","publication_identifier":{"isbn":["9783540421979","9783540453352"],"issn":["0302-9743"]},"publication_status":"published","department":[{"_id":"63"}],"title":"A Computable Spectral Theorem","place":"Berlin, Heidelberg"},{"_id":"18166","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}],"page":"155-164","citation":{"ieee":"M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.","short":"M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.","mla":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp. 155–64.","bibtex":"@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)}, author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164} }","chicago":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), AA:155–64, 2001.","apa":"Ziegler, M., & Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).","ama":"Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164."},"year":"2001","type":"conference","user_id":"15415","title":"New Bounds for Hypercube Slicing Numbers","abstract":[{"text":"What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.","lang":"eng"}],"date_created":"2020-08-24T11:29:08Z","status":"public","volume":"AA","department":[{"_id":"63"}],"publication":"Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"first_name":"M. Reza","full_name":"Emamy-Khansari, M. Reza","last_name":"Emamy-Khansari"}]},{"author":[{"full_name":"Brattka, Vasco","first_name":"Vasco","last_name":"Brattka"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publication":"Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-24T11:33:12Z","abstract":[{"lang":"eng","text":"We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable."}],"title":"Turing Computability of (Non-)Linear Optimization","user_id":"15415","type":"conference","year":"2001","citation":{"mla":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–84.","bibtex":"@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001}, pages={181–184} }","chicago":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 181–84, 2001.","ama":"Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01). ; 2001:181-184.","apa":"Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01) (pp. 181–184).","ieee":"V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.","short":"V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184."},"page":"181-184","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","_id":"18168"},{"ddc":["000"],"user_id":"15415","abstract":[{"lang":"eng","text":"We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low."}],"has_accepted_license":"1","status":"public","date_created":"2020-08-26T13:08:24Z","author":[{"last_name":"Klein","first_name":"Jan","full_name":"Klein, Jan"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"}],"publication":"Proc. of 3. GI-Informatiktage 2001","file_date_updated":"2020-08-26T13:08:08Z","file":[{"access_level":"closed","file_name":"hni-id-1450.pdf","date_created":"2020-08-26T13:08:08Z","relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-08-26T13:08:08Z","creator":"koala","file_id":"18371","file_size":146136}],"_id":"18370","type":"conference","citation":{"apa":"Klein, J., & Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp. 275–278). Bad Schussenried.","ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried; 2001:275-278.","chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In Proc. of 3. GI-Informatiktage 2001, 275–78. Bad Schussenried, 2001.","mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–78.","bibtex":"@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc. of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001}, pages={275–278} }","short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–278."},"year":"2001","page":"275 - 278","title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph","place":"Bad Schussenried","department":[{"_id":"63"}],"date_updated":"2022-01-06T06:53:30Z","language":[{"iso":"eng"}]},{"publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH '01","department":[{"_id":"63"}],"author":[{"full_name":"Wand, Michael","first_name":"Michael","last_name":"Wand"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"first_name":"Ingmar","full_name":"Peter, Ingmar","last_name":"Peter"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Straßer","full_name":"Straßer, Wolfgang","first_name":"Wolfgang"}],"publication_status":"published","publication_identifier":{"isbn":["158113374X"]},"date_created":"2020-04-09T10:36:54Z","status":"public","abstract":[{"lang":"eng","text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption."}],"title":"The randomized z-buffer algorithm","user_id":"15415","year":"2001","type":"conference","citation":{"mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={10.1145/383259.383299}, booktitle={Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001} }","chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001. https://doi.org/10.1145/383259.383299.","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W. (2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH ’01. https://doi.org/10.1145/383259.383299","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in Proceedings of the 28th annual conference on Computer graphics and interactive techniques - SIGGRAPH ’01, 2001.","short":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques - SIGGRAPH ’01, 2001."},"language":[{"iso":"eng"}],"_id":"16492","date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/383259.383299"},{"language":[{"iso":"eng"}],"year":"2001","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.","ama":"Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2","apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={10.1007/3-540-45477-2_2}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }","short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001."},"type":"book_chapter","series_title":" Lecture Notes in Computer Science","doi":"10.1007/3-540-45477-2_2","intvolume":" 2204","_id":"16493","date_updated":"2022-01-06T06:52:51Z","status":"public","date_created":"2020-04-09T10:40:48Z","volume":2204,"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540427070","9783540454779"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Graph-Theoretic Concepts in Computer Science","user_id":"15415","title":"Data Management in Networks","place":"Berlin, Heidelberg"},{"date_updated":"2022-01-06T06:52:51Z","_id":"16494","doi":"10.1007/3-540-45718-6_68","language":[{"iso":"eng"}],"year":"2001","type":"book_chapter","citation":{"short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.","apa":"Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In Computational Science - ICCS 2001. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68","ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg; 2001. doi:10.1007/3-540-45718-6_68","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={10.1007/3-540-45718-6_68}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001, doi:10.1007/3-540-45718-6_68."},"place":"Berlin, Heidelberg","user_id":"15415","title":"Parallel Bridging Models and Their Impact on Algorithm Design","department":[{"_id":"63"}],"publication":"Computational Science - ICCS 2001","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"date_created":"2020-04-09T10:51:36Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540422334","9783540457183"],"issn":["0302-9743"]}},{"place":"Berlin, Heidelberg","user_id":"15415","title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","publisher":"Springer ","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-17T10:59:08Z","editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_status":"published","publication_identifier":{"isbn":["9783540424932","9783540446767"],"issn":["0302-9743"]},"date_updated":"2022-01-06T06:52:55Z","_id":"16722","doi":"10.1007/3-540-44676-1","language":[{"iso":"eng"}],"citation":{"ieee":"F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.","short":"F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.","bibtex":"@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}, DOI={10.1007/3-540-44676-1}, publisher={Springer }, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.","apa":"Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1","ama":"Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1","chicago":"Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1."},"year":"2001","type":"book_editor"},{"date_updated":"2022-01-06T06:54:08Z","_id":"19620","intvolume":" 81","citation":{"short":"I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","ieee":"I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","chicago":"Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and Implementations. Vol. 81. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","ama":"Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.","apa":"Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms and Implementations (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and Implementations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","bibtex":"@book{Rieping_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication in Parallel Systems-Models, Algorithms and Implementations}, volume={81}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Rieping, Ingo}, year={2000}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"type":"dissertation","year":"2000","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Communication in Parallel Systems-Models, Algorithms and Implementations","user_id":"5786","publication_identifier":{"isbn":["3-931466-80-9"]},"volume":81,"status":"public","date_created":"2020-09-22T10:06:31Z","author":[{"last_name":"Rieping","full_name":"Rieping, Ingo","first_name":"Ingo"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}]},{"user_id":"5786","related_material":{"link":[{"url":"https://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20000101283","relation":"confirmation"}]},"title":"Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints","status":"public","date_created":"2020-09-22T10:16:35Z","volume":90,"publication_identifier":{"isbn":["3-931466-89-2"]},"author":[{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"date_updated":"2022-01-06T06:54:08Z","_id":"19621","intvolume":" 90","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","citation":{"ieee":"M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","short":"M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","mla":"Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","bibtex":"@book{Westermann_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints}, volume={90}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Westermann, Matthias}, year={2000}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Westermann M. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.","apa":"Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000."},"year":"2000","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"citation":{"apa":"Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference.","ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. PUB-Library, Release 7.0, User Guide and Function Reference.; 2000.","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. PUB-Library, Release 7.0, User Guide and Function Reference, 2000.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_2000, title={PUB-Library, Release 7.0, User Guide and Function Reference}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={2000} }","mla":"Bonorden, Olaf, et al. PUB-Library, Release 7.0, User Guide and Function Reference. 2000.","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.","ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference. 2000."},"year":"2000","type":"report","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:10Z","_id":"19733","date_created":"2020-09-28T12:20:20Z","has_accepted_license":"1","status":"public","file_date_updated":"2020-09-28T12:20:10Z","department":[{"_id":"63"}],"author":[{"last_name":"Bonorden","full_name":"Bonorden, Olaf","first_name":"Olaf"},{"last_name":"Rieping","first_name":"Ingo","full_name":"Rieping, Ingo"},{"last_name":"von Otte","first_name":"Ingo","full_name":"von Otte, Ingo"},{"full_name":"Juurlink, Bernhardus","first_name":"Bernhardus","last_name":"Juurlink"}],"file":[{"access_level":"closed","date_created":"2020-09-28T12:20:10Z","file_name":"pub-hni-1656.pdf","success":1,"relation":"main_file","date_updated":"2020-09-28T12:20:10Z","content_type":"application/pdf","creator":"koala","file_id":"19734","file_size":271118}],"ddc":["000"],"title":"PUB-Library, Release 7.0, User Guide and Function Reference","user_id":"15415"},{"type":"habilitation","year":"2000","citation":{"short":"C. Scheideler, Probabilistic Methods for Coordination Problems, 2000.","ieee":"C. Scheideler, Probabilistic Methods for Coordination Problems. 2000.","chicago":"Scheideler, Christian. Probabilistic Methods for Coordination Problems, 2000.","ama":"Scheideler C. Probabilistic Methods for Coordination Problems.; 2000.","apa":"Scheideler, C. (2000). Probabilistic Methods for Coordination Problems.","bibtex":"@book{Scheideler_2000, title={Probabilistic Methods for Coordination Problems}, author={Scheideler, Christian}, year={2000} }","mla":"Scheideler, Christian. Probabilistic Methods for Coordination Problems. 2000."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:12Z","_id":"19784","publication_identifier":{"isbn":["3-931466-77-9"]},"status":"public","date_created":"2020-09-30T10:05:34Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"63"}],"title":"Probabilistic Methods for Coordination Problems","user_id":"15415"},{"publication":"Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)","department":[{"_id":"63"}],"author":[{"last_name":"Bednara","full_name":"Bednara, M.","first_name":"M."},{"last_name":"Beyer","full_name":"Beyer, O.","first_name":"O."},{"first_name":"J.","full_name":"Teich, J.","last_name":"Teich"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"publication_identifier":{"isbn":["0769507166"]},"publication_status":"published","date_created":"2020-10-02T10:30:38Z","status":"public","title":"Tradeoff analysis and architecture design of a hybrid hardware/software sorter","user_id":"15415","page":"299-308","year":"2000","type":"conference","citation":{"bibtex":"@inproceedings{Bednara_Beyer_Teich_Wanka_2000, title={Tradeoff analysis and architecture design of a hybrid hardware/software sorter}, DOI={10.1109/asap.2000.862400}, booktitle={Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)}, author={Bednara, M. and Beyer, O. and Teich, J. and Wanka, Rolf}, year={2000}, pages={299–308} }","mla":"Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi:10.1109/asap.2000.862400.","apa":"Bednara, M., Beyer, O., Teich, J., & Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308. https://doi.org/10.1109/asap.2000.862400","ama":"Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP). ; 2000:299-308. doi:10.1109/asap.2000.862400","chicago":"Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” In Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308, 2000. https://doi.org/10.1109/asap.2000.862400.","ieee":"M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi: 10.1109/asap.2000.862400.","short":"M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:13Z","_id":"19849","doi":"10.1109/asap.2000.862400"},{"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2018-04-03T05:51:02Z","status":"public","volume":33,"_id":"2143","intvolume":" 33","date_updated":"2022-01-06T06:54:59Z","issue":"5/6","doi":"10.1007/s002240010006","language":[{"iso":"eng"}],"page":"337--391","year":"2000","citation":{"ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","apa":"Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006."},"type":"journal_article"},{"language":[{"iso":"eng"}],"year":"2000","citation":{"mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","apa":"Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155."},"type":"journal_article","page":"1126--1155","issue":"4","doi":"10.1137/S0097539799353431","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z","status":"public","date_created":"2018-04-03T06:12:15Z","volume":30,"author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"publication":"SIAM J. Comput.","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols"},{"type":"conference","citation":{"mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.","apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000."},"year":"2000","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:55:00Z","_id":"2146","urn":"21467","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:13:07Z","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"PDPTA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:47:50Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T08:47:50Z","file_id":"2299","creator":"florida","file_size":168677,"access_level":"open_access","date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf"}],"ddc":["040"],"title":"Distributed Path Selection for Storage Networks","user_id":"14955"},{"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"],"user_id":"14955","date_created":"2018-04-03T06:16:48Z","has_accepted_license":"1","status":"public","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_size":185001,"creator":"florida","file_id":"2295","content_type":"application/pdf","date_updated":"2018-04-12T08:36:17Z","relation":"main_file","date_created":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf","access_level":"open_access"}],"oa":"1","urn":"21476","_id":"2147","date_updated":"2022-01-06T06:55:00Z","page":"30--39","type":"conference","year":"2000","citation":{"ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39."},"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"year":"2000","type":"journal_article","citation":{"chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.","apa":"Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000."},"page":"213--237","_id":"2148","intvolume":" 17","date_updated":"2022-01-06T06:55:00Z","issue":"3-4","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Random Struct. Algorithms","department":[{"_id":"79"},{"_id":"63"}],"status":"public","date_created":"2018-04-03T06:17:52Z","volume":17,"user_id":"14955","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma"},{"language":[{"iso":"eng"}],"type":"conference","year":"2000","citation":{"short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }"},"page":"119--128","_id":"2149","date_updated":"2022-01-06T06:55:02Z","urn":"21493","oa":"1","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T08:38:13Z","relation":"main_file","file_size":222176,"file_id":"2297","creator":"florida","access_level":"open_access","file_name":"spaa_00.pdf","date_created":"2018-04-12T08:38:13Z"}],"author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"full_name":"Salzwedel, Kay","first_name":"Kay","last_name":"Salzwedel"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T08:38:13Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:18:45Z","user_id":"14955","ddc":["040"],"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","year":"2000","type":"conference","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.","ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.","apa":"Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47."},"page":"38--47","_id":"2150","urn":"21509","file":[{"creator":"florida","file_id":"2300","file_size":190083,"relation":"main_file","date_updated":"2018-04-12T08:49:23Z","content_type":"application/pdf","date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf","access_level":"open_access"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publisher":"ACM","publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:21:11Z","user_id":"14955","ddc":["040"]},{"date_updated":"2022-01-06T06:53:21Z","_id":"17865","language":[{"iso":"eng"}],"year":"2000","citation":{"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} }","mla":"Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000.","chicago":"Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000.","ama":"Wand M, Fischer M, Meyer auf der Heide F. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn; 2000.","apa":"Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn.","ieee":"M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 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."},"type":"report","abstract":[{"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.","lang":"eng"}],"place":"Universität Paderborn","user_id":"15415","title":"Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes","ddc":["000"],"file":[{"access_level":"closed","file_name":"tr-ri-00-217.pdf","date_created":"2020-08-12T13:27:33Z","content_type":"application/pdf","date_updated":"2020-08-12T13:27:33Z","success":1,"relation":"main_file","file_size":921817,"file_id":"17866","creator":"koala"}],"department":[{"_id":"63"}],"file_date_updated":"2020-08-12T13:27:33Z","author":[{"full_name":"Wand, Michael","first_name":"Michael","last_name":"Wand"},{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-08-12T13:27:52Z","has_accepted_license":"1","status":"public"},{"title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","user_id":"15415","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","status":"public","date_created":"2020-09-03T13:21:02Z","author":[{"last_name":"Govindarajan","full_name":"Govindarajan, Sathish","first_name":"Sathish"},{"first_name":"Tamas","full_name":"Lukovszki, Tamas","last_name":"Lukovszki"},{"last_name":"Maheshwari","full_name":"Maheshwari, Anil","first_name":"Anil"},{"last_name":"Zeh","first_name":"Norbert","full_name":"Zeh, Norbert"}],"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS","department":[{"_id":"63"}],"doi":"10.1007/s00453-005-1197-3","_id":"18962","date_updated":"2022-01-06T06:53:55Z","citation":{"ieee":"S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.","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.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3.","bibtex":"@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={10.1007/s00453-005-1197-3}, 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} }","chicago":"Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3.","ama":"Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3","apa":"Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3"},"year":"2000","type":"conference","page":"585-614","language":[{"iso":"eng"}]},{"user_id":"15415","abstract":[{"lang":"eng","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."}],"volume":4698,"status":"public","date_created":"2020-08-14T13:48:54Z","publisher":"Springer","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)","_id":"17990","intvolume":" 4698","citation":{"mla":"Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15.","bibtex":"@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={10.1007/3-540-45253-2_15}, 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} }","apa":"Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15","ama":"Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15","chicago":"Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-45253-2_15.","ieee":"A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166.","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."},"type":"conference","year":"2000","page":"155-166","title":"Property Testing in Computational Geometry","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540410041","9783540452539"]},"publication_status":"published","department":[{"_id":"63"}],"doi":"10.1007/3-540-45253-2_15","date_updated":"2022-01-06T06:53:24Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"doi":"10.1007/3-540-44411-4_34","date_updated":"2022-01-06T06:53:26Z","language":[{"iso":"eng"}],"title":"Computing the Dimension of Linear Subspaces","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540413486","9783540444114"],"issn":["0302-9743"]},"publication_status":"published","department":[{"_id":"63"}],"intvolume":" 1963","_id":"18146","page":"450-458","type":"conference","citation":{"chicago":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.","apa":"Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34","ama":"Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34","bibtex":"@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={10.1007/3-540-44411-4_34}, 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.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.","short":"M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.","ieee":"M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458."},"year":"2000","user_id":"15415","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"}],"date_created":"2020-08-24T09:58:56Z","status":"public","volume":1963,"publication":"SOFSEM 2000: Theory and Practice of Informatics","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"last_name":"Brattka","first_name":"Vasco","full_name":"Brattka, Vasco"}],"publisher":"Springer"},{"title":"Computing Cut Numbers","user_id":"15415","abstract":[{"lang":"eng","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.
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).
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."}],"date_created":"2020-08-24T10:10:40Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"date_updated":"2022-01-06T06:53:26Z","_id":"18150","page":"73-79","citation":{"chicago":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000.","apa":"Ziegler, M., & Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79).","ama":"Ziegler M, Sohler C. Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00). ; 2000:73-79.","mla":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” 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} }","short":"M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.","ieee":"M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79."},"type":"conference","year":"2000","language":[{"iso":"eng"}]},{"doi":"10.1145/355483.355490","_id":"18446","intvolume":" 45","date_updated":"2022-01-06T06:53:32Z","page":"944-967","type":"journal_article","year":"2000","citation":{"mla":"Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.","bibtex":"@article{Lorys_Wanka_Oesterdiekhoff_Kutylowski_2000, title={Periodification Scheme: Constructing Sorting Networks with Constant Period}, volume={45}, DOI={10.1145/355483.355490}, journal={Journal of the ACM}, author={Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, year={2000}, pages={944–967} }","chicago":"Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM 45 (2000): 944–67. https://doi.org/10.1145/355483.355490.","ama":"Lorys K, Wanka R, Oesterdiekhoff B, Kutylowski M. Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM. 2000;45:944-967. doi:10.1145/355483.355490","apa":"Lorys, K., Wanka, R., Oesterdiekhoff, B., & Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967. https://doi.org/10.1145/355483.355490","ieee":"K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.","short":"K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967."},"language":[{"iso":"eng"}],"title":"Periodification Scheme: Constructing Sorting Networks with Constant Period","user_id":"15415","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(32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 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 .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.","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} }","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 32nd ACM Symposium on Theory of Computing, 38–47, 2000.","apa":"Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (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: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47."},"type":"conference","year":"2000","page":"38-47"},{"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}],"publication":"Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures - SPAA '00","department":[{"_id":"63"}],"publication_identifier":{"isbn":["1581131852"]},"publication_status":"published","status":"public","date_created":"2020-04-09T13:06:23Z","title":"Data management in hierarchical bus networks","user_id":"15415","type":"conference","year":"2000","citation":{"ieee":"F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.","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.","bibtex":"@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management in hierarchical bus networks}, DOI={10.1145/341800.341814}, 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} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00, 2000, doi:10.1145/341800.341814.","chicago":"Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00, 2000. https://doi.org/10.1145/341800.341814.","apa":"Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00. https://doi.org/10.1145/341800.341814","ama":"Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’00. ; 2000. doi:10.1145/341800.341814"},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:51Z","_id":"16495","doi":"10.1145/341800.341814"},{"abstract":[{"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.","lang":"eng"}],"title":"Caching in networks","user_id":"15415","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"full_name":"Westermann, Matthias","first_name":"Matthias","last_name":"Westermann"}],"department":[{"_id":"63"}],"publication":"SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms","publication_identifier":{"isbn":["0898714532"]},"status":"public","date_created":"2020-04-09T13:16:15Z","date_updated":"2022-01-06T06:52:51Z","_id":"16496","year":"2000","type":"conference","citation":{"ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 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.","mla":"Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.","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} }","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. ; 2000:430–439.","apa":"Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 430–439).","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 430–439, 2000."},"page":"430–439","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:51Z","_id":"16497","doi":"10.1007/3-540-44520-x_59","language":[{"iso":"eng"}],"year":"2000","type":"book_chapter","citation":{"ieee":"F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.","short":"F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.","bibtex":"@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={10.1007/3-540-44520-x_59}, 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.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.","chicago":"Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59.","ama":"Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59","apa":"Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59"},"place":"Berlin, Heidelberg","user_id":"15415","title":"Complexity Theory and Algorithms","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Kutyłowski","first_name":"Mirosław","full_name":"Kutyłowski, Mirosław"},{"first_name":"Prabhakar","full_name":"Ragde, Prabhakar","last_name":"Ragde"}],"department":[{"_id":"63"}],"publication":"Euro-Par 2000 Parallel Processing","status":"public","date_created":"2020-04-09T13:30:45Z","publication_identifier":{"isbn":["9783540679561","9783540445203"],"issn":["0302-9743"]},"publication_status":"published"},{"publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"status":"public","date_created":"2020-05-18T13:47:36Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"publication":"SIAM Journal on Computing","department":[{"_id":"63"}],"title":"Contention Resolution in Hashing Based Shared Memory Simulations","user_id":"15415","year":"2000","citation":{"mla":"Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x.","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution in Hashing Based Shared Memory Simulations}, DOI={10.1137/s009753979529564x}, 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.” SIAM Journal on Computing, 2000, 1703–39. https://doi.org/10.1137/s009753979529564x.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739. https://doi.org/10.1137/s009753979529564x","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739. doi:10.1137/s009753979529564x","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739."},"type":"journal_article","page":"1703-1739","language":[{"iso":"eng"}],"doi":"10.1137/s009753979529564x","date_updated":"2022-01-06T06:53:01Z","_id":"17010"},{"_id":"16345","date_updated":"2022-01-06T06:52:49Z","language":[{"iso":"eng"}],"year":"2000","citation":{"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,” ForschungsForum Paderborn, pp. 112–116, 2000.","short":"F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.","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.” ForschungsForum Paderborn, 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} }","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. ForschungsForum Paderborn. 2000:112-116.","apa":"Meyer auf der Heide, F., & Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 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.” ForschungsForum Paderborn, 2000, 112–16."},"type":"journal_article","page":"112-116","user_id":"15415","title":"Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik","ddc":["000"],"article_type":"original","status":"public","has_accepted_license":"1","date_created":"2020-03-24T10:59:27Z","publication_identifier":{"unknown":["ISBN 978-3-942647-99-1"]},"file":[{"access_level":"closed","date_created":"2020-08-04T13:17:46Z","file_name":"FFP-06-2000.pdf","success":1,"relation":"main_file","date_updated":"2020-08-04T13:17:46Z","content_type":"application/pdf","creator":"koala","file_id":"17588","file_size":477845}],"author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"department":[{"_id":"63"}],"publication":"ForschungsForum Paderborn","file_date_updated":"2020-08-04T13:17:46Z"},{"author":[{"first_name":"Olaf","full_name":"Bonorden, Olaf","last_name":"Bonorden"},{"full_name":"Juurlink, Bernhardus","first_name":"Bernhardus","last_name":"Juurlink"},{"first_name":"I.","full_name":"Von Otte, I.","last_name":"Von Otte"},{"last_name":"Rieping","first_name":"Ingo","full_name":"Rieping, Ingo"}],"publication":"Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing","department":[{"_id":"63"}],"status":"public","date_created":"2020-09-28T12:11:30Z","publication_identifier":{"isbn":["0769501435"]},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"user_id":"15415","title":"The Paderborn university BSP (PUB) library-design, implementation and performance","language":[{"iso":"eng"}],"year":"1999","citation":{"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.","ieee":"O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.","chicago":"Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999. https://doi.org/10.1109/ipps.1999.760442.","apa":"Bonorden, O., Juurlink, B., Von Otte, I., & Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104. https://doi.org/10.1109/ipps.1999.760442","ama":"Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP (PUB) library-design, implementation and performance. In: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. ; 1999:99-104. doi:10.1109/ipps.1999.760442","mla":"Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi:10.1109/ipps.1999.760442.","bibtex":"@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn university BSP (PUB) library-design, implementation and performance}, DOI={10.1109/ipps.1999.760442}, 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} }"},"type":"conference","page":"99-104","_id":"19732","date_updated":"2022-01-06T06:54:10Z","doi":"10.1109/ipps.1999.760442"},{"status":"public","date_created":"2018-04-03T06:22:14Z","volume":32,"author":[{"last_name":"Flammini","first_name":"Michele","full_name":"Flammini, Michele"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","title":"Simple, Efficient Routing Schemes for All-Optical Networks","language":[{"iso":"eng"}],"type":"journal_article","citation":{"short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123","apa":"Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }"},"year":"1999","page":"387--420","issue":"3","doi":"10.1007/s002240000123","date_updated":"2022-01-06T06:55:02Z","_id":"2151","intvolume":" 32"},{"ddc":["040"],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","user_id":"14955","has_accepted_license":"1","status":"public","date_created":"2018-04-03T08:56:06Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"SODA","file_date_updated":"2018-04-12T07:34:50Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:34:50Z","relation":"main_file","file_size":179058,"file_id":"2288","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:34:50Z","file_name":"SODA-99.pdf"}],"oa":"1","_id":"2164","date_updated":"2022-01-06T06:55:09Z","urn":"21649","type":"conference","citation":{"mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 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} }","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.","apa":"Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).","chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121."},"year":"1999","page":"112--121","language":[{"iso":"eng"}]},{"user_id":"14955","ddc":["040"],"title":"Simple Competitive Request Scheduling Strategies","status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:56:45Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:36:27Z","file_id":"2290","creator":"florida","file_size":144422,"access_level":"open_access","file_name":"SPAA-99.pdf","date_created":"2018-04-12T07:36:27Z"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"full_name":"Riedel, Marco","first_name":"Marco","last_name":"Riedel"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:36:27Z","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","date_updated":"2022-01-06T06:55:09Z","_id":"2165","urn":"21658","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” 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} }"},"year":"1999","page":"33--42"},{"related_material":{"link":[{"url":"http://www.cccg.ca/proceedings/1999/fp36.pdf","relation":"confirmation"}]},"title":"Partitioned neighborhood spanners of minimal outdegree","place":"Vancouver","department":[{"_id":"63"}],"date_updated":"2022-01-06T06:53:21Z","language":[{"iso":"eng"}],"user_id":"15415","ddc":["000"],"abstract":[{"lang":"eng","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"}],"date_created":"2020-08-12T13:12:00Z","has_accepted_license":"1","status":"public","file":[{"file_name":"hni-id-729.pdf","date_created":"2020-08-27T11:14:43Z","access_level":"closed","file_size":209419,"creator":"koala","file_id":"18438","date_updated":"2020-08-27T11:14:43Z","content_type":"application/pdf","relation":"main_file","success":1}],"file_date_updated":"2020-08-27T11:14:43Z","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Lukovszki, Tamas","first_name":"Tamas","last_name":"Lukovszki"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"_id":"17864","type":"conference","citation":{"ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.","mla":"Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” Proceedings of the 11th Canadian Conference on Computational Geometry, 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} }","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.","ama":"Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal outdegree. In: Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver; 1999."},"year":"1999"},{"page":"136-141","citation":{"chicago":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 136–41, 1999.","apa":"Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp. 136–141).","ama":"Sohler C. Fast Reconstruction of Delaunay Triangulations. In: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99). ; 1999:136-141.","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} }","mla":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–41.","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.","ieee":"C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141."},"type":"conference","year":"1999","language":[{"iso":"eng"}],"_id":"18747","date_updated":"2022-01-06T06:53:51Z","date_created":"2020-09-01T10:43:10Z","status":"public","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)","department":[{"_id":"63"}],"author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"title":"Fast Reconstruction of Delaunay Triangulations","user_id":"15415","abstract":[{"lang":"eng","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."}]},{"date_updated":"2022-01-06T06:53:55Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"title":"New Results on Geometric Spanners and Their Applications","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-62-0 "]},"intvolume":" 63","_id":"18942","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"1999","type":"dissertation","citation":{"apa":"Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Lukovszki T. New Results on Geometric Spanners and Their Applications. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999.","chicago":"Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","mla":"Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. 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} }","short":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","ieee":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999."},"user_id":"5786","ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-09-22T13:12:09Z","creator":"koala","file_id":"19641","file_size":1077329,"access_level":"closed","file_name":"pub-hni-495.pdf","date_created":"2020-09-22T13:12:09Z"}],"author":[{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file_date_updated":"2020-09-22T13:12:09Z","status":"public","has_accepted_license":"1","date_created":"2020-09-03T11:41:51Z","volume":63},{"date_updated":"2022-01-06T06:53:55Z","_id":"18959","doi":"10.1007/3-540-48447-7_20","language":[{"iso":"eng"}],"page":"193-204","citation":{"apa":"Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204). https://doi.org/10.1007/3-540-48447-7_20","ama":"Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204. doi:10.1007/3-540-48447-7_20","chicago":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.","mla":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204, doi:10.1007/3-540-48447-7_20.","bibtex":"@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric Spanners}, DOI={10.1007/3-540-48447-7_20}, booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }","short":"T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","ieee":"T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204."},"year":"1999","type":"conference","abstract":[{"text":"We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.
Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.
Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.","lang":"eng"}],"user_id":"15415","title":"New Results on Fault Tolerant Geometric Spanners","publication":"Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS","department":[{"_id":"63"}],"author":[{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"}],"date_created":"2020-09-03T13:03:45Z","status":"public","publication_identifier":{"isbn":["9783540662792","9783540484479"],"issn":["0302-9743"]},"publication_status":"published"},{"_id":"18965","date_updated":"2022-01-06T06:53:56Z","doi":"10.1145/305619.305637","language":[{"iso":"eng"}],"citation":{"chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 165–74, 1999. https://doi.org/10.1145/305619.305637.","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management in networks: experimental evaluation of a provably good strategy. In: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99. ; 1999:165-174. doi:10.1145/305619.305637","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99 (pp. 165–174). https://doi.org/10.1145/305619.305637","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.","bibtex":"@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999, title={Data management in networks: experimental evaluation of a provably good strategy}, DOI={10.1145/305619.305637}, booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999}, pages={165–174} }","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–174.","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99, 1999, pp. 165–174."},"year":"1999","type":"conference","page":"165-174","user_id":"15415","title":"Data management in networks: experimental evaluation of a provably good strategy","author":[{"full_name":"Krick, Christof","first_name":"Christof","last_name":"Krick"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}],"department":[{"_id":"63"}],"publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA '99","status":"public","date_created":"2020-09-03T14:27:14Z","publication_status":"published","publication_identifier":{"isbn":["1581131240"]}},{"user_id":"15415","title":"Generating Random Star-Shaped Polygons","abstract":[{"lang":"eng","text":"In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set ( S ) of ( n ) points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped polygon degenerate if its kernel has 0 area.
Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons."}],"status":"public","date_created":"2020-08-28T14:20:42Z","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)","department":[{"_id":"63"}],"_id":"18576","date_updated":"2022-01-06T06:53:40Z","language":[{"iso":"eng"}],"citation":{"ama":"Sohler C. Generating Random Star-Shaped Polygons. In: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99). ; 1999:174-177.","apa":"Sohler, C. (1999). Generating Random Star-Shaped Polygons. In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99) (pp. 174–177).","chicago":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.","mla":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–77.","bibtex":"@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.","ieee":"C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177."},"year":"1999","type":"conference","page":"174-177"},{"language":[{"iso":"eng"}],"page":"2-12","year":"1999","citation":{"apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12."},"type":"conference","oa":"1","urn":"22109","_id":"2210","date_updated":"2022-01-06T06:55:26Z","date_created":"2018-04-05T07:00:11Z","status":"public","has_accepted_license":"1","file":[{"date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","access_level":"open_access","file_size":211926,"creator":"florida","file_id":"2294","content_type":"application/pdf","date_updated":"2018-04-12T08:34:00Z","relation":"main_file"}],"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:34:00Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Riedel","full_name":"Riedel, Marco","first_name":"Marco"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)"},{"language":[{"iso":"eng"}],"page":"215--224","year":"1999","type":"conference","citation":{"ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.","short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.","bibtex":"@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler, Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }","apa":"Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999."},"oa":"1","urn":"21668","_id":"2166","date_updated":"2022-01-06T06:55:10Z","date_created":"2018-04-03T08:57:30Z","status":"public","has_accepted_license":"1","file":[{"file_name":"STOC-99.pdf","date_created":"2018-04-12T07:35:46Z","access_level":"open_access","file_size":227305,"file_id":"2289","creator":"florida","date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","relation":"main_file"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"user_id":"14955","ddc":["040"],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols"},{"department":[{"_id":"63"}],"publication":"Journal of Algorithms","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"publication_status":"published","publication_identifier":{"issn":["0196-6774"]},"date_created":"2020-04-14T11:50:52Z","status":"public","title":"Shortest-Path Routing in Arbitrary Networks","user_id":"15415","page":"105-131","year":"1999","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.","bibtex":"@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing in Arbitrary Networks}, DOI={10.1006/jagm.1998.0980}, journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1999}, pages={105–131} }","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.","ama":"Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms. 1999:105-131. doi:10.1006/jagm.1998.0980","apa":"Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980","ieee":"F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.","short":"F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131."},"type":"journal_article","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:52Z","_id":"16501","doi":"10.1006/jagm.1998.0980"},{"title":"Allocating Weighted Jobs in Parallel","user_id":"15415","author":[{"first_name":"P.","full_name":"Berenbrink, P.","last_name":"Berenbrink"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Schröder, K.","first_name":"K.","last_name":"Schröder"}],"publication":"Theory of Computing Systems","department":[{"_id":"63"}],"publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","status":"public","date_created":"2020-04-14T12:00:32Z","_id":"16502","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/s002240000119","year":"1999","type":"journal_article","citation":{"short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999.","apa":"Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in Parallel. Theory of Computing Systems. 1999:281-300. doi:10.1007/s002240000119","chicago":"Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, 281–300. https://doi.org/10.1007/s002240000119.","mla":"Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.","bibtex":"@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating Weighted Jobs in Parallel}, DOI={10.1007/s002240000119}, journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }"},"page":"281-300","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:53:03Z","_id":"17052","doi":"10.1007/978-3-662-01069-3_47","language":[{"iso":"eng"}],"citation":{"mla":"Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.","bibtex":"@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg}, title={International Workshop on Communication and Data Management in Large Networks}, DOI={10.1007/978-3-662-01069-3_47}, booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1999} }","chicago":"Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.” In Informatik Aktuell. Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-01069-3_47.","ama":"Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. ; 1999. doi:10.1007/978-3-662-01069-3_47","apa":"Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell. https://doi.org/10.1007/978-3-662-01069-3_47","ieee":"E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.","short":"E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999."},"type":"book_chapter","year":"1999","place":"Berlin, Heidelberg","user_id":"15415","title":"International Workshop on Communication and Data Management in Large Networks","publication":"Informatik aktuell","department":[{"_id":"63"}],"author":[{"first_name":"E. W.","full_name":"Mayr, E. W.","last_name":"Mayr"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"date_created":"2020-05-20T13:16:56Z","status":"public","publication_status":"published","publication_identifier":{"issn":["1431-472X"],"isbn":["9783540664505","9783662010693"]}},{"user_id":"15415","title":"Provably Good and Practical Strategies for Non-uniform Data Management in Networks","place":"Berlin, Heidelberg","date_created":"2020-05-20T13:35:49Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540662518","9783540484813"],"issn":["0302-9743"]},"department":[{"_id":"63"}],"publication":"Algorithms - ESA’ 99","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"doi":"10.1007/3-540-48481-7_9","_id":"17053","date_updated":"2022-01-06T06:53:03Z","language":[{"iso":"eng"}],"year":"1999","type":"book_chapter","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.","apa":"Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9","bibtex":"@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg}, title={Provably Good and Practical Strategies for Non-uniform Data Management in Networks}, DOI={10.1007/3-540-48481-7_9}, booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1999} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.","short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.","ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999."}},{"file_date_updated":"2020-09-22T13:05:04Z","author":[{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file":[{"file_size":592479,"file_id":"19640","creator":"koala","content_type":"application/pdf","date_updated":"2020-09-22T13:05:04Z","success":1,"relation":"main_file","date_created":"2020-09-22T13:05:04Z","file_name":"pub-hni-478.pdf","access_level":"closed"}],"volume":46,"date_created":"2020-09-22T13:05:43Z","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"5786","year":"1998","type":"dissertation","citation":{"mla":"Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","bibtex":"@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking, Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","ama":"Vöcking B. Static and Dynamic Data Management in Networks. Vol 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1998.","apa":"Vöcking, B. (1998). Static and Dynamic Data Management in Networks (Vol. 46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","short":"B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998."},"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"intvolume":" 46","_id":"19639","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-45-0"]},"title":"Static and Dynamic Data Management in Networks","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:09Z"},{"date_updated":"2022-01-06T06:54:11Z","_id":"19735","type":"report","year":"1998","citation":{"ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.","mla":"Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998} }","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.","apa":"Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (1998). The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.","ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.; 1998."},"language":[{"iso":"eng"}],"ddc":["000"],"title":"The Paderborn University BSP (PUB) Library - Design, Implementation and Performance","user_id":"15415","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 addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries."}],"has_accepted_license":"1","status":"public","date_created":"2020-09-28T12:41:20Z","author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"},{"last_name":"von Otte","full_name":"von Otte, Ingo","first_name":"Ingo"},{"first_name":"Bernhardus","full_name":"Juurlink, Bernhardus","last_name":"Juurlink"}],"department":[{"_id":"63"}],"file_date_updated":"2020-09-28T12:41:08Z","file":[{"date_updated":"2020-09-28T12:41:08Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":255806,"file_id":"19736","creator":"koala","access_level":"closed","file_name":"pub-hni-1350.pdf","date_created":"2020-09-28T12:41:08Z"}]},{"file":[{"access_level":"closed","file_name":"hni-id-854.pdf","date_created":"2020-08-27T11:20:38Z","content_type":"application/pdf","date_updated":"2020-08-27T11:20:38Z","success":1,"relation":"main_file","file_size":266070,"file_id":"18442","creator":"koala"}],"author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"publication":"Algorithms — ESA’ 98","file_date_updated":"2020-08-27T11:20:38Z","has_accepted_license":"1","status":"public","date_created":"2020-07-27T11:42:54Z","abstract":[{"lang":"eng","text":"We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.\r\n"}],"user_id":"15415","ddc":["000"],"type":"book_chapter","year":"1998","citation":{"ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={10.1007/3-540-68530-8_14}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }","mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.","chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.","ama":"Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14"},"_id":"17412","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"place":"Berlin, Heidelberg","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:11Z","doi":"10.1007/3-540-68530-8_14"},{"date_updated":"2022-01-06T06:53:21Z","language":[{"iso":"eng"}],"place":"Saarbrücken","title":"A Network Based Approach for Realtime Walkthrough of Massive Models","department":[{"_id":"63"}],"_id":"17863","page":"133--142","citation":{"chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.","ama":"Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE ’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.","mla":"Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }, year={1998}, pages={133--142} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 1998, pp. 133--142."},"year":"1998","type":"conference","abstract":[{"lang":"eng","text":"New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"}],"ddc":["000"],"user_id":"15415","file_date_updated":"2020-08-27T11:18:26Z","publication":"Algorithm Engineering, 2nd International Workshop, {WAE '98}","author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"full_name":"Ziegler, Martin ","first_name":"Martin ","last_name":"Ziegler"}],"publisher":"Max-Planck-Institut für Informatik","file":[{"date_created":"2020-08-27T11:18:26Z","file_name":"hni-id-853.pdf","access_level":"closed","creator":"koala","file_id":"18440","file_size":272549,"relation":"main_file","success":1,"date_updated":"2020-08-27T11:18:26Z","content_type":"application/pdf"}],"date_created":"2020-08-12T12:50:56Z","has_accepted_license":"1","status":"public"},{"year":"1998","type":"report","citation":{"bibtex":"@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }","mla":"Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.","chicago":"Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","apa":"Ziegler, M., Fischer, M., & Lukovszki, T. (1998). Multimediale Entdeckungsreisen unserer Welt mit dem Internet.","ama":"Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.","ieee":"M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998.","short":"M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","_id":"18145","status":"public","date_created":"2020-08-24T09:55:41Z","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"}],"department":[{"_id":"63"}],"title":"Multimediale Entdeckungsreisen unserer Welt mit dem Internet","user_id":"15415","abstract":[{"text":"Preis für den Beitrag \"Multimediale Entdeckungsreisen unserer Welt mit dem Internet\"","lang":"ger"},{"lang":"eng","text":"Award for the Article \"Multimedia-based Expedition of our World with the Internet\""}]},{"department":[{"_id":"63"}],"author":[{"last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte","first_name":"Brigitte"}],"date_created":"2020-08-27T11:42:12Z","status":"public","place":"Universität Paderborn","user_id":"15415","title":"On Periodic Comparator Networks","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","year":"1998","citation":{"bibtex":"@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }","mla":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.","chicago":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.","apa":"Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität Paderborn.","ama":"Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.","ieee":"B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998.","short":"B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998."},"date_updated":"2022-01-06T06:53:32Z","_id":"18445"},{"title":"Universal Continuous Routing Strategies","user_id":"14955","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","volume":31,"status":"public","date_created":"2018-04-03T08:59:06Z","_id":"2168","date_updated":"2022-01-06T06:55:10Z","intvolume":" 31","doi":"10.1007/s002240000096","issue":"4","year":"1998","citation":{"short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096","apa":"Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096","chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.","mla":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={10.1007/s002240000096}, number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and Vöcking, Berthold}, year={1998}, pages={425--449} }"},"type":"journal_article","page":"425--449","language":[{"iso":"eng"}]},{"_id":"2169","date_updated":"2022-01-06T06:55:10Z","urn":"21699","oa":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }","apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.","short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268."},"year":"1998","page":"259--268","user_id":"14955","ddc":["040"],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","file":[{"date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","access_level":"open_access","file_size":492778,"creator":"florida","file_id":"2285","date_updated":"2018-04-12T07:08:12Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"first_name":"Micah","full_name":"Adler, Micah","last_name":"Adler"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:08:12Z","status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:59:55Z"},{"language":[{"iso":"eng"}],"page":"624--633","citation":{"ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.","bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","apa":"Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633."},"year":"1998","type":"conference","urn":"21705","date_updated":"2022-01-06T06:55:11Z","_id":"2170","oa":"1","file":[{"file_name":"STOC98.pdf","date_created":"2018-04-12T07:15:50Z","access_level":"open_access","creator":"florida","file_id":"2286","file_size":228487,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:15:50Z"}],"publication":"STOC","file_date_updated":"2018-04-12T07:15:50Z","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T09:00:31Z","status":"public","has_accepted_license":"1","user_id":"14955","ddc":["040"],"title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)"},{"intvolume":" 1390","_id":"2185","date_updated":"2022-01-06T06:55:17Z","doi":"10.1007/BFb0052928","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"year":"1998","type":"book","citation":{"mla":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={10.1007/BFb0052928}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","chicago":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.","apa":"Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928","ama":"Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928","ieee":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998.","short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998."},"user_id":"14955","title":"Universal Routing Strategies for Interconnection Networks","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T09:38:18Z","status":"public","publication_identifier":{"isbn":["978-3-540-69792-3"]},"volume":1390},{"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Klaus","full_name":"Schröder, Klaus","last_name":"Schröder"},{"first_name":"Frank","full_name":"Schwarze, Frank","last_name":"Schwarze"}],"publication":"Theoretical Computer Science","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-14T12:20:57Z","volume":196,"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","user_id":"15415","title":"Routing on networks of optical crossbars","language":[{"iso":"eng"}],"citation":{"apa":"Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 196, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6","ama":"Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6","chicago":"Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science 196 (1998): 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6.","bibtex":"@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on networks of optical crossbars}, volume={196}, DOI={10.1016/s0304-3975(97)86791-6}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6.","short":"F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.","ieee":"F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998."},"year":"1998","type":"journal_article","page":"181-200","intvolume":" 196","_id":"16503","date_updated":"2022-01-06T06:52:52Z","doi":"10.1016/s0304-3975(97)86791-6"},{"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"status":"public","date_created":"2020-04-14T12:36:47Z","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Theoretical Computer Science","title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model","user_id":"15415","year":"1998","type":"journal_article","citation":{"bibtex":"@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}, DOI={10.1016/s0304-3975(98)00020-6}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6","apa":"Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203."},"page":"175-203","language":[{"iso":"eng"}],"doi":"10.1016/s0304-3975(98)00020-6","date_updated":"2022-01-06T06:52:52Z","_id":"16504"},{"place":"Berlin, Heidelberg","user_id":"15415","title":"Communication-efficient parallel multiway and approximate minimum cut computation","publication":"LATIN'98: Theoretical Informatics","department":[{"_id":"63"}],"author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Gabriel Terán","full_name":"Martinez, Gabriel Terán","last_name":"Martinez"}],"date_created":"2020-04-15T10:34:15Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540642756","9783540697152"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:52Z","_id":"16562","doi":"10.1007/bfb0054332","language":[{"iso":"eng"}],"type":"book_chapter","year":"1998","citation":{"ama":"Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332","apa":"Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332","chicago":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.","mla":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.","bibtex":"@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg}, title={Communication-efficient parallel multiway and approximate minimum cut computation}, DOI={10.1007/bfb0054332}, booktitle={LATIN’98: Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}, year={1998} }","short":"F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.","ieee":"F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998."}},{"department":[{"_id":"63"}],"publication":"Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98","author":[{"last_name":"Cole","first_name":"Richard","full_name":"Cole, Richard"},{"last_name":"Maggs","full_name":"Maggs, Bruce M.","first_name":"Bruce M."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Michael","full_name":"Mitzenmacher, Michael","last_name":"Mitzenmacher"},{"last_name":"Richa","first_name":"Andréa W.","full_name":"Richa, Andréa W."},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"},{"last_name":"Sitaraman","full_name":"Sitaraman, Ramesh K.","first_name":"Ramesh K."},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"date_created":"2020-04-15T10:38:12Z","status":"public","publication_identifier":{"isbn":["0897919629"]},"publication_status":"published","user_id":"15415","title":"Randomized protocols for low-congestion circuit routing in multistage interconnection networks","language":[{"iso":"eng"}],"citation":{"ama":"Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98. ; 1998. doi:10.1145/276698.276790","apa":"Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98. https://doi.org/10.1145/276698.276790","chicago":"Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998. https://doi.org/10.1145/276698.276790.","mla":"Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998, doi:10.1145/276698.276790.","bibtex":"@inproceedings{Cole_Maggs_Meyer auf der Heide_Mitzenmacher_Richa_Schröder_Sitaraman_Vöcking_1998, title={Randomized protocols for low-congestion circuit routing in multistage interconnection networks}, DOI={10.1145/276698.276790}, booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98}, author={Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide, Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and Sitaraman, Ramesh K. and Vöcking, Berthold}, year={1998} }","short":"R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998.","ieee":"R. Cole et al., “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98, 1998."},"year":"1998","type":"conference","date_updated":"2022-01-06T06:52:52Z","_id":"16563","doi":"10.1145/276698.276790"},{"publication_identifier":{"isbn":["3-931466-27-2"]},"volume":28,"status":"public","date_created":"2020-09-22T12:46:17Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"}],"department":[{"_id":"63"},{"_id":"26"}],"title":"Communication Efficient Parallel Searching","user_id":"5786","year":"1997","citation":{"bibtex":"@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Bäumker, Armin. Communication Efficient Parallel Searching. Vol. 28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","ieee":"A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","short":"A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997."},"type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:09Z","_id":"19631","intvolume":" 28"},{"user_id":"5786","title":"Communication and I/O Efficient Parallel Data Structures","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-22T12:53:00Z","volume":27,"publication_identifier":{"isbn":["3-931466-26-4"]},"_id":"19636","intvolume":" 27","date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication and I/O Efficient Parallel Data Structures}, volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ama":"Dittrich W. Communication and I/O Efficient Parallel Data Structures. Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","apa":"Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","short":"W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997."},"type":"dissertation","year":"1997"},{"intvolume":" 35","_id":"19637","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"dissertation","citation":{"short":"W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ieee":"W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","chicago":"Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","bibtex":"@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997."},"year":"1997","user_id":"5786","ddc":["000"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-09-22T12:57:43Z","creator":"koala","file_id":"19638","file_size":1172216,"access_level":"closed","file_name":"pub-hni-468.pdf","date_created":"2020-09-22T12:57:43Z"}],"author":[{"full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard","last_name":"Strothmann"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file_date_updated":"2020-09-22T12:57:43Z","has_accepted_license":"1","status":"public","date_created":"2020-09-22T12:57:53Z","volume":35,"date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"title":"Bounded Degree Spanning Trees","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-34-5"]}},{"abstract":[{"text":"Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.","lang":"eng"}],"title":"Bounded degree spanning trees","user_id":"15415","publication":"Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)","department":[{"_id":"63"}],"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard","last_name":"Strothmann"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"publication_status":"published","date_created":"2020-10-05T07:13:42Z","status":"public","_id":"19869","date_updated":"2022-01-06T06:54:14Z","doi":"10.1007/3-540-63397-9_9","citation":{"ieee":"A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: 10.1007/3-540-63397-9_9.","short":"A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.","mla":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi:10.1007/3-540-63397-9_9.","bibtex":"@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees}, DOI={10.1007/3-540-63397-9_9}, booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)}, author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }","chicago":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.","apa":"Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). https://doi.org/10.1007/3-540-63397-9_9","ama":"Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). ; 1997. doi:10.1007/3-540-63397-9_9"},"year":"1997","type":"conference","language":[{"iso":"eng"}]},{"year":"1997","citation":{"short":"W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.","ieee":"W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.","apa":"Strothmann, W.-B., & Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.","ama":"Strothmann W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs. Paderborn; 1997.","chicago":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.","mla":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. 1997.","bibtex":"@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki, Tamás}, year={1997} }"},"type":"report","language":[{"iso":"eng"}],"_id":"18955","date_updated":"2022-01-06T06:53:55Z","date_created":"2020-09-03T12:59:56Z","has_accepted_license":"1","status":"public","department":[{"_id":"63"}],"file_date_updated":"2020-09-03T12:59:44Z","author":[{"last_name":"Strothmann","first_name":"Willy-Bernhard","full_name":"Strothmann, Willy-Bernhard"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"}],"file":[{"file_size":222106,"creator":"koala","file_id":"18957","content_type":"application/pdf","date_updated":"2020-09-03T12:59:44Z","relation":"main_file","success":1,"file_name":"pub-hni-901.pdf","date_created":"2020-09-03T12:59:44Z","access_level":"closed"}],"title":"Decremental Biconnectivity on Planar Graphs","ddc":["000"],"user_id":"15415","abstract":[{"lang":"eng","text":"In this paper we present a (randomized) algorithm for maintaining the biconnected components of a dynamic planar graph of $n$ vertices under deletions of edges. The biconnected components can be maintained under any sequence of edge deletions in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$ amortized time per edge deletion, which improves previous (deterministic) results due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed. Our work describes a simplification of the data structures from [GiIt96] and uses dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi and Italiano, we only need $O(n)$ space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for finding efficiently a $Delta$-spanning tree in a biconnected planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann."}],"place":"Paderborn"},{"user_id":"15415","title":"Encoding a Triangulation as a Permutation of its Point Set","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"full_name":"Denny, Markus","first_name":"Markus","last_name":"Denny"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 9th Canadian Conference on Computational Geometry","status":"public","date_created":"2020-08-28T14:14:57Z","date_updated":"2022-01-06T06:53:40Z","_id":"18575","language":[{"iso":"eng"}],"citation":{"short":"C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","ieee":"C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","chicago":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational Geometry, 39–43, 1997.","ama":"Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry. ; 1997:39-43.","apa":"Sohler, C., & Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In Proceedings of the 9th Canadian Conference on Computational Geometry (pp. 39–43).","mla":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","bibtex":"@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997}, pages={39–43} }"},"year":"1997","type":"conference","page":"39-43"},{"language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:55:13Z","department":[{"_id":"79"},{"_id":"63"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","page":"326--332","citation":{"short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.","apa":"Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.","mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }"},"type":"conference","year":"1997","urn":"21759","_id":"2175","date_created":"2018-04-03T09:11:47Z","has_accepted_license":"1","status":"public","file_date_updated":"2018-04-12T07:11:50Z","publication":"IPPS","publisher":"IEEE Computer Society","author":[{"full_name":"Bock, Stefan","first_name":"Stefan","last_name":"Bock"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"access_level":"open_access","file_name":"IPPS97.pdf","date_created":"2018-04-12T07:07:20Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:11:50Z","creator":"florida","file_id":"2284","file_size":88749}],"ddc":["040"],"user_id":"14955"},{"title":"Simple, Efficient Routing Schemes for All-Optical Networks","ddc":["040"],"user_id":"14955","author":[{"last_name":"Flammini","full_name":"Flammini, Michele","first_name":"Michele"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:11:32Z","file":[{"date_updated":"2018-04-12T07:11:32Z","content_type":"application/pdf","relation":"main_file","file_size":365709,"file_id":"2283","creator":"florida","access_level":"open_access","file_name":"SPAA97.pdf","date_created":"2018-04-12T07:06:34Z"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:17:10Z","date_updated":"2022-01-06T06:55:13Z","_id":"2179","urn":"21792","oa":"1","year":"1997","citation":{"ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.","apa":"Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.","bibtex":"@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele and Scheideler, Christian}, year={1997}, pages={170--179} }","short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179."},"type":"conference","page":"170--179","language":[{"iso":"eng"}]},{"user_id":"15415","title":"A lower bound for randomized algebraic decision trees","author":[{"first_name":"Dima","full_name":"Grigoriev, Dima","last_name":"Grigoriev"},{"first_name":"Marek","full_name":"Karpinski, Marek","last_name":"Karpinski"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Roman","full_name":"Smolensky, Roman","last_name":"Smolensky"}],"department":[{"_id":"63"}],"publication":"computational complexity","status":"public","date_created":"2020-04-15T10:42:43Z","publication_identifier":{"issn":["1016-3328","1420-8954"]},"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","_id":"16564","doi":"10.1007/bf01270387","language":[{"iso":"eng"}],"year":"1997","citation":{"bibtex":"@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387}, journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375} }","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375. https://doi.org/10.1007/bf01270387","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375."},"type":"journal_article","page":"357-375"},{"doi":"10.1006/inco.1997.2642","date_updated":"2022-01-06T06:52:52Z","_id":"16565","page":"103-120","type":"journal_article","citation":{"bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={10.1006/inco.1997.2642}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }","mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120."},"year":"1997","language":[{"iso":"eng"}],"title":"Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures","user_id":"15415","publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","date_created":"2020-04-15T11:20:09Z","status":"public","department":[{"_id":"63"}],"publication":"Information and Computation","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}]},{"date_updated":"2022-01-06T06:52:52Z","_id":"16567","doi":"10.1007/s002240000071","year":"1997","citation":{"ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.","bibtex":"@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.","chicago":"Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071.","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071","apa":"Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644. https://doi.org/10.1007/s002240000071"},"type":"journal_article","page":"627-644","language":[{"iso":"eng"}],"title":"Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks","user_id":"15415","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"M.","full_name":"Storch, M.","last_name":"Storch"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"department":[{"_id":"63"}],"publication":"Theory of Computing Systems","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"status":"public","date_created":"2020-04-15T11:31:05Z"},{"_id":"16568","intvolume":" 1284","page":"1157 - 170","year":"1997","citation":{"mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={1157–170}, collection={Lecture Notes in Computer Science} }","apa":"Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 1157–1170. https://doi.org/10.1007/3-540-63397-9_13","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.","short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170."},"type":"conference","abstract":[{"lang":"eng","text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n"}],"user_id":"15415","publication":"5th Annual European Symposium on Algorithms (ESA '97)","author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard","last_name":"Strothmann"}],"publisher":"Springer","volume":1284,"date_created":"2020-04-15T11:44:36Z","status":"public","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/3-540-63397-9_13","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Dynamic data structures for realtime management of large geometric scenes","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]}},{"date_updated":"2022-01-06T06:52:52Z","_id":"16569","doi":"10.1007/bfb0002716","type":"book_chapter","year":"1997","citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","short":"F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={10.1007/bfb0002716}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.","apa":"Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716","ama":"Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716"},"language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Static and dynamic data management in networks","user_id":"15415","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"publication":"Euro-Par'97 Parallel Processing","department":[{"_id":"63"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"publication_status":"published","status":"public","date_created":"2020-04-15T11:47:28Z"},{"title":"Allocating weighted jobs in parallel","user_id":"15415","publication_identifier":{"isbn":["0897918908"]},"publication_status":"published","status":"public","date_created":"2020-04-16T06:18:07Z","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"}],"department":[{"_id":"63"}],"publication":"Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97","doi":"10.1145/258492.258522","_id":"16604","date_updated":"2022-01-06T06:52:53Z","type":"conference","year":"1997","citation":{"ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97, 1997.","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997.","bibtex":"@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating weighted jobs in parallel}, DOI={10.1145/258492.258522}, booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1997} }","mla":"Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997, doi:10.1145/258492.258522.","apa":"Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97. https://doi.org/10.1145/258492.258522","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522."},"language":[{"iso":"eng"}]},{"doi":"10.1007/3-540-63138-0_21","date_updated":"2022-01-06T06:52:53Z","_id":"16605","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","ieee":"A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","chicago":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.","ama":"Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21","apa":"Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21","mla":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.","bibtex":"@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={10.1007/3-540-63138-0_21}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }"},"year":"1997","user_id":"15415","title":"Communication efficient parallel searching","place":"Berlin, Heidelberg","date_created":"2020-04-16T06:22:32Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540631385","9783540691570"]},"department":[{"_id":"63"}],"publication":"Solving Irregularly Structured Problems in Parallel","author":[{"last_name":"Bäumker","full_name":"Bäumker, Armin","first_name":"Armin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"status":"public","date_created":"2020-04-16T10:41:06Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"author":[{"full_name":"Karaivazoglou, Efstratios","first_name":"Efstratios","last_name":"Karaivazoglou"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Euro-Par'97 Parallel Processing","user_id":"15415","title":"Routing on asyncronous processor networks","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"year":"1997","type":"book_chapter","citation":{"apa":"Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741","ama":"Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741","chicago":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.","mla":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.","bibtex":"@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }","short":"E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","ieee":"E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997."},"doi":"10.1007/bfb0002741","date_updated":"2022-01-06T06:52:54Z","_id":"16687"},{"date_created":"2020-04-16T10:44:29Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0818681977"]},"department":[{"_id":"63"}],"publication":"Proceedings 38th Annual Symposium on Foundations of Computer Science","author":[{"first_name":"B.M.","full_name":"Maggs, B.M.","last_name":"Maggs"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"full_name":"Westermann, Matthias","first_name":"Matthias","last_name":"Westermann"}],"user_id":"15415","title":"Exploiting locality for data management in systems of limited bandwidth","language":[{"iso":"eng"}],"year":"1997","type":"conference","citation":{"apa":"Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117","ama":"Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117","chicago":"Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997. https://doi.org/10.1109/sfcs.1997.646117.","mla":"Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.","bibtex":"@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117}, booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science}, author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1997} }","short":"B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.","ieee":"B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117."},"doi":"10.1109/sfcs.1997.646117","_id":"16689","date_updated":"2022-01-06T06:52:54Z"}]