[{"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"mla":"Westermann, Matthias. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","bibtex":"@book{Westermann_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints}, volume={90}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Westermann, Matthias}, year={2000}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Westermann M. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.","ieee":"M. Westermann, <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","apa":"Westermann, M. (2000). <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i> (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Westermann, Matthias. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","short":"M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000."},"related_material":{"link":[{"url":"https://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20000101283","relation":"confirmation"}]},"date_created":"2020-09-22T10:16:35Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","publication_identifier":{"isbn":["3-931466-89-2"]},"author":[{"full_name":"Westermann, Matthias","first_name":"Matthias","last_name":"Westermann"}],"title":"Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints","year":"2000","status":"public","intvolume":"        90","date_updated":"2022-01-06T06:54:08Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19621","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"volume":90,"user_id":"5786"},{"_id":"19733","language":[{"iso":"eng"}],"user_id":"15415","ddc":["000"],"year":"2000","title":"PUB-Library, Release 7.0, User Guide and Function Reference","status":"public","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"first_name":"Ingo","last_name":"Rieping","full_name":"Rieping, Ingo"},{"last_name":"von Otte","first_name":"Ingo","full_name":"von Otte, Ingo"},{"full_name":"Juurlink, Bernhardus","first_name":"Bernhardus","last_name":"Juurlink"}],"date_updated":"2022-01-06T06:54:10Z","has_accepted_license":"1","file":[{"content_type":"application/pdf","success":1,"file_id":"19734","date_updated":"2020-09-28T12:20:10Z","relation":"main_file","access_level":"closed","file_size":271118,"file_name":"pub-hni-1656.pdf","date_created":"2020-09-28T12:20:10Z","creator":"koala"}],"date_created":"2020-09-28T12:20:20Z","type":"report","department":[{"_id":"63"}],"file_date_updated":"2020-09-28T12:20:10Z","citation":{"ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>.; 2000.","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000.","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>, 2000.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_2000, title={PUB-Library, Release 7.0, User Guide and Function Reference}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={2000} }","mla":"Bonorden, Olaf, et al. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>. 2000.","apa":"Bonorden, O., Rieping, I., von Otte, I., &#38; Juurlink, B. (2000). <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>.","ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>. 2000."}},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-10-02T10:30:38Z","citation":{"apa":"Bednara, M., Beyer, O., Teich, J., &#38; Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 299–308. <a href=\"https://doi.org/10.1109/asap.2000.862400\">https://doi.org/10.1109/asap.2000.862400</a>","ieee":"M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 2000, pp. 299–308, doi: <a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>.","short":"M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.","chicago":"Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” In <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 299–308, 2000. <a href=\"https://doi.org/10.1109/asap.2000.862400\">https://doi.org/10.1109/asap.2000.862400</a>.","mla":"Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 2000, pp. 299–308, doi:<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>.","ama":"Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In: <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>. ; 2000:299-308. doi:<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>","bibtex":"@inproceedings{Bednara_Beyer_Teich_Wanka_2000, title={Tradeoff analysis and architecture design of a hybrid hardware/software sorter}, DOI={<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>}, booktitle={Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)}, author={Bednara, M. and Beyer, O. and Teich, J. and Wanka, Rolf}, year={2000}, pages={299–308} }"},"publication":"Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)","doi":"10.1109/asap.2000.862400","user_id":"15415","_id":"19849","language":[{"iso":"eng"}],"page":"299-308","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","publication_identifier":{"isbn":["0769507166"]},"author":[{"full_name":"Bednara, M.","first_name":"M.","last_name":"Bednara"},{"full_name":"Beyer, O.","first_name":"O.","last_name":"Beyer"},{"first_name":"J.","last_name":"Teich","full_name":"Teich, J."},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"title":"Tradeoff analysis and architecture design of a hybrid hardware/software sorter","status":"public","year":"2000"},{"publication":"Theory Comput. Syst.","issue":"5/6","citation":{"mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, 2000, pp. 337--391, doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>.","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput Syst</i>. 2000;33(5/6):337--391. doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }","apa":"Adler, M., &#38; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput. Syst.</i>, <i>33</i>(5/6), 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, pp. 337--391, 2000.","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i> 33, no. 5/6 (2000): 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>.","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391."},"type":"journal_article","department":[{"_id":"79"},{"_id":"63"}],"date_created":"2018-04-03T05:51:02Z","date_updated":"2022-01-06T06:54:59Z","intvolume":"        33","status":"public","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","year":"2000","author":[{"full_name":"Adler, Micah","first_name":"Micah","last_name":"Adler"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"doi":"10.1007/s002240010006","user_id":"14955","volume":33,"page":"337--391","language":[{"iso":"eng"}],"_id":"2143"},{"page":"1126--1155","language":[{"iso":"eng"}],"_id":"2145","user_id":"14955","doi":"10.1137/S0097539799353431","volume":30,"year":"2000","status":"public","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"date_updated":"2022-01-06T06:55:00Z","intvolume":"        30","date_created":"2018-04-03T06:12:15Z","type":"journal_article","department":[{"_id":"79"},{"_id":"63"}],"publication":"SIAM J. Comput.","issue":"4","citation":{"bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J Comput</i>. 2000;30(4):1126--1155. doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i>, vol. 30, no. 4, 2000, pp. 1126--1155, doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i> 30, no. 4 (2000): 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” <i>SIAM J. Comput.</i>, vol. 30, no. 4, pp. 1126--1155, 2000.","apa":"Scheideler, C., &#38; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J. Comput.</i>, <i>30</i>(4), 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>"}},{"type":"conference","oa":"1","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf","file_size":168677,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T08:47:50Z","file_id":"2299","content_type":"application/pdf"}],"date_created":"2018-04-03T06:13:07Z","publication":"PDPTA","file_date_updated":"2018-04-12T08:47:50Z","citation":{"chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In <i>PDPTA</i>, 2000.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In <i>PDPTA</i>.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in <i>PDPTA</i>, 2000.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: <i>PDPTA</i>. ; 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” <i>PDPTA</i>, 2000."},"ddc":["040"],"user_id":"14955","language":[{"iso":"eng"}],"_id":"2146","urn":"21467","date_updated":"2022-01-06T06:55:00Z","has_accepted_license":"1","title":"Distributed Path Selection for Storage Networks","status":"public","year":"2000","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}]},{"status":"public","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","year":"2000","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:55:00Z","has_accepted_license":"1","page":"30--39","language":[{"iso":"eng"}],"_id":"2147","urn":"21476","user_id":"14955","ddc":["040"],"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in <i>SODA</i>, 2000, pp. 30--39.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In <i>SODA</i> (pp. 30--39).","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In <i>SODA</i>, 30--39, 2000.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>SODA</i>, 2000, pp. 30--39.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: <i>SODA</i>. ; 2000:30--39."},"file":[{"date_created":"2018-04-12T08:36:17Z","creator":"florida","file_id":"2295","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T08:36:17Z","file_name":"SODA-00.pdf","access_level":"open_access","file_size":185001}],"date_created":"2018-04-03T06:16:48Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1"},{"author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"status":"public","year":"2000","title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","intvolume":"        17","date_updated":"2022-01-06T06:55:00Z","_id":"2148","language":[{"iso":"eng"}],"page":"213--237","volume":17,"user_id":"14955","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, pp. 213--237, 2000.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct. Algorithms</i>, <i>17</i>(3–4), 213--237.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i> 17, no. 3–4 (2000): 213--237.","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, 2000, pp. 213--237.","bibtex":"@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct Algorithms</i>. 2000;17(3-4):213--237."},"issue":"3-4","publication":"Random Struct. Algorithms","date_created":"2018-04-03T06:17:52Z","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:55:02Z","author":[{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"first_name":"Kay","last_name":"Salzwedel","full_name":"Salzwedel, Kay"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"year":"2000","status":"public","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","user_id":"14955","ddc":["040"],"language":[{"iso":"eng"}],"_id":"2149","urn":"21493","page":"119--128","citation":{"mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” <i>SPAA</i>, 2000, pp. 119--128.","bibtex":"@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: <i>SPAA</i>. ; 2000:119--128.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in <i>SPAA</i>, 2000, pp. 119--128.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In <i>SPAA</i> (pp. 119--128).","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In <i>SPAA</i>, 119--128, 2000."},"file_date_updated":"2018-04-12T08:38:13Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","date_created":"2018-04-03T06:18:45Z","file":[{"creator":"florida","date_created":"2018-04-12T08:38:13Z","relation":"main_file","date_updated":"2018-04-12T08:38:13Z","file_name":"spaa_00.pdf","file_size":222176,"access_level":"open_access","file_id":"2297","content_type":"application/pdf"}]},{"year":"2000","title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:55:02Z","language":[{"iso":"eng"}],"publication":"STOC","file":[{"creator":"florida","date_created":"2018-04-12T08:49:23Z","access_level":"open_access","file_size":190083,"file_name":"STOC-00.pdf","date_updated":"2018-04-12T08:49:23Z","relation":"main_file","content_type":"application/pdf","file_id":"2300"}],"date_created":"2018-04-03T06:21:11Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"status":"public","has_accepted_license":"1","page":"38--47","_id":"2150","urn":"21509","publisher":"ACM","user_id":"14955","ddc":["040"],"file_date_updated":"2018-04-12T08:49:23Z","citation":{"ama":"Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: <i>STOC</i>. ACM; 2000:38--47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }","mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” <i>STOC</i>, ACM, 2000, pp. 38--47.","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In <i>STOC</i>, 38--47. ACM, 2000.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In <i>STOC</i> (pp. 38--47). ACM.","ieee":"A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in <i>STOC</i>, 2000, pp. 38--47."},"oa":"1"},{"ddc":["000"],"user_id":"15415","language":[{"iso":"eng"}],"_id":"17865","has_accepted_license":"1","date_updated":"2022-01-06T06:53:21Z","author":[{"last_name":"Wand","first_name":"Michael","full_name":"Wand, Michael"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"status":"public","title":"Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes","year":"2000","department":[{"_id":"63"}],"type":"report","place":"Universität Paderborn","date_created":"2020-08-12T13:27:52Z","file":[{"success":1,"content_type":"application/pdf","file_id":"17866","date_updated":"2020-08-12T13:27:33Z","relation":"main_file","file_size":921817,"access_level":"closed","file_name":"tr-ri-00-217.pdf","date_created":"2020-08-12T13:27:33Z","creator":"koala"}],"abstract":[{"text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved.","lang":"eng"}],"citation":{"mla":"Wand, Michael, et al. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. 2000.","bibtex":"@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn}, title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2000} }","ama":"Wand M, Fischer M, Meyer auf der Heide F. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn; 2000.","ieee":"M. Wand, M. Fischer, and F. Meyer auf der Heide, <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","apa":"Wand, M., Fischer, M., &#38; Meyer auf der Heide, F. (2000). <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn.","short":"M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.","chicago":"Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000."},"file_date_updated":"2020-08-12T13:27:33Z"},{"year":"2000","title":"I/O-Efficient Well-Separated Pair Decomposition and Applications","status":"public","author":[{"full_name":"Govindarajan, Sathish","first_name":"Sathish","last_name":"Govindarajan"},{"first_name":"Tamas","last_name":"Lukovszki","full_name":"Lukovszki, Tamas"},{"first_name":"Anil","last_name":"Maheshwari","full_name":"Maheshwari, Anil"},{"full_name":"Zeh, Norbert","last_name":"Zeh","first_name":"Norbert"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"date_updated":"2022-01-06T06:53:55Z","publication_status":"published","page":"585-614","language":[{"iso":"eng"}],"_id":"18962","doi":"10.1007/s00453-005-1197-3","user_id":"15415","publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS","citation":{"ama":"Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>. ; 2000:585-614. doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>","bibtex":"@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, year={2000}, pages={585–614} }","mla":"Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614, doi:<a href=\"https://doi.org/10.1007/s00453-005-1197-3\">10.1007/s00453-005-1197-3</a>.","short":"S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.","chicago":"Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 585–614, 2000. <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>.","apa":"Govindarajan, S., Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i> (pp. 585–614). <a href=\"https://doi.org/10.1007/s00453-005-1197-3\">https://doi.org/10.1007/s00453-005-1197-3</a>","ieee":"S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS</i>, 2000, pp. 585–614."},"date_created":"2020-09-03T13:21:02Z","type":"conference","department":[{"_id":"63"}]},{"user_id":"15415","volume":4698,"page":"155-166","_id":"17990","publisher":"Springer","status":"public","place":"Berlin, Heidelberg","citation":{"mla":"Czumaj, Artur, et al. “Property Testing in Computational Geometry.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, vol. 4698, Springer, 2000, pp. 155–66, doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>.","bibtex":"@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)}, publisher={Springer}, author={Czumaj, Artur and Sohler, Christian and Ziegler, Martin}, year={2000}, pages={155–166}, collection={Lecture Notes in Computer Science} }","ama":"Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>. Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>","ieee":"A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 2000, vol. 4698, pp. 155–166.","apa":"Czumaj, A., Sohler, C., &#38; Ziegler, M. (2000). Property Testing in Computational Geometry. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i> (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>","short":"A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.","chicago":"Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>."},"doi":"10.1007/3-540-45253-2_15","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","intvolume":"      4698","year":"2000","title":"Property Testing in Computational Geometry","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"publication_identifier":{"isbn":["9783540410041","9783540452539"],"issn":["0302-9743"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-14T13:48:54Z","abstract":[{"text":"We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.","lang":"eng"}],"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)"},{"publication_status":"published","date_updated":"2022-01-06T06:53:26Z","intvolume":"      1963","title":"Computing the Dimension of Linear Subspaces","year":"2000","publication_identifier":{"isbn":["9783540413486","9783540444114"],"issn":["0302-9743"]},"author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"},{"full_name":"Brattka, Vasco","first_name":"Vasco","last_name":"Brattka"}],"doi":"10.1007/3-540-44411-4_34","language":[{"iso":"eng"}],"abstract":[{"text":"Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.","lang":"eng"}],"publication":"SOFSEM 2000: Theory and Practice of Informatics","type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T09:58:56Z","status":"public","user_id":"15415","volume":1963,"page":"450-458","publisher":"Springer","_id":"18146","citation":{"ama":"Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: <i>SOFSEM 2000: Theory and Practice of Informatics</i>. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>","short":"M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.","chicago":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 1963:450–58. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>.","bibtex":"@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>}, booktitle={SOFSEM 2000: Theory and Practice of Informatics}, publisher={Springer}, author={Ziegler, Martin and Brattka, Vasco}, year={2000}, pages={450–458} }","mla":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” <i>SOFSEM 2000: Theory and Practice of Informatics</i>, vol. 1963, Springer, 2000, pp. 450–58, doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>.","apa":"Ziegler, M., &#38; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In <i>SOFSEM 2000: Theory and Practice of Informatics</i> (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>","ieee":"M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 2000, vol. 1963, pp. 450–458."},"place":"Berlin, Heidelberg"},{"user_id":"15415","page":"73-79","language":[{"iso":"eng"}],"_id":"18150","date_updated":"2022-01-06T06:53:26Z","year":"2000","status":"public","title":"Computing Cut Numbers","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T10:10:40Z","abstract":[{"text":"What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.<br>This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).<br>We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7.","lang":"eng"}],"publication":"Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00)","citation":{"ama":"Ziegler M, Sohler C. Computing Cut Numbers. In: <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>. ; 2000:73-79.","bibtex":"@inproceedings{Ziegler_Sohler_2000, title={Computing Cut Numbers}, booktitle={Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)}, author={Ziegler, Martin and Sohler, Christian}, year={2000}, pages={73–79} }","mla":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79.","short":"M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.","chicago":"Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 73–79, 2000.","apa":"Ziegler, M., &#38; Sohler, C. (2000). Computing Cut Numbers. In <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i> (pp. 73–79).","ieee":"M. Ziegler and C. Sohler, “Computing Cut Numbers,” in <i>Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)</i>, 2000, pp. 73–79."}},{"abstract":[{"lang":"eng","text":"We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.\r\n\r\nPreviously, very little was known on such networks. The fastest solutions required time O(nε) where the depth was roughly 1/ε. We introduce a general method called periodification scheme that converts automatically an arbitrary sorting network that sorts n items in time T(n) and that has layout area A(n) into a sorting network that has period 5, sorts ***(n • T(n) items in time O(T(<n)• log n), and has layout area O(A(n)) • T(n)). In particular, applying this scheme to Batcher's algorithms, we get practical period 5 comparator networks that sort in time O(log3n). For theoretical interest, one may use the AKS netork resulting in a period 5 comparator network with runtime O(log2n)."}],"publication":"Journal of the ACM","citation":{"ieee":"K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” <i>Journal of the ACM</i>, vol. 45, pp. 944–967, 2000, doi: <a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>.","apa":"Lorys, K., Wanka, R., Oesterdiekhoff, B., &#38; Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. <i>Journal of the ACM</i>, <i>45</i>, 944–967. <a href=\"https://doi.org/10.1145/355483.355490\">https://doi.org/10.1145/355483.355490</a>","mla":"Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” <i>Journal of the ACM</i>, vol. 45, 2000, pp. 944–67, doi:<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>.","bibtex":"@article{Lorys_Wanka_Oesterdiekhoff_Kutylowski_2000, title={Periodification Scheme: Constructing Sorting Networks with Constant Period}, volume={45}, DOI={<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>}, journal={Journal of the ACM}, author={Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, year={2000}, pages={944–967} }","short":"K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967.","ama":"Lorys K, Wanka R, Oesterdiekhoff B, Kutylowski M. Periodification Scheme: Constructing Sorting Networks with Constant Period. <i>Journal of the ACM</i>. 2000;45:944-967. doi:<a href=\"https://doi.org/10.1145/355483.355490\">10.1145/355483.355490</a>","chicago":"Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” <i>Journal of the ACM</i> 45 (2000): 944–67. <a href=\"https://doi.org/10.1145/355483.355490\">https://doi.org/10.1145/355483.355490</a>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-08-27T11:49:50Z","date_updated":"2022-01-06T06:53:32Z","intvolume":"        45","title":"Periodification Scheme: Constructing Sorting Networks with Constant Period","year":"2000","status":"public","author":[{"full_name":"Lorys, Krzysztof","first_name":"Krzysztof","last_name":"Lorys"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"},{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"},{"last_name":"Kutylowski","first_name":"Miroslaw","full_name":"Kutylowski, Miroslaw"}],"doi":"10.1145/355483.355490","user_id":"15415","volume":45,"page":"944-967","_id":"18446","language":[{"iso":"eng"}]},{"year":"2000","title":"A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ","status":"public","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:55:26Z","has_accepted_license":"1","page":"38-47","urn":"22111","_id":"2211","language":[{"iso":"eng"}],"user_id":"14955","ddc":["040"],"file_date_updated":"2018-04-12T08:37:23Z","publication":"32nd ACM Symposium on Theory of Computing","citation":{"mla":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","bibtex":"@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }","ama":"Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: <i>32nd ACM Symposium on Theory of Computing</i>. ; 2000:38-47.","ieee":"A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in <i>32nd ACM Symposium on Theory of Computing</i>, 2000, pp. 38–47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In <i>32nd ACM Symposium on Theory of Computing</i> (pp. 38–47).","chicago":"Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In <i>32nd ACM Symposium on Theory of Computing</i>, 38–47, 2000.","short":"A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47."},"file":[{"file_id":"2296","content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T08:37:23Z","file_name":"STOC-00.pdf","access_level":"open_access","file_size":190083,"date_created":"2018-04-12T08:37:23Z","creator":"florida"}],"date_created":"2018-04-05T07:02:46Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1"},{"date_updated":"2022-01-06T06:52:51Z","publication_status":"published","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"publication_identifier":{"isbn":["1581131852"]},"title":"Data management in hierarchical bus networks","status":"public","year":"2000","doi":"10.1145/341800.341814","user_id":"15415","language":[{"iso":"eng"}],"_id":"16495","citation":{"short":"F. Meyer auf der Heide, H. Räcke, M. Westermann, in: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000.","ama":"Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. ; 2000. doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>","chicago":"Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management in hierarchical bus networks}, DOI={<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>}, booktitle={Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’00}, author={Meyer auf der Heide, Friedhelm and Räcke, Harald and Westermann, Matthias}, year={2000} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>, 2000, doi:<a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>.","apa":"Meyer auf der Heide, F., Räcke, H., &#38; Westermann, M. (2000). Data management in hierarchical bus networks. <i>Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00</i>. <a href=\"https://doi.org/10.1145/341800.341814\">https://doi.org/10.1145/341800.341814</a>","ieee":"F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: <a href=\"https://doi.org/10.1145/341800.341814\">10.1145/341800.341814</a>."},"publication":"Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures  - SPAA '00","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-09T13:06:23Z"},{"date_updated":"2022-01-06T06:52:51Z","year":"2000","status":"public","title":"Caching in networks","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"publication_identifier":{"isbn":["0898714532"]},"user_id":"15415","page":"430–439","language":[{"iso":"eng"}],"_id":"16496","abstract":[{"text":"We present a general framework for the development of on-line algorithms for data management in networks with limited memory capacities. These algorithms dynamically create and delete copies of shared data objects that can be read and written by the nodes in the network. Our algorithms aim to minimize the congestion, i.e., the maximum communication load over all network resources, so that that none of these resources become a communication bottleneck. We give several examples of networks for which our framework yields efficient algorithms, including meshes, fat-trees, hypercubic networks, and complete networks. For example, our framework yields an $O(d cdot log n)$-competitive caching algorithm for $d$-dimensional meshes of size $n$ with respect to the congestion on the communication links, and an $O(1)$-competitive algorithms for complete networks with respect to the congestion at the memory modules due to remote accesses. Previous work on data management in networks either neglects memory capacity constraints or minimizes only the total communication load, i.e., the sum of the communication load over all resources, which may produce congestion as some of the links become bottlenecks.","lang":"eng"}],"publication":"SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms","citation":{"short":"F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.","chicago":"Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 430–439, 2000.","ieee":"F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i>, 2000, pp. 430–439.","apa":"Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (2000). Caching in networks. In <i>SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms</i> (pp. 430–439).","bibtex":"@inproceedings{Meyer auf der Heide_Vöcking_Westermann_2000, title={Caching in networks}, booktitle={SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={2000}, pages={430–439} }","ama":"Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2000:430–439.","mla":"Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” <i>SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2000, pp. 430–439."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-09T13:16:15Z"},{"language":[{"iso":"eng"}],"_id":"16497","doi":"10.1007/3-540-44520-x_59","user_id":"15415","publication_identifier":{"isbn":["9783540679561","9783540445203"],"issn":["0302-9743"]},"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Kutyłowski, Mirosław","first_name":"Mirosław","last_name":"Kutyłowski"},{"full_name":"Ragde, Prabhakar","first_name":"Prabhakar","last_name":"Ragde"}],"status":"public","title":"Complexity Theory and Algorithms","year":"2000","date_updated":"2022-01-06T06:52:51Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-09T13:30:45Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"bibtex":"@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>}, booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }","ama":"Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg; 2000. doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” <i>Euro-Par 2000 Parallel Processing</i>, 2000, doi:<a href=\"https://doi.org/10.1007/3-540-44520-x_59\">10.1007/3-540-44520-x_59</a>.","chicago":"Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg, 2000. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>.","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 <i>Euro-Par 2000 Parallel Processing</i>, Berlin, Heidelberg, 2000.","apa":"Meyer auf der Heide, F., Kutyłowski, M., &#38; Ragde, P. (2000). Complexity Theory and Algorithms. In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44520-x_59\">https://doi.org/10.1007/3-540-44520-x_59</a>"},"publication":"Euro-Par 2000 Parallel Processing"}]