[{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"first_name":"Willy-Bernhard","last_name":"Strothmann","full_name":"Strothmann, Willy-Bernhard"}],"year":"1997","title":"Bounded degree spanning trees","status":"public","date_updated":"2022-01-06T06:54:14Z","publication_status":"published","_id":"19869","language":[{"iso":"eng"}],"doi":"10.1007/3-540-63397-9_9","user_id":"15415","citation":{"ama":"Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. ; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>","bibtex":"@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>}, booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)}, author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }","mla":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>.","chicago":"Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.” In <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>.","short":"A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97), 1997.","apa":"Czumaj, A., &#38; Strothmann, W.-B. (1997). Bounded degree spanning trees. <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">https://doi.org/10.1007/3-540-63397-9_9</a>","ieee":"A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_9\">10.1007/3-540-63397-9_9</a>."},"publication":"Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)","abstract":[{"lang":"eng","text":"Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$."}],"date_created":"2020-10-05T07:13:42Z","department":[{"_id":"63"}],"type":"conference"},{"doi":"10.1007/3-540-63397-9_5","date_updated":"2022-01-06T06:58:52Z","publication_status":"published","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"year":"1997","title":"Denesting by bounded degree radicals","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:30:40Z","file":[{"date_created":"2018-06-05T08:31:35Z","creator":"feidens","content_type":"application/pdf","success":1,"file_id":"3030","access_level":"closed","file_size":1656133,"file_name":"DenestingByBoundedDegreeRevised.pdf","date_updated":"2018-06-05T08:31:35Z","relation":"main_file"}],"publication":"Algorithms — ESA '97","ddc":["000"],"user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"3029","page":"53-63","has_accepted_license":"1","status":"public","place":"Berlin, Heidelberg","citation":{"mla":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” <i>Algorithms — ESA ’97</i>, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>.","apa":"Blömer, J. (1997). Denesting by bounded degree radicals. In <i>Algorithms — ESA ’97</i> (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>","ieee":"J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.","chicago":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In <i>Algorithms — ESA ’97</i>, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>.","short":"J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.","ama":"Blömer J. Denesting by bounded degree radicals. In: <i>Algorithms — ESA ’97</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>","bibtex":"@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded degree radicals}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>}, booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={1997}, pages={53–63} }"},"file_date_updated":"2018-06-05T08:31:35Z"},{"date_created":"2020-04-15T11:47:28Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Euro-Par'97 Parallel Processing","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static and dynamic data management in networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1997} }","ama":"Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002716\">10.1007/bfb0002716</a>","ieee":"F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management in networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1997). Static and dynamic data management in networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data Management in Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002716\">https://doi.org/10.1007/bfb0002716</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997."},"language":[{"iso":"eng"}],"_id":"16569","user_id":"15415","doi":"10.1007/bfb0002716","year":"1997","title":"Static and dynamic data management in networks","status":"public","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"publication_identifier":{"isbn":["9783540634409","9783540695493"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:52:52Z"},{"place":"Berlin, Heidelberg","date_created":"2020-04-16T06:22:32Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,” in <i>Solving Irregularly Structured Problems in Parallel</i>, Berlin, Heidelberg, 1997.","mla":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” <i>Solving Irregularly Structured Problems in Parallel</i>, 1997, doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>.","apa":"Bäumker, A., &#38; Meyer auf der Heide, F. (1997). Communication efficient parallel searching. In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>","bibtex":"@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication efficient parallel searching}, DOI={<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>}, booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker, Armin and Meyer auf der Heide, Friedhelm}, year={1997} }","chicago":"Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient Parallel Searching.” In <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63138-0_21\">https://doi.org/10.1007/3-540-63138-0_21</a>.","short":"A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg, 1997.","ama":"Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching. In: <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/3-540-63138-0_21\">10.1007/3-540-63138-0_21</a>"},"publication":"Solving Irregularly Structured Problems in Parallel","language":[{"iso":"eng"}],"_id":"16605","doi":"10.1007/3-540-63138-0_21","user_id":"15415","author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540631385","9783540691570"]},"year":"1997","status":"public","title":"Communication efficient parallel searching","date_updated":"2022-01-06T06:52:53Z","publication_status":"published"},{"author":[{"full_name":"Karaivazoglou, Efstratios","last_name":"Karaivazoglou","first_name":"Efstratios"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540634409","9783540695493"]},"status":"public","title":"Routing on asyncronous processor networks","year":"1997","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","_id":"16687","language":[{"iso":"eng"}],"doi":"10.1007/bfb0002741","user_id":"15415","citation":{"mla":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>.","ama":"Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks. In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>","bibtex":"@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Routing on asyncronous processor networks}, DOI={<a href=\"https://doi.org/10.1007/bfb0002741\">10.1007/bfb0002741</a>}, booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios and Meyer auf der Heide, Friedhelm}, year={1997} }","apa":"Karaivazoglou, E., &#38; Meyer auf der Heide, F. (1997). Routing on asyncronous processor networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>","ieee":"E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.","chicago":"Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous Processor Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg, 1997. <a href=\"https://doi.org/10.1007/bfb0002741\">https://doi.org/10.1007/bfb0002741</a>.","short":"E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997."},"publication":"Euro-Par'97 Parallel Processing","place":"Berlin, Heidelberg","date_created":"2020-04-16T10:41:06Z","department":[{"_id":"63"}],"type":"book_chapter"},{"user_id":"14972","volume":1284,"page":"157-170","_id":"16568","publisher":"Springer","status":"public","place":"Berlin, Heidelberg","citation":{"ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>.","apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>."},"doi":"10.1007/3-540-63397-9_13","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publication_status":"published","date_updated":"2026-02-23T16:05:33Z","intvolume":"      1284","year":"1997","title":"Dynamic data structures for realtime management of large geometric scenes","author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann","first_name":"Willy-Bernhard"}],"publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-15T11:44:36Z","abstract":[{"lang":"eng","text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n"}],"publication":"5th Annual European Symposium on Algorithms (ESA '97)"},{"publication":"Lecture Notes in Computer Science","citation":{"short":"H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.","chicago":"Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-61863-5_33\">https://doi.org/10.1007/3-540-61863-5_33</a>.","apa":"Kleine Büning, H., &#38; Lettmann, T. (1996). Learning a representation for optimizable formulas. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-61863-5_33\">https://doi.org/10.1007/3-540-61863-5_33</a>","ieee":"H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996.","ama":"Kleine Büning H, Lettmann T. Learning a representation for optimizable formulas. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-61863-5_33\">10.1007/3-540-61863-5_33</a>","bibtex":"@inbook{Kleine Büning_Lettmann_1996, place={Berlin, Heidelberg}, title={Learning a representation for optimizable formulas}, DOI={<a href=\"https://doi.org/10.1007/3-540-61863-5_33\">10.1007/3-540-61863-5_33</a>}, booktitle={Lecture Notes in Computer Science}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1996} }","mla":"Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” <i>Lecture Notes in Computer Science</i>, 1996, doi:<a href=\"https://doi.org/10.1007/3-540-61863-5_33\">10.1007/3-540-61863-5_33</a>."},"date_created":"2020-10-01T08:15:08Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"year":"1996","status":"public","title":"Learning a representation for optimizable formulas","author":[{"first_name":"Hans","last_name":"Kleine Büning","full_name":"Kleine Büning, Hans"},{"orcid":"0000-0001-5859-2457","last_name":"Lettmann","first_name":"Theodor","full_name":"Lettmann, Theodor","id":"315"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540618638","9783540707196"]},"publication_status":"published","date_updated":"2022-01-06T06:54:13Z","language":[{"iso":"eng"}],"_id":"19816","user_id":"315","doi":"10.1007/3-540-61863-5_33"},{"place":"Berlin, Heidelberg","date_created":"2020-08-03T13:11:02Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin, Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}, DOI={<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376} }","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>","mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996, pp. 369–76, doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>.","chicago":"Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In <i>Lecture Notes in Computer Science</i>, 369–76. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>.","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.","ieee":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>"},"publication":"Lecture Notes in Computer Science","_id":"17564","language":[{"iso":"eng"}],"page":"369-376","doi":"10.1007/bfb0024725","user_id":"15415","author":[{"full_name":"Bäumker, Armin","last_name":"Bäumker","first_name":"Armin"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540616276","9783540706366"]},"title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","status":"public","year":"1996","date_updated":"2022-01-06T06:53:15Z","publication_status":"published"},{"place":"Berlin, Heidelberg","date_created":"2020-04-16T13:25:51Z","type":"book_editor","department":[{"_id":"63"}],"citation":{"ieee":"F. Meyer auf der Heide and B. Monien, Eds., <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996.","apa":"Meyer auf der Heide, F., &#38; Monien, B. (Eds.). (1996). <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>","chicago":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>.","short":"F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.","mla":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. 1996, doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>.","bibtex":"@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>}, year={1996} }","ama":"Meyer auf der Heide F, Monien B, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>"},"language":[{"iso":"eng"}],"_id":"16702","doi":"10.1007/3-540-61440-0","user_id":"15415","editor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"title":"Automata, Languages and Programming, 23rd International Colloquium, ICALP96","status":"public","year":"1996","publication_identifier":{"isbn":["9783540614401","9783540685807"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:54Z","publication_status":"published"},{"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-16T13:32:22Z","publication":"STACS 96","citation":{"apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Stemann, V. (1996). Fault-tolerant shared memory simulations. In <i>STACS 96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>","ieee":"P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in <i>STACS 96</i>, Berlin, Heidelberg, 1996.","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.” In <i>STACS 96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>.","short":"P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.","mla":"Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” <i>STACS 96</i>, 1996, doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>.","ama":"Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: <i>STACS 96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>","bibtex":"@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg}, title={Fault-tolerant shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>}, booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996} }"},"doi":"10.1007/3-540-60922-9_16","user_id":"15415","language":[{"iso":"eng"}],"_id":"16703","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","title":"Fault-tolerant shared memory simulations","year":"1996","status":"public","author":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Stemann, Volker","first_name":"Volker","last_name":"Stemann"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540609223","9783540497233"]}},{"date_created":"2020-04-16T13:36:32Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in <i>STACS 95</i>, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In <i>STACS 95</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In <i>STACS 95</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” <i>STACS 95</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>}, 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: <i>STACS 95</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>"},"publication":"STACS 95","language":[{"iso":"eng"}],"_id":"16704","user_id":"15415","doi":"10.1007/3-540-59042-0_81","publication_identifier":{"isbn":["9783540590422","9783540491750"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"title":"A packet routing protocol for arbitrary networks","status":"public","year":"1995","publication_status":"published","date_updated":"2022-01-06T06:52:54Z"},{"place":"Berlin, Heidelberg","date_created":"2020-04-16T13:40:52Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","citation":{"bibtex":"@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>}, booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>","mla":"Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>."},"language":[{"iso":"eng"}],"_id":"16705","doi":"10.1007/3-540-60313-1_133","user_id":"15415","year":"1995","status":"public","title":"Shared memory simulations with triple-logarithmic delay","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"date_updated":"2022-01-06T06:52:54Z","publication_status":"published"},{"citation":{"mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>.","ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","apa":"Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>","ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg, 1995.","chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995."},"publication":"Graph-Theoretic Concepts in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-17T07:46:18Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540606185","9783540484875"]},"author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Matthias","last_name":"Westermann","full_name":"Westermann, Matthias"}],"year":"1995","title":"Hot-potato routing on multi-dimensional tori","status":"public","user_id":"15415","doi":"10.1007/3-540-60618-1_77","language":[{"iso":"eng"}],"_id":"16717"},{"publication_status":"published","date_updated":"2022-01-06T06:52:58Z","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"},{"first_name":"Wolfgang","last_name":"Dittrich","full_name":"Dittrich, Wolfgang"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"status":"public","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","year":"1995","user_id":"15415","doi":"10.1007/3-540-60313-1_131","_id":"16874","language":[{"iso":"eng"}],"citation":{"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={<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={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: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","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 <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>.","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 <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>"},"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-27T13:59:05Z","place":"Berlin, Heidelberg"},{"language":[{"iso":"eng"}],"_id":"17477","publisher":"Springer","editor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Monien","first_name":"B.","full_name":"Monien, B."},{"full_name":"Rosenberg, A. L.","last_name":"Rosenberg","first_name":"A. L."}],"user_id":"15415","doi":"10.1007/3-540-56731-3","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"status":"public","year":"1993","title":"Parallel Architectures and Their Efficient Use","publication_status":"published","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T09:49:20Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_editor","citation":{"ama":"Meyer auf der Heide F, Monien B, Rosenberg AL, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>","bibtex":"@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg}, title={Parallel Architectures and Their Efficient Use}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>}, publisher={Springer}, year={1993} }","mla":"Meyer auf der Heide, Friedhelm, et al., editors. <i>Parallel Architectures and Their Efficient Use</i>. Springer, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>.","short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.","chicago":"Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>.","apa":"Meyer auf der Heide, F., Monien, B., &#38; Rosenberg, A. L. (Eds.). (1993). <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>","ieee":"F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993."}},{"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff","first_name":"Brigitte"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540569398","9783540478263"]},"status":"public","year":"1993","title":"Strongly adaptive token distribution","doi":"10.1007/3-540-56939-1_89","user_id":"15415","language":[{"iso":"eng"}],"_id":"16730","citation":{"bibtex":"@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg}, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>}, booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Automata, Languages and Programming</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>.","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1993.","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1993). Strongly adaptive token distribution. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>"},"publication":"Automata, Languages and Programming","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-20T10:33:56Z"},{"user_id":"15415","doi":"10.1007/3-540-56503-5_46","language":[{"iso":"eng"}],"_id":"16732","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1993","title":"Capabilities and complexity of computations with integer division","status":"public","author":[{"last_name":"Lürwer-Brüggemeier","first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540565031","9783540475743"]},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-20T11:25:51Z","place":"Berlin, Heidelberg","publication":"Lecture Notes in Computer Science","citation":{"ieee":"K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1993.","apa":"Lürwer-Brüggemeier, K., &#38; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>","mla":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” <i>Lecture Notes in Computer Science</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>.","bibtex":"@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }","chicago":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>.","ama":"Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993."}},{"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:51:15Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"Data structures and efficient algorithms","citation":{"ieee":"H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.","apa":"Alt, H., &#38; Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In <i>Data structures and efficient algorithms</i> (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>","short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.","chicago":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In <i>Data Structures and Efficient Algorithms</i>, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>.","mla":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” <i>Data Structures and Efficient Algorithms</i>, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>.","bibtex":"@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance and symmetries of geometric patterns}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>}, booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24} }","ama":"Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>"},"page":"1-24","_id":"3046","publisher":"Springer Berlin Heidelberg","doi":"10.1007/3-540-55488-2_19","user_id":"25078","title":"Resemblance and symmetries of geometric patterns","year":"1992","status":"public","author":[{"full_name":"Alt, Helmut","first_name":"Helmut","last_name":"Alt"},{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"date_updated":"2022-01-06T06:58:54Z","publication_status":"published"},{"user_id":"15415","doi":"10.1007/3-540-55488-2_31","language":[{"iso":"eng"}],"_id":"16733","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"status":"public","year":"1992","title":"High performance universal hashing, with applications to shared memory simulations","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-20T11:27:50Z","place":"Berlin, Heidelberg","citation":{"ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg, 1992.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In <i>Data structures and efficient algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>.","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” <i>Data Structures and Efficient Algorithms</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>.","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>"},"publication":"Data structures and efficient algorithms"},{"publication":"Lecture Notes in Computer Science","citation":{"mla":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” <i>Lecture Notes in Computer Science</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>.","ama":"Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }","apa":"Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>","ieee":"F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1992.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>."},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-20T11:29:58Z","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","year":"1992","title":"Hashing strategies for simulating shared memory on distributed memory machines","status":"public","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"doi":"10.1007/3-540-56731-3_3","user_id":"15415","_id":"16734","language":[{"iso":"eng"}]}]