--- _id: '19621' author: - first_name: Matthias full_name: Westermann, Matthias last_name: Westermann citation: ama: 'Westermann M. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.' apa: 'Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.' 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} }' chicago: 'Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.' ieee: 'M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.' mla: 'Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. 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.' date_created: 2020-09-22T10:16:35Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 90' language: - iso: eng publication_identifier: isbn: - 3-931466-89-2 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: https://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20000101283 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: 'Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints' type: dissertation user_id: '5786' volume: 90 year: '2000' ... --- _id: '19733' author: - first_name: Olaf full_name: Bonorden, Olaf last_name: Bonorden - first_name: Ingo full_name: Rieping, Ingo last_name: Rieping - first_name: Ingo full_name: von Otte, Ingo last_name: von Otte - first_name: Bernhardus full_name: Juurlink, Bernhardus last_name: Juurlink citation: ama: Bonorden O, Rieping I, von Otte I, Juurlink B. PUB-Library, Release 7.0, User Guide and Function Reference.; 2000. apa: Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (2000). PUB-Library, Release 7.0, User Guide and Function Reference. 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} }' chicago: Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. PUB-Library, Release 7.0, User Guide and Function Reference, 2000. ieee: O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference. 2000. mla: Bonorden, Olaf, et al. PUB-Library, Release 7.0, User Guide and Function Reference. 2000. short: O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000. date_created: 2020-09-28T12:20:20Z date_updated: 2022-01-06T06:54:10Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-09-28T12:20:10Z date_updated: 2020-09-28T12:20:10Z file_id: '19734' file_name: pub-hni-1656.pdf file_size: 271118 relation: main_file success: 1 file_date_updated: 2020-09-28T12:20:10Z has_accepted_license: '1' language: - iso: eng status: public title: PUB-Library, Release 7.0, User Guide and Function Reference type: report user_id: '15415' year: '2000' ... --- _id: '19849' author: - first_name: M. full_name: Bednara, M. last_name: Bednara - first_name: O. full_name: Beyer, O. last_name: Beyer - first_name: J. full_name: Teich, J. last_name: Teich - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: 'Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP). ; 2000:299-308. doi:10.1109/asap.2000.862400' apa: Bednara, M., Beyer, O., Teich, J., & Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308. https://doi.org/10.1109/asap.2000.862400 bibtex: '@inproceedings{Bednara_Beyer_Teich_Wanka_2000, title={Tradeoff analysis and architecture design of a hybrid hardware/software sorter}, DOI={10.1109/asap.2000.862400}, 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} }' chicago: Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” In Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 299–308, 2000. https://doi.org/10.1109/asap.2000.862400. ieee: 'M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi: 10.1109/asap.2000.862400.' mla: Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308, doi:10.1109/asap.2000.862400. 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.' date_created: 2020-10-02T10:30:38Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/asap.2000.862400 language: - iso: eng page: 299-308 publication: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP) publication_identifier: isbn: - '0769507166' publication_status: published status: public title: Tradeoff analysis and architecture design of a hybrid hardware/software sorter type: conference user_id: '15415' year: '2000' ... --- _id: '2143' author: - first_name: Micah full_name: Adler, Micah last_name: Adler - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006 apa: Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006 bibtex: '@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }' chicago: 'Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.' ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000. mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006. short: M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391. date_created: 2018-04-03T05:51:02Z date_updated: 2022-01-06T06:54:59Z department: - _id: '79' - _id: '63' doi: 10.1007/s002240010006 intvolume: ' 33' issue: 5/6 language: - iso: eng page: 337--391 publication: Theory Comput. Syst. status: public title: Efficient Communication Strategies for Ad Hoc Wireless Networks type: journal_article user_id: '14955' volume: 33 year: '2000' ... --- _id: '2145' author: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Berthold full_name: Vöcking, Berthold last_name: Vöcking citation: ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431' apa: 'Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431' bibtex: '@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }' chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.' ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000.' mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.' short: C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155. date_created: 2018-04-03T06:12:15Z date_updated: 2022-01-06T06:55:00Z department: - _id: '79' - _id: '63' doi: 10.1137/S0097539799353431 intvolume: ' 30' issue: '4' language: - iso: eng page: 1126--1155 publication: SIAM J. Comput. status: public title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols' type: journal_article user_id: '14955' volume: 30 year: '2000' ... --- _id: '2146' author: - first_name: Petra full_name: Berenbrink, Petra last_name: Berenbrink - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.' apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA. 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} }' chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000. ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000. mla: Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000. short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.' date_created: 2018-04-03T06:13:07Z date_updated: 2022-01-06T06:55:00Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:47:50Z date_updated: 2018-04-12T08:47:50Z file_id: '2299' file_name: PDPTA-00.pdf file_size: 168677 relation: main_file file_date_updated: 2018-04-12T08:47:50Z has_accepted_license: '1' language: - iso: eng oa: '1' publication: PDPTA status: public title: Distributed Path Selection for Storage Networks type: conference urn: '21467' user_id: '14955' year: '2000' ... --- _id: '2147' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.' apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (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} }' chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.' ieee: 'A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.' mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.' short: 'A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.' date_created: 2018-04-03T06:16:48Z date_updated: 2022-01-06T06:55:00Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:36:17Z date_updated: 2018-04-12T08:36:17Z file_id: '2295' file_name: SODA-00.pdf file_size: 185001 relation: main_file file_date_updated: 2018-04-12T08:36:17Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 30--39 publication: SODA status: public title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma' type: conference urn: '21476' user_id: '14955' year: '2000' ... --- _id: '2148' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.' apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 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} }' chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.' ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.' mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.' short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237. date_created: 2018-04-03T06:17:52Z date_updated: 2022-01-06T06:55:00Z department: - _id: '79' - _id: '63' intvolume: ' 17' issue: 3-4 language: - iso: eng page: 213--237 publication: Random Struct. Algorithms status: public title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma' type: journal_article user_id: '14955' volume: 17 year: '2000' ... --- _id: '2149' author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.' apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (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} }' chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000. ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128. mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128. short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.' date_created: 2018-04-03T06:18:45Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:38:13Z date_updated: 2018-04-12T08:38:13Z file_id: '2297' file_name: spaa_00.pdf file_size: 222176 relation: main_file file_date_updated: 2018-04-12T08:38:13Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 119--128 publication: SPAA status: public title: Efficient, distributed data placement strategies for storage area networks (extended abstract) type: conference urn: '21493' user_id: '14955' year: '2000' ... --- _id: '2150' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler 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: STOC. ACM; 2000:38--47.' apa: Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM. 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} }' 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 STOC, 38--47. ACM, 2000. 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 STOC, 2000, pp. 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).” STOC, ACM, 2000, pp. 38--47. short: 'A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.' date_created: 2018-04-03T06:21:11Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:49:23Z date_updated: 2018-04-12T08:49:23Z file_id: '2300' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:49:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38--47 publication: STOC publisher: ACM status: public title: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) type: conference urn: '21509' user_id: '14955' year: '2000' ... --- _id: '17865' abstract: - lang: eng 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. author: - first_name: Michael full_name: Wand, Michael last_name: Wand - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Wand M, Fischer M, Meyer auf der Heide F. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn; 2000. apa: Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn. 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} }' chicago: Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000. ieee: M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000. mla: Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000. 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. date_created: 2020-08-12T13:27:52Z date_updated: 2022-01-06T06:53:21Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-12T13:27:33Z date_updated: 2020-08-12T13:27:33Z file_id: '17866' file_name: tr-ri-00-217.pdf file_size: 921817 relation: main_file success: 1 file_date_updated: 2020-08-12T13:27:33Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn status: public title: Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes type: report user_id: '15415' year: '2000' ... --- _id: '18962' author: - first_name: Sathish full_name: Govindarajan, Sathish last_name: Govindarajan - first_name: Tamas full_name: Lukovszki, Tamas last_name: Lukovszki - first_name: Anil full_name: Maheshwari, Anil last_name: Maheshwari - first_name: Norbert full_name: Zeh, Norbert last_name: Zeh citation: ama: 'Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3' apa: Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3 bibtex: '@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={10.1007/s00453-005-1197-3}, 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} }' chicago: Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3. ieee: S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614. mla: Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3. 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.' date_created: 2020-09-03T13:21:02Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' doi: 10.1007/s00453-005-1197-3 language: - iso: eng page: 585-614 publication: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS publication_identifier: issn: - 0178-4617 - 1432-0541 publication_status: published status: public title: I/O-Efficient Well-Separated Pair Decomposition and Applications type: conference user_id: '15415' year: '2000' ... --- _id: '17990' abstract: - lang: eng 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. author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15' apa: 'Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15' bibtex: '@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={10.1007/3-540-45253-2_15}, 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} }' chicago: 'Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-45253-2_15.' ieee: A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166. mla: Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15. 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.' date_created: 2020-08-14T13:48:54Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/3-540-45253-2_15 intvolume: ' 4698' language: - iso: eng page: 155-166 place: Berlin, Heidelberg publication: Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00) publication_identifier: isbn: - '9783540410041' - '9783540452539' issn: - 0302-9743 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Property Testing in Computational Geometry type: conference user_id: '15415' volume: 4698 year: '2000' ... --- _id: '18146' abstract: - lang: eng 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.' author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Vasco full_name: Brattka, Vasco last_name: Brattka citation: ama: 'Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34' apa: 'Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34' bibtex: '@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={10.1007/3-540-44411-4_34}, booktitle={SOFSEM 2000: Theory and Practice of Informatics}, publisher={Springer}, author={Ziegler, Martin and Brattka, Vasco}, year={2000}, pages={450–458} }' chicago: 'Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.' ieee: 'M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.' mla: 'Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.' short: 'M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.' date_created: 2020-08-24T09:58:56Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' doi: 10.1007/3-540-44411-4_34 intvolume: ' 1963' language: - iso: eng page: 450-458 place: Berlin, Heidelberg publication: 'SOFSEM 2000: Theory and Practice of Informatics' publication_identifier: isbn: - '9783540413486' - '9783540444114' issn: - 0302-9743 publication_status: published publisher: Springer status: public title: Computing the Dimension of Linear Subspaces type: conference user_id: '15415' volume: 1963 year: '2000' ... --- _id: '18150' abstract: - lang: eng 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.
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).
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. author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Ziegler M, Sohler C. Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00). ; 2000:73-79.' apa: Ziegler, M., & Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 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} }' chicago: Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000. ieee: M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79. mla: Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 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.' date_created: 2020-08-24T10:10:40Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' language: - iso: eng page: 73-79 publication: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00) status: public title: Computing Cut Numbers type: conference user_id: '15415' year: '2000' ... --- _id: '18446' 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(Journal of the ACM. 2000;45:944-967. doi:10.1145/355483.355490' apa: 'Lorys, K., Wanka, R., Oesterdiekhoff, B., & Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967. https://doi.org/10.1145/355483.355490' bibtex: '@article{Lorys_Wanka_Oesterdiekhoff_Kutylowski_2000, title={Periodification Scheme: Constructing Sorting Networks with Constant Period}, volume={45}, DOI={10.1145/355483.355490}, journal={Journal of the ACM}, author={Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, year={2000}, pages={944–967} }' chicago: 'Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM 45 (2000): 944–67. https://doi.org/10.1145/355483.355490.' ieee: 'K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.' mla: 'Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.' short: K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967. date_created: 2020-08-27T11:49:50Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' doi: 10.1145/355483.355490 intvolume: ' 45' language: - iso: eng page: 944-967 publication: Journal of the ACM status: public title: 'Periodification Scheme: Constructing Sorting Networks with Constant Period' type: journal_article user_id: '15415' volume: 45 year: '2000' ... --- _id: '2211' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.' apa: Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (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} }' 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 32nd ACM Symposium on Theory of Computing, 38–47, 2000. 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 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47. mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47. short: 'A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.' date_created: 2018-04-05T07:02:46Z date_updated: 2022-01-06T06:55:26Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:37:23Z date_updated: 2018-04-12T08:37:23Z file_id: '2296' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:37:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38-47 publication: 32nd ACM Symposium on Theory of Computing status: public title: 'A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ' type: conference urn: '22111' user_id: '14955' year: '2000' ... --- _id: '16495' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Harald full_name: Räcke, Harald last_name: Räcke - first_name: Matthias full_name: Westermann, Matthias last_name: Westermann citation: ama: 'Meyer auf der Heide F, Räcke H, Westermann M. Data management in hierarchical bus networks. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00. ; 2000. doi:10.1145/341800.341814' apa: Meyer auf der Heide, F., Räcke, H., & Westermann, M. (2000). Data management in hierarchical bus networks. Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00. https://doi.org/10.1145/341800.341814 bibtex: '@inproceedings{Meyer auf der Heide_Räcke_Westermann_2000, title={Data management in hierarchical bus networks}, DOI={10.1145/341800.341814}, 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} }' chicago: Meyer auf der Heide, Friedhelm, Harald Räcke, and Matthias Westermann. “Data Management in Hierarchical Bus Networks.” In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000. https://doi.org/10.1145/341800.341814. ieee: 'F. Meyer auf der Heide, H. Räcke, and M. Westermann, “Data management in hierarchical bus networks,” 2000, doi: 10.1145/341800.341814.' mla: Meyer auf der Heide, Friedhelm, et al. “Data Management in Hierarchical Bus Networks.” Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’00, 2000, doi:10.1145/341800.341814. 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.' date_created: 2020-04-09T13:06:23Z date_updated: 2022-01-06T06:52:51Z department: - _id: '63' doi: 10.1145/341800.341814 language: - iso: eng publication: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures - SPAA '00 publication_identifier: isbn: - '1581131852' publication_status: published status: public title: Data management in hierarchical bus networks type: conference user_id: '15415' year: '2000' ... --- _id: '16496' abstract: - lang: eng 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. author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Berthold full_name: Vöcking, Berthold last_name: Vöcking - first_name: Matthias full_name: Westermann, Matthias last_name: Westermann citation: ama: 'Meyer auf der Heide F, Vöcking B, Westermann M. Caching in networks. In: SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. ; 2000:430–439.' apa: 'Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (2000). Caching in networks. In SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (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} }' chicago: 'Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann. “Caching in Networks.” In SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 430–439, 2000.' ieee: 'F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Caching in networks,” in SODA ’00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, 2000, pp. 430–439.' mla: 'Meyer auf der Heide, Friedhelm, et al. “Caching in Networks.” SODA ’00: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 430–439.' 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.' date_created: 2020-04-09T13:16:15Z date_updated: 2022-01-06T06:52:51Z department: - _id: '63' language: - iso: eng page: 430–439 publication: 'SODA ''00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms' publication_identifier: isbn: - '0898714532' status: public title: Caching in networks type: conference user_id: '15415' year: '2000' ... --- _id: '16497' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Mirosław full_name: Kutyłowski, Mirosław last_name: Kutyłowski - first_name: Prabhakar full_name: Ragde, Prabhakar last_name: Ragde citation: ama: 'Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms. In: Euro-Par 2000 Parallel Processing. Berlin, Heidelberg; 2000. doi:10.1007/3-540-44520-x_59' apa: Meyer auf der Heide, F., Kutyłowski, M., & Ragde, P. (2000). Complexity Theory and Algorithms. In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-x_59 bibtex: '@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg}, title={Complexity Theory and Algorithms}, DOI={10.1007/3-540-44520-x_59}, booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }' chicago: Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde. “Complexity Theory and Algorithms.” In Euro-Par 2000 Parallel Processing. Berlin, Heidelberg, 2000. https://doi.org/10.1007/3-540-44520-x_59. ieee: F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and Algorithms,” in Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000. mla: Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.” Euro-Par 2000 Parallel Processing, 2000, doi:10.1007/3-540-44520-x_59. short: 'F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel Processing, Berlin, Heidelberg, 2000.' date_created: 2020-04-09T13:30:45Z date_updated: 2022-01-06T06:52:51Z department: - _id: '63' doi: 10.1007/3-540-44520-x_59 language: - iso: eng place: Berlin, Heidelberg publication: Euro-Par 2000 Parallel Processing publication_identifier: isbn: - '9783540679561' - '9783540445203' issn: - 0302-9743 publication_status: published status: public title: Complexity Theory and Algorithms type: book_chapter user_id: '15415' year: '2000' ...