[{"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540679561","9783540445203"]},"status":"public","date_created":"2020-04-09T13:30:45Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Kutyłowski","first_name":"Mirosław","full_name":"Kutyłowski, Mirosław"},{"last_name":"Ragde","first_name":"Prabhakar","full_name":"Ragde, Prabhakar"}],"publication":"Euro-Par 2000 Parallel Processing","department":[{"_id":"63"}],"title":"Complexity Theory and Algorithms","user_id":"15415","place":"Berlin, Heidelberg","type":"book_chapter","citation":{"apa":"Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59","ama":"Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59","chicago":"Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59.","bibtex":"@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={10.1007/3-540-44520-x_59}, booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59.","short":"F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.","ieee":"F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000."},"year":"2000","language":[{"iso":"eng"}],"doi":"10.1007/3-540-44520-x_59","date_updated":"2022-01-06T06:52:51Z","_id":"16497"},{"publication":"SIAM Journal on Computing","department":[{"_id":"63"}],"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"date_created":"2020-05-18T13:47:36Z","status":"public","title":"Contention Resolution in Hashing Based Shared Memory Simulations","user_id":"15415","page":"1703-1739","type":"journal_article","citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, SIAM Journal on Computing (2000) 1703–1739.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention Resolution in Hashing Based Shared Memory Simulations,” SIAM Journal on Computing, pp. 1703–1739, 2000.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, 1703–39. https://doi.org/10.1137/s009753979529564x.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing. 2000:1703-1739. doi:10.1137/s009753979529564x","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (2000). Contention Resolution in Hashing Based Shared Memory Simulations. SIAM Journal on Computing, 1703–1739. https://doi.org/10.1137/s009753979529564x","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_2000, title={Contention Resolution in Hashing Based Shared Memory Simulations}, DOI={10.1137/s009753979529564x}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={2000}, pages={1703–1739} }","mla":"Czumaj, Artur, et al. “Contention Resolution in Hashing Based Shared Memory Simulations.” SIAM Journal on Computing, 2000, pp. 1703–39, doi:10.1137/s009753979529564x."},"year":"2000","language":[{"iso":"eng"}],"_id":"17010","date_updated":"2022-01-06T06:53:01Z","doi":"10.1137/s009753979529564x"},{"date_updated":"2022-01-06T06:52:49Z","_id":"16345","language":[{"iso":"eng"}],"page":"112-116","year":"2000","citation":{"ieee":"F. Meyer auf der Heide and R. Wanka, “Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik,” ForschungsForum Paderborn, pp. 112–116, 2000.","short":"F. Meyer auf der Heide, R. Wanka, ForschungsForum Paderborn (2000) 112–116.","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, pp. 112–16.","bibtex":"@article{Meyer auf der Heide_Wanka_2000, title={Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik}, journal={ForschungsForum Paderborn}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2000}, pages={112–116} }","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Von Der Hollerith-Maschine Zum Parallelrechner - Die Alltägliche Aufgabe Des Sortierens Als Fortschrittsmotor Für Die Informatik.” ForschungsForum Paderborn, 2000, 112–16.","ama":"Meyer auf der Heide F, Wanka R. Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn. 2000:112-116.","apa":"Meyer auf der Heide, F., & Wanka, R. (2000). Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik. ForschungsForum Paderborn, 112–116."},"type":"journal_article","article_type":"original","user_id":"15415","title":"Von der Hollerith-Maschine zum Parallelrechner - Die alltägliche Aufgabe des Sortierens als Fortschrittsmotor für die Informatik","ddc":["000"],"file":[{"date_created":"2020-08-04T13:17:46Z","file_name":"FFP-06-2000.pdf","access_level":"closed","file_size":477845,"creator":"koala","file_id":"17588","content_type":"application/pdf","date_updated":"2020-08-04T13:17:46Z","success":1,"relation":"main_file"}],"department":[{"_id":"63"}],"publication":"ForschungsForum Paderborn","file_date_updated":"2020-08-04T13:17:46Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"date_created":"2020-03-24T10:59:27Z","has_accepted_license":"1","status":"public","publication_identifier":{"unknown":["ISBN 978-3-942647-99-1"]}},{"language":[{"iso":"eng"}],"page":"99-104","year":"1999","citation":{"short":"O. Bonorden, B. Juurlink, I. Von Otte, I. Rieping, in: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104.","ieee":"O. Bonorden, B. Juurlink, I. Von Otte, and I. Rieping, “The Paderborn university BSP (PUB) library-design, implementation and performance,” in Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi: 10.1109/ipps.1999.760442.","chicago":"Bonorden, Olaf, Bernhardus Juurlink, I. Von Otte, and Ingo Rieping. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” In Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104, 1999. https://doi.org/10.1109/ipps.1999.760442.","ama":"Bonorden O, Juurlink B, Von Otte I, Rieping I. The Paderborn university BSP (PUB) library-design, implementation and performance. In: Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. ; 1999:99-104. doi:10.1109/ipps.1999.760442","apa":"Bonorden, O., Juurlink, B., Von Otte, I., & Rieping, I. (1999). The Paderborn university BSP (PUB) library-design, implementation and performance. Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 99–104. https://doi.org/10.1109/ipps.1999.760442","bibtex":"@inproceedings{Bonorden_Juurlink_Von Otte_Rieping_1999, title={The Paderborn university BSP (PUB) library-design, implementation and performance}, DOI={10.1109/ipps.1999.760442}, booktitle={Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing}, author={Bonorden, Olaf and Juurlink, Bernhardus and Von Otte, I. and Rieping, Ingo}, year={1999}, pages={99–104} }","mla":"Bonorden, Olaf, et al. “The Paderborn University BSP (PUB) Library-Design, Implementation and Performance.” Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, 1999, pp. 99–104, doi:10.1109/ipps.1999.760442."},"type":"conference","_id":"19732","date_updated":"2022-01-06T06:54:10Z","doi":"10.1109/ipps.1999.760442","publication":"Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing","department":[{"_id":"63"}],"author":[{"first_name":"Olaf","full_name":"Bonorden, Olaf","last_name":"Bonorden"},{"first_name":"Bernhardus","full_name":"Juurlink, Bernhardus","last_name":"Juurlink"},{"last_name":"Von Otte","first_name":"I.","full_name":"Von Otte, I."},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"}],"date_created":"2020-09-28T12:11:30Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0769501435"]},"abstract":[{"lang":"eng","text":"The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In ad-dition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in its implementation deviate significantly from the techniques used in other BSP libraries."}],"user_id":"15415","title":"The Paderborn university BSP (PUB) library-design, implementation and performance"},{"user_id":"14955","title":"Simple, Efficient Routing Schemes for All-Optical Networks","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","author":[{"last_name":"Flammini","full_name":"Flammini, Michele","first_name":"Michele"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T06:22:14Z","status":"public","volume":32,"_id":"2151","date_updated":"2022-01-06T06:55:02Z","intvolume":" 32","issue":"3","doi":"10.1007/s002240000123","language":[{"iso":"eng"}],"page":"387--420","year":"1999","type":"journal_article","citation":{"short":"M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999): 387--420. https://doi.org/10.1007/s002240000123.","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123","apa":"Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420. https://doi.org/10.1007/s002240000123","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.","bibtex":"@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123}, number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler, Christian}, year={1999}, pages={387--420} }"}},{"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:34:50Z","publication":"SODA","author":[{"last_name":"Berenbrink","first_name":"Petra","full_name":"Berenbrink, Petra"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"date_updated":"2018-04-12T07:34:50Z","content_type":"application/pdf","relation":"main_file","file_size":179058,"file_id":"2288","creator":"florida","access_level":"open_access","file_name":"SODA-99.pdf","date_created":"2018-04-12T07:34:50Z"}],"date_created":"2018-04-03T08:56:06Z","has_accepted_license":"1","status":"public","ddc":["040"],"title":"Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths","user_id":"14955","page":"112--121","year":"1999","citation":{"chicago":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.","apa":"Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).","ama":"Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In: SODA. ; 1999:112--121.","bibtex":"@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink, Petra and Scheideler, Christian}, year={1999}, pages={112--121} }","mla":"Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.","short":"P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.","ieee":"P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121."},"type":"conference","language":[{"iso":"eng"}],"urn":"21649","date_updated":"2022-01-06T06:55:09Z","_id":"2164","oa":"1"},{"page":"33--42","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling Strategies,” in SPAA, 1999, pp. 33--42.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).","ama":"Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling Strategies. In: SPAA. ; 1999:33--42.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }","mla":"Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42."},"year":"1999","type":"conference","language":[{"iso":"eng"}],"oa":"1","urn":"21658","date_updated":"2022-01-06T06:55:09Z","_id":"2165","date_created":"2018-04-03T08:56:45Z","status":"public","has_accepted_license":"1","file_date_updated":"2018-04-12T07:36:27Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Riedel","first_name":"Marco","full_name":"Riedel, Marco"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"access_level":"open_access","file_name":"SPAA-99.pdf","date_created":"2018-04-12T07:36:27Z","relation":"main_file","date_updated":"2018-04-12T07:36:27Z","content_type":"application/pdf","creator":"florida","file_id":"2290","file_size":144422}],"ddc":["040"],"title":"Simple Competitive Request Scheduling Strategies","user_id":"14955"},{"title":"Partitioned neighborhood spanners of minimal outdegree","related_material":{"link":[{"relation":"confirmation","url":"http://www.cccg.ca/proceedings/1999/fp36.pdf"}]},"place":"Vancouver","department":[{"_id":"63"}],"date_updated":"2022-01-06T06:53:21Z","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"15415","abstract":[{"text":"A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the quality of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:\r\n\r\n* k determines the amount of space required for storing PNGs.\r\n\r\n* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.\r\n\r\nOur results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.\r\n","lang":"eng"}],"date_created":"2020-08-12T13:12:00Z","has_accepted_license":"1","status":"public","file_date_updated":"2020-08-27T11:14:43Z","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"full_name":"Lukovszki, Tamas","first_name":"Tamas","last_name":"Lukovszki"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"file":[{"date_created":"2020-08-27T11:14:43Z","file_name":"hni-id-729.pdf","access_level":"closed","creator":"koala","file_id":"18438","file_size":209419,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-08-27T11:14:43Z"}],"_id":"17864","type":"conference","year":"1999","citation":{"short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in Proceedings of the 11th Canadian Conference on Computational Geometry, 1999.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver, 1999.","ama":"Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal outdegree. In: Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver; 1999.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In Proceedings of the 11th Canadian Conference on Computational Geometry. Vancouver.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1999, place={Vancouver}, title={Partitioned neighborhood spanners of minimal outdegree}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}, year={1999} }","mla":"Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” Proceedings of the 11th Canadian Conference on Computational Geometry, 1999."}},{"abstract":[{"text":"We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.","lang":"eng"}],"title":"Fast Reconstruction of Delaunay Triangulations","user_id":"15415","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)","status":"public","date_created":"2020-09-01T10:43:10Z","_id":"18747","date_updated":"2022-01-06T06:53:51Z","citation":{"ama":"Sohler C. Fast Reconstruction of Delaunay Triangulations. In: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99). ; 1999:136-141.","apa":"Sohler, C. (1999). Fast Reconstruction of Delaunay Triangulations. In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99) (pp. 136–141).","chicago":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” In Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 136–41, 1999.","bibtex":"@inproceedings{Sohler_1999, title={Fast Reconstruction of Delaunay Triangulations}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={136–141} }","mla":"Sohler, Christian. “Fast Reconstruction of Delaunay Triangulations.” Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–41.","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141.","ieee":"C. Sohler, “Fast Reconstruction of Delaunay Triangulations,” in Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG’99), 1999, pp. 136–141."},"type":"conference","year":"1999","page":"136-141","language":[{"iso":"eng"}]},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-09-22T13:12:09Z","file_id":"19641","creator":"koala","file_size":1077329,"access_level":"closed","date_created":"2020-09-22T13:12:09Z","file_name":"pub-hni-495.pdf"}],"file_date_updated":"2020-09-22T13:12:09Z","author":[{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-03T11:41:51Z","status":"public","has_accepted_license":"1","volume":63,"user_id":"5786","ddc":["000"],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"citation":{"ieee":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, vol. 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","short":"T. Lukovszki, New Results on Geometric Spanners and Their Applications, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","bibtex":"@book{Lukovszki_1999, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={New Results on Geometric Spanners and Their Applications}, volume={63}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lukovszki, Tamás}, year={1999}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","chicago":"Lukovszki, Tamás. New Results on Geometric Spanners and Their Applications. Vol. 63. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1999.","apa":"Lukovszki, T. (1999). New Results on Geometric Spanners and Their Applications (Vol. 63). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Lukovszki T. New Results on Geometric Spanners and Their Applications. Vol 63. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1999."},"type":"dissertation","year":"1999","_id":"18942","intvolume":" 63","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-62-0 "]},"title":"New Results on Geometric Spanners and Their Applications","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:55Z"},{"language":[{"iso":"eng"}],"page":"193-204","year":"1999","citation":{"bibtex":"@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric Spanners}, DOI={10.1007/3-540-48447-7_20}, booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }","mla":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204, doi:10.1007/3-540-48447-7_20.","apa":"Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS (pp. 193–204). https://doi.org/10.1007/3-540-48447-7_20","ama":"Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS. ; 1999:193-204. doi:10.1007/3-540-48447-7_20","chicago":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 193–204, 1999. https://doi.org/10.1007/3-540-48447-7_20.","ieee":"T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","short":"T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204."},"type":"conference","doi":"10.1007/3-540-48447-7_20","date_updated":"2022-01-06T06:53:55Z","_id":"18959","date_created":"2020-09-03T13:03:45Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540662792","9783540484479"]},"department":[{"_id":"63"}],"publication":"Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS","author":[{"full_name":"Lukovszki, Tamás","first_name":"Tamás","last_name":"Lukovszki"}],"user_id":"15415","title":"New Results on Fault Tolerant Geometric Spanners","abstract":[{"text":"We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.
Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.
Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.","lang":"eng"}]},{"title":"Data management in networks: experimental evaluation of a provably good strategy","user_id":"15415","publication_status":"published","publication_identifier":{"isbn":["1581131240"]},"date_created":"2020-09-03T14:27:14Z","status":"public","publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA '99","department":[{"_id":"63"}],"author":[{"full_name":"Krick, Christof","first_name":"Christof","last_name":"Krick"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}],"doi":"10.1145/305619.305637","date_updated":"2022-01-06T06:53:56Z","_id":"18965","page":"165-174","year":"1999","citation":{"ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data management in networks: experimental evaluation of a provably good strategy,” in Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99, 1999, pp. 165–174.","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–174.","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 1999, pp. 165–74, doi:10.1145/305619.305637.","bibtex":"@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999, title={Data management in networks: experimental evaluation of a provably good strategy}, DOI={10.1145/305619.305637}, booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999}, pages={165–174} }","chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” In Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99, 165–74, 1999. https://doi.org/10.1145/305619.305637.","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data management in networks: experimental evaluation of a provably good strategy. In: Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’99. ; 1999:165-174. doi:10.1145/305619.305637","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann, M. (1999). Data management in networks: experimental evaluation of a provably good strategy. In Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’99 (pp. 165–174). https://doi.org/10.1145/305619.305637"},"type":"conference","language":[{"iso":"eng"}]},{"date_created":"2020-08-28T14:20:42Z","status":"public","publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)","department":[{"_id":"63"}],"author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"title":"Generating Random Star-Shaped Polygons","user_id":"15415","abstract":[{"lang":"eng","text":"In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set ( S ) of ( n ) points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped polygon degenerate if its kernel has 0 area.
Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons."}],"page":"174-177","type":"conference","citation":{"chicago":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.","ama":"Sohler C. Generating Random Star-Shaped Polygons. In: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99). ; 1999:174-177.","apa":"Sohler, C. (1999). Generating Random Star-Shaped Polygons. In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99) (pp. 174–177).","mla":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–77.","bibtex":"@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }","short":"C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177.","ieee":"C. Sohler, “Generating Random Star-Shaped Polygons,” in Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–177."},"year":"1999","language":[{"iso":"eng"}],"_id":"18576","date_updated":"2022-01-06T06:53:40Z"},{"user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)","file":[{"file_name":"CDMLarge-99.pdf","date_created":"2018-04-12T08:34:00Z","access_level":"open_access","file_size":211926,"creator":"florida","file_id":"2294","content_type":"application/pdf","date_updated":"2018-04-12T08:34:00Z","relation":"main_file"}],"author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Riedel","full_name":"Riedel, Marco","first_name":"Marco"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:34:00Z","has_accepted_license":"1","status":"public","date_created":"2018-04-05T07:00:11Z","date_updated":"2022-01-06T06:55:26Z","_id":"2210","urn":"22109","oa":"1","language":[{"iso":"eng"}],"citation":{"ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","bibtex":"@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink, Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12} }","mla":"Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","chicago":"Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.","ama":"Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage Network (Extended Abstract). In: International Workshop on Communication and Data Management in Large Networks (CDMLarge). ; 1999:2-12.","apa":"Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12)."},"year":"1999","type":"conference","page":"2-12"},{"date_updated":"2022-01-06T06:55:10Z","_id":"2166","urn":"21668","oa":"1","year":"1999","citation":{"short":"C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.","apa":"Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999:215--224.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.","bibtex":"@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler, Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224."},"type":"conference","page":"215--224","language":[{"iso":"eng"}],"ddc":["040"],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","file":[{"file_id":"2289","creator":"florida","file_size":227305,"relation":"main_file","date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","date_created":"2018-04-12T07:35:46Z","file_name":"STOC-99.pdf","access_level":"open_access"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T08:57:30Z"},{"date_created":"2020-04-14T11:50:52Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0196-6774"]},"department":[{"_id":"63"}],"publication":"Journal of Algorithms","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"user_id":"15415","title":"Shortest-Path Routing in Arbitrary Networks","language":[{"iso":"eng"}],"page":"105-131","year":"1999","type":"journal_article","citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999.","short":"F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.","bibtex":"@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing in Arbitrary Networks}, DOI={10.1006/jagm.1998.0980}, journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1999}, pages={105–131} }","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, pp. 105–31, doi:10.1006/jagm.1998.0980.","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing in Arbitrary Networks.” Journal of Algorithms, 1999, 105–31. https://doi.org/10.1006/jagm.1998.0980.","ama":"Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms. 1999:105-131. doi:10.1006/jagm.1998.0980","apa":"Meyer auf der Heide, F., & Vöcking, B. (1999). Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms, 105–131. https://doi.org/10.1006/jagm.1998.0980"},"doi":"10.1006/jagm.1998.0980","_id":"16501","date_updated":"2022-01-06T06:52:52Z"},{"language":[{"iso":"eng"}],"page":"281-300","type":"journal_article","citation":{"chicago":"Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, 281–300. https://doi.org/10.1007/s002240000119.","apa":"Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1999). Allocating Weighted Jobs in Parallel. Theory of Computing Systems, 281–300. https://doi.org/10.1007/s002240000119","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in Parallel. Theory of Computing Systems. 1999:281-300. doi:10.1007/s002240000119","bibtex":"@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating Weighted Jobs in Parallel}, DOI={10.1007/s002240000119}, journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }","mla":"Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” Theory of Computing Systems, 1999, pp. 281–300, doi:10.1007/s002240000119.","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, pp. 281–300, 1999."},"year":"1999","doi":"10.1007/s002240000119","date_updated":"2022-01-06T06:52:52Z","_id":"16502","date_created":"2020-04-14T12:00:32Z","status":"public","publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Theory of Computing Systems","author":[{"last_name":"Berenbrink","first_name":"P.","full_name":"Berenbrink, P."},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"K.","full_name":"Schröder, K.","last_name":"Schröder"}],"user_id":"15415","title":"Allocating Weighted Jobs in Parallel"},{"place":"Berlin, Heidelberg","user_id":"15415","title":"International Workshop on Communication and Data Management in Large Networks","author":[{"last_name":"Mayr","first_name":"E. W.","full_name":"Mayr, E. W."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"publication":"Informatik aktuell","department":[{"_id":"63"}],"status":"public","date_created":"2020-05-20T13:16:56Z","publication_status":"published","publication_identifier":{"isbn":["9783540664505","9783662010693"],"issn":["1431-472X"]},"date_updated":"2022-01-06T06:53:03Z","_id":"17052","doi":"10.1007/978-3-662-01069-3_47","language":[{"iso":"eng"}],"citation":{"bibtex":"@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg}, title={International Workshop on Communication and Data Management in Large Networks}, DOI={10.1007/978-3-662-01069-3_47}, booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1999} }","mla":"Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.","ama":"Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication and Data Management in Large Networks. In: Informatik Aktuell. ; 1999. doi:10.1007/978-3-662-01069-3_47","apa":"Mayr, E. W., Meyer auf der Heide, F., & Wanka, R. (1999). International Workshop on Communication and Data Management in Large Networks. In Informatik aktuell. https://doi.org/10.1007/978-3-662-01069-3_47","chicago":"Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International Workshop on Communication and Data Management in Large Networks.” In Informatik Aktuell. Berlin, Heidelberg, 1999. https://doi.org/10.1007/978-3-662-01069-3_47.","ieee":"E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop on Communication and Data Management in Large Networks,” in Informatik aktuell, Berlin, Heidelberg, 1999.","short":"E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999."},"type":"book_chapter","year":"1999"},{"_id":"17053","date_updated":"2022-01-06T06:53:03Z","doi":"10.1007/3-540-48481-7_9","language":[{"iso":"eng"}],"year":"1999","type":"book_chapter","citation":{"ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and Practical Strategies for Non-uniform Data Management in Networks,” in Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.","short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’ 99, Berlin, Heidelberg, 1999.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg}, title={Provably Good and Practical Strategies for Non-uniform Data Management in Networks}, DOI={10.1007/3-540-48481-7_9}, booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1999} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” Algorithms - ESA’ 99, 1999, doi:10.1007/3-540-48481-7_9.","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9","apa":"Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9"},"place":"Berlin, Heidelberg","user_id":"15415","title":"Provably Good and Practical Strategies for Non-uniform Data Management in Networks","department":[{"_id":"63"}],"publication":"Algorithms - ESA’ 99","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"first_name":"Matthias","full_name":"Westermann, Matthias","last_name":"Westermann"}],"date_created":"2020-05-20T13:35:49Z","status":"public","publication_identifier":{"isbn":["9783540662518","9783540484813"],"issn":["0302-9743"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"title":"Static and Dynamic Data Management in Networks","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-45-0"]},"intvolume":" 46","_id":"19639","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"type":"dissertation","citation":{"bibtex":"@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking, Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","apa":"Vöcking, B. (1998). Static and Dynamic Data Management in Networks (Vol. 46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Vöcking B. Static and Dynamic Data Management in Networks. Vol 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1998.","chicago":"Vöcking, Berthold. Static and Dynamic Data Management in Networks. Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","ieee":"B. Vöcking, Static and Dynamic Data Management in Networks, vol. 46. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","short":"B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998."},"year":"1998","user_id":"5786","ddc":["000"],"file":[{"access_level":"closed","file_name":"pub-hni-478.pdf","date_created":"2020-09-22T13:05:04Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-09-22T13:05:04Z","creator":"koala","file_id":"19640","file_size":592479}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"file_date_updated":"2020-09-22T13:05:04Z","status":"public","has_accepted_license":"1","date_created":"2020-09-22T13:05:43Z","volume":46},{"abstract":[{"text":"The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.","lang":"eng"}],"title":"The Paderborn University BSP (PUB) Library - Design, Implementation and Performance","ddc":["000"],"user_id":"15415","file_date_updated":"2020-09-28T12:41:08Z","department":[{"_id":"63"}],"author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"},{"full_name":"von Otte, Ingo","first_name":"Ingo","last_name":"von Otte"},{"full_name":"Juurlink, Bernhardus","first_name":"Bernhardus","last_name":"Juurlink"}],"file":[{"file_name":"pub-hni-1350.pdf","date_created":"2020-09-28T12:41:08Z","access_level":"closed","file_size":255806,"file_id":"19736","creator":"koala","date_updated":"2020-09-28T12:41:08Z","content_type":"application/pdf","relation":"main_file","success":1}],"date_created":"2020-09-28T12:41:20Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:54:11Z","_id":"19735","year":"1998","type":"report","citation":{"ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.","mla":"Bonorden, Olaf, et al. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998} }","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance, 1998.","apa":"Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (1998). The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.","ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. The Paderborn University BSP (PUB) Library - Design, Implementation and Performance.; 1998."},"language":[{"iso":"eng"}]},{"file":[{"date_created":"2020-08-27T11:20:38Z","file_name":"hni-id-854.pdf","access_level":"closed","creator":"koala","file_id":"18442","file_size":266070,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-08-27T11:20:38Z"}],"file_date_updated":"2020-08-27T11:20:38Z","publication":"Algorithms — ESA’ 98","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"},{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"date_created":"2020-07-27T11:42:54Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.\r\n"}],"user_id":"15415","ddc":["000"],"citation":{"chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In Algorithms — ESA’ 98. Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_14","ama":"Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: Algorithms — ESA’ 98. Berlin, Heidelberg; 1998. doi:10.1007/3-540-68530-8_14","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={10.1007/3-540-68530-8_14}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }","mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998."},"year":"1998","type":"book_chapter","_id":"17412","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"place":"Berlin, Heidelberg","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:11Z","doi":"10.1007/3-540-68530-8_14"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:21Z","department":[{"_id":"63"}],"place":"Saarbrücken","title":"A Network Based Approach for Realtime Walkthrough of Massive Models","type":"conference","citation":{"chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.","ama":"Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE ’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.","mla":"Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, 1998, pp. 133--142.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }, year={1998}, pages={133--142} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 1998, pp. 133--142."},"year":"1998","page":"133--142","_id":"17863","publisher":"Max-Planck-Institut für Informatik","author":[{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"full_name":"Ziegler, Martin ","first_name":"Martin ","last_name":"Ziegler"}],"publication":"Algorithm Engineering, 2nd International Workshop, {WAE '98}","file_date_updated":"2020-08-27T11:18:26Z","file":[{"date_created":"2020-08-27T11:18:26Z","file_name":"hni-id-853.pdf","access_level":"closed","file_size":272549,"creator":"koala","file_id":"18440","date_updated":"2020-08-27T11:18:26Z","content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","has_accepted_license":"1","date_created":"2020-08-12T12:50:56Z","abstract":[{"text":"New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.\r\n","lang":"eng"}],"ddc":["000"],"user_id":"15415"},{"date_updated":"2022-01-06T06:53:26Z","_id":"18145","citation":{"chicago":"Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","ama":"Ziegler M, Fischer M, Lukovszki T. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet.; 1998.","apa":"Ziegler, M., Fischer, M., & Lukovszki, T. (1998). Multimediale Entdeckungsreisen unserer Welt mit dem Internet.","bibtex":"@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }","mla":"Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.","short":"M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","ieee":"M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998."},"year":"1998","type":"report","language":[{"iso":"eng"}],"abstract":[{"lang":"ger","text":"Preis für den Beitrag \"Multimediale Entdeckungsreisen unserer Welt mit dem Internet\""},{"lang":"eng","text":"Award for the Article \"Multimedia-based Expedition of our World with the Internet\""}],"title":"Multimediale Entdeckungsreisen unserer Welt mit dem Internet","user_id":"15415","department":[{"_id":"63"}],"author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"},{"id":"146","last_name":"Fischer","full_name":"Fischer, Matthias","first_name":"Matthias"},{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"}],"date_created":"2020-08-24T09:55:41Z","status":"public"},{"date_updated":"2022-01-06T06:53:32Z","_id":"18445","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"type":"dissertation","year":"1998","citation":{"chicago":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.","ama":"Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.","apa":"Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität Paderborn.","bibtex":"@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }","mla":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.","short":"B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.","ieee":"B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998."},"user_id":"15415","title":"On Periodic Comparator Networks","place":"Universität Paderborn","date_created":"2020-08-27T11:42:12Z","status":"public","department":[{"_id":"63"}],"author":[{"full_name":"Oesterdiekhoff, Brigitte","first_name":"Brigitte","last_name":"Oesterdiekhoff"}]},{"department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"date_created":"2018-04-03T08:59:06Z","status":"public","volume":31,"user_id":"14955","title":"Universal Continuous Routing Strategies","language":[{"iso":"eng"}],"page":"425--449","type":"journal_article","citation":{"short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.","chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.","apa":"Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096","bibtex":"@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies}, volume={31}, DOI={10.1007/s002240000096}, number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and Vöcking, Berthold}, year={1998}, pages={425--449} }","mla":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096."},"year":"1998","date_updated":"2022-01-06T06:55:10Z","_id":"2168","intvolume":" 31","issue":"4","doi":"10.1007/s002240000096"},{"date_created":"2018-04-03T08:59:55Z","has_accepted_license":"1","status":"public","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:08:12Z","author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"file":[{"file_size":492778,"file_id":"2285","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T07:08:12Z","relation":"main_file","date_created":"2018-04-12T07:08:12Z","file_name":"SPAA98.pdf","access_level":"open_access"}],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","ddc":["040"],"user_id":"14955","page":"259--268","type":"conference","citation":{"short":"M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In: SPAA. ; 1998:259--268.","apa":"Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","bibtex":"@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler, Micah and Scheideler, Christian}, year={1998}, pages={259--268} }"},"year":"1998","language":[{"iso":"eng"}],"oa":"1","urn":"21699","date_updated":"2022-01-06T06:55:10Z","_id":"2169"},{"date_updated":"2022-01-06T06:55:11Z","_id":"2170","urn":"21705","oa":"1","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","apa":"Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).","ama":"Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In: STOC. ; 1998:624--633.","bibtex":"@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel and Scheideler, Christian}, year={1998}, pages={624--633} }","mla":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633."},"year":"1998","page":"624--633","user_id":"14955","title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","ddc":["040"],"file":[{"relation":"main_file","date_updated":"2018-04-12T07:15:50Z","content_type":"application/pdf","file_id":"2286","creator":"florida","file_size":228487,"access_level":"open_access","date_created":"2018-04-12T07:15:50Z","file_name":"STOC98.pdf"}],"author":[{"first_name":"Uriel","full_name":"Feige, Uriel","last_name":"Feige"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:15:50Z","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:00:31Z"},{"_id":"2185","intvolume":" 1390","date_updated":"2022-01-06T06:55:17Z","doi":"10.1007/BFb0052928","series_title":"Lecture Notes in Computer Science","type":"book","year":"1998","citation":{"ama":"Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928","apa":"Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928","chicago":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.","mla":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={10.1007/BFb0052928}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.","ieee":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998."},"language":[{"iso":"eng"}],"title":"Universal Routing Strategies for Interconnection Networks","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"volume":1390,"publication_identifier":{"isbn":["978-3-540-69792-3"]},"date_created":"2018-04-03T09:38:18Z","status":"public"},{"page":"181-200","year":"1998","type":"journal_article","citation":{"short":"F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science 196 (1998) 181–200.","ieee":"F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks of optical crossbars,” Theoretical Computer Science, vol. 196, pp. 181–200, 1998.","apa":"Meyer auf der Heide, F., Schröder, K., & Schwarze, F. (1998). Routing on networks of optical crossbars. Theoretical Computer Science, 196, 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6","ama":"Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical crossbars. Theoretical Computer Science. 1998;196:181-200. doi:10.1016/s0304-3975(97)86791-6","chicago":"Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science 196 (1998): 181–200. https://doi.org/10.1016/s0304-3975(97)86791-6.","bibtex":"@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on networks of optical crossbars}, volume={196}, DOI={10.1016/s0304-3975(97)86791-6}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.” Theoretical Computer Science, vol. 196, 1998, pp. 181–200, doi:10.1016/s0304-3975(97)86791-6."},"language":[{"iso":"eng"}],"doi":"10.1016/s0304-3975(97)86791-6","_id":"16503","intvolume":" 196","date_updated":"2022-01-06T06:52:52Z","publication_identifier":{"issn":["0304-3975"]},"volume":196,"publication_status":"published","date_created":"2020-04-14T12:20:57Z","status":"public","department":[{"_id":"63"}],"publication":"Theoretical Computer Science","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"},{"last_name":"Schwarze","first_name":"Frank","full_name":"Schwarze, Frank"}],"title":"Routing on networks of optical crossbars","user_id":"15415"},{"language":[{"iso":"eng"}],"year":"1998","type":"journal_article","citation":{"bibtex":"@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}, DOI={10.1016/s0304-3975(98)00020-6}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.","apa":"Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203."},"page":"175-203","date_updated":"2022-01-06T06:52:52Z","_id":"16504","doi":"10.1016/s0304-3975(98)00020-6","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"}],"publication":"Theoretical Computer Science","status":"public","date_created":"2020-04-14T12:36:47Z","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"user_id":"15415","title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model"},{"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Gabriel Terán","full_name":"Martinez, Gabriel Terán","last_name":"Martinez"}],"publication":"LATIN'98: Theoretical Informatics","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540642756","9783540697152"]},"status":"public","date_created":"2020-04-15T10:34:15Z","place":"Berlin, Heidelberg","title":"Communication-efficient parallel multiway and approximate minimum cut computation","user_id":"15415","type":"book_chapter","year":"1998","citation":{"bibtex":"@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg}, title={Communication-efficient parallel multiway and approximate minimum cut computation}, DOI={10.1007/bfb0054332}, booktitle={LATIN’98: Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez, Gabriel Terán}, year={1998} }","mla":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical Informatics, 1998, doi:10.1007/bfb0054332.","ama":"Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics. Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332","apa":"Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332","chicago":"Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.","ieee":"F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel multiway and approximate minimum cut computation,” in LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998.","short":"F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics, Berlin, Heidelberg, 1998."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:52Z","_id":"16562","doi":"10.1007/bfb0054332"},{"publication_status":"published","publication_identifier":{"isbn":["0897919629"]},"date_created":"2020-04-15T10:38:12Z","status":"public","department":[{"_id":"63"}],"publication":"Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98","author":[{"last_name":"Cole","first_name":"Richard","full_name":"Cole, Richard"},{"last_name":"Maggs","full_name":"Maggs, Bruce M.","first_name":"Bruce M."},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Michael","full_name":"Mitzenmacher, Michael","last_name":"Mitzenmacher"},{"last_name":"Richa","full_name":"Richa, Andréa W.","first_name":"Andréa W."},{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"},{"full_name":"Sitaraman, Ramesh K.","first_name":"Ramesh K.","last_name":"Sitaraman"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"title":"Randomized protocols for low-congestion circuit routing in multistage interconnection networks","user_id":"15415","type":"conference","year":"1998","citation":{"mla":"Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998, doi:10.1145/276698.276790.","bibtex":"@inproceedings{Cole_Maggs_Meyer auf der Heide_Mitzenmacher_Richa_Schröder_Sitaraman_Vöcking_1998, title={Randomized protocols for low-congestion circuit routing in multistage interconnection networks}, DOI={10.1145/276698.276790}, booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98}, author={Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide, Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and Sitaraman, Ramesh K. and Vöcking, Berthold}, year={1998} }","apa":"Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A. W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98. https://doi.org/10.1145/276698.276790","ama":"Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion circuit routing in multistage interconnection networks. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98. ; 1998. doi:10.1145/276698.276790","chicago":"Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.” In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998. https://doi.org/10.1145/276698.276790.","ieee":"R. Cole et al., “Randomized protocols for low-congestion circuit routing in multistage interconnection networks,” in Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98, 1998.","short":"R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98, 1998."},"language":[{"iso":"eng"}],"doi":"10.1145/276698.276790","date_updated":"2022-01-06T06:52:52Z","_id":"16563"},{"citation":{"short":"A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ieee":"A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Bäumker, Armin. Communication Efficient Parallel Searching. Vol. 28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol. 28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","mla":"Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","bibtex":"@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"type":"dissertation","year":"1997","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19631","date_updated":"2022-01-06T06:54:09Z","intvolume":" 28","publication_identifier":{"isbn":["3-931466-27-2"]},"volume":28,"date_created":"2020-09-22T12:46:17Z","status":"public","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Bäumker","full_name":"Bäumker, Armin","first_name":"Armin"}],"title":"Communication Efficient Parallel Searching","user_id":"5786"},{"_id":"19636","intvolume":" 27","date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"short":"W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ieee":"W. Dittrich, Communication and I/O Efficient Parallel Data Structures, vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","chicago":"Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures (Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Dittrich W. Communication and I/O Efficient Parallel Data Structures. Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","mla":"Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","bibtex":"@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication and I/O Efficient Parallel Data Structures}, volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"type":"dissertation","year":"1997","user_id":"5786","title":"Communication and I/O Efficient Parallel Data Structures","department":[{"_id":"63"},{"_id":"26"}],"author":[{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-22T12:53:00Z","status":"public","publication_identifier":{"isbn":["3-931466-26-4"]},"volume":27},{"_id":"19637","intvolume":" 35","type":"dissertation","citation":{"short":"W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","ieee":"W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","apa":"Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.","chicago":"Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol. 35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","mla":"Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.","bibtex":"@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard}, year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"year":"1997","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"ddc":["000"],"user_id":"5786","file_date_updated":"2020-09-22T12:57:43Z","author":[{"first_name":"Willy-Bernhard","full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file":[{"date_created":"2020-09-22T12:57:43Z","file_name":"pub-hni-468.pdf","access_level":"closed","file_size":1172216,"file_id":"19638","creator":"koala","date_updated":"2020-09-22T12:57:43Z","content_type":"application/pdf","relation":"main_file","success":1}],"volume":35,"date_created":"2020-09-22T12:57:53Z","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"title":"Bounded Degree Spanning Trees","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-34-5"]}},{"publication":"Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)","department":[{"_id":"63"}],"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard","last_name":"Strothmann"}],"publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2020-10-05T07:13:42Z","status":"public","abstract":[{"text":"Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.","lang":"eng"}],"title":"Bounded degree spanning trees","user_id":"15415","type":"conference","citation":{"bibtex":"@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees}, DOI={10.1007/3-540-63397-9_9}, booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)}, author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }","mla":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997, doi:10.1007/3-540-63397-9_9.","apa":"Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees. Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). https://doi.org/10.1007/3-540-63397-9_9","ama":"Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97). ; 1997. doi:10.1007/3-540-63397-9_9","chicago":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.","ieee":"A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: 10.1007/3-540-63397-9_9.","short":"A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997."},"year":"1997","language":[{"iso":"eng"}],"_id":"19869","date_updated":"2022-01-06T06:54:14Z","doi":"10.1007/3-540-63397-9_9"},{"_id":"18955","date_updated":"2022-01-06T06:53:55Z","language":[{"iso":"eng"}],"year":"1997","citation":{"short":"W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs, Paderborn, 1997.","ieee":"W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.","chicago":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. Paderborn, 1997.","ama":"Strothmann W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs. Paderborn; 1997.","apa":"Strothmann, W.-B., & Lukovszki, T. (1997). Decremental Biconnectivity on Planar Graphs. Paderborn.","mla":"Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity on Planar Graphs. 1997.","bibtex":"@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki, Tamás}, year={1997} }"},"type":"report","abstract":[{"lang":"eng","text":"In this paper we present a (randomized) algorithm for maintaining the biconnected components of a dynamic planar graph of $n$ vertices under deletions of edges. The biconnected components can be maintained under any sequence of edge deletions in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$ amortized time per edge deletion, which improves previous (deterministic) results due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed. Our work describes a simplification of the data structures from [GiIt96] and uses dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi and Italiano, we only need $O(n)$ space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for finding efficiently a $Delta$-spanning tree in a biconnected planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann."}],"place":"Paderborn","user_id":"15415","title":"Decremental Biconnectivity on Planar Graphs","ddc":["000"],"file":[{"date_updated":"2020-09-03T12:59:44Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":222106,"creator":"koala","file_id":"18957","access_level":"closed","file_name":"pub-hni-901.pdf","date_created":"2020-09-03T12:59:44Z"}],"department":[{"_id":"63"}],"file_date_updated":"2020-09-03T12:59:44Z","author":[{"last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard"},{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"}],"date_created":"2020-09-03T12:59:56Z","status":"public","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"year":"1997","type":"conference","citation":{"short":"C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","ieee":"C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its Point Set,” in Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","apa":"Sohler, C., & Denny, M. (1997). Encoding a Triangulation as a Permutation of its Point Set. In Proceedings of the 9th Canadian Conference on Computational Geometry (pp. 39–43).","ama":"Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry. ; 1997:39-43.","chicago":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational Geometry, 39–43, 1997.","mla":"Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 39–43.","bibtex":"@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997}, pages={39–43} }"},"page":"39-43","date_updated":"2022-01-06T06:53:40Z","_id":"18575","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"last_name":"Denny","first_name":"Markus","full_name":"Denny, Markus"}],"department":[{"_id":"63"}],"publication":"Proceedings of the 9th Canadian Conference on Computational Geometry","status":"public","date_created":"2020-08-28T14:14:57Z","user_id":"15415","title":"Encoding a Triangulation as a Permutation of its Point Set"},{"_id":"2175","urn":"21759","year":"1997","citation":{"ieee":"S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.","short":"S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332.","bibtex":"@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1997}, pages={326--332} }","mla":"Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.","apa":"Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.","ama":"Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the (n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.","chicago":"Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997."},"type":"conference","page":"326--332","user_id":"14955","ddc":["040"],"file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:11:50Z","relation":"main_file","file_size":88749,"file_id":"2284","creator":"florida","access_level":"open_access","date_created":"2018-04-12T07:07:20Z","file_name":"IPPS97.pdf"}],"publisher":"IEEE Computer Society","author":[{"first_name":"Stefan","full_name":"Bock, Stefan","last_name":"Bock"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file_date_updated":"2018-04-12T07:11:50Z","publication":"IPPS","has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:11:47Z","date_updated":"2022-01-06T06:55:13Z","oa":"1","language":[{"iso":"eng"}],"title":"Optimal Wormhole Routing in the (n, d)-Torus","department":[{"_id":"79"},{"_id":"63"}]},{"title":"Simple, Efficient Routing Schemes for All-Optical Networks","ddc":["040"],"user_id":"14955","author":[{"first_name":"Michele","full_name":"Flammini, Michele","last_name":"Flammini"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"SPAA","file_date_updated":"2018-04-12T07:11:32Z","file":[{"access_level":"open_access","file_name":"SPAA97.pdf","date_created":"2018-04-12T07:06:34Z","relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-12T07:11:32Z","file_id":"2283","creator":"florida","file_size":365709}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:17:10Z","_id":"2179","date_updated":"2022-01-06T06:55:13Z","urn":"21792","oa":"1","year":"1997","citation":{"short":"M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.","ieee":"M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179.","chicago":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.","apa":"Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).","ama":"Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.","mla":"Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.","bibtex":"@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele and Scheideler, Christian}, year={1997}, pages={170--179} }"},"type":"conference","page":"170--179","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:52Z","_id":"16564","doi":"10.1007/bf01270387","language":[{"iso":"eng"}],"page":"357-375","citation":{"short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997.","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375. https://doi.org/10.1007/bf01270387","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.","bibtex":"@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387}, journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375} }"},"type":"journal_article","year":"1997","user_id":"15415","title":"A lower bound for randomized algebraic decision trees","department":[{"_id":"63"}],"publication":"computational complexity","author":[{"full_name":"Grigoriev, Dima","first_name":"Dima","last_name":"Grigoriev"},{"last_name":"Karpinski","first_name":"Marek","full_name":"Karpinski, Marek"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Roman","full_name":"Smolensky, Roman","last_name":"Smolensky"}],"date_created":"2020-04-15T10:42:43Z","status":"public","publication_identifier":{"issn":["1016-3328","1420-8954"]},"publication_status":"published"},{"user_id":"15415","title":"Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"department":[{"_id":"63"}],"publication":"Information and Computation","status":"public","date_created":"2020-04-15T11:20:09Z","publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"date_updated":"2022-01-06T06:52:52Z","_id":"16565","doi":"10.1006/inco.1997.2642","language":[{"iso":"eng"}],"citation":{"chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642","bibtex":"@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={10.1006/inco.1997.2642}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }","mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997."},"type":"journal_article","year":"1997","page":"103-120"},{"user_id":"15415","title":"Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Storch, M.","first_name":"M.","last_name":"Storch"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"department":[{"_id":"63"}],"publication":"Theory of Computing Systems","status":"public","date_created":"2020-04-15T11:31:05Z","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"_id":"16567","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/s002240000071","language":[{"iso":"eng"}],"type":"journal_article","citation":{"ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071.","bibtex":"@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }","apa":"Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644. https://doi.org/10.1007/s002240000071","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071","chicago":"Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071."},"year":"1997","page":"627-644"},{"doi":"10.1007/3-540-63397-9_13","date_updated":"2022-01-06T06:52:52Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Dynamic data structures for realtime management of large geometric scenes","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"department":[{"_id":"63"}],"intvolume":" 1284","_id":"16568","citation":{"ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.","short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13.","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={1157–170}, collection={Lecture Notes in Computer Science} }","apa":"Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 1157–1170. https://doi.org/10.1007/3-540-63397-9_13","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13."},"year":"1997","type":"conference","page":"1157 - 170","user_id":"15415","abstract":[{"text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n","lang":"eng"}],"status":"public","date_created":"2020-04-15T11:44:36Z","volume":1284,"publisher":"Springer","author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard"}],"publication":"5th Annual European Symposium on Algorithms (ESA '97)"},{"language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","ieee":"F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","apa":"Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716","ama":"Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={10.1007/bfb0002716}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716."},"year":"1997","_id":"16569","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/bfb0002716","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"publication":"Euro-Par'97 Parallel Processing","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-15T11:47:28Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"publication_status":"published","place":"Berlin, Heidelberg","user_id":"15415","title":"Static and dynamic data management in networks"},{"date_updated":"2022-01-06T06:52:53Z","_id":"16604","doi":"10.1145/258492.258522","year":"1997","citation":{"ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97, 1997.","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997.","bibtex":"@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating weighted jobs in parallel}, DOI={10.1145/258492.258522}, booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1997} }","mla":"Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997, doi:10.1145/258492.258522.","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522","apa":"Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA ’97. https://doi.org/10.1145/258492.258522"},"type":"conference","language":[{"iso":"eng"}],"title":"Allocating weighted jobs in parallel","user_id":"15415","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Schröder","first_name":"Klaus","full_name":"Schröder, Klaus"}],"department":[{"_id":"63"}],"publication":"Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97","publication_identifier":{"isbn":["0897918908"]},"publication_status":"published","status":"public","date_created":"2020-04-16T06:18:07Z"},{"place":"Berlin, Heidelberg","user_id":"15415","title":"Communication efficient parallel searching","department":[{"_id":"63"}],"publication":"Solving Irregularly Structured Problems in Parallel","author":[{"last_name":"Bäumker","full_name":"Bäumker, Armin","first_name":"Armin"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-16T06:22:32Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540631385","9783540691570"]},"date_updated":"2022-01-06T06:52:53Z","_id":"16605","doi":"10.1007/3-540-63138-0_21","language":[{"iso":"eng"}],"citation":{"mla":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21.","bibtex":"@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={10.1007/3-540-63138-0_21}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }","chicago":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.","apa":"Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21","ama":"Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21","ieee":"A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","short":"A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997."},"year":"1997","type":"book_chapter"},{"date_updated":"2022-01-06T06:52:54Z","_id":"16687","doi":"10.1007/bfb0002741","language":[{"iso":"eng"}],"type":"book_chapter","year":"1997","citation":{"short":"E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","ieee":"E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.","chicago":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.","ama":"Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741","apa":"Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741","mla":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.","bibtex":"@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }"},"place":"Berlin, Heidelberg","user_id":"15415","title":"Routing on asyncronous processor networks","author":[{"last_name":"Karaivazoglou","full_name":"Karaivazoglou, Efstratios","first_name":"Efstratios"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Euro-Par'97 Parallel Processing","status":"public","date_created":"2020-04-16T10:41:06Z","publication_status":"published","publication_identifier":{"isbn":["9783540634409","9783540695493"],"issn":["0302-9743","1611-3349"]}},{"type":"conference","year":"1997","citation":{"mla":"Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117.","bibtex":"@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117}, booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science}, author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1997} }","apa":"Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117","ama":"Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117","chicago":"Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997. https://doi.org/10.1109/sfcs.1997.646117.","ieee":"B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.","short":"B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997."},"language":[{"iso":"eng"}],"_id":"16689","date_updated":"2022-01-06T06:52:54Z","doi":"10.1109/sfcs.1997.646117","author":[{"full_name":"Maggs, B.M.","first_name":"B.M.","last_name":"Maggs"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"department":[{"_id":"63"}],"publication":"Proceedings 38th Annual Symposium on Foundations of Computer Science","publication_identifier":{"isbn":["0818681977"]},"publication_status":"published","status":"public","date_created":"2020-04-16T10:44:29Z","title":"Exploiting locality for data management in systems of limited bandwidth","user_id":"15415"}]