--- _id: '2179' author: - first_name: Michele full_name: Flammini, Michele last_name: Flammini - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical Networks. In: SPAA. ; 1997:170--179.' apa: Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179). bibtex: '@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele and Scheideler, Christian}, year={1997}, pages={170--179} }' chicago: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997. ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical Networks,” in SPAA, 1997, pp. 170--179. mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179. short: 'M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.' date_created: 2018-04-03T09:17:10Z date_updated: 2022-01-06T06:55:13Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T07:06:34Z date_updated: 2018-04-12T07:11:32Z file_id: '2283' file_name: SPAA97.pdf file_size: 365709 relation: main_file file_date_updated: 2018-04-12T07:11:32Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 170--179 publication: SPAA status: public title: Simple, Efficient Routing Schemes for All-Optical Networks type: conference urn: '21792' user_id: '14955' year: '1997' ... --- _id: '16564' author: - first_name: Dima full_name: Grigoriev, Dima last_name: Grigoriev - first_name: Marek full_name: Karpinski, Marek last_name: Karpinski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Roman full_name: Smolensky, Roman last_name: Smolensky citation: ama: Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. computational complexity. 1997:357-375. doi:10.1007/bf01270387 apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1997). A lower bound for randomized algebraic decision trees. Computational Complexity, 357–375. https://doi.org/10.1007/bf01270387 bibtex: '@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387}, journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375} }' chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387. ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” computational complexity, pp. 357–375, 1997. mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387. short: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational Complexity (1997) 357–375. date_created: 2020-04-15T10:42:43Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1007/bf01270387 language: - iso: eng page: 357-375 publication: computational complexity publication_identifier: issn: - 1016-3328 - 1420-8954 publication_status: published status: public title: A lower bound for randomized algebraic decision trees type: journal_article user_id: '15415' year: '1997' ... --- _id: '16565' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Volker full_name: Stemann, Volker last_name: Stemann citation: ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation. 1997:103-120. doi:10.1006/inco.1997.2642' apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642' bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures}, DOI={10.1006/inco.1997.2642}, journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }' chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.' ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures,” Information and Computation, pp. 103–120, 1997.' mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.” Information and Computation, 1997, pp. 103–20, doi:10.1006/inco.1997.2642.' short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation (1997) 103–120. date_created: 2020-04-15T11:20:09Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1006/inco.1997.2642 language: - iso: eng page: 103-120 publication: Information and Computation publication_identifier: issn: - 0890-5401 publication_status: published status: public title: 'Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures' type: journal_article user_id: '15415' year: '1997' ... --- _id: '16567' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: M. full_name: Storch, M. last_name: Storch - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems. Published online 1997:627-644. doi:10.1007/s002240000071 apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. Theory of Computing Systems, 627–644. https://doi.org/10.1007/s002240000071 bibtex: '@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }' chicago: Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071. ieee: 'F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems, pp. 627–644, 1997, doi: 10.1007/s002240000071.' mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing Systems, 1997, pp. 627–44, doi:10.1007/s002240000071. short: F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644. date_created: 2020-04-15T11:31:05Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1007/s002240000071 language: - iso: eng page: 627-644 publication: Theory of Computing Systems publication_identifier: issn: - 1432-4350 - 1433-0490 publication_status: published status: public title: Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks type: journal_article user_id: '15415' year: '1997' ... --- _id: '16568' abstract: - lang: eng text: "We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n" author: - 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 - first_name: Willy-Bernhard full_name: Strothmann, Willy-Bernhard last_name: Strothmann citation: ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:10.1007/3-540-63397-9_13' apa: Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 1157–1170. https://doi.org/10.1007/3-540-63397-9_13 bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={1157–170}, collection={Lecture Notes in Computer Science} }' chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.' ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 1157–170, doi: 10.1007/3-540-63397-9_13.' mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 1157–70, doi:10.1007/3-540-63397-9_13. short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.' date_created: 2020-04-15T11:44:36Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1007/3-540-63397-9_13 intvolume: ' 1284' language: - iso: eng page: 1157 - 170 place: Berlin, Heidelberg publication: 5th Annual European Symposium on Algorithms (ESA '97) publication_identifier: isbn: - '9783540633976' - '9783540695363' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Dynamic data structures for realtime management of large geometric scenes type: conference user_id: '15415' volume: 1284 year: '1997' ... --- _id: '16569' 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 citation: ama: 'Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716' apa: Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002716 bibtex: '@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={10.1007/bfb0002716}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }' chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002716. ieee: F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997. mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716. short: 'F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.' date_created: 2020-04-15T11:47:28Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1007/bfb0002716 language: - iso: eng place: Berlin, Heidelberg publication: Euro-Par'97 Parallel Processing publication_identifier: isbn: - '9783540634409' - '9783540695493' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Static and dynamic data management in networks type: book_chapter user_id: '15415' year: '1997' ... --- _id: '16604' author: - first_name: Petra full_name: Berenbrink, Petra last_name: Berenbrink - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Klaus full_name: Schröder, Klaus last_name: Schröder citation: ama: 'Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97. ; 1997. doi:10.1145/258492.258522' apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97. https://doi.org/10.1145/258492.258522 bibtex: '@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating weighted jobs in parallel}, DOI={10.1145/258492.258522}, booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1997} }' chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522. ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’97, 1997. mla: Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997, doi:10.1145/258492.258522. short: 'P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’97, 1997.' date_created: 2020-04-16T06:18:07Z date_updated: 2022-01-06T06:52:53Z department: - _id: '63' doi: 10.1145/258492.258522 language: - iso: eng publication: Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 publication_identifier: isbn: - '0897918908' publication_status: published status: public title: Allocating weighted jobs in parallel type: conference user_id: '15415' year: '1997' ... --- _id: '16605' author: - first_name: Armin full_name: Bäumker, Armin last_name: Bäumker - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg; 1997. doi:10.1007/3-540-63138-0_21' apa: Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21 bibtex: '@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={10.1007/3-540-63138-0_21}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }' chicago: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21. ieee: A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997. mla: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” Solving Irregularly Structured Problems in Parallel, 1997, doi:10.1007/3-540-63138-0_21. short: 'A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.' date_created: 2020-04-16T06:22:32Z date_updated: 2022-01-06T06:52:53Z department: - _id: '63' doi: 10.1007/3-540-63138-0_21 language: - iso: eng place: Berlin, Heidelberg publication: Solving Irregularly Structured Problems in Parallel publication_identifier: isbn: - '9783540631385' - '9783540691570' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Communication efficient parallel searching type: book_chapter user_id: '15415' year: '1997' ... --- _id: '16687' author: - first_name: Efstratios full_name: Karaivazoglou, Efstratios last_name: Karaivazoglou - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741' apa: Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg. https://doi.org/10.1007/bfb0002741 bibtex: '@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }' chicago: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing. Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741. ieee: E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997. mla: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741. short: 'E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.' date_created: 2020-04-16T10:41:06Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1007/bfb0002741 language: - iso: eng place: Berlin, Heidelberg publication: Euro-Par'97 Parallel Processing publication_identifier: isbn: - '9783540634409' - '9783540695493' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Routing on asyncronous processor networks type: book_chapter user_id: '15415' year: '1997' ... --- _id: '16689' author: - first_name: B.M. full_name: Maggs, B.M. last_name: Maggs - 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: 'Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality for data management in systems of limited bandwidth. In: Proceedings 38th Annual Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117' apa: Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. Proceedings 38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117 bibtex: '@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117}, booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science}, author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and Westermann, Matthias}, year={1997} }' chicago: Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” In Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997. https://doi.org/10.1109/sfcs.1997.646117. ieee: 'B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.' mla: Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997, doi:10.1109/sfcs.1997.646117. short: 'B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings 38th Annual Symposium on Foundations of Computer Science, 1997.' date_created: 2020-04-16T10:44:29Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1109/sfcs.1997.646117 language: - iso: eng publication: Proceedings 38th Annual Symposium on Foundations of Computer Science publication_identifier: isbn: - '0818681977' publication_status: published status: public title: Exploiting locality for data management in systems of limited bandwidth type: conference user_id: '15415' year: '1997' ...