[{"publication_identifier":{"isbn":["9783540630661","9783642608315"],"issn":["1431-472X"]},"publication_status":"published","date_created":"2020-04-16T10:48:16Z","status":"public","department":[{"_id":"63"}],"publication":"Informatik ’97 Informatik als Innovationsmotor","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Decker","full_name":"Decker, Thomas","first_name":"Thomas"}],"title":"Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”","user_id":"15415","place":"Berlin, Heidelberg","citation":{"short":"F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor, Berlin, Heidelberg, 1997.","ieee":"F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.","apa":"Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_22","ama":"Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22","chicago":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg, 1997. https://doi.org/10.1007/978-3-642-60831-5_22.","mla":"Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’” Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.","bibtex":"@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications”}, DOI={10.1007/978-3-642-60831-5_22}, booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf der Heide, Friedhelm and Decker, Thomas}, year={1997} }"},"year":"1997","type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-60831-5_22","date_updated":"2022-01-06T06:52:54Z","_id":"16693"},{"language":[{"iso":"eng"}],"type":"journal_article","citation":{"chicago":"Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I (1996): 299–306.","ama":"Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.","apa":"Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I, 299–306.","mla":"Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 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} }","short":"F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306.","ieee":"F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp. 299–306, 1996."},"year":"1996","page":"299-306","_id":"19958","date_updated":"2022-01-06T06:54:17Z","author":[{"last_name":"Schwarze","first_name":"Frank","full_name":"Schwarze, Frank"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Schröder, Klaus","first_name":"Klaus","last_name":"Schröder"}],"publication":"Euro-Par 1996","department":[{"_id":"63"}],"status":"public","date_created":"2020-10-08T12:04:41Z","volume":"I","user_id":"15415","title":"Routing on Networks of Optical Crossbars (Extended Abstract)."},{"title":"Contention Resolution in Hashing Based Shared Memory Simulations","user_id":"15415","date_created":"2020-07-27T13:03:41Z","status":"public","department":[{"_id":"63"}],"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"_id":"17418","date_updated":"2022-01-06T06:53:11Z","type":"report","year":"1996","citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations. 1996.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 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} }","mla":"Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996."},"report_number":"tr-rsfb-96-005","language":[{"iso":"eng"}],"series_title":"Technical Report SFB, University of Paderborn"},{"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"}],"user_id":"15415","title":"A lower bound for randomized algebraic decision trees","publication":"Proc. of 28th ACM-STOC","department":[{"_id":"63"}],"author":[{"last_name":"Grigoriev","first_name":"Dima","full_name":"Grigoriev, Dima"},{"full_name":"Karpinski, Marek","first_name":"Marek","last_name":"Karpinski"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Smolensky","full_name":"Smolensky, Roman","first_name":"Roman"}],"publisher":"Eurographics Symposium on Parallel Graphics and Visualization","date_created":"2020-07-27T13:09:09Z","status":"public","volume":65453,"intvolume":" 65453","_id":"17419","date_updated":"2022-01-06T06:53:11Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"page":"612-621","type":"conference","year":"1996","citation":{"chicago":"Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.","ama":"Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.","apa":"Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In Proc. of 28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.","mla":"Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, 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} }","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.","ieee":"D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC, 1996, vol. 65453, pp. 612–621."}},{"file_date_updated":"2020-08-26T10:15:36Z","publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","publisher":"IOS Press","author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","id":"146","last_name":"Fischer"},{"last_name":"Rethmann","first_name":"Jochen","full_name":"Rethmann, Jochen"},{"last_name":"Wachsmann","first_name":"Alf","full_name":"Wachsmann, Alf"}],"file":[{"file_name":"hni-1454.pdf","date_created":"2020-08-26T10:15:36Z","access_level":"closed","file_id":"18354","creator":"koala","file_size":285707,"relation":"main_file","success":1,"date_updated":"2020-08-26T10:15:36Z","content_type":"application/pdf"}],"date_created":"2020-07-30T14:45:12Z","status":"public","has_accepted_license":"1","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"}],"ddc":["000"],"user_id":"15415","page":"13–27","citation":{"apa":"Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27). Amsterdam: IOS Press.","ama":"Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 13–27. Amsterdam: IOS Press, 1996.","mla":"Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, 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} }","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.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27."},"type":"conference","year":"1996","_id":"17483","department":[{"_id":"63"}],"publication_identifier":{"isbn":["905199267X"]},"place":"Amsterdam","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:13Z"},{"date_updated":"2022-01-06T06:53:15Z","_id":"17564","doi":"10.1007/bfb0024725","page":"369-376","year":"1996","type":"book_chapter","citation":{"mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.","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={10.1007/bfb0024725}, 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} }","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 Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.","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: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725","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 Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 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."},"language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","user_id":"15415","publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"},{"last_name":"Dittrich","full_name":"Dittrich, Wolfgang","first_name":"Wolfgang"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Ingo","full_name":"Rieping, Ingo","last_name":"Rieping"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540616276","9783540706366"]},"publication_status":"published","date_created":"2020-08-03T13:11:02Z","status":"public"},{"date_updated":"2022-01-06T06:53:30Z","_id":"18352","language":[{"iso":"eng"}],"year":"1996","type":"report","citation":{"ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 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.","mla":"Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.","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} }","apa":"Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn.","ama":"Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn; 1996.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996."},"user_id":"15415","ddc":["000"],"title":"A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware","place":"Universität Paderborn","abstract":[{"lang":"eng","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 multilinear 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 online the optimal parameter values for an access to a global variable achieves good speed ups.\r\n"}],"has_accepted_license":"1","status":"public","date_created":"2020-08-26T10:06:31Z","file":[{"success":1,"relation":"main_file","date_updated":"2020-08-26T10:05:35Z","content_type":"application/pdf","file_id":"18353","creator":"koala","file_size":519632,"access_level":"closed","date_created":"2020-08-26T10:05:35Z","file_name":"tr-rsfb-96-007.pdf"}],"author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Rethmann","full_name":"Rethmann, Jochen","first_name":"Jochen"},{"first_name":"Alf","full_name":"Wachsmann, Alf","last_name":"Wachsmann"}],"department":[{"_id":"63"}],"file_date_updated":"2020-08-26T10:05:35Z"},{"date_created":"2018-04-03T09:29:45Z","status":"public","department":[{"_id":"79"},{"_id":"63"}],"publisher":"University of Paderborn, Germany","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Universal routing strategies","user_id":"14955","type":"dissertation","year":"1996","citation":{"ieee":"C. Scheideler, Universal routing strategies. University of Paderborn, Germany, 1996.","short":"C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996.","bibtex":"@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }","mla":"Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.","chicago":"Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.","apa":"Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany.","ama":"Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:15Z","_id":"2181"},{"date_updated":"2022-01-06T06:55:16Z","_id":"2182","doi":"10.1016/0304-3975(96)00032-1","issue":"2","page":"245--281","year":"1996","type":"journal_article","citation":{"bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1","apa":"Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281."},"language":[{"iso":"eng"}],"title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","user_id":"14955","publication":"Theor. Comput. Sci.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"date_created":"2018-04-03T09:30:20Z","status":"public"},{"language":[{"iso":"eng"}],"page":"370--379","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (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} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379."},"type":"conference","year":"1996","urn":"21832","date_updated":"2022-01-06T06:55:17Z","_id":"2183","oa":"1","file":[{"relation":"main_file","date_updated":"2018-04-12T07:10:17Z","content_type":"application/pdf","file_id":"2281","creator":"florida","file_size":248409,"access_level":"open_access","file_name":"FOCS96.pdf","date_created":"2018-04-12T07:01:11Z"}],"department":[{"_id":"79"},{"_id":"63"}],"publication":"FOCS","file_date_updated":"2018-04-12T07:10:17Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-04-03T09:31:52Z","status":"public","has_accepted_license":"1","user_id":"14955","title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","ddc":["040"]},{"intvolume":" 1175","_id":"2184","urn":"21840","year":"1996","citation":{"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.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.","ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33.","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33."},"type":"conference","page":"16--33","ddc":["040"],"user_id":"14955","volume":1175,"has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:32:47Z","publisher":"Springer","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"SOFSEM","file_date_updated":"2018-04-12T07:10:36Z","file":[{"file_size":597639,"file_id":"2282","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T07:10:36Z","relation":"main_file","date_created":"2018-04-12T07:01:59Z","file_name":"SOFSEM96.pdf","access_level":"open_access"}],"oa":"1","date_updated":"2022-01-06T06:55:17Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Communication in Parallel Systems","department":[{"_id":"79"},{"_id":"63"}]},{"date_updated":"2022-01-06T06:55:18Z","oa":"1","language":[{"iso":"eng"}],"title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","department":[{"_id":"79"},{"_id":"63"}],"_id":"2186","urn":"21868","citation":{"short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.","ieee":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365.","chicago":"Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.","ama":"Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.","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} }"},"type":"conference","year":"1996","page":"356--365","ddc":["040"],"user_id":"14955","publisher":"ACM","author":[{"last_name":"Cypher","first_name":"Robert","full_name":"Cypher, Robert"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"file_date_updated":"2018-04-12T07:11:03Z","publication":"STOC","file":[{"date_created":"2018-04-12T06:58:59Z","file_name":"STOC96.pdf","access_level":"open_access","creator":"florida","file_id":"2280","file_size":700595,"relation":"main_file","date_updated":"2018-04-12T07:11:03Z","content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","date_created":"2018-04-03T09:39:17Z"},{"page":"621-630","type":"journal_article","year":"1996","citation":{"ama":"Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. Acta Informatica. 1996:621-630. doi:10.1007/bf03036467","apa":"Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. Acta Informatica, 621–630. https://doi.org/10.1007/bf03036467","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.” Acta Informatica, 1996, 621–30. https://doi.org/10.1007/bf03036467.","bibtex":"@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and error. A new approach to space-bounded learning}, DOI={10.1007/bf03036467}, 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} }","mla":"Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.","short":"F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.","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,” Acta Informatica, pp. 621–630, 1996."},"language":[{"iso":"eng"}],"doi":"10.1007/bf03036467","_id":"16698","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]},"date_created":"2020-04-16T11:40:05Z","status":"public","publication":"Acta Informatica","department":[{"_id":"63"}],"author":[{"last_name":"Ameur","full_name":"Ameur, Foued","first_name":"Foued"},{"full_name":"Fischer, Paul","first_name":"Paul","last_name":"Fischer"},{"last_name":"Höffgen","first_name":"Klaus -U.","full_name":"Höffgen, Klaus -U."},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Trial and error. A new approach to space-bounded learning","user_id":"15415"},{"doi":"10.1007/bf01955042","date_updated":"2022-01-06T06:52:54Z","_id":"16699","page":"413-427","type":"journal_article","year":"1996","citation":{"short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” Algorithmica, pp. 413–427, 1996, doi: 10.1007/bf01955042.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, 413–27. https://doi.org/10.1007/bf01955042.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.","bibtex":"@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly adaptive token distribution}, DOI={10.1007/bf01955042}, journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }"},"language":[{"iso":"eng"}],"title":"Strongly adaptive token distribution","user_id":"15415","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","date_created":"2020-04-16T11:46:56Z","status":"public","publication":"Algorithmica","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}]},{"title":"Efficient PRAM simulation on a distributed memory machine","user_id":"15415","author":[{"full_name":"Karp, R. M.","first_name":"R. M.","last_name":"Karp"},{"first_name":"M.","full_name":"Luby, M.","last_name":"Luby"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"department":[{"_id":"63"}],"publication":"Algorithmica","publication_status":"published","publication_identifier":{"issn":["0178-4617","1432-0541"]},"status":"public","date_created":"2020-04-16T11:50:27Z","date_updated":"2022-01-06T06:52:54Z","_id":"16700","doi":"10.1007/bf01940878","citation":{"ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878","apa":"Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878","chicago":"Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, 517–42. https://doi.org/10.1007/bf01940878.","bibtex":"@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation on a distributed memory machine}, DOI={10.1007/bf01940878}, journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={517–542} }","mla":"Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” Algorithmica, pp. 517–542, 1996."},"year":"1996","type":"journal_article","page":"517-542","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","status":"public","date_created":"2020-04-16T11:53:57Z","author":[{"last_name":"Gil","first_name":"Joseph","full_name":"Gil, Joseph"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"publication":"SIAM Journal on Computing","department":[{"_id":"63"}],"title":"The Tree Model for Hashing: Lower and Upper Bounds","user_id":"15415","type":"journal_article","year":"1996","citation":{"short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.","apa":"Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955. https://doi.org/10.1137/s0097539793255722","ama":"Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722","chicago":"Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, 936–55. https://doi.org/10.1137/s0097539793255722.","mla":"Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.","bibtex":"@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model for Hashing: Lower and Upper Bounds}, DOI={10.1137/s0097539793255722}, journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }"},"page":"936-955","language":[{"iso":"eng"}],"doi":"10.1137/s0097539793255722","_id":"16701","date_updated":"2022-01-06T06:52:54Z"},{"_id":"16702","date_updated":"2022-01-06T06:52:54Z","doi":"10.1007/3-540-61440-0","year":"1996","citation":{"chicago":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-61440-0.","apa":"Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0","ama":"Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0","bibtex":"@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={10.1007/3-540-61440-0}, year={1996} }","mla":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata, Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.","short":"F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.","ieee":"F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996."},"type":"book_editor","language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Automata, Languages and Programming, 23rd International Colloquium, ICALP96","user_id":"15415","department":[{"_id":"63"}],"editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Monien, Burkhard","first_name":"Burkhard","last_name":"Monien"}],"publication_identifier":{"isbn":["9783540614401","9783540685807"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","status":"public","date_created":"2020-04-16T13:25:51Z"},{"author":[{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"department":[{"_id":"63"}],"publication":"STACS 96","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540609223","9783540497233"]},"status":"public","date_created":"2020-04-16T13:32:22Z","place":"Berlin, Heidelberg","title":"Fault-tolerant shared memory simulations","user_id":"15415","type":"book_chapter","citation":{"short":"P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.","apa":"Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16","ama":"Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.” In STACS 96. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-60922-9_16.","bibtex":"@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg}, title={Fault-tolerant shared memory simulations}, DOI={10.1007/3-540-60922-9_16}, booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996} }","mla":"Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS 96, 1996, doi:10.1007/3-540-60922-9_16."},"year":"1996","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:54Z","_id":"16703","doi":"10.1007/3-540-60922-9_16"},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"1995","type":"dissertation","citation":{"ieee":"V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","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} }","mla":"Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ama":"Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations. Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","apa":"Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"intvolume":" 3","_id":"19623","date_updated":"2022-01-06T06:54:08Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"department":[{"_id":"63"},{"_id":"26"}],"status":"public","date_created":"2020-09-22T12:28:47Z","volume":3,"publication_identifier":{"isbn":["3-931466-02-7"]},"user_id":"5786","title":"Contention Resolution in Hashing Based Shared Memory Simulations"},{"ddc":["000"],"user_id":"5786","volume":8,"date_created":"2020-09-22T12:38:29Z","has_accepted_license":"1","status":"public","file_date_updated":"2020-09-22T12:38:15Z","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","file":[{"file_id":"19629","creator":"koala","file_size":801624,"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2020-09-22T12:38:15Z","date_created":"2020-09-22T12:38:15Z","file_name":"pub-hni-441.pdf","access_level":"closed"}],"intvolume":" 8","_id":"19627","year":"1995","citation":{"short":"A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ieee":"A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Vol. 8. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","mla":"Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. 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} }"},"type":"dissertation","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations","publication_identifier":{"isbn":["3-931466-07-8"]},"department":[{"_id":"63"},{"_id":"26"}],"date_updated":"2022-01-06T06:54:09Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn"},{"volume":6,"publication_identifier":{"isbn":["3-931466-05-1"]},"date_created":"2020-09-22T12:40:46Z","status":"public","department":[{"_id":"63"},{"_id":"26"}],"author":[{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher","user_id":"5786","citation":{"mla":"Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","bibtex":"@book{Wachsmann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher}, volume={6}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Wachsmann, Alf}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","chicago":"Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Vol. 6. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Wachsmann, A. (1995). Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher (Vol. 6). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Wachsmann A. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher. Vol 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","ieee":"A. Wachsmann, Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher, vol. 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995."},"type":"dissertation","year":"1995","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:54:09Z","_id":"19630","intvolume":" 6"},{"title":"Space-Bounded Learning Algorithms","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"author":[{"last_name":"Ameur","full_name":"Ameur, Foued","first_name":"Foued"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":10,"publication_identifier":{"isbn":["3-931466-09-4"]},"date_created":"2020-09-22T12:50:36Z","status":"public","intvolume":" 10","_id":"19634","date_updated":"2022-01-06T06:54:09Z","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"ieee":"F. Ameur, Space-Bounded Learning Algorithms, vol. 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","mla":"Ameur, Foued. Space-Bounded Learning Algorithms. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","bibtex":"@book{Ameur_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Space-Bounded Learning Algorithms}, volume={10}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ameur, Foued}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Ameur F. Space-Bounded Learning Algorithms. Vol 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","apa":"Ameur, F. (1995). Space-Bounded Learning Algorithms (Vol. 10). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","chicago":"Ameur, Foued. Space-Bounded Learning Algorithms. Vol. 10. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995."},"year":"1995","type":"dissertation","language":[{"iso":"eng"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"_id":"17482","date_updated":"2022-01-06T06:53:12Z","page":"46--59","type":"conference","year":"1995","citation":{"mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Simulating shared memory in real time: On the computation power of reconfigurable meshes}, booktitle={Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995}, pages={46--59} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real time: On the computation power of reconfigurable meshes. In: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Simulating shared memory in real time: On the computation power of reconfigurable meshes. In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures (pp. 46--59).","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 46--59, 1995.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory in real time: On the computation power of reconfigurable meshes,” in Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59."},"language":[{"iso":"eng"}],"title":"Simulating shared memory in real time: On the computation power of reconfigurable meshes","user_id":"15415","publication":"Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures","department":[{"_id":"63"}],"author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"date_created":"2020-07-30T14:09:45Z","status":"public"},{"year":"1995","type":"conference","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, series={Lecture Notes in Computer Science}, title={Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}, DOI={10.1007/3-540-60313-1_154}, booktitle={ESA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={341--354}, collection={Lecture Notes in Computer Science} }","ama":"Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154","apa":"Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354). https://doi.org/10.1007/3-540-60313-1_154","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA, 341--354. Lecture Notes in Computer Science, 1995. https://doi.org/10.1007/3-540-60313-1_154.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.","short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354."},"page":"341--354","_id":"2187","urn":"21878","status":"public","has_accepted_license":"1","date_created":"2018-04-03T09:40:55Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"file_date_updated":"2018-04-12T07:09:35Z","publication":"ESA","file":[{"file_name":"ESA95.pdf","date_created":"2018-04-12T06:57:17Z","access_level":"open_access","file_size":177256,"file_id":"2279","creator":"florida","content_type":"application/pdf","date_updated":"2018-04-12T07:09:35Z","relation":"main_file"}],"ddc":["040"],"user_id":"14955","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/3-540-60313-1_154","oa":"1","date_updated":"2022-01-06T06:55:18Z","department":[{"_id":"79"},{"_id":"63"}],"title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks"},{"title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","ddc":["040"],"user_id":"14955","has_accepted_license":"1","status":"public","date_created":"2018-04-04T12:43:41Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T07:09:52Z","publication":"SPAA","file":[{"date_created":"2018-04-12T06:56:32Z","file_name":"SPAA95.pdf","access_level":"open_access","file_size":284222,"creator":"florida","file_id":"2278","date_updated":"2018-04-12T07:09:52Z","content_type":"application/pdf","relation":"main_file"}],"oa":"1","date_updated":"2022-01-06T06:55:24Z","_id":"2207","urn":"22075","type":"conference","year":"1995","citation":{"ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: SPAA. ; 1995:137--146.","apa":"Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146."},"page":"137--146","language":[{"iso":"eng"}]},{"status":"public","has_accepted_license":"1","date_created":"2018-04-04T12:44:26Z","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"publication":"STACS","file_date_updated":"2018-04-12T07:09:13Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"file_size":407467,"creator":"florida","file_id":"2277","date_updated":"2018-04-12T07:09:13Z","content_type":"application/pdf","relation":"main_file","file_name":"STACS95.pdf","date_created":"2018-04-12T06:54:40Z","access_level":"open_access"}],"title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","ddc":["040"],"user_id":"14955","type":"conference","year":"1995","citation":{"short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS, 1995, pp. 267--278.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.","apa":"Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1995}, pages={267--278} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278."},"page":"267--278","language":[{"iso":"eng"}],"oa":"1","_id":"2208","date_updated":"2022-01-06T06:55:24Z","urn":"22085"},{"citation":{"mla":"Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.","bibtex":"@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995}, pages={103–110} }","chicago":"Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.","apa":"Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x","ama":"Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x","ieee":"D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1995.","short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110."},"year":"1995","type":"journal_article","page":"103-110","language":[{"iso":"eng"}],"_id":"16566","date_updated":"2022-01-06T06:52:52Z","doi":"10.1016/s0020-0190(97)00032-x","author":[{"last_name":"Breslauer","full_name":"Breslauer, Dany","first_name":"Dany"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Dubhashi","full_name":"Dubhashi, Devdatt P.","first_name":"Devdatt P."},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Information Processing Letters","department":[{"_id":"63"}],"publication_identifier":{"issn":["0020-0190"]},"publication_status":"published","status":"public","date_created":"2020-04-15T11:28:35Z","title":"Transforming comparison model lower bounds to the parallel-random-access-machine","user_id":"15415"},{"date_updated":"2022-01-06T06:52:54Z","_id":"16704","doi":"10.1007/3-540-59042-0_81","language":[{"iso":"eng"}],"citation":{"mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={10.1007/3-540-59042-0_81}, booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1995} }","ama":"Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81","apa":"Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-59042-0_81.","ieee":"F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995."},"type":"book_chapter","year":"1995","place":"Berlin, Heidelberg","user_id":"15415","title":"A packet routing protocol for arbitrary networks","department":[{"_id":"63"}],"publication":"STACS 95","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"date_created":"2020-04-16T13:36:32Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783540590422","9783540491750"],"issn":["0302-9743","1611-3349"]}},{"date_updated":"2022-01-06T06:52:54Z","_id":"16705","doi":"10.1007/3-540-60313-1_133","language":[{"iso":"eng"}],"citation":{"ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","bibtex":"@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={10.1007/3-540-60313-1_133}, booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","mla":"Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_133","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133."},"type":"book_chapter","year":"1995","place":"Berlin, Heidelberg","user_id":"15415","title":"Shared memory simulations with triple-logarithmic delay","publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"date_created":"2020-04-16T13:40:52Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"publication_status":"published"},{"_id":"16706","date_updated":"2022-01-06T06:52:54Z","doi":"10.1145/215399.215430","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995. https://doi.org/10.1145/215399.215430.","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95. ; 1995. doi:10.1145/215399.215430","apa":"Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95. https://doi.org/10.1145/215399.215430","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995, doi:10.1145/215399.215430.","bibtex":"@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430}, booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}, year={1995} }","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.","ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA ’95, 1995."},"year":"1995","type":"conference","language":[{"iso":"eng"}],"title":"Optimal trade-offs between size and slowdown for universal parallel networks","user_id":"15415","department":[{"_id":"63"}],"publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Storch","full_name":"Storch, Martin","first_name":"Martin"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"publication_identifier":{"isbn":["0897917170"]},"publication_status":"published","date_created":"2020-04-16T13:47:15Z","status":"public"},{"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","department":[{"_id":"63"}],"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"publication_status":"published","publication_identifier":{"isbn":["0818669152"]},"date_created":"2020-04-16T13:49:13Z","status":"public","title":"Improved optimal shared memory simulations, and the power of reconfiguration","user_id":"15415","citation":{"mla":"Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={10.1109/istcs.1995.377051}, booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","apa":"Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: Proceedings Third Israel Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995."},"year":"1995","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:54Z","_id":"16707","doi":"10.1109/istcs.1995.377051"},{"doi":"10.1007/3-540-60618-1_77","_id":"16717","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"type":"book_chapter","year":"1995","citation":{"ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77.","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={10.1007/3-540-60618-1_77}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77.","apa":"Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77","ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60618-1_77"},"user_id":"15415","title":"Hot-potato routing on multi-dimensional tori","place":"Berlin, Heidelberg","date_created":"2020-04-17T07:46:18Z","status":"public","publication_identifier":{"isbn":["9783540606185","9783540484875"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"Graph-Theoretic Concepts in Computer Science","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Westermann","full_name":"Westermann, Matthias","first_name":"Matthias"}]},{"author":[{"first_name":"Armin","full_name":"Bäumker, Armin","last_name":"Bäumker"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"publication_status":"published","status":"public","date_created":"2020-04-27T13:59:05Z","place":"Berlin, Heidelberg","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","user_id":"15415","citation":{"short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131","apa":"Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_131.","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg}, title={Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}, DOI={10.1007/3-540-60313-1_131}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131."},"year":"1995","type":"book_chapter","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:58Z","_id":"16874","doi":"10.1007/3-540-60313-1_131"},{"date_updated":"2022-01-06T06:54:09Z","_id":"19624","type":"dissertation","citation":{"ieee":"R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn, 1994.","short":"R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität Paderborn, 1994.","mla":"Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. 1994.","bibtex":"@book{Wanka_1994, place={Universität Paderborn}, title={Paralleles Sortieren auf mehrdimensionalen Gittern}, author={Wanka, Rolf}, year={1994} }","ama":"Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn; 1994.","apa":"Wanka, R. (1994). Paralleles Sortieren auf mehrdimensionalen Gittern. Universität Paderborn.","chicago":"Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität Paderborn, 1994."},"year":"1994","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"language":[{"iso":"eng"}],"place":"Universität Paderborn","title":"Paralleles Sortieren auf mehrdimensionalen Gittern","ddc":["000"],"user_id":"15415","author":[{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"department":[{"_id":"63"}],"file_date_updated":"2020-09-22T12:32:33Z","file":[{"file_name":"pub-hni-9686.pdf","date_created":"2020-09-22T12:32:33Z","access_level":"closed","file_id":"19625","creator":"koala","file_size":967735,"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2020-09-22T12:32:33Z"}],"status":"public","has_accepted_license":"1","date_created":"2020-09-22T12:32:48Z"},{"user_id":"15415","title":"Dynamic Perfect Hashing: Upper and Lower Bounds","date_created":"2020-04-20T10:19:33Z","status":"public","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","author":[{"full_name":"Dietzfelbinger, Martin","first_name":"Martin","last_name":"Dietzfelbinger"},{"last_name":"Karlin","full_name":"Karlin, Anna","first_name":"Anna"},{"first_name":"Kurt","full_name":"Mehlhorn, Kurt","last_name":"Mehlhorn"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rohnert","first_name":"Hans","full_name":"Rohnert, Hans"},{"last_name":"Tarjan","first_name":"Robert E.","full_name":"Tarjan, Robert E."}],"doi":"10.1137/s0097539791194094","date_updated":"2022-01-06T06:52:55Z","_id":"16728","language":[{"iso":"eng"}],"page":"738-761","citation":{"mla":"Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.","bibtex":"@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994, title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={10.1137/s0097539791194094}, journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.}, year={1994}, pages={738–761} }","chicago":"Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” SIAM Journal on Computing, 1994, 738–61. https://doi.org/10.1137/s0097539791194094.","ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing. 1994:738-761. doi:10.1137/s0097539791194094","apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094","ieee":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal on Computing, pp. 738–761, 1994.","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761."},"type":"journal_article","year":"1994"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"publication_status":"published","editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Monien","first_name":"B.","full_name":"Monien, B."},{"full_name":"Rosenberg, A. L.","first_name":"A. L.","last_name":"Rosenberg"}],"date_created":"2020-07-30T09:49:20Z","status":"public","department":[{"_id":"63"}],"publisher":"Springer","title":"Parallel Architectures and Their Efficient Use","user_id":"15415","place":"Berlin, Heidelberg","type":"book_editor","citation":{"mla":"Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.","bibtex":"@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg}, title={Parallel Architectures and Their Efficient Use}, DOI={10.1007/3-540-56731-3}, publisher={Springer}, year={1993} }","chicago":"Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993. https://doi.org/10.1007/3-540-56731-3.","apa":"Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993). Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-56731-3","ama":"Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3","ieee":"F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.","short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993."},"year":"1993","language":[{"iso":"eng"}],"doi":"10.1007/3-540-56731-3","_id":"17477","date_updated":"2022-01-06T06:53:12Z"},{"date_updated":"2022-01-06T06:53:12Z","_id":"17479","language":[{"iso":"eng"}],"year":"1993","type":"conference","citation":{"short":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.","ieee":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.","apa":"Kastens, U., Meyer auf der Heide, F., Wachsmann, A., & Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).","ama":"Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In: Proc. 3rd PASA Workshop, PARS Mitteilungen. ; 1993:50-55.","chicago":"Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55, 1993.","bibtex":"@inproceedings{Kastens_Meyer auf der Heide_Wachsmann_Wichmann_1993, title={OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)}, booktitle={Proc. 3rd PASA Workshop, PARS Mitteilungen}, author={Kastens, Uwe and Meyer auf der Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}, year={1993}, pages={50–55} }","mla":"Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55."},"page":"50-55","user_id":"15415","title":"OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)","status":"public","date_created":"2020-07-30T10:54:52Z","author":[{"last_name":"Kastens","full_name":"Kastens, Uwe","first_name":"Uwe"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"},{"last_name":"Wichmann","full_name":"Wichmann, Friedrich","first_name":"Friedrich"}],"department":[{"_id":"63"}],"publication":"Proc. 3rd PASA Workshop, PARS Mitteilungen"},{"doi":"10.1006/inco.1993.1007","date_updated":"2022-01-06T06:52:55Z","_id":"16729","language":[{"iso":"eng"}],"page":"196-217","year":"1993","type":"journal_article","citation":{"ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” Information and Computation, pp. 196–217, 1993.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.","bibtex":"@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel Dictionary}, DOI={10.1006/inco.1993.1007}, journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1993}, pages={196–217} }","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” Information and Computation, 1993, 196–217. https://doi.org/10.1006/inco.1993.1007.","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007","ama":"Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. Information and Computation. 1993:196-217. doi:10.1006/inco.1993.1007"},"user_id":"15415","title":"An Optimal Parallel Dictionary","date_created":"2020-04-20T10:31:51Z","status":"public","publication_identifier":{"issn":["0890-5401"]},"publication_status":"published","publication":"Information and Computation","department":[{"_id":"63"}],"author":[{"full_name":"Dietzfelbinger, M.","first_name":"M.","last_name":"Dietzfelbinger"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}]},{"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Oesterdiekhoff","first_name":"Brigitte","full_name":"Oesterdiekhoff, Brigitte"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540569398","9783540478263"]},"publication_status":"published","status":"public","date_created":"2020-04-20T10:33:56Z","place":"Berlin, Heidelberg","title":"Strongly adaptive token distribution","user_id":"15415","citation":{"short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg, 1993.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” In Automata, Languages and Programming. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56939-1_89.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: Automata, Languages and Programming. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56939-1_89","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly adaptive token distribution. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89","bibtex":"@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg}, title={Strongly adaptive token distribution}, DOI={10.1007/3-540-56939-1_89}, booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89."},"type":"book_chapter","year":"1993","language":[{"iso":"eng"}],"_id":"16730","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56939-1_89"},{"user_id":"15415","title":"Simple, efficient shared memory simulations","status":"public","date_created":"2020-04-20T10:35:49Z","publication_status":"published","publication_identifier":{"isbn":["0897915992"]},"author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA '93","doi":"10.1145/165231.165246","date_updated":"2022-01-06T06:52:55Z","_id":"16731","language":[{"iso":"eng"}],"year":"1993","citation":{"chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993. https://doi.org/10.1145/165231.165246.","ama":"Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93. ; 1993. doi:10.1145/165231.165246","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA ’93. https://doi.org/10.1145/165231.165246","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1993, title={Simple, efficient shared memory simulations}, DOI={10.1145/165231.165246}, booktitle={Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA ’93}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1993} }","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993, doi:10.1145/165231.165246.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures - SPAA ’93, 1993."},"type":"conference"},{"date_updated":"2022-01-06T06:52:55Z","_id":"16732","doi":"10.1007/3-540-56503-5_46","type":"book_chapter","year":"1993","citation":{"bibtex":"@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={10.1007/3-540-56503-5_46}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }","mla":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” Lecture Notes in Computer Science, 1993, doi:10.1007/3-540-56503-5_46.","chicago":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56503-5_46.","ama":"Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1993. doi:10.1007/3-540-56503-5_46","apa":"Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46","ieee":"K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993."},"language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","title":"Capabilities and complexity of computations with integer division","user_id":"15415","publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Lürwer-Brüggemeier","full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_status":"published","publication_identifier":{"isbn":["9783540565031","9783540475743"],"issn":["0302-9743","1611-3349"]},"date_created":"2020-04-20T11:25:51Z","status":"public"},{"abstract":[{"lang":"eng","text":"We consider the following periodic sorting procedure on two-dimensional meshes of processors: Initially, each node contains one number. We proceed in rounds each round consisting of sorting the columns of the grid, and, in the second phase, of sorting the rows according to the snake-like ordering. We exactly characterize the number of rounds necessary to sort on an l × m-grid in the worst case, where l is the number of the rows and m the number of the columns. An upper bound of ⌈ log l⌉ + 1was known before. This bound is tight for the case that m is not a power of 2. Surprisingly, it turns out that far fewer rounds are necessary if m is a power of 2 (and m ≪ l) in this case, exactly min { log m + 1, ⌈ log l⌉ + 1} rounds are needed in the worst case."}],"title":"Periodic Sorting on Two-Dimensional Meshes","user_id":"15415","author":[{"full_name":"Kutylowski, Miroslaw","first_name":"Miroslaw","last_name":"Kutylowski"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"department":[{"_id":"63"}],"publication":"Parallel Processing Letters 2","publication_status":"published","publication_identifier":{"issn":["0129-6264","1793-642X"]},"status":"public","date_created":"2020-09-03T11:05:14Z","_id":"18936","date_updated":"2022-01-06T06:53:55Z","doi":"10.1142/s0129626492000349","type":"journal_article","citation":{"chicago":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, 213–20. https://doi.org/10.1142/s0129626492000349.","apa":"Kutylowski, M., & Wanka, R. (1992). Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2, 213–220. https://doi.org/10.1142/s0129626492000349","ama":"Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. Parallel Processing Letters 2. Published online 1992:213-220. doi:10.1142/s0129626492000349","bibtex":"@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional Meshes}, DOI={10.1142/s0129626492000349}, journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka, Rolf}, year={1992}, pages={213–220} }","mla":"Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional Meshes.” Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349.","short":"M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.","ieee":"M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,” Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349."},"year":"1992","page":"213-220","language":[{"iso":"eng"}]},{"year":"1992","citation":{"chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In Data Structures and Efficient Algorithms. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_31.","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In Data structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={10.1007/3-540-55488-2_31}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in Data structures and efficient algorithms, Berlin, Heidelberg, 1992."},"type":"book_chapter","language":[{"iso":"eng"}],"doi":"10.1007/3-540-55488-2_31","date_updated":"2022-01-06T06:52:55Z","_id":"16733","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"status":"public","date_created":"2020-04-20T11:27:50Z","author":[{"full_name":"Dietzfelbinger, Martin","first_name":"Martin","last_name":"Dietzfelbinger"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Data structures and efficient algorithms","title":"High performance universal hashing, with applications to shared memory simulations","user_id":"15415","place":"Berlin, Heidelberg"},{"doi":"10.1007/3-540-56731-3_3","_id":"16734","date_updated":"2022-01-06T06:52:55Z","citation":{"ieee":"F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={10.1007/3-540-56731-3_3}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992, doi:10.1007/3-540-56731-3_3.","apa":"Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_3","ama":"Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1992. doi:10.1007/3-540-56731-3_3","chicago":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-56731-3_3."},"type":"book_chapter","year":"1992","language":[{"iso":"eng"}],"title":"Hashing strategies for simulating shared memory on distributed memory machines","user_id":"15415","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_created":"2020-04-20T11:29:58Z","status":"public","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}]},{"user_id":"15415","title":"On the performance of networks with multiple busses","place":"Berlin, Heidelberg","date_created":"2020-04-20T11:31:58Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540552109","9783540467755"]},"publication_status":"published","department":[{"_id":"63"}],"publication":"STACS 92","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Pham, Hieu Thien","first_name":"Hieu Thien","last_name":"Pham"}],"doi":"10.1007/3-540-55210-3_176","_id":"16735","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"year":"1992","citation":{"short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.","apa":"Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176","ama":"Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176","chicago":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In STACS 92. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55210-3_176.","mla":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.","bibtex":"@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={10.1007/3-540-55210-3_176}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }"},"type":"book_chapter"},{"date_created":"2020-04-20T11:33:22Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["0897915119"]},"publication":"Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92","department":[{"_id":"63"}],"author":[{"last_name":"Karp","first_name":"Richard M.","full_name":"Karp, Richard M."},{"last_name":"Luby","first_name":"Michael","full_name":"Luby, Michael"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"user_id":"15415","title":"Efficient PRAM simulation on a distributed memory machine","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM simulation on a distributed memory machine}, DOI={10.1145/129712.129743}, booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92}, author={Karp, Richard M. and Luby, Michael and Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992, doi:10.1145/129712.129743.","chicago":"Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992. https://doi.org/10.1145/129712.129743.","ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92. ; 1992. doi:10.1145/129712.129743","apa":"Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM simulation on a distributed memory machine. In Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92. https://doi.org/10.1145/129712.129743","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” in Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92, 1992.","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 1992."},"type":"conference","year":"1992","doi":"10.1145/129712.129743","date_updated":"2022-01-06T06:52:55Z","_id":"16736"},{"_id":"16737","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/978-3-322-95233-2_7","year":"1992","type":"book_chapter","citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik, Wiesbaden, 1992.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,” in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992. https://doi.org/10.1007/978-3-322-95233-2_7.","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7","ama":"Dietzfelbinger M, Meyer auf der Heide F. Dynamic Hashing in Real Time. In: TEUBNER-TEXTE Zur Informatik. Wiesbaden; 1992. doi:10.1007/978-3-322-95233-2_7","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic Hashing in Real Time}, DOI={10.1007/978-3-322-95233-2_7}, booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7."},"language":[{"iso":"eng"}],"place":"Wiesbaden","title":"Dynamic Hashing in Real Time","user_id":"15415","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"department":[{"_id":"63"}],"publication":"TEUBNER-TEXTE zur Informatik","publication_status":"published","publication_identifier":{"issn":["1615-4584"],"isbn":["9783815420331","9783322952332"]},"status":"public","date_created":"2020-04-20T11:35:06Z"},{"doi":"10.1007/bfb0032068","_id":"3050","date_updated":"2022-01-06T06:58:54Z","language":[{"iso":"eng"}],"page":"703-716","type":"book_chapter","year":"1990","citation":{"ieee":"H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.","short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.","bibtex":"@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={10.1007/bfb0032068}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }","chicago":"Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.","apa":"Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068","ama":"Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068"},"user_id":"14955","title":"Approximation of convex polygons","place":"Berlin/Heidelberg","extern":"1","date_created":"2018-06-05T08:56:43Z","status":"public","publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","department":[{"_id":"64"},{"_id":"63"}],"publication":"Automata, Languages and Programming","author":[{"first_name":"Helmut","full_name":"Alt, Helmut","last_name":"Alt"},{"full_name":"Blömer, Johannes","first_name":"Johannes","id":"23","last_name":"Blömer"},{"last_name":"Wagener","full_name":"Wagener, Hubert","first_name":"Hubert"}],"publisher":"Springer-Verlag"},{"department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication_status":"published","publication_identifier":{"isbn":["3540528261"]},"date_created":"2020-04-20T11:37:37Z","status":"public","place":"Berlin/Heidelberg","title":"A new universal class of hash functions and dynamic hashing in real time","user_id":"15415","type":"book_chapter","year":"1990","citation":{"bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={A new universal class of hash functions and dynamic hashing in real time}, DOI={10.1007/bfb0032018}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018.","ama":"Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In Automata, Languages and Programming. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0032018.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990."},"language":[{"iso":"eng"}],"_id":"16738","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0032018"},{"_id":"16739","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/bfb0029597","citation":{"short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","ieee":"F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","apa":"Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597","ama":"Meyer auf der Heide F. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597","chicago":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597.","mla":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.","bibtex":"@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={10.1007/bfb0029597}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }"},"year":"1990","type":"book_chapter","language":[{"iso":"eng"}],"place":"Berlin/Heidelberg","title":"Dynamic hashing strategies","user_id":"15415","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_identifier":{"isbn":["3540529535"]},"publication_status":"published","date_created":"2020-04-20T11:39:31Z","status":"public"}]