[{"publication":"STACS 92","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” <i>STACS 92</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>.","ama":"Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: <i>STACS 92</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>","bibtex":"@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }","apa":"Meyer auf der Heide, F., &#38; Pham, H. T. (1992). On the performance of networks with multiple busses. In <i>STACS 92</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>","ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in <i>STACS 92</i>, Berlin, Heidelberg, 1992.","short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In <i>STACS 92</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>."},"date_created":"2020-04-20T11:31:58Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"year":"1992","status":"public","title":"On the performance of networks with multiple busses","publication_identifier":{"isbn":["9783540552109","9783540467755"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Pham","first_name":"Hieu Thien","full_name":"Pham, Hieu Thien"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"_id":"16735","user_id":"15415","doi":"10.1007/3-540-55210-3_176"},{"_id":"16789","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/bfb0028983","title":"Computing minimum spanning forests on 1- and 2-dimensional processor arrays","year":"1989","status":"public","publication_identifier":{"isbn":["9783540508403","9783540460985"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_status":"published","date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-21T11:37:58Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"STACS 89","citation":{"apa":"Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In <i>STACS 89</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>","ieee":"F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in <i>STACS 89</i>, Berlin, Heidelberg, 1989.","short":"F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.","chicago":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In <i>STACS 89</i>. Berlin, Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>.","mla":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>.","ama":"Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: <i>STACS 89</i>. Berlin, Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>","bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }"}},{"date_created":"2020-04-21T09:00:37Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in <i>STACS 88</i>, Berlin, Heidelberg, 1988.","apa":"Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &#38; Wigderson, A. (1988). On computations with integer division. In <i>STACS 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>","short":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.","chicago":"Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.” In <i>STACS 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>.","mla":"Just, Bettina, et al. “On Computations with Integer Division.” <i>STACS 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>.","bibtex":"@inbook{Just_Mathematik_Meyer auf der Heide_Informatik_Wigderson_1988, place={Berlin, Heidelberg}, title={On computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>}, booktitle={STACS 88}, author={Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm and Informatik, Fb and Wigderson, Avi}, year={1988} }","ama":"Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: <i>STACS 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>"},"publication":"STACS 88","_id":"16767","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/bfb0035829","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540188346","9783540481904"]},"author":[{"first_name":"Bettina","last_name":"Just","full_name":"Just, Bettina"},{"first_name":"Fb","last_name":"Mathematik","full_name":"Mathematik, Fb"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Informatik, Fb","first_name":"Fb","last_name":"Informatik"},{"last_name":"Wigderson","first_name":"Avi","full_name":"Wigderson, Avi"}],"year":"1988","title":"On computations with integer division","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:55Z"},{"user_id":"15415","doi":"10.1007/3-540-19487-8_24","language":[{"iso":"eng"}],"_id":"16768","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","status":"public","year":"1988","title":"Upper and lower bounds for the dictionary problem","author":[{"last_name":"Dietzfelbinger","first_name":"M.","full_name":"Dietzfelbinger, M."},{"full_name":"Mehlhorn, K.","last_name":"Mehlhorn","first_name":"K."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Rohnert, H.","last_name":"Rohnert","first_name":"H."}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540194873","9783540392880"]},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-21T09:01:36Z","place":"Berlin, Heidelberg","publication":"SWAT 88","citation":{"apa":"Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &#38; Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In <i>SWAT 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>","ieee":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in <i>SWAT 88</i>, Berlin, Heidelberg, 1988.","short":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.","chicago":"Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In <i>SWAT 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>.","mla":"Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” <i>SWAT 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>.","ama":"Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and lower bounds for the dictionary problem. In: <i>SWAT 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>","bibtex":"@inbook{Dietzfelbinger_Mehlhorn_Meyer auf der Heide_Rohnert_1988, place={Berlin, Heidelberg}, title={Upper and lower bounds for the dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>}, booktitle={SWAT 88}, author={Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H.}, year={1988} }"}},{"date_created":"2020-10-01T09:08:05Z","place":"Berlin, Heidelberg","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"type":"book_chapter","citation":{"ieee":"H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in <i>Computation Theory and Logic</i>, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.","apa":"Büning, H. K., &#38; Lettmann, T. (1987). Representation independent query and update operations on propositional definite Horn formulas. In E. Börger (Ed.), <i>Computation Theory and Logic</i> (pp. 208–223). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-18170-9_167\">https://doi.org/10.1007/3-540-18170-9_167</a>","chicago":"Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” In <i>Computation Theory and Logic</i>, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987. <a href=\"https://doi.org/10.1007/3-540-18170-9_167\">https://doi.org/10.1007/3-540-18170-9_167</a>.","short":"H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic, Berlin, Heidelberg, 1987, pp. 208–223.","mla":"Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” <i>Computation Theory and Logic</i>, edited by Egon Börger, 1987, pp. 208–23, doi:<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>.","bibtex":"@inbook{Büning_Lettmann_1987, place={Berlin, Heidelberg}, title={Representation independent query and update operations on propositional definite Horn formulas}, DOI={<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>}, booktitle={Computation Theory and Logic}, author={Büning, Hans Kleine and Lettmann, Theodor}, editor={Börger, EgonEditor}, year={1987}, pages={208–223} }","ama":"Büning HK, Lettmann T. Representation independent query and update operations on propositional definite Horn formulas. In: Börger E, ed. <i>Computation Theory and Logic</i>. Berlin, Heidelberg; 1987:208-223. doi:<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>"},"publication":"Computation Theory and Logic","_id":"19821","language":[{"iso":"eng"}],"page":"208-223","editor":[{"first_name":"Egon","last_name":"Börger","full_name":"Börger, Egon"}],"user_id":"315","doi":"10.1007/3-540-18170-9_167","author":[{"last_name":"Büning","first_name":"Hans Kleine","full_name":"Büning, Hans Kleine"},{"full_name":"Lettmann, Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann","first_name":"Theodor","id":"315"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540181705","9783540477952"]},"status":"public","title":"Representation independent query and update operations on propositional definite Horn formulas","year":"1987","publication_status":"published","date_updated":"2022-01-06T06:54:13Z"},{"publication":"8th International Conference on Automated Deduction","citation":{"ieee":"H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in <i>8th International Conference on Automated Deduction</i>, Berlin, Heidelberg, 1986.","apa":"Kleine Büning, H., &#38; Lettmann, T. (1986). Classes of first order formulas under various satisfiability definitions. In <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16780-3_119\">https://doi.org/10.1007/3-540-16780-3_119</a>","short":"H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.","chicago":"Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” In <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16780-3_119\">https://doi.org/10.1007/3-540-16780-3_119</a>.","mla":"Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” <i>8th International Conference on Automated Deduction</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>.","bibtex":"@inbook{Kleine Büning_Lettmann_1986, place={Berlin, Heidelberg}, title={Classes of first order formulas under various satisfiability definitions}, DOI={<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>}, booktitle={8th International Conference on Automated Deduction}, author={Kleine Büning, H. and Lettmann, Theodor}, year={1986} }","ama":"Kleine Büning H, Lettmann T. Classes of first order formulas under various satisfiability definitions. In: <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>"},"type":"book_chapter","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"place":"Berlin, Heidelberg","date_created":"2020-10-01T08:56:14Z","date_updated":"2022-01-06T06:54:13Z","publication_status":"published","year":"1986","title":"Classes of first order formulas under various satisfiability definitions","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540167808","9783540398615"]},"author":[{"last_name":"Kleine Büning","first_name":"H.","full_name":"Kleine Büning, H."},{"id":"315","full_name":"Lettmann, Theodor","orcid":"0000-0001-5859-2457","first_name":"Theodor","last_name":"Lettmann"}],"doi":"10.1007/3-540-16780-3_119","user_id":"315","language":[{"iso":"eng"}],"_id":"19819"},{"citation":{"mla":"Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” <i>Automata, Languages and Programming</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>.","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A tradeoff between search and update time for the implicit dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>}, booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1986} }","ama":"Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>","ieee":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1986.","apa":"Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>","chicago":"Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>.","short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986."},"publication":"Automata, Languages and Programming","date_created":"2020-04-21T10:05:54Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","author":[{"first_name":"Allan","last_name":"Borodin","full_name":"Borodin, Allan"},{"full_name":"Fich, Faith E.","last_name":"Fich","first_name":"Faith E."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Upfal","first_name":"Eli","full_name":"Upfal, Eli"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"}],"publication_identifier":{"isbn":["9783540167617","9783540398592"],"issn":["0302-9743","1611-3349"]},"title":"A tradeoff between search and update time for the implicit dictionary problem","year":"1986","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"_id":"16774","user_id":"15415","doi":"10.1007/3-540-16761-7_54"},{"department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-21T10:07:06Z","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>.","short":"F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.","ieee":"F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","apa":"Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>","bibtex":"@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding up random access machines by few processors}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>}, booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }","ama":"Meyer auf der Heide F. Speeding up random access machines by few processors. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>","mla":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>."},"publication":"STACS 86","doi":"10.1007/3-540-16078-7_72","user_id":"15415","language":[{"iso":"eng"}],"_id":"16775","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"status":"public","title":"Speeding up random access machines by few processors","year":"1986"},{"publication":"STACS 86","citation":{"bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>}, booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }","ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>.","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.","chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>.","ieee":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A time-space tradeoff for element distinctness. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-21T10:08:23Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","status":"public","title":"A time-space tradeoff for element distinctness","year":"1986","author":[{"first_name":"A.","last_name":"Borodin","full_name":"Borodin, A."},{"full_name":"Fich, F.","last_name":"Fich","first_name":"F."},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Upfal","first_name":"E.","full_name":"Upfal, E."},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540160786","9783540397588"]},"user_id":"15415","doi":"10.1007/3-540-16078-7_89","language":[{"iso":"eng"}],"_id":"16776"},{"doi":"10.1007/3-540-12920-0_20","user_id":"15415","language":[{"iso":"eng"}],"_id":"16787","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","status":"public","title":"Efficient simulations among several models of parallel computers (extended abstract)","year":"1984","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540129202","9783540388050"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-21T11:28:40Z","publication":"STACS 84","citation":{"ieee":"F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in <i>STACS 84</i>, Berlin, Heidelberg, 1984.","apa":"Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In <i>STACS 84</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>","chicago":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” In <i>STACS 84</i>. Berlin, Heidelberg, 1984. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>.","short":"F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.","mla":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” <i>STACS 84</i>, 1984, doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>.","bibtex":"@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient simulations among several models of parallel computers (extended abstract)}, DOI={<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>}, booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }","ama":"Meyer auf der Heide F. Efficient simulations among several models of parallel computers (extended abstract). In: <i>STACS 84</i>. Berlin, Heidelberg; 1984. doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>"}},{"publication":"Fundamentals of Computation Theory","citation":{"ieee":"F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 1981.","apa":"Meyer auf der Heide, F., &#38; Rollik, A. (1981). Random access machines and straight-line programs. In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>","chicago":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>.","short":"F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.","mla":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” <i>Fundamentals of Computation Theory</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>.","bibtex":"@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random access machines and straight-line programs}, DOI={<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>}, booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm and Rollik, Anton}, year={1981} }","ama":"Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>"},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-22T09:03:21Z","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","year":"1981","status":"public","title":"Random access machines and straight-line programs","author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Rollik","first_name":"Anton","full_name":"Rollik, Anton"}],"publication_identifier":{"isbn":["9783540108542","9783540387657"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/3-540-10854-8_29","user_id":"15415","_id":"16813","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-22T09:05:15Z","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","apa":"Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>","ieee":"F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1981.","ama":"Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>","bibtex":"@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor trade-offs for universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981} }","mla":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” <i>Lecture Notes in Computer Science</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>."},"publication":"Lecture Notes in Computer Science","doi":"10.1007/3-540-10856-4_111","user_id":"15415","language":[{"iso":"eng"}],"_id":"16814","date_updated":"2022-01-06T06:52:56Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108566","9783540387695"]},"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"year":"1981","title":"Time-processor trade-offs for universal parallel computers","status":"public"}]