[{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-09T10:30:23Z","publication":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '02","citation":{"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} }","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.","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>","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>.","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.","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>"},"doi":"10.1145/564870.564910","user_id":"15415","language":[{"iso":"eng"}],"_id":"16491","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","year":"2002","status":"public","title":"Energy, congestion and dilation in radio networks","publication_identifier":{"isbn":["1581135297"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"},{"full_name":"Volbert, Klaus","first_name":"Klaus","last_name":"Volbert"},{"full_name":"Grünewald, Matthias","last_name":"Grünewald","first_name":"Matthias"}]},{"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","title":"Mobile Computing, Mobile Networks","year":"2002","status":"public","publication_identifier":{"isbn":["9783540440499","9783540457060"],"issn":["0302-9743"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Kumar, Mohan","last_name":"Kumar","first_name":"Mohan"},{"first_name":"Sotiris","last_name":"Nikoletseas","full_name":"Nikoletseas, Sotiris"},{"full_name":"Spirakis, Paul","last_name":"Spirakis","first_name":"Paul"}],"doi":"10.1007/3-540-45706-2_133","user_id":"15415","_id":"16723","edition":"Lecture Notes in Computer Science, vol 2400","language":[{"iso":"eng"}],"publication":"Euro-Par 2002 Parallel Processing","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>","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} }","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>.","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>.","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.","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>","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."},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-17T11:40:33Z"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19622","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":89,"status":"public","year":"2001","title":"Balls into Bins: A Paradigm for Job Allocation, Data Distribution Processes, and Routing","publication_identifier":{"isbn":["3-931466-88-4"]},"author":[{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"}],"date_updated":"2022-01-06T06:54:08Z","intvolume":"        89","date_created":"2020-09-22T10:18:39Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"citation":{"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.","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} }","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.","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.","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."},"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20010101222"}]}},{"publication":"Proceedings of the PDPTA 2001","citation":{"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} }","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.","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.","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.","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.","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)."},"date_created":"2020-09-30T12:34:44Z","type":"conference","department":[{"_id":"63"},{"_id":"70"}],"year":"2001","status":"public","title":"Efficient Parallel Simulations of Pulse-Coded Neural Networks (PCNN)","author":[{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"},{"first_name":"Georg","last_name":"Hartmann","full_name":"Hartmann, Georg"},{"full_name":"Wolff, Carsten","last_name":"Wolff","first_name":"Carsten"},{"last_name":"Preis","first_name":"Robert","full_name":"Preis, Robert"}],"date_updated":"2022-01-06T06:54:12Z","intvolume":"         1","page":"463-470","_id":"19797","language":[{"iso":"eng"}],"user_id":"15415","volume":1},{"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>.","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>","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} }","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>","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.","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","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>."},"publication":"Combinatorica","issue":"1","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article","date_created":"2018-04-03T05:47:20Z","intvolume":"        21","date_updated":"2022-01-06T06:54:57Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"year":"2001","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","status":"public","volume":21,"user_id":"14955","doi":"10.1007/s004930170007","language":[{"iso":"eng"}],"_id":"2139","page":"95--138"},{"type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T08:39:01Z","date_updated":"2018-04-12T08:39:01Z","relation":"main_file","file_size":85778,"access_level":"open_access","file_name":"PDP-00.pdf","content_type":"application/pdf","file_id":"2298"}],"date_created":"2018-04-03T05:49:21Z","publication":"PDP","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:59Z","title":"SIMLAB-A Simulation Environment for Storage Area Networks","year":"2001","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"oa":"1","file_date_updated":"2018-04-12T08:39:01Z","citation":{"mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” <i>PDP</i>, 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} }","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.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in <i>PDP</i>, 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.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 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."},"user_id":"14955","ddc":["040"],"page":"227--234","_id":"2141","urn":"21415","publisher":"IEEE Computer Society","has_accepted_license":"1","status":"public"},{"date_updated":"2022-01-06T06:53:51Z","publication_status":"published","publication_identifier":{"isbn":["9783540422877","9783540482246"],"issn":["0302-9743"]},"author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"status":"public","title":"Testing Hypergraph Coloring","year":"2001","doi":"10.1007/3-540-48224-5_41","user_id":"15415","language":[{"iso":"eng"}],"_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>.","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>","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} }","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>","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>.","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."},"publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-09-01T10:48:38Z"},{"_id":"18750","language":[{"iso":"eng"}],"page":"865-872","user_id":"15415","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"year":"2001","title":"Soft Kinetic Data Structures","status":"public","date_updated":"2022-01-06T06:53:51Z","date_created":"2020-09-01T10:56:39Z","department":[{"_id":"63"}],"type":"conference","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.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.","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.","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).","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} }","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.","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."},"publication":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms"},{"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"}],"citation":{"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} }","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>","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.","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>.","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.","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>"},"publication":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-09-02T12:24:25Z","date_updated":"2022-01-06T06:53:53Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"}],"status":"public","year":"2001","title":"Property Testing with Geometric Queries","user_id":"15415","doi":"10.1007/3-540-44676-1_22","language":[{"iso":"eng"}],"_id":"18857","page":"266-277"},{"doi":"10.1007/3-540-45294-x_21","user_id":"15415","_id":"18964","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:55Z","publication_status":"published","author":[{"full_name":"Lukovszki, Tamás","first_name":"Tamás","last_name":"Lukovszki"},{"last_name":"Maheshwari","first_name":"Anil","full_name":"Maheshwari, Anil"},{"full_name":"Zeh, Norbert","first_name":"Norbert","last_name":"Zeh"}],"publication_identifier":{"isbn":["9783540430025","9783540452942"],"issn":["0302-9743"]},"status":"public","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","year":"2001","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T13:26:01Z","citation":{"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.","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>","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} }","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>","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.","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>."},"publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS"},{"date_updated":"2022-01-06T06:55:58Z","publication_status":"published","publication_identifier":{"issn":["0163-5824"]},"author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"full_name":"von zur Gathen, Joachim","first_name":"Joachim","last_name":"von zur Gathen"},{"first_name":"Jürgen","last_name":"Gerhard","full_name":"Gerhard, Jürgen"},{"full_name":"Müller, Olaf","last_name":"Müller","first_name":"Olaf"}],"title":"Factoring a binary polynomial of degree over one million","status":"public","year":"2001","doi":"10.1145/504331.504333","user_id":"15415","language":[{"iso":"eng"}],"_id":"23731","page":"16-18","abstract":[{"lang":"eng","text":"<jats:p>\r\n            On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z\r\n            <jats:sub>2</jats:sub>\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          </jats:p>"}],"citation":{"ieee":"O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” <i>ACM SIGSAM Bulletin</i>, pp. 16–18, 2001.","apa":"Bonorden, O., von zur Gathen, J., Gerhard, J., &#38; Müller, O. (2001). Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>","short":"O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.","chicago":"Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>.","mla":"Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, pp. 16–18, doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>.","bibtex":"@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>}, 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} }","ama":"Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>. 2001:16-18. doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>"},"publication":"ACM SIGSAM Bulletin","department":[{"_id":"63"}],"type":"journal_article","date_created":"2021-09-03T09:08:27Z"},{"intvolume":"      2064","date_updated":"2022-01-06T06:53:26Z","publication_status":"published","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"last_name":"Brattka","first_name":"Vasco","full_name":"Brattka, Vasco"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540421979","9783540453352"]},"title":"A Computable Spectral Theorem","year":"2001","doi":"10.1007/3-540-45335-0_23","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-24T10:14:06Z","status":"public","volume":2064,"user_id":"15415","_id":"18152","page":"378-388","citation":{"apa":"Ziegler, M., &#38; Brattka, V. (2001). A Computable Spectral Theorem. In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i> (Vol. 2064, pp. 378–388). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>","ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2001, vol. 2064, pp. 378–388.","chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2064:378–88. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>.","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.","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, vol. 2064, 2001, pp. 378–88, doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>.","ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>. Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>}, 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} }"},"place":"Berlin, Heidelberg"},{"date_created":"2020-08-24T11:29:08Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)","citation":{"mla":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, vol. AA, 2001, pp. 155–64.","ama":"Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>. Vol AA. ; 2001:155-164.","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} }","apa":"Ziegler, M., &#38; Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i> (Vol. AA, pp. 155–164).","ieee":"M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, 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.","chicago":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, AA:155–64, 2001."},"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"}],"page":"155-164","_id":"18166","language":[{"iso":"eng"}],"user_id":"15415","volume":"AA","year":"2001","title":"New Bounds for Hypercube Slicing Numbers","status":"public","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"full_name":"Emamy-Khansari, M. Reza","last_name":"Emamy-Khansari","first_name":"M. Reza"}],"date_updated":"2022-01-06T06:53:26Z"},{"publication":"Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)","citation":{"mla":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 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} }","ama":"Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>. ; 2001:181-184.","ieee":"V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 2001, pp. 181–184.","apa":"Brattka, V., &#38; Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i> (pp. 181–184).","short":"V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.","chicago":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 181–84, 2001."},"abstract":[{"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.","lang":"eng"}],"date_created":"2020-08-24T11:33:12Z","type":"conference","department":[{"_id":"63"}],"year":"2001","title":"Turing Computability of (Non-)Linear Optimization","status":"public","author":[{"first_name":"Vasco","last_name":"Brattka","full_name":"Brattka, Vasco"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:26Z","page":"181-184","language":[{"iso":"eng"}],"_id":"18168","user_id":"15415"},{"user_id":"15415","ddc":["000"],"page":"275 - 278","_id":"18370","has_accepted_license":"1","status":"public","place":"Bad Schussenried","file_date_updated":"2020-08-26T13:08:08Z","citation":{"short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.","chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In <i>Proc. of 3. GI-Informatiktage 2001</i>, 275–78. Bad Schussenried, 2001.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–278.","apa":"Klein, J., &#38; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In <i>Proc. of 3. GI-Informatiktage 2001</i> (pp. 275–278). Bad Schussenried.","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} }","ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: <i>Proc. of 3. GI-Informatiktage 2001</i>. Bad Schussenried; 2001:275-278.","mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–78."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:30Z","title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph","year":"2001","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"}],"type":"conference","department":[{"_id":"63"}],"file":[{"access_level":"closed","file_size":146136,"file_name":"hni-id-1450.pdf","date_updated":"2020-08-26T13:08:08Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"18371","creator":"koala","date_created":"2020-08-26T13:08:08Z"}],"date_created":"2020-08-26T13:08:24Z","abstract":[{"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.","lang":"eng"}],"publication":"Proc. of 3. GI-Informatiktage 2001"},{"_id":"16492","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1145/383259.383299","title":"The randomized z-buffer algorithm","year":"2001","status":"public","author":[{"full_name":"Wand, Michael","last_name":"Wand","first_name":"Michael"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Peter, Ingmar","last_name":"Peter","first_name":"Ingmar"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Wolfgang","last_name":"Straßer","full_name":"Straßer, Wolfgang"}],"publication_identifier":{"isbn":["158113374X"]},"publication_status":"published","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:36:54Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01","citation":{"mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001, doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>.","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>. ; 2001. doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>}, 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} }","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &#38; Straßer, W. (2001). The randomized z-buffer algorithm. In <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>, 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.","chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>."},"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."}]},{"volume":2204,"doi":"10.1007/3-540-45477-2_2","user_id":"15415","_id":"16493","series_title":" Lecture Notes in Computer Science","language":[{"iso":"eng"}],"intvolume":"      2204","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540427070","9783540454779"]},"title":"Data Management in Networks","status":"public","year":"2001","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-09T10:40:48Z","citation":{"short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>.","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.","apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }","ama":"Meyer auf der Heide F. Data Management in Networks. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>."},"publication":"Graph-Theoretic Concepts in Computer Science"},{"department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-09T10:51:36Z","place":"Berlin, Heidelberg","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>.","ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>.","short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001."},"publication":"Computational Science - ICCS 2001","user_id":"15415","doi":"10.1007/3-540-45718-6_68","language":[{"iso":"eng"}],"_id":"16494","publication_status":"published","date_updated":"2022-01-06T06:52:51Z","publication_identifier":{"isbn":["9783540422334","9783540457183"],"issn":["0302-9743"]},"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"year":"2001","title":"Parallel Bridging Models and Their Impact on Algorithm Design","status":"public"},{"place":"Berlin, Heidelberg","date_created":"2020-04-17T10:59:08Z","department":[{"_id":"63"}],"type":"book_editor","citation":{"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.","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>.","ieee":"F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.","apa":"Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>","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={<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>}, publisher={Springer }, year={2001} }","ama":"Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>","mla":"Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>."},"_id":"16722","language":[{"iso":"eng"}],"edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","publisher":"Springer ","editor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"doi":"10.1007/3-540-44676-1","user_id":"15415","publication_identifier":{"isbn":["9783540424932","9783540446767"],"issn":["0302-9743"]},"year":"2001","status":"public","title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","date_updated":"2022-01-06T06:52:55Z","publication_status":"published"},{"citation":{"ieee":"I. Rieping, <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","apa":"Rieping, I. (2000). <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i> (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Rieping, Ingo. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. Vol. 81. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","short":"I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","mla":"Rieping, Ingo. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. 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} }","ama":"Rieping I. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2020-09-22T10:06:31Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","author":[{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"publication_identifier":{"isbn":["3-931466-80-9"]},"year":"2000","status":"public","title":"Communication in Parallel Systems-Models, Algorithms and Implementations","intvolume":"        81","date_updated":"2022-01-06T06:54:08Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19620","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":81,"user_id":"5786"}]