[{"user_id":"15504","title":"Towards jamming-resistant and competitive medium access in the SINR model","publisher":"ACM","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"last_name":"Zhang","first_name":"Jin","full_name":"Zhang, Jin"}],"publication":"Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011","department":[{"_id":"79"}],"status":"public","date_created":"2018-03-28T07:09:07Z","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"_id":"1892","date_updated":"2022-01-06T06:53:54Z","doi":"10.1145/2030686.2030697","type":"conference","year":"2011","citation":{"bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={10.1145/2030686.2030697}, booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }","mla":"W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 33--36. ACM, 2011. https://doi.org/10.1145/2030686.2030697.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and competitive medium access in the SINR model. In: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011. ACM; 2011:33--36. doi:10.1145/2030686.2030697","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM. https://doi.org/10.1145/2030686.2030697","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36."},"page":"33--36"},{"doi":"10.1145/2107502.2107522","date_updated":"2022-01-06T06:53:54Z","_id":"1893","page":"15","citation":{"ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011. ACM; 2011:15. doi:10.1145/2107502.2107522","apa":"W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM. https://doi.org/10.1145/2107502.2107522","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 15. ACM, 2011. https://doi.org/10.1145/2107502.2107522.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={10.1145/2107502.2107522}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }","mla":"W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15."},"year":"2011","type":"conference","title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","user_id":"15504","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"date_created":"2018-03-28T07:09:54Z","status":"public","department":[{"_id":"79"}],"publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","publisher":"ACM","author":[{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}]},{"page":"235--244","citation":{"mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={10.1145/1989493.1989527}, booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","apa":"Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244). https://doi.org/10.1145/1989493.1989527","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing chord overlay network. In: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011). ; 2011:235--244. doi:10.1145/1989493.1989527","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 235--244, 2011. https://doi.org/10.1145/1989493.1989527.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011), 2011, pp. 235--244.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244."},"type":"conference","year":"2011","doi":"10.1145/1989493.1989527","_id":"1895","date_updated":"2022-01-06T06:53:55Z","date_created":"2018-03-28T07:12:49Z","status":"public","publication_identifier":{"isbn":["978-1-4503-0743-7"]},"publication":"SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)","department":[{"_id":"79"}],"author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"user_id":"15504","title":"Re-Chord: a self-stabilizing chord overlay network"},{"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"full_name":"Frahling, Gereon","first_name":"Gereon","last_name":"Frahling"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-04T06:52:56Z","publication_identifier":{"isbn":["978-3-942647-09-0"]},"volume":290,"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301123","relation":"confirmation"}]},"user_id":"5786","title":"Algorithms for Dynamic Geometric Data Streams","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"year":"2011","type":"dissertation","citation":{"short":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Frahling G. Algorithms for Dynamic Geometric Data Streams. Vol 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Frahling, G. (2011). Algorithms for Dynamic Geometric Data Streams (Vol. 290). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Vol. 290. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","mla":"Frahling, Gereon. Algorithms for Dynamic Geometric Data Streams. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Frahling_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Algorithms for Dynamic Geometric Data Streams}, volume={290}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Frahling, Gereon}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"date_updated":"2022-01-06T06:53:56Z","_id":"18973","intvolume":" 290"},{"intvolume":" 287","_id":"18974","date_updated":"2022-01-06T06:53:56Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"type":"dissertation","year":"2011","citation":{"ieee":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler, Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Mehler, Jan. Power-Aware Online File Allocation in Dynamic Networks. Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Mehler J. Power-Aware Online File Allocation in Dynamic Networks. Vol 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","apa":"Mehler, J. (2011). Power-Aware Online File Allocation in Dynamic Networks (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011"}]},"user_id":"5786","title":"Power-Aware Online File Allocation in Dynamic Networks","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Mehler","full_name":"Mehler, Jan","first_name":"Jan"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-04T06:58:58Z","volume":287,"publication_identifier":{"isbn":["978-3-942647-06-9"]}},{"year":"2011","type":"dissertation","citation":{"short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","apa":"Gehweiler, J. (2011). Peer-to-Peer Based Parallel Web Computing (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Gehweiler J. Peer-to-Peer Based Parallel Web Computing. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","bibtex":"@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Gehweiler, Joachim. Peer-to-Peer Based Parallel Web Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:56Z","_id":"18976","intvolume":" 298","publication_identifier":{"isbn":["978-3-942647-17-5"]},"volume":298,"status":"public","date_created":"2020-09-04T07:46:32Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"}],"department":[{"_id":"63"},{"_id":"26"}],"title":"Peer-to-Peer Based Parallel Web Computing","user_id":"5786","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186","relation":"confirmation"}]},"abstract":[{"text":"Web computing is a variant of parallel computing where the idle times of PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms. In this thesis we consider a web computing variant with two\r\nimportant properties: First, we support the execution of coupled, massively\r\nparallel algorithms (rather than distributed data processing). And second,\r\nwe organize the system in peer-to-peer fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web) library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical and algorithmic aspects, in particular: In order to schedule\r\nprocesses with respect to the currently available computing power, which\r\ncontinually changes in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms and -- as a basic precondition -- the technical ability\r\nto migrate threads at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use, compatible with\r\nrecent Java versions, available for all important platforms, and easy-to-use\r\nfor developers, we develop the PadMig thread migration and checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables. In order to judge\r\nthe quality of the schedules produced, we perform extensive experiments to\r\ncompare several variants of the DHHT-based load balancer with the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside the available computing power, we finally also consider the network\r\nbandwidth as a secondary criterion for load balancing. For this purpose, we\r\ncluster the PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant, adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally compare it to the well-established MCL algorithm using a\r\nsimulator.","lang":"eng"}]},{"doi":"10.1007/978-3-642-19094-0_18","intvolume":" 6552","_id":"1899","date_updated":"2022-01-06T06:53:56Z","page":"170--181","year":"2011","citation":{"short":"S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181.","ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011, vol. 6552, pp. 170--181.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. https://doi.org/10.1007/978-3-642-19094-0_18.","apa":"Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer. https://doi.org/10.1007/978-3-642-19094-0_18","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:10.1007/978-3-642-19094-0_18","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.","bibtex":"@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181}, collection={Lecture Notes in Computer Science} }"},"type":"conference","series_title":"Lecture Notes in Computer Science","title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","user_id":"15504","publication_identifier":{"isbn":["978-3-642-19093-3"]},"volume":6552,"date_created":"2018-03-28T07:17:05Z","status":"public","publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","department":[{"_id":"79"}],"publisher":"Springer","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"user_id":"15504","title":"Programming for Distributed Computing: From Physical to Logical Networks","date_created":"2018-03-28T07:17:53Z","status":"public","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"department":[{"_id":"79"}],"publication":"Computer Science, The Hardware, Software and Heart of It","author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"publisher":"Springer","doi":"10.1007/978-1-4614-1168-0_9","date_updated":"2022-01-06T06:53:57Z","_id":"1900","page":"155--168","year":"2011","citation":{"bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={10.1007/978-1-4614-1168-0_9}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.","apa":"Scheideler, C., & Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer. https://doi.org/10.1007/978-1-4614-1168-0_9","ama":"Scheideler C, Graffi K. Programming for Distributed Computing: From Physical to Logical Networks. In: Computer Science, The Hardware, Software and Heart of It. Springer; 2011:155--168. doi:10.1007/978-1-4614-1168-0_9","chicago":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” In Computer Science, The Hardware, Software and Heart of It, 155--168. Springer, 2011. https://doi.org/10.1007/978-1-4614-1168-0_9.","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168."},"type":"book_chapter"},{"page":"129-148","type":"book_chapter","year":"2011","citation":{"short":"E.-M. Seng, in: M. Menne, M. Ströhmer (Eds.), Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann, Regensburg, 2011, pp. 129–148.","ieee":"E.-M. Seng, “Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen,” in Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann, M. Menne and M. Ströhmer, Eds. Regensburg, 2011, pp. 129–148.","ama":"Seng E-M. Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen. In: Menne M, Ströhmer M, eds. Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann. Regensburg; 2011:129-148.","apa":"Seng, E.-M. (2011). Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen. In M. Menne & M. Ströhmer (Eds.), Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann (pp. 129–148). Regensburg.","chicago":"Seng, Eva- Maria. “Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen.” In Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann, edited by Mareike Menne and Michael Ströhmer, 129–48. Regensburg, 2011.","bibtex":"@inbook{Seng_2011, place={Regensburg}, title={Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen}, booktitle={Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann}, author={Seng, Eva- Maria}, editor={Menne, Mareike and Ströhmer, MichaelEditors}, year={2011}, pages={129–148} }","mla":"Seng, Eva-Maria. “Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen.” Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann, edited by Mareike Menne and Michael Ströhmer, 2011, pp. 129–48."},"language":[{"iso":"ger"}],"_id":"19000","date_updated":"2022-01-06T06:53:57Z","editor":[{"first_name":"Mareike","full_name":"Menne, Mareike","last_name":"Menne"},{"full_name":"Ströhmer, Michael","first_name":"Michael","last_name":"Ströhmer"}],"date_created":"2020-09-04T09:53:01Z","status":"public","department":[{"_id":"443"}],"publication":"Total Regional. Studien zur frühneuzeitlichen Sozial- und Wirtschaftsgeschichte, FS für Frank Göttmann","author":[{"last_name":"Seng","id":"499","first_name":"Eva- Maria","full_name":"Seng, Eva- Maria"}],"title":"Der Kanonenbischof Christoph Bernhard von Galen und seine retrospektiven Baumaßnahmen","user_id":"21240","place":"Regensburg"},{"date_updated":"2022-01-06T06:53:57Z","_id":"19002","language":[{"iso":"ger"}],"page":"50-53","year":"2011","type":"journal_article","citation":{"mla":"Seng, Eva-Maria. “Dekor und Kirchenbau.” kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur, vol. H.2, 2011, pp. 50–53.","bibtex":"@article{Seng_2011, title={Dekor und Kirchenbau}, volume={H.2}, journal={kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur}, author={Seng, Eva- Maria}, year={2011}, pages={50–53} }","ama":"Seng E-M. Dekor und Kirchenbau. kunst und kirche Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur. 2011;H.2:50-53.","apa":"Seng, E.-M. (2011). Dekor und Kirchenbau. kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur, H.2, 50–53.","chicago":"Seng, Eva- Maria. “Dekor und Kirchenbau.” kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur H.2 (2011): 50–53.","ieee":"E.-M. Seng, “Dekor und Kirchenbau,” kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur, vol. H.2, pp. 50–53, 2011.","short":"E.-M. Seng, kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur H.2 (2011) 50–53."},"user_id":"21240","title":"Dekor und Kirchenbau","date_created":"2020-09-04T10:00:24Z","status":"public","volume":"H.2","department":[{"_id":"443"}],"publication":"kunst und kirche. Ökumenische Zeitschrift für zeitgenössische Kunst und Architektur","author":[{"last_name":"Seng","id":"499","first_name":"Eva- Maria","full_name":"Seng, Eva- Maria"}]}]