[{"status":"public","type":"journal_article","publication":"Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18853","citation":{"ama":"Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property Testers. <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>. 2002:83-92.","ieee":"C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property Testers,” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, pp. 83–92, 2002.","chicago":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 2002, 83–92.","mla":"Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 2002, pp. 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} }","short":"C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS) (2002) 83–92.","apa":"Sohler, C., &#38; Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient Property Testers. <i>Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS)</i>, 83–92."},"page":"83-92","year":"2002","title":"Abstract Combinatorial Programs and Efficient Property Testers","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"date_created":"2020-09-02T12:08:22Z","date_updated":"2022-01-06T06:53:52Z"},{"title":"A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing","author":[{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"first_name":"A.","last_name":"Benczúr","full_name":"Benczúr, A."}],"date_created":"2020-09-03T13:16:48Z","date_updated":"2022-01-06T06:53:55Z","citation":{"ieee":"T. Lukovszki and A. Benczúr, <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","chicago":"Lukovszki, Tamás, and A. Benczúr. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn, 2002.","ama":"Lukovszki T, Benczúr A. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn; 2002.","apa":"Lukovszki, T., &#38; Benczúr, A. (2002). <i>A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. Paderborn.","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} }","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. <i>A Degree O(Log Log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing</i>. 2002."},"place":"Paderborn","year":"2002","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18961","status":"public","type":"report"},{"publication_identifier":{"isbn":["3-935433-24-7"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320","relation":"confirmation"}]},"year":"2002","citation":{"apa":"Ziegler, M. (2002). <i>Zur Berechenbarkeit reeller geometrischer Probleme</i> (Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. 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} }","short":"M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ama":"Ziegler M. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.","chicago":"Ziegler, Martin. <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>. Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.","ieee":"M. Ziegler, <i>Zur Berechenbarkeit reeller geometrischer Probleme</i>, vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002."},"intvolume":"       115","date_updated":"2022-01-06T06:53:26Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"date_created":"2020-08-24T11:36:55Z","volume":115,"title":"Zur Berechenbarkeit reeller geometrischer Probleme","type":"dissertation","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."},{"lang":"eng","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."}],"status":"public","_id":"18169","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"ger"}]},{"department":[{"_id":"63"}],"user_id":"15415","_id":"18176","language":[{"iso":"eng"}],"publication":"Mathematical Logic Quarterly (MLQ)","type":"journal_article","status":"public","volume":48,"author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-24T12:05:40Z","date_updated":"2022-01-06T06:53:26Z","doi":"10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4","title":"Computability on Regular Subsets of Euclidean Space","issue":"S1","publication_identifier":{"issn":["0942-5616","1521-3870"]},"publication_status":"published","intvolume":"        48","page":"157-181","citation":{"ama":"Ziegler M. Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>. 2002;48(S1):157-181. doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","chicago":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i> 48, no. S1 (2002): 157–81. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>.","ieee":"M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, pp. 157–181, 2002.","apa":"Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. <i>Mathematical Logic Quarterly (MLQ)</i>, <i>48</i>(S1), 157–181. <a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>","mla":"Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” <i>Mathematical Logic Quarterly (MLQ)</i>, vol. 48, no. S1, 2002, pp. 157–81, doi:<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>.","bibtex":"@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean Space}, volume={48}, DOI={<a href=\"https://doi.org/10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4\">10.1002/1521-3870(200210)48:1+&#60;157::aid-malq157&#62;3.0.co;2-4</a>}, number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin}, year={2002}, pages={157–181} }","short":"M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181."},"year":"2002"},{"language":[{"iso":"eng"}],"_id":"18177","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","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."}],"status":"public","publication":"Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG'02)","type":"conference","title":"Point Location Algorithms of Minimum Size","date_updated":"2022-01-06T06:53:26Z","date_created":"2020-08-24T12:09:15Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"},{"last_name":"Finschi","full_name":"Finschi, Lukas","first_name":"Lukas"}],"year":"2002","citation":{"chicago":"Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location Algorithms of Minimum Size.” In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","ieee":"M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum Size,” in <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002.","ama":"Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size. In: <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>. ; 2002.","apa":"Ziegler, M., Damerow, V., &#38; Finschi, L. (2002). Point Location Algorithms of Minimum Size. In <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>.","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} }","short":"M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.","mla":"Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” <i>Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02)</i>, 2002."},"publication_status":"published"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18179","status":"public","abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science","type":"conference","doi":"10.1007/978-0-387-35608-2_9","title":"Computability of Linear Equations","date_created":"2020-08-24T12:11:07Z","author":[{"full_name":"Brattka, Vasco","last_name":"Brattka","first_name":"Vasco"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:26Z","page":"95-106","citation":{"short":"V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.","bibtex":"@inproceedings{Brattka_Ziegler_2002, place={Boston, MA}, title={Computability of Linear Equations}, DOI={<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>}, booktitle={Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science}, author={Brattka, Vasco and Ziegler, Martin}, year={2002}, pages={95–106} }","mla":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 2002, pp. 95–106, doi:<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>.","apa":"Brattka, V., &#38; Ziegler, M. (2002). Computability of Linear Equations. In <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i> (pp. 95–106). Boston, MA. <a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">https://doi.org/10.1007/978-0-387-35608-2_9</a>","ama":"Brattka V, Ziegler M. Computability of Linear Equations. In: <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>. Boston, MA; 2002:95-106. doi:<a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">10.1007/978-0-387-35608-2_9</a>","ieee":"V. Brattka and M. Ziegler, “Computability of Linear Equations,” in <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 2002, pp. 95–106.","chicago":"Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” In <i>Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science</i>, 95–106. Boston, MA, 2002. <a href=\"https://doi.org/10.1007/978-0-387-35608-2_9\">https://doi.org/10.1007/978-0-387-35608-2_9</a>."},"place":"Boston, MA","year":"2002","publication_status":"published"},{"abstract":[{"lang":"eng","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"}],"status":"public","type":"conference","publication":"Simulation und Visualisierung","language":[{"iso":"eng"}],"_id":"18369","user_id":"15415","department":[{"_id":"63"}],"year":"2002","place":"Ghent, BE","citation":{"chicago":"Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In <i>Simulation Und Visualisierung</i>, 71–84. Ghent, BE: SCS European Publishing House, 2002.","ieee":"B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in <i>Simulation und Visualisierung</i>, 2002, pp. 71–84.","ama":"Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: <i>Simulation Und Visualisierung</i>. Ghent, BE: SCS European Publishing House; 2002:71-84.","apa":"Mueck, B., Dangelmaier, W., Fischer, M., &#38; Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In <i>Simulation und Visualisierung</i> (pp. 71–84). Ghent, BE: SCS European Publishing House.","short":"B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.","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.” <i>Simulation Und Visualisierung</i>, SCS European Publishing House, 2002, pp. 71–84."},"page":"71-84","title":"Bi-directional Coupling of Simulation Tools with a Walkthrough-System","date_updated":"2022-01-06T06:53:30Z","publisher":"SCS European Publishing House","author":[{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Klemisch, Wolfram","last_name":"Klemisch","first_name":"Wolfram"}],"date_created":"2020-08-26T13:01:43Z"},{"status":"public","abstract":[{"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.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 29th International Colloquium on Automata, Languages and Programming","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18566","citation":{"ama":"Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>","ieee":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002.","chicago":"Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>.","apa":"Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &#38; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>.","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.","bibtex":"@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin, Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>}, 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} }"},"place":"Berlin, Heidelberg","year":"2002","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540438649","9783540454656"]},"doi":"10.1007/3-540-45465-9_77","title":"Randomized Pursuit-Evasion in Graphs","date_created":"2020-08-28T12:04:12Z","author":[{"full_name":"Adler, Micah","last_name":"Adler","first_name":"Micah"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"first_name":"Naveen","last_name":"Sivadasan","full_name":"Sivadasan, Naveen"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"date_updated":"2022-01-06T06:53:40Z"},{"status":"public","type":"journal_article","publication":"Theory of Computing Systems","language":[{"iso":"eng"}],"_id":"16489","user_id":"15415","department":[{"_id":"63"}],"year":"2002","citation":{"mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Theory of Computing Systems</i>, 2002, pp. 217–45, doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","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={<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>}, 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.","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. <i>Theory of Computing Systems</i>, 217–245. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>","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. <i>Theory of Computing Systems</i>. Published online 2002:217-245. doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>","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,” <i>Theory of Computing Systems</i>, pp. 217–245, 2002, doi: <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","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.” <i>Theory of Computing Systems</i>, 2002, 217–45. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>."},"page":"217-245","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"title":"Data Management in Networks: Experimental Evaluation of a Provably Good Strategy","doi":"10.1007/s00224-001-1045-z","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:03:55Z","author":[{"first_name":"Christof","full_name":"Krick, Christof","last_name":"Krick"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"first_name":"Bernhard","last_name":"Vöcking","full_name":"Vöcking, Bernhard"},{"full_name":"Westermann, Matthias' ","last_name":"Westermann","first_name":"Matthias' "}]},{"language":[{"iso":"eng"}],"_id":"16490","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","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."}],"status":"public","publication":"Proceedings of the ACM symposium on Virtual reality software and technology  - VRST '02","type":"conference","title":"The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments","doi":"10.1145/585740.585764","date_updated":"2022-01-06T06:52:51Z","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"last_name":"Krokowski","full_name":"Krokowski, Jens","first_name":"Jens"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"first_name":"Michael","last_name":"Wand","full_name":"Wand, Michael"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-09T10:10:36Z","year":"2002","citation":{"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.","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={<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>}, 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} }","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>.","apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &#38; Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>","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 <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>.","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 <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>, 2002.","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: <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>"},"publication_identifier":{"isbn":["1581135300"]},"publication_status":"published"},{"status":"public","publication":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '02","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16491","citation":{"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.","bibtex":"@inproceedings{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2002, title={Energy, congestion and dilation in radio networks}, DOI={<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>}, 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} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Energy, Congestion and Dilation in Radio Networks.” <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>.","apa":"Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2002). Energy, congestion and dilation in radio networks. In <i>Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02</i>. <a href=\"https://doi.org/10.1145/564870.564910\">https://doi.org/10.1145/564870.564910</a>","ama":"Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Energy, congestion and dilation in radio networks. In: <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/564870.564910\">10.1145/564870.564910</a>","ieee":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, congestion and dilation in radio networks,” in <i>Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’02</i>, 2002.","chicago":"Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Energy, Congestion and Dilation in Radio Networks.” In <i>Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’02</i>, 2002. <a href=\"https://doi.org/10.1145/564870.564910\">https://doi.org/10.1145/564870.564910</a>."},"year":"2002","publication_identifier":{"isbn":["1581135297"]},"publication_status":"published","doi":"10.1145/564870.564910","title":"Energy, congestion and dilation in radio networks","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"},{"first_name":"Klaus","full_name":"Volbert, Klaus","last_name":"Volbert"},{"first_name":"Matthias","last_name":"Grünewald","full_name":"Grünewald, Matthias"}],"date_created":"2020-04-09T10:30:23Z","date_updated":"2022-01-06T06:52:51Z"},{"language":[{"iso":"eng"}],"_id":"16723","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Euro-Par 2002 Parallel Processing","type":"book_chapter","title":"Mobile Computing, Mobile Networks","doi":"10.1007/3-540-45706-2_133","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-17T11:40:33Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Mohan","last_name":"Kumar","full_name":"Kumar, Mohan"},{"first_name":"Sotiris","full_name":"Nikoletseas, Sotiris","last_name":"Nikoletseas"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"}],"year":"2002","place":"Berlin, Heidelberg","citation":{"ama":"Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: <i>Euro-Par 2002 Parallel Processing</i>. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>","chicago":"Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>.","ieee":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.","apa":"Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &#38; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In <i>Euro-Par 2002 Parallel Processing</i> (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>.","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={<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>}, booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={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."},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540440499","9783540457060"]},"publication_status":"published","edition":"Lecture Notes in Computer Science, vol 2400"},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"19622","user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"year":"2001","citation":{"ama":"Schröder K. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Vol 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2001.","chicago":"Schröder, Klaus. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Vol. 89. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","ieee":"K. Schröder, <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>, vol. 89. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001.","apa":"Schröder, K. (2001). <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i> (Vol. 89). 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.","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} }","mla":"Schröder, Klaus. <i>Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2001."},"intvolume":"        89","publication_identifier":{"isbn":["3-931466-88-4"]},"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222"}]},"title":"Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing","date_updated":"2022-01-06T06:54:08Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"author":[{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"}],"date_created":"2020-09-22T10:18:39Z","volume":89},{"title":"Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)","volume":1,"author":[{"full_name":"Salzwedel, Kay","last_name":"Salzwedel","first_name":"Kay"},{"full_name":"Hartmann, Georg","last_name":"Hartmann","first_name":"Georg"},{"first_name":"Carsten","full_name":"Wolff, Carsten","last_name":"Wolff"},{"first_name":"Robert","last_name":"Preis","full_name":"Preis, Robert"}],"date_created":"2020-09-30T12:34:44Z","date_updated":"2022-01-06T06:54:12Z","page":"463-470","intvolume":"         1","citation":{"ama":"Salzwedel K, Hartmann G, Wolff C, Preis R. Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In: <i>Proceedings of the PDPTA 2001</i>. Vol 1. ; 2001:463-470.","ieee":"K. Salzwedel, G. Hartmann, C. Wolff, and R. Preis, “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN),” in <i>Proceedings of the PDPTA 2001</i>, 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 <i>Proceedings of the PDPTA 2001</i>, 1:463–70, 2001.","apa":"Salzwedel, K., Hartmann, G., Wolff, C., &#38; Preis, R. (2001). Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN). In <i>Proceedings of the PDPTA 2001</i> (Vol. 1, pp. 463–470).","mla":"Salzwedel, Kay, et al. “Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN).” <i>Proceedings of the PDPTA 2001</i>, vol. 1, 2001, pp. 463–70.","short":"K. Salzwedel, G. Hartmann, C. Wolff, R. Preis, in: Proceedings of the PDPTA 2001, 2001, pp. 463–470.","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} }"},"year":"2001","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"70"}],"user_id":"15415","_id":"19797","status":"public","publication":"Proceedings of the PDPTA 2001","type":"conference"},{"status":"public","publication":"Combinatorica","type":"journal_article","language":[{"iso":"eng"}],"_id":"2139","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","year":"2001","page":"95--138","intvolume":"        21","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i>, vol. 21, no. 1, 2001, pp. 95--138, doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>, <i>21</i>(1), 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>. 2001;21(1):95--138. doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, vol. 21, no. 1, pp. 95--138, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i> 21, no. 1 (2001): 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>."},"issue":"1","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","doi":"10.1007/s004930170007","date_updated":"2022-01-06T06:54:57Z","volume":21,"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-04-03T05:47:20Z"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T08:39:01Z","ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","_id":"2141","status":"public","file":[{"date_created":"2018-04-12T08:39:01Z","creator":"florida","date_updated":"2018-04-12T08:39:01Z","file_name":"PDP-00.pdf","file_id":"2298","access_level":"open_access","file_size":85778,"content_type":"application/pdf","relation":"main_file"}],"urn":"21415","publication":"PDP","type":"conference","title":"SIMLAB-A Simulation Environment for Storage Area Networks","date_created":"2018-04-03T05:49:21Z","author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"oa":"1","date_updated":"2022-01-06T06:54:59Z","publisher":"IEEE Computer Society","page":"227--234","citation":{"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} }","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” <i>PDP</i>, IEEE Computer Society, 2001, pp. 227--234.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In <i>PDP</i> (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: <i>PDP</i>. IEEE Computer Society; 2001:227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In <i>PDP</i>, 227--234. IEEE Computer Society, 2001.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in <i>PDP</i>, 2001, pp. 227--234."},"year":"2001","has_accepted_license":"1"},{"status":"public","publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18749","page":"493-505","citation":{"chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>.","ieee":"A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, pp. 493–505, 2001.","ama":"Czumaj A, Sohler C. Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>. 2001:493-505. doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>","apa":"Czumaj, A., &#38; Sohler, C. (2001). Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>","short":"A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.","bibtex":"@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>}, 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.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, pp. 493–505, doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>."},"year":"2001","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422877","9783540482246"]},"publication_status":"published","doi":"10.1007/3-540-48224-5_41","title":"Testing Hypergraph Coloring","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"date_created":"2020-09-01T10:48:38Z","date_updated":"2022-01-06T06:53:51Z"},{"year":"2001","citation":{"chicago":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 865–72, 2001.","ieee":"C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, pp. 865–872.","ama":"Sohler C, Czumaj A. Soft Kinetic Data Structures. In: <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2001:865-872.","apa":"Sohler, C., &#38; Czumaj, A. (2001). Soft Kinetic Data Structures. In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i> (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.” <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 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} }"},"page":"865-872","date_updated":"2022-01-06T06:53:51Z","date_created":"2020-09-01T10:56:39Z","author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"title":"Soft Kinetic Data Structures","type":"conference","publication":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms","status":"public","_id":"18750","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"publication":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)","type":"journal_article","status":"public","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"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18857","language":[{"iso":"eng"}],"page":"266-277","citation":{"ama":"Sohler C, Czumaj A. Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>. 2001:266-277. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>","ieee":"C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, pp. 266–277, 2001.","chicago":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, 266–77. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>.","apa":"Sohler, C., &#38; Czumaj, A. (2001). Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 266–277. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>","bibtex":"@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>}, journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }","mla":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, pp. 266–77, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>.","short":"C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277."},"year":"2001","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"}],"date_created":"2020-09-02T12:24:25Z","date_updated":"2022-01-06T06:53:53Z","doi":"10.1007/3-540-44676-1_22","title":"Property Testing with Geometric Queries"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18964","status":"public","type":"conference","publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS","doi":"10.1007/3-540-45294-x_21","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","author":[{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"},{"last_name":"Maheshwari","full_name":"Maheshwari, Anil","first_name":"Anil"},{"full_name":"Zeh, Norbert","last_name":"Zeh","first_name":"Norbert"}],"date_created":"2020-09-03T13:26:01Z","date_updated":"2022-01-06T06:53:55Z","citation":{"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.","bibtex":"@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}, DOI={<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>}, 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} }","mla":"Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>.","apa":"Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>","chicago":"Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>.","ieee":"T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001.","ama":"Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>"},"year":"2001","publication_status":"published","publication_identifier":{"isbn":["9783540430025","9783540452942"],"issn":["0302-9743"]}}]