[{"doi":"10.1007/3-540-63397-9_13","date_updated":"2026-02-23T16:05:33Z","author":[{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard","first_name":"Willy-Bernhard"}],"volume":1284,"place":"Berlin, Heidelberg","citation":{"chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>.","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","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. 157–170.","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={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, 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={157–170}, collection={Lecture Notes in Computer Science} }","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>"},"page":"157-170","intvolume":"      1284","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"_id":"16568","user_id":"14972","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"status":"public","type":"conference","title":"Dynamic data structures for realtime management of large geometric scenes","publisher":"Springer","date_created":"2020-04-15T11:44:36Z","year":"1997","language":[{"iso":"eng"}],"abstract":[{"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","lang":"eng"}],"publication":"5th Annual European Symposium on Algorithms (ESA '97)"},{"type":"journal_article","publication":"Euro-Par 1996","status":"public","_id":"19958","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"year":"1996","citation":{"apa":"Schwarze, F., Meyer auf der Heide, F., &#38; Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>, <i>I</i>, 299–306.","short":"F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.","bibtex":"@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par 1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1996}, pages={299–306} }","mla":"Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” <i>Euro-Par 1996</i>, vol. I, 1996, pp. 299–306.","ama":"Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). <i>Euro-Par 1996</i>. 1996;I:299-306.","chicago":"Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” <i>Euro-Par 1996</i> I (1996): 299–306.","ieee":"F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” <i>Euro-Par 1996</i>, vol. I, pp. 299–306, 1996."},"page":"299-306","date_updated":"2022-01-06T06:54:17Z","author":[{"first_name":"Frank","last_name":"Schwarze","full_name":"Schwarze, Frank"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Schröder","full_name":"Schröder, Klaus","first_name":"Klaus"}],"date_created":"2020-10-08T12:04:41Z","volume":"I","title":"Routing on Networks of Optical Crossbars (Extended Abstract)."},{"department":[{"_id":"63"}],"series_title":"Technical Report SFB, University of Paderborn","user_id":"15415","_id":"17418","language":[{"iso":"eng"}],"type":"report","report_number":"tr-rsfb-96-005","status":"public","date_created":"2020-07-27T13:03:41Z","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Volker","last_name":"Stemann","full_name":"Stemann, Volker"}],"date_updated":"2022-01-06T06:53:11Z","title":"Contention Resolution in Hashing Based Shared Memory Simulations","citation":{"mla":"Czumaj, Artur, et al. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996.","bibtex":"@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University of Paderborn} }","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1996). <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>.; 1996.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Technical Report SFB, University of Paderborn, 1996.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. 1996."},"year":"1996"},{"title":"A lower bound for randomized algebraic decision trees","volume":65453,"author":[{"full_name":"Grigoriev, Dima","last_name":"Grigoriev","first_name":"Dima"},{"full_name":"Karpinski, Marek","last_name":"Karpinski","first_name":"Marek"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Smolensky","full_name":"Smolensky, Roman","first_name":"Roman"}],"date_created":"2020-07-27T13:09:09Z","publisher":"Eurographics Symposium on Parallel Graphics and Visualization","date_updated":"2022-01-06T06:53:11Z","intvolume":"     65453","page":"612-621","citation":{"apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In <i>Proc. of 28th ACM-STOC</i> (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.","short":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Proc. of 28th ACM-STOC</i>, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.","bibtex":"@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996, series={Lecture Notes in Computer Science}, title={A lower bound for randomized algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC}, publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: <i>Proc. of 28th ACM-STOC</i>. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in <i>Proc. of 28th ACM-STOC</i>, 1996, vol. 65453, pp. 612–621.","chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In <i>Proc. of 28th ACM-STOC</i>, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996."},"year":"1996","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","_id":"17419","status":"public","abstract":[{"text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.","lang":"eng"}],"publication":"Proc. of 28th ACM-STOC","type":"conference"},{"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"In this paper we develop a model for communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. The implementation of the service network is done on a free configurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi-linear function. The cost model includes the parameters packet size, send hot spot, and the number of processors accessing global variables. These parameters influence the communication time in a high degree and capture important parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components algorithm (among others) and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programmer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on-line the optimal parameter values for an access to a global variable achieves good speed ups.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":285707,"access_level":"closed","file_id":"18354","file_name":"hni-1454.pdf","date_updated":"2020-08-26T10:15:36Z","date_created":"2020-08-26T10:15:36Z","creator":"koala"}],"publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","publisher":"IOS Press","date_created":"2020-07-30T14:45:12Z","year":"1996","file_date_updated":"2020-08-26T10:15:36Z","_id":"17483","department":[{"_id":"63"}],"user_id":"15415","status":"public","type":"conference","date_updated":"2022-01-06T06:53:13Z","author":[{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Jochen","full_name":"Rethmann, Jochen","last_name":"Rethmann"},{"last_name":"Wachsmann","full_name":"Wachsmann, Alf","first_name":"Alf"}],"place":"Amsterdam","page":"13–27","citation":{"mla":"Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, IOS Press, 1996, pp. 13–27.","short":"M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.","bibtex":"@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996}, pages={13–27} }","apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i> (pp. 13–27). Amsterdam: IOS Press.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 13–27. Amsterdam: IOS Press, 1996.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 1996, pp. 13–27.","ama":"Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>. Amsterdam: IOS Press; 1996:13–27."},"has_accepted_license":"1","publication_identifier":{"isbn":["905199267X"]}},{"department":[{"_id":"63"}],"user_id":"15415","_id":"17564","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","date_created":"2020-08-03T13:11:02Z","author":[{"full_name":"Bäumker, Armin","last_name":"Bäumker","first_name":"Armin"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"date_updated":"2022-01-06T06:53:15Z","doi":"10.1007/bfb0024725","title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","publication_identifier":{"isbn":["9783540616276","9783540706366"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"369-376","citation":{"chicago":"Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In <i>Lecture Notes in Computer Science</i>, 369–76. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>.","ieee":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin, Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}, DOI={<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376} }","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.","mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996, pp. 369–76, doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>.","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>"},"place":"Berlin, Heidelberg","year":"1996"},{"title":"A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware","date_updated":"2022-01-06T06:53:30Z","date_created":"2020-08-26T10:06:31Z","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Jochen","last_name":"Rethmann","full_name":"Rethmann, Jochen"},{"full_name":"Wachsmann, Alf","last_name":"Wachsmann","first_name":"Alf"}],"year":"1996","place":"Universität Paderborn","citation":{"apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn.","bibtex":"@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996} }","mla":"Fischer, Matthias, et al. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. 1996.","short":"M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 1996.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 1996.","ama":"Fischer M, Rethmann J, Wachsmann A. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn; 1996."},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2020-08-26T10:05:35Z","language":[{"iso":"eng"}],"_id":"18352","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"text":"In this report, we develop a cost model for the communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. Because we do not have a parallel computer at our disposal that is equipped with a service network, we emulate the service network on a reconfigurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi­linear function. The cost model includes the parameters packet size, send hot spot (the number of messages sent out by one processor), and number of processors accessing global variables. We show that these parameters influence the communication time in a high degree and capture important parameters like network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication, and Connected Components algorithm, and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony and show that the influence of hot spots to the communication time is not as high as one would expect from theoretical considerations in a synchronous model. Therefore, we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on­line the optimal parameter values for an access to a global variable achieves good speed ups.\r\n","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":519632,"file_name":"tr-rsfb-96-007.pdf","file_id":"18353","access_level":"closed","date_updated":"2020-08-26T10:05:35Z","date_created":"2020-08-26T10:05:35Z","creator":"koala"}],"status":"public","type":"report"},{"date_updated":"2022-01-06T06:55:15Z","publisher":"University of Paderborn, Germany","date_created":"2018-04-03T09:29:45Z","author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"title":"Universal routing strategies","year":"1996","citation":{"bibtex":"@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }","short":"C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.","mla":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996.","apa":"Scheideler, C. (1996). <i>Universal routing strategies</i>. University of Paderborn, Germany.","chicago":"Scheideler, Christian. <i>Universal Routing Strategies</i>. University of Paderborn, Germany, 1996.","ieee":"C. Scheideler, <i>Universal routing strategies</i>. University of Paderborn, Germany, 1996.","ama":"Scheideler C. <i>Universal Routing Strategies</i>. University of Paderborn, Germany; 1996."},"_id":"2181","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"_id":"2182","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theor. Comput. Sci.","status":"public","date_updated":"2022-01-06T06:55:16Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"date_created":"2018-04-03T09:30:20Z","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","doi":"10.1016/0304-3975(96)00032-1","issue":"2","year":"1996","citation":{"bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996, pp. 245--281, doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>.","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor. Comput. Sci.</i>, (2), 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor Comput Sci</i>. 1996;(2):245--281. doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput. Sci.</i>, no. 2, pp. 245--281, 1996."},"page":"245--281"},{"title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","date_updated":"2022-01-06T06:55:17Z","oa":"1","date_created":"2018-04-03T09:31:52Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"1996","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 1996, pp. 370--379.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={370--379} }","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (pp. 370--379).","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In <i>FOCS</i>, 370--379, 1996.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: <i>FOCS</i>. ; 1996:370--379."},"page":"370--379","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-04-12T07:10:17Z","language":[{"iso":"eng"}],"_id":"2183","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"urn":"21832","file":[{"access_level":"open_access","file_name":"FOCS96.pdf","file_id":"2281","file_size":248409,"date_created":"2018-04-12T07:01:11Z","creator":"florida","date_updated":"2018-04-12T07:10:17Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"FOCS"},{"file":[{"date_created":"2018-04-12T07:01:59Z","creator":"florida","date_updated":"2018-04-12T07:10:36Z","access_level":"open_access","file_id":"2282","file_name":"SOFSEM96.pdf","file_size":597639,"content_type":"application/pdf","relation":"main_file"}],"status":"public","urn":"21840","type":"conference","publication":"SOFSEM","language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:10:36Z","ddc":["040"],"user_id":"14955","series_title":"Lecture Notes in Computer Science","department":[{"_id":"79"},{"_id":"63"}],"_id":"2184","citation":{"ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In <i>SOFSEM</i>, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: <i>SOFSEM</i>. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel Systems. In <i>SOFSEM</i> (Vol. 1175, pp. 16--33). Springer.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes in Computer Science}, title={Communication in Parallel Systems}, volume={1175}, booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” <i>SOFSEM</i>, vol. 1175, Springer, 1996, pp. 16--33.","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33."},"intvolume":"      1175","page":"16--33","year":"1996","has_accepted_license":"1","title":"Communication in Parallel Systems","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T09:32:47Z","volume":1175,"publisher":"Springer","date_updated":"2022-01-06T06:55:17Z","oa":"1"},{"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","publisher":"ACM","date_updated":"2022-01-06T06:55:18Z","oa":"1","author":[{"full_name":"Cypher, Robert","last_name":"Cypher","first_name":"Robert"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"date_created":"2018-04-03T09:39:17Z","year":"1996","citation":{"bibtex":"@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM}, author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}, year={1996}, pages={356--365} }","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” <i>STOC</i>, ACM, 1996, pp. 356--365.","short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., &#38; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In <i>STOC</i> (pp. 356--365). ACM.","chicago":"Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In <i>STOC</i>, 356--365. ACM, 1996.","ieee":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in <i>STOC</i>, 1996, pp. 356--365.","ama":"Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: <i>STOC</i>. ACM; 1996:356--365."},"page":"356--365","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:11:03Z","_id":"2186","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"urn":"21868","file":[{"file_size":700595,"access_level":"open_access","file_id":"2280","file_name":"STOC96.pdf","date_updated":"2018-04-12T07:11:03Z","date_created":"2018-04-12T06:58:59Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"STOC"},{"status":"public","type":"journal_article","publication":"Acta Informatica","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16698","citation":{"bibtex":"@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and error. A new approach to space-bounded learning}, DOI={<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>}, journal={Acta Informatica}, author={Ameur, Foued and Fischer, Paul and Höffgen, Klaus -U. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={621–630} }","short":"F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.","mla":"Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” <i>Acta Informatica</i>, 1996, pp. 621–30, doi:<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>.","apa":"Ameur, F., Fischer, P., Höffgen, K.-U., &#38; Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. <i>Acta Informatica</i>, 621–630. <a href=\"https://doi.org/10.1007/bf03036467\">https://doi.org/10.1007/bf03036467</a>","chicago":"Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” <i>Acta Informatica</i>, 1996, 621–30. <a href=\"https://doi.org/10.1007/bf03036467\">https://doi.org/10.1007/bf03036467</a>.","ieee":"F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and error. A new approach to space-bounded learning,” <i>Acta Informatica</i>, pp. 621–630, 1996.","ama":"Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. <i>Acta Informatica</i>. 1996:621-630. doi:<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>"},"page":"621-630","year":"1996","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]},"doi":"10.1007/bf03036467","title":"Trial and error. A new approach to space-bounded learning","date_created":"2020-04-16T11:40:05Z","author":[{"first_name":"Foued","last_name":"Ameur","full_name":"Ameur, Foued"},{"first_name":"Paul","full_name":"Fischer, Paul","last_name":"Fischer"},{"first_name":"Klaus -U.","last_name":"Höffgen","full_name":"Höffgen, Klaus -U."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:54Z"},{"status":"public","publication":"Algorithmica","type":"journal_article","language":[{"iso":"eng"}],"_id":"16699","department":[{"_id":"63"}],"user_id":"15415","year":"1996","page":"413-427","citation":{"bibtex":"@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>}, journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, pp. 413–27, doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1996). Strongly adaptive token distribution. <i>Algorithmica</i>, 413–427. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” <i>Algorithmica</i>, pp. 413–427, 1996, doi: <a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, 413–27. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. <i>Algorithmica</i>. Published online 1996:413-427. doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>"},"publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","title":"Strongly adaptive token distribution","doi":"10.1007/bf01955042","date_updated":"2022-01-06T06:52:54Z","author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff","first_name":"Brigitte"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"date_created":"2020-04-16T11:46:56Z"},{"status":"public","type":"journal_article","publication":"Algorithmica","language":[{"iso":"eng"}],"_id":"16700","user_id":"15415","department":[{"_id":"63"}],"year":"1996","citation":{"ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>. 1996:517-542. doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” <i>Algorithmica</i>, pp. 517–542, 1996.","chicago":"Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, 517–42. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>.","mla":"Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, pp. 517–42, doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>.","bibtex":"@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation on a distributed memory machine}, DOI={<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>}, journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={517–542} }","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.","apa":"Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>, 517–542. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>"},"page":"517-542","publication_status":"published","publication_identifier":{"issn":["0178-4617","1432-0541"]},"title":"Efficient PRAM simulation on a distributed memory machine","doi":"10.1007/bf01940878","date_updated":"2022-01-06T06:52:54Z","author":[{"first_name":"R. M.","full_name":"Karp, R. M.","last_name":"Karp"},{"first_name":"M.","last_name":"Luby","full_name":"Luby, M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-16T11:50:27Z"},{"date_created":"2020-04-16T11:53:57Z","author":[{"first_name":"Joseph","full_name":"Gil, Joseph","last_name":"Gil"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"date_updated":"2022-01-06T06:52:54Z","doi":"10.1137/s0097539793255722","title":"The Tree Model for Hashing: Lower and Upper Bounds","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","page":"936-955","citation":{"chicago":"Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, 936–55. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>.","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” <i>SIAM Journal on Computing</i>, pp. 936–955, 1996.","ama":"Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>. 1996:936-955. doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>, 936–955. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>","short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.","bibtex":"@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model for Hashing: Lower and Upper Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>}, journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }","mla":"Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, pp. 936–55, doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>."},"year":"1996","department":[{"_id":"63"}],"user_id":"15415","_id":"16701","language":[{"iso":"eng"}],"publication":"SIAM Journal on Computing","type":"journal_article","status":"public"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16702","language":[{"iso":"eng"}],"type":"book_editor","status":"public","editor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"}],"date_created":"2020-04-16T13:25:51Z","date_updated":"2022-01-06T06:52:54Z","doi":"10.1007/3-540-61440-0","title":"Automata, Languages and Programming, 23rd International Colloquium, ICALP96","publication_status":"published","publication_identifier":{"isbn":["9783540614401","9783540685807"],"issn":["0302-9743","1611-3349"]},"citation":{"ama":"Meyer auf der Heide F, Monien B, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>","ieee":"F. Meyer auf der Heide and B. Monien, Eds., <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996.","chicago":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>.","apa":"Meyer auf der Heide, F., &#38; Monien, B. (Eds.). (1996). <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>","short":"F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.","bibtex":"@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>}, year={1996} }","mla":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. 1996, doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>."},"year":"1996","place":"Berlin, Heidelberg"},{"status":"public","type":"book_chapter","publication":"STACS 96","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16703","citation":{"apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Stemann, V. (1996). Fault-tolerant shared memory simulations. In <i>STACS 96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>","bibtex":"@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg}, title={Fault-tolerant shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>}, booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996} }","short":"P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.","mla":"Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” <i>STACS 96</i>, 1996, doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>.","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.” In <i>STACS 96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in <i>STACS 96</i>, Berlin, Heidelberg, 1996.","ama":"Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: <i>STACS 96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>"},"year":"1996","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540609223","9783540497233"]},"doi":"10.1007/3-540-60922-9_16","title":"Fault-tolerant shared memory simulations","date_created":"2020-04-16T13:32:22Z","author":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"date_updated":"2022-01-06T06:52:54Z"},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"19623","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"year":"1995","citation":{"bibtex":"@book{Stemann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations}, volume={3}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Stemann, Volker}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","mla":"Stemann, Volker. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Stemann, V. (1995). <i>Contention Resolution in Hashing Based Shared Memory Simulations</i> (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"V. Stemann, <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>, vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Stemann, Volker. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ama":"Stemann V. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995."},"intvolume":"         3","publication_identifier":{"isbn":["3-931466-02-7"]},"title":"Contention Resolution in Hashing Based Shared Memory Simulations","date_updated":"2022-01-06T06:54:08Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-09-22T12:28:47Z","author":[{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"volume":3},{"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"_id":"19627","language":[{"iso":"eng"}],"file_date_updated":"2020-09-22T12:38:15Z","ddc":["000"],"type":"dissertation","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"koala","date_created":"2020-09-22T12:38:15Z","date_updated":"2020-09-22T12:38:15Z","access_level":"closed","file_name":"pub-hni-441.pdf","file_id":"19629","file_size":801624}],"status":"public","date_created":"2020-09-22T12:38:29Z","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"volume":8,"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:09Z","title":"Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations","publication_identifier":{"isbn":["3-931466-07-8"]},"has_accepted_license":"1","citation":{"ama":"Czumaj A. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","ieee":"A. Czumaj, <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>, vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Czumaj, Artur. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Vol. 8. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","bibtex":"@book{Czumaj_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations}, volume={8}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Czumaj, Artur}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Czumaj, Artur. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Czumaj, A. (1995). <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i> (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"intvolume":"         8","year":"1995"}]