[{"abstract":[{"text":"We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path.
Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for some constant c.
Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help. We answer this question affirmatively and prove Theta(kn) bounds on the number of Steiner points and on the number of edges in such spanners.","lang":"eng"}],"user_id":"15415","title":"New Results on Fault Tolerant Geometric Spanners","author":[{"first_name":"Tamás","full_name":"Lukovszki, Tamás","last_name":"Lukovszki"}],"publication":"Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99), LNCS","department":[{"_id":"63"}],"status":"public","date_created":"2020-09-03T13:03:45Z","publication_identifier":{"isbn":["9783540662792","9783540484479"],"issn":["0302-9743"]},"publication_status":"published","date_updated":"2022-01-06T06:53:55Z","_id":"18959","doi":"10.1007/3-540-48447-7_20","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","ieee":"T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204.","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.","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","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","mla":"Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS, 1999, pp. 193–204, doi:10.1007/3-540-48447-7_20.","bibtex":"@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric Spanners}, DOI={10.1007/3-540-48447-7_20}, booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }"},"year":"1999","page":"193-204"},{"language":[{"iso":"eng"}],"page":"165-174","year":"1999","type":"conference","citation":{"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} }","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","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.","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."},"date_updated":"2022-01-06T06:53:56Z","_id":"18965","doi":"10.1145/305619.305637","department":[{"_id":"63"}],"publication":"Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA '99","author":[{"last_name":"Krick","full_name":"Krick, Christof","first_name":"Christof"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"},{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"date_created":"2020-09-03T14:27:14Z","status":"public","publication_identifier":{"isbn":["1581131240"]},"publication_status":"published","user_id":"15415","title":"Data management in networks: experimental evaluation of a provably good strategy"},{"language":[{"iso":"eng"}],"type":"conference","citation":{"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.","ama":"Sohler C. Generating Random Star-Shaped Polygons. In: Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99). ; 1999:174-177.","apa":"Sohler, C. (1999). Generating Random Star-Shaped Polygons. In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99) (pp. 174–177).","chicago":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” In Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 174–77, 1999.","mla":"Sohler, Christian. “Generating Random Star-Shaped Polygons.” Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99), 1999, pp. 174–77.","bibtex":"@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }"},"year":"1999","page":"174-177","_id":"18576","date_updated":"2022-01-06T06:53:40Z","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"publication":"Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)","department":[{"_id":"63"}],"status":"public","date_created":"2020-08-28T14:20:42Z","abstract":[{"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.","lang":"eng"}],"user_id":"15415","title":"Generating Random Star-Shaped Polygons"},{"language":[{"iso":"eng"}],"page":"2-12","type":"conference","citation":{"short":"P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","ieee":"P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia Storage Network (Extended Abstract),” in International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.","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).","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.","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} }"},"year":"1999","oa":"1","urn":"22109","_id":"2210","date_updated":"2022-01-06T06:55:26Z","date_created":"2018-04-05T07:00:11Z","status":"public","has_accepted_license":"1","file":[{"access_level":"open_access","date_created":"2018-04-12T08:34:00Z","file_name":"CDMLarge-99.pdf","date_updated":"2018-04-12T08:34:00Z","content_type":"application/pdf","relation":"main_file","file_size":211926,"file_id":"2294","creator":"florida"}],"file_date_updated":"2018-04-12T08:34:00Z","publication":"International Workshop on Communication and Data Management in Large Networks (CDMLarge)","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"full_name":"Riedel, Marco","first_name":"Marco","last_name":"Riedel"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"14955","ddc":["040"],"title":"Design of the PRESTO Multimedia Storage Network (Extended Abstract)"},{"ddc":["040"],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"STOC","file_date_updated":"2018-04-12T07:35:46Z","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"file":[{"date_updated":"2018-04-12T07:35:46Z","content_type":"application/pdf","relation":"main_file","file_size":227305,"creator":"florida","file_id":"2289","access_level":"open_access","file_name":"STOC-99.pdf","date_created":"2018-04-12T07:35:46Z"}],"date_created":"2018-04-03T08:57:30Z","status":"public","has_accepted_license":"1","urn":"21668","_id":"2166","date_updated":"2022-01-06T06:55:10Z","oa":"1","page":"215--224","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.","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In: STOC. ; 1999: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).","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","year":"1999","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0196-6774"]},"publication_status":"published","date_created":"2020-04-14T11:50:52Z","status":"public","department":[{"_id":"63"}],"publication":"Journal of Algorithms","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"title":"Shortest-Path Routing in Arbitrary Networks","user_id":"15415","page":"105-131","citation":{"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","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","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.","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.","short":"F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.","ieee":"F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary Networks,” Journal of Algorithms, pp. 105–131, 1999."},"year":"1999","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1006/jagm.1998.0980","date_updated":"2022-01-06T06:52:52Z","_id":"16501"},{"doi":"10.1007/s002240000119","_id":"16502","date_updated":"2022-01-06T06:52:52Z","language":[{"iso":"eng"}],"type":"journal_article","citation":{"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.","short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.","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.","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"},"year":"1999","page":"281-300","user_id":"15415","title":"Allocating Weighted Jobs in Parallel","status":"public","date_created":"2020-04-14T12:00:32Z","publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","author":[{"first_name":"P.","full_name":"Berenbrink, P.","last_name":"Berenbrink"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schröder, K.","first_name":"K.","last_name":"Schröder"}],"publication":"Theory of Computing Systems","department":[{"_id":"63"}]},{"date_created":"2020-05-20T13:16:56Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540664505","9783662010693"],"issn":["1431-472X"]},"department":[{"_id":"63"}],"publication":"Informatik aktuell","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"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"user_id":"15415","title":"International Workshop on Communication and Data Management in Large Networks","place":"Berlin, Heidelberg","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin, Heidelberg, 1999.","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.","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","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","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.","mla":"Mayr, E. W., et al. “International Workshop on Communication and Data Management in Large Networks.” Informatik Aktuell, 1999, doi:10.1007/978-3-662-01069-3_47.","bibtex":"@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg}, title={International Workshop on Communication and Data Management in Large Networks}, DOI={10.1007/978-3-662-01069-3_47}, booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={1999} }"},"year":"1999","doi":"10.1007/978-3-662-01069-3_47","_id":"17052","date_updated":"2022-01-06T06:53:03Z"},{"user_id":"15415","title":"Provably Good and Practical Strategies for Non-uniform Data Management in Networks","place":"Berlin, Heidelberg","status":"public","date_created":"2020-05-20T13:35:49Z","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540662518","9783540484813"]},"publication_status":"published","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"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}],"department":[{"_id":"63"}],"publication":"Algorithms - ESA’ 99","doi":"10.1007/3-540-48481-7_9","_id":"17053","date_updated":"2022-01-06T06:53:03Z","language":[{"iso":"eng"}],"citation":{"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.","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} }","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.” In Algorithms - ESA’ 99. Berlin, Heidelberg, 1999. https://doi.org/10.1007/3-540-48481-7_9.","apa":"Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1999). Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In Algorithms - ESA’ 99. Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_9","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical Strategies for Non-uniform Data Management in Networks. In: Algorithms - ESA’ 99. Berlin, Heidelberg; 1999. doi:10.1007/3-540-48481-7_9","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."},"type":"book_chapter","year":"1999"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:09Z","department":[{"_id":"63"},{"_id":"26"}],"publication_identifier":{"isbn":["3-931466-45-0"]},"title":"Static and Dynamic Data Management in Networks","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"citation":{"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.","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.","mla":"Vöcking, Berthold. Static and Dynamic Data Management in Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.","bibtex":"@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking, Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"B. Vöcking, Static and Dynamic Data Management in Networks, 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."},"year":"1998","type":"dissertation","intvolume":" 46","_id":"19639","file":[{"access_level":"closed","file_name":"pub-hni-478.pdf","date_created":"2020-09-22T13:05:04Z","content_type":"application/pdf","date_updated":"2020-09-22T13:05:04Z","relation":"main_file","success":1,"file_size":592479,"creator":"koala","file_id":"19640"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"first_name":"Berthold","full_name":"Vöcking, 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,"user_id":"5786","ddc":["000"]},{"type":"report","year":"1998","citation":{"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.","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. 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} }","mla":"Bonorden, Olaf, et al. 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.","ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, The Paderborn University BSP (PUB) Library - Design, Implementation and Performance. 1998."},"language":[{"iso":"eng"}],"_id":"19735","date_updated":"2022-01-06T06:54:11Z","date_created":"2020-09-28T12:41:20Z","status":"public","has_accepted_license":"1","file_date_updated":"2020-09-28T12:41:08Z","department":[{"_id":"63"}],"author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"},{"full_name":"von Otte, Ingo","first_name":"Ingo","last_name":"von Otte"},{"last_name":"Juurlink","first_name":"Bernhardus","full_name":"Juurlink, Bernhardus"}],"file":[{"content_type":"application/pdf","date_updated":"2020-09-28T12:41:08Z","success":1,"relation":"main_file","file_size":255806,"file_id":"19736","creator":"koala","access_level":"closed","date_created":"2020-09-28T12:41:08Z","file_name":"pub-hni-1350.pdf"}],"ddc":["000"],"title":"The Paderborn University BSP (PUB) Library - Design, Implementation and Performance","user_id":"15415","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"}]},{"abstract":[{"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","lang":"eng"}],"user_id":"15415","ddc":["000"],"file":[{"file_id":"18442","creator":"koala","file_size":266070,"success":1,"relation":"main_file","date_updated":"2020-08-27T11:20:38Z","content_type":"application/pdf","date_created":"2020-08-27T11:20:38Z","file_name":"hni-id-854.pdf","access_level":"closed"}],"author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamás","first_name":"Tamás"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication":"Algorithms — ESA’ 98","file_date_updated":"2020-08-27T11:20:38Z","status":"public","has_accepted_license":"1","date_created":"2020-07-27T11:42:54Z","_id":"17412","citation":{"ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={10.1007/3-540-68530-8_14}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }","mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” Algorithms — ESA’ 98, 1998, doi:10.1007/3-540-68530-8_14.","chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In Algorithms — ESA’ 98. Berlin, Heidelberg, 1998. https://doi.org/10.1007/3-540-68530-8_14.","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"},"type":"book_chapter","year":"1998","place":"Berlin, Heidelberg","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","department":[{"_id":"63"}],"publication_status":"published","publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"date_updated":"2022-01-06T06:53:11Z","doi":"10.1007/3-540-68530-8_14","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"title":"A Network Based Approach for Realtime Walkthrough of Massive Models","place":"Saarbrücken","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:21Z","date_created":"2020-08-12T12:50:56Z","has_accepted_license":"1","status":"public","file":[{"file_id":"18440","creator":"koala","file_size":272549,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-08-27T11:18:26Z","file_name":"hni-id-853.pdf","date_created":"2020-08-27T11:18:26Z","access_level":"closed"}],"publication":"Algorithm Engineering, 2nd International Workshop, {WAE '98}","file_date_updated":"2020-08-27T11:18:26Z","author":[{"last_name":"Fischer","id":"146","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"last_name":"Ziegler","first_name":"Martin ","full_name":"Ziegler, Martin "}],"publisher":"Max-Planck-Institut für Informatik","user_id":"15415","ddc":["000"],"abstract":[{"lang":"eng","text":"New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"}],"page":"133--142","year":"1998","citation":{"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.","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.","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} }","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In Algorithm Engineering, 2nd International Workshop, {WAE ’98}, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.","ama":"Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: Algorithm Engineering, 2nd International Workshop, {WAE ’98}. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.","apa":"Fischer, M., Lukovszki, T., & Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In Algorithm Engineering, 2nd International Workshop, {WAE ’98} (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik."},"type":"conference","_id":"17863"},{"title":"Multimediale Entdeckungsreisen unserer Welt mit dem Internet","user_id":"15415","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\""}],"status":"public","date_created":"2020-08-24T09:55:41Z","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Lukovszki","first_name":"Tamás","full_name":"Lukovszki, Tamás"}],"department":[{"_id":"63"}],"date_updated":"2022-01-06T06:53:26Z","_id":"18145","year":"1998","citation":{"bibtex":"@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }","mla":"Ziegler, Martin, et al. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet. 1998.","chicago":"Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","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.","ieee":"M. Ziegler, M. Fischer, and T. Lukovszki, Multimediale Entdeckungsreisen unserer Welt mit dem Internet. 1998.","short":"M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998."},"type":"report","language":[{"iso":"eng"}]},{"year":"1998","type":"dissertation","citation":{"ama":"Oesterdiekhoff B. On Periodic Comparator Networks. Universität Paderborn; 1998.","apa":"Oesterdiekhoff, B. (1998). On Periodic Comparator Networks. Universität Paderborn.","chicago":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. Universität Paderborn, 1998.","mla":"Oesterdiekhoff, Brigitte. On Periodic Comparator Networks. 1998.","bibtex":"@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }","short":"B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn, 1998.","ieee":"B. Oesterdiekhoff, On Periodic Comparator Networks. Universität Paderborn, 1998."},"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:32Z","_id":"18445","date_created":"2020-08-27T11:42:12Z","status":"public","department":[{"_id":"63"}],"author":[{"last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte","first_name":"Brigitte"}],"title":"On Periodic Comparator Networks","user_id":"15415","place":"Universität Paderborn"},{"doi":"10.1007/s002240000096","issue":"4","_id":"2168","intvolume":" 31","date_updated":"2022-01-06T06:55:10Z","page":"425--449","citation":{"short":"C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.","ieee":"C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.","ama":"Scheideler C, Vöcking B. Universal Continuous Routing Strategies. Theory Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096","apa":"Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096","chicago":"Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.","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","type":"journal_article","language":[{"iso":"eng"}],"title":"Universal Continuous Routing Strategies","user_id":"14955","volume":31,"date_created":"2018-04-03T08:59:06Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publication":"Theory Comput. Syst.","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}]},{"type":"conference","citation":{"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.","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} }","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.","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."},"year":"1998","page":"259--268","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:55:10Z","_id":"2169","urn":"21699","has_accepted_license":"1","status":"public","date_created":"2018-04-03T08:59:55Z","author":[{"first_name":"Micah","full_name":"Adler, Micah","last_name":"Adler"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"file_date_updated":"2018-04-12T07:08:12Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"file":[{"file_size":492778,"file_id":"2285","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T07:08:12Z","relation":"main_file","file_name":"SPAA98.pdf","date_created":"2018-04-12T07:08:12Z","access_level":"open_access"}],"title":"Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)","ddc":["040"],"user_id":"14955"},{"oa":"1","urn":"21705","_id":"2170","date_updated":"2022-01-06T06:55:11Z","language":[{"iso":"eng"}],"page":"624--633","citation":{"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.","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.","chicago":"Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.","ieee":"U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract),” in STOC, 1998, pp. 624--633.","short":"U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633."},"type":"conference","year":"1998","user_id":"14955","ddc":["040"],"title":"Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)","date_created":"2018-04-03T09:00:31Z","has_accepted_license":"1","status":"public","file":[{"content_type":"application/pdf","date_updated":"2018-04-12T07:15:50Z","relation":"main_file","file_size":228487,"creator":"florida","file_id":"2286","access_level":"open_access","file_name":"STOC98.pdf","date_created":"2018-04-12T07:15:50Z"}],"file_date_updated":"2018-04-12T07:15:50Z","publication":"STOC","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Feige, Uriel","first_name":"Uriel","last_name":"Feige"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}]},{"intvolume":" 1390","_id":"2185","date_updated":"2022-01-06T06:55:17Z","doi":"10.1007/BFb0052928","series_title":"Lecture Notes in Computer Science","citation":{"mla":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390, 1998, doi:10.1007/BFb0052928.","bibtex":"@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal Routing Strategies for Interconnection Networks}, volume={1390}, DOI={10.1007/BFb0052928}, author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer Science} }","apa":"Scheideler, C. (1998). Universal Routing Strategies for Interconnection Networks (Vol. 1390). https://doi.org/10.1007/BFb0052928","ama":"Scheideler C. Universal Routing Strategies for Interconnection Networks. Vol 1390.; 1998. doi:10.1007/BFb0052928","chicago":"Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998. https://doi.org/10.1007/BFb0052928.","ieee":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, vol. 1390. 1998.","short":"C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998."},"type":"book","year":"1998","language":[{"iso":"eng"}],"title":"Universal Routing Strategies for Interconnection Networks","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"author":[{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"volume":1390,"publication_identifier":{"isbn":["978-3-540-69792-3"]},"date_created":"2018-04-03T09:38:18Z","status":"public"},{"doi":"10.1016/s0304-3975(97)86791-6","intvolume":" 196","_id":"16503","date_updated":"2022-01-06T06:52:52Z","language":[{"iso":"eng"}],"year":"1998","type":"journal_article","citation":{"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","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","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.","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.","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} }","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."},"page":"181-200","user_id":"15415","title":"Routing on networks of optical crossbars","status":"public","date_created":"2020-04-14T12:20:57Z","volume":196,"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"},{"full_name":"Schwarze, Frank","first_name":"Frank","last_name":"Schwarze"}],"publication":"Theoretical Computer Science","department":[{"_id":"63"}]}]