[{"date_created":"2020-01-16T09:37:44Z","author":[{"full_name":"Rott, H.","last_name":"Rott","first_name":"H."},{"last_name":"Domik","full_name":"Domik, Gitta","id":"90","first_name":"Gitta"}],"volume":2,"date_updated":"2022-01-06T06:52:30Z","title":"The SAR-580 experiment on snow and glaciers at the Austrian test site","citation":{"ama":"Rott H, Domik G. The SAR-580 experiment on snow and glaciers at the Austrian test site. In: <i>Proc. SAR-580 Investigators Workshop</i>. Vol 2. ; 1984:217-232.","chicago":"Rott, H., and Gitta Domik. “The SAR-580 Experiment on Snow and Glaciers at the Austrian Test Site.” In <i>Proc. SAR-580 Investigators Workshop</i>, 2:217–32, 1984.","ieee":"H. Rott and G. Domik, “The SAR-580 experiment on snow and glaciers at the Austrian test site,” in <i>Proc. SAR-580 Investigators Workshop</i>, 1984, vol. 2, pp. 217–232.","bibtex":"@inproceedings{Rott_Domik_1984, title={The SAR-580 experiment on snow and glaciers at the Austrian test site}, volume={2}, booktitle={Proc. SAR-580 Investigators Workshop}, author={Rott, H. and Domik, Gitta}, year={1984}, pages={217–232} }","mla":"Rott, H., and Gitta Domik. “The SAR-580 Experiment on Snow and Glaciers at the Austrian Test Site.” <i>Proc. SAR-580 Investigators Workshop</i>, vol. 2, 1984, pp. 217–32.","short":"H. Rott, G. Domik, in: Proc. SAR-580 Investigators Workshop, 1984, pp. 217–232.","apa":"Rott, H., &#38; Domik, G. (1984). The SAR-580 experiment on snow and glaciers at the Austrian test site. In <i>Proc. SAR-580 Investigators Workshop</i> (Vol. 2, pp. 217–232)."},"intvolume":"         2","page":"217-232","year":"1984","user_id":"15458","department":[{"_id":"65"}],"_id":"15598","language":[{"iso":"eng"}],"type":"conference","publication":"Proc. SAR-580 Investigators Workshop","status":"public"},{"title":"Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.","date_created":"2020-01-16T09:41:21Z","author":[{"first_name":"Gitta","last_name":"Domik","id":"90","full_name":"Domik, Gitta"},{"first_name":"Franz","full_name":"Leberl, Franz","last_name":"Leberl"},{"first_name":"Johannes","last_name":"Raggam","full_name":"Raggam, Johannes"}],"publisher":"Graz Research Center","date_updated":"2022-01-06T06:52:30Z","citation":{"apa":"Domik, G., Leberl, F., &#38; Raggam, J. (1984). <i>Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.</i> Graz Research Center.","mla":"Domik, Gitta, et al. <i>Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.</i> Graz Research Center, 1984.","bibtex":"@book{Domik_Leberl_Raggam_1984, series={Final Report on contract Nr. DAJA 45-83-C-0018, European Research Office of the US Army and DIBAG Report Nr. 17}, title={Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.}, publisher={Graz Research Center}, author={Domik, Gitta and Leberl, Franz and Raggam, Johannes}, year={1984}, collection={Final Report on contract Nr. DAJA 45-83-C-0018, European Research Office of the US Army and DIBAG Report Nr. 17} }","short":"G. Domik, F. Leberl, J. Raggam, Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models., Graz Research Center, 1984.","chicago":"Domik, Gitta, Franz Leberl, and Johannes Raggam. <i>Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.</i> Final Report on Contract Nr. DAJA 45-83-C-0018, European Research Office of the US Army and DIBAG Report Nr. 17. Graz Research Center, 1984.","ieee":"G. Domik, F. Leberl, and J. Raggam, <i>Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.</i> Graz Research Center, 1984.","ama":"Domik G, Leberl F, Raggam J. <i>Differential Rectification of SLR-Images Using Map-Derived and Radar-Generated Digital Elevation Models.</i> Graz Research Center; 1984."},"year":"1984","language":[{"iso":"eng"}],"series_title":"Final Report on contract Nr. DAJA 45-83-C-0018, European Research Office of the US Army and DIBAG Report Nr. 17","user_id":"90","department":[{"_id":"65"}],"_id":"15600","status":"public","type":"report"},{"type":"journal_article","publication":"Bildmessung und luftbildwesen","status":"public","_id":"15124","user_id":"15458","department":[{"_id":"65"}],"language":[{"iso":"eng"}],"issue":"5","year":"1984","citation":{"chicago":"Domik, Gitta, M Kobrick, and Franz Leberl. “Analyse von Radarbildern Mittels Digitaler Hoehenmodelle.” <i>Bildmessung Und Luftbildwesen</i> 52, no. 5 (1984): 249–63.","ieee":"G. Domik, M. Kobrick, and F. Leberl, “Analyse von Radarbildern mittels digitaler Hoehenmodelle,” <i>Bildmessung und luftbildwesen</i>, vol. 52, no. 5, pp. 249–263, 1984.","ama":"Domik G, Kobrick M, Leberl F. Analyse von Radarbildern mittels digitaler Hoehenmodelle. <i>Bildmessung und luftbildwesen</i>. 1984;52(5):249-263.","bibtex":"@article{Domik_Kobrick_Leberl_1984, title={Analyse von Radarbildern mittels digitaler Hoehenmodelle}, volume={52}, number={5}, journal={Bildmessung und luftbildwesen}, author={Domik, Gitta and Kobrick, M and Leberl, Franz}, year={1984}, pages={249–263} }","short":"G. Domik, M. Kobrick, F. Leberl, Bildmessung Und Luftbildwesen 52 (1984) 249–263.","mla":"Domik, Gitta, et al. “Analyse von Radarbildern Mittels Digitaler Hoehenmodelle.” <i>Bildmessung Und Luftbildwesen</i>, vol. 52, no. 5, 1984, pp. 249–63.","apa":"Domik, G., Kobrick, M., &#38; Leberl, F. (1984). Analyse von Radarbildern mittels digitaler Hoehenmodelle. <i>Bildmessung Und Luftbildwesen</i>, <i>52</i>(5), 249–263."},"intvolume":"        52","page":"249-263","date_updated":"2022-01-06T06:52:15Z","author":[{"id":"90","full_name":"Domik, Gitta","last_name":"Domik","first_name":"Gitta"},{"first_name":"M","last_name":"Kobrick","full_name":"Kobrick, M"},{"last_name":"Leberl","full_name":"Leberl, Franz","first_name":"Franz"}],"date_created":"2019-11-22T08:10:02Z","volume":52,"title":"Analyse von Radarbildern mittels digitaler Hoehenmodelle"},{"doi":"dx.doi.org/10.1007/BFb0000113","title":"Software Specification by Graph Grammars","volume":153,"author":[{"last_name":"Nagl","full_name":"Nagl, Manfred","first_name":"Manfred"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"last_name":"Gall","full_name":"Gall, Rupert","first_name":"Rupert"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"date_created":"2019-03-04T11:52:04Z","publisher":"Springer","date_updated":"2022-01-06T07:03:52Z","page":"267-287","intvolume":"       153","citation":{"ama":"Nagl M, Engels G, Gall R, Schäfer W. Software Specification by Graph Grammars. In: <i>Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)</i>. Vol 153. LNCS. Berlin/Heidelberg: Springer; 1983:267-287. doi:<a href=\"https://doi.org/dx.doi.org/10.1007/BFb0000113\">dx.doi.org/10.1007/BFb0000113</a>","ieee":"M. Nagl, G. Engels, R. Gall, and W. Schäfer, “Software Specification by Graph Grammars,” in <i>Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)</i>, 1983, vol. 153, pp. 267–287.","chicago":"Nagl, Manfred, Gregor Engels, Rupert Gall, and Wilhelm Schäfer. “Software Specification by Graph Grammars.” In <i>Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)</i>, 153:267–87. LNCS. Berlin/Heidelberg: Springer, 1983. <a href=\"https://doi.org/dx.doi.org/10.1007/BFb0000113\">https://doi.org/dx.doi.org/10.1007/BFb0000113</a>.","bibtex":"@inproceedings{Nagl_Engels_Gall_Schäfer_1983, place={Berlin/Heidelberg}, series={LNCS}, title={Software Specification by Graph Grammars}, volume={153}, DOI={<a href=\"https://doi.org/dx.doi.org/10.1007/BFb0000113\">dx.doi.org/10.1007/BFb0000113</a>}, booktitle={Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)}, publisher={Springer}, author={Nagl, Manfred and Engels, Gregor and Gall, Rupert and Schäfer, Wilhelm}, year={1983}, pages={267–287}, collection={LNCS} }","mla":"Nagl, Manfred, et al. “Software Specification by Graph Grammars.” <i>Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)</i>, vol. 153, Springer, 1983, pp. 267–87, doi:<a href=\"https://doi.org/dx.doi.org/10.1007/BFb0000113\">dx.doi.org/10.1007/BFb0000113</a>.","short":"M. Nagl, G. Engels, R. Gall, W. Schäfer, in: Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany), Springer, Berlin/Heidelberg, 1983, pp. 267–287.","apa":"Nagl, M., Engels, G., Gall, R., &#38; Schäfer, W. (1983). Software Specification by Graph Grammars. In <i>Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)</i> (Vol. 153, pp. 267–287). Berlin/Heidelberg: Springer. <a href=\"https://doi.org/dx.doi.org/10.1007/BFb0000113\">https://doi.org/dx.doi.org/10.1007/BFb0000113</a>"},"year":"1983","place":"Berlin/Heidelberg","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","series_title":"LNCS","_id":"8255","status":"public","abstract":[{"lang":"eng","text":"The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specification engineering using graph grammars. This approach is influenced by the syntactical definition of the underlying programming language or module concept etc. to be supported but also by the idea of the user interface."}],"publication":"Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)","type":"conference"},{"language":[{"iso":"eng"}],"_id":"7411","user_id":"52534","department":[{"_id":"66"}],"abstract":[{"lang":"eng","text":"The following paper,demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify tbe changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to \"specification engineering\" using graph grammars. This approach is influenced by the syntactical definition of the underlying language for Programming in the Small, the module concept etc. to be supported on one side but also by the idea of the user interface."}],"status":"public","type":"journal_article","publication":"Computing","title":"Software Specification Using Graph Grammars","doi":"http://dx.doi.org/10.1007/BF02251236","date_updated":"2022-01-06T07:03:36Z","date_created":"2019-01-31T15:55:42Z","author":[{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"full_name":"Gall, Rupert","last_name":"Gall","first_name":"Rupert"},{"last_name":"Nagl","full_name":"Nagl, Manfred","first_name":"Manfred"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"volume":31,"year":"1983","citation":{"ama":"Engels G, Gall R, Nagl M, Schäfer W. Software Specification Using Graph Grammars. <i>Computing</i>. 1983;31(4):317-346. doi:<a href=\"http://dx.doi.org/10.1007/BF02251236\">http://dx.doi.org/10.1007/BF02251236</a>","ieee":"G. Engels, R. Gall, M. Nagl, and W. Schäfer, “Software Specification Using Graph Grammars,” <i>Computing</i>, vol. 31, no. 4, pp. 317–346, 1983.","chicago":"Engels, Gregor, Rupert Gall, Manfred Nagl, and Wilhelm Schäfer. “Software Specification Using Graph Grammars.” <i>Computing</i> 31, no. 4 (1983): 317–46. <a href=\"http://dx.doi.org/10.1007/BF02251236\">http://dx.doi.org/10.1007/BF02251236</a>.","apa":"Engels, G., Gall, R., Nagl, M., &#38; Schäfer, W. (1983). Software Specification Using Graph Grammars. <i>Computing</i>, <i>31</i>(4), 317–346. <a href=\"http://dx.doi.org/10.1007/BF02251236\">http://dx.doi.org/10.1007/BF02251236</a>","short":"G. Engels, R. Gall, M. Nagl, W. Schäfer, Computing 31 (1983) 317–346.","mla":"Engels, Gregor, et al. “Software Specification Using Graph Grammars.” <i>Computing</i>, vol. 31, no. 4, 1983, pp. 317–46, doi:<a href=\"http://dx.doi.org/10.1007/BF02251236\">http://dx.doi.org/10.1007/BF02251236</a>.","bibtex":"@article{Engels_Gall_Nagl_Schäfer_1983, title={Software Specification Using Graph Grammars}, volume={31}, DOI={<a href=\"http://dx.doi.org/10.1007/BF02251236\">http://dx.doi.org/10.1007/BF02251236</a>}, number={4}, journal={Computing}, author={Engels, Gregor and Gall, Rupert and Nagl, Manfred and Schäfer, Wilhelm}, year={1983}, pages={317–346} }"},"page":"317-346","intvolume":"        31","issue":"4"},{"status":"public","abstract":[{"lang":"eng","text":"A new approach to an operational treatment of errors and exceptions in specifications of abstract data types is presented. Considering a specification as a term rewriting system, we define an operational semantics and give conditions that are sufficient for its well-definedness (Church-Rosser property). Also, we give conditions that are sufficient for the termination of reduction strategies, respecting the specified error and exception handling."}],"type":"journal_article","publication":"Acta Informatica","language":[{"iso":"eng"}],"user_id":"52534","department":[{"_id":"66"}],"_id":"7412","citation":{"apa":"Engels, G., Pletat, U., &#38; Ehrich, H.-D. (1983). An Operational Semantics for Specifications of Abstract Data Types with Error Handling. <i>Acta Informatica</i>, <i>9</i>(3), 235–254. <a href=\"http://dx.doi.org/10.1007/BF00265557\">http://dx.doi.org/10.1007/BF00265557</a>","bibtex":"@article{Engels_Pletat_Ehrich_1983, title={An Operational Semantics for Specifications of Abstract Data Types with Error Handling}, volume={9}, DOI={<a href=\"http://dx.doi.org/10.1007/BF00265557\">http://dx.doi.org/10.1007/BF00265557</a>}, number={3}, journal={Acta Informatica}, author={Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}, year={1983}, pages={235–254} }","mla":"Engels, Gregor, et al. “An Operational Semantics for Specifications of Abstract Data Types with Error Handling.” <i>Acta Informatica</i>, vol. 9, no. 3, 1983, pp. 235–54, doi:<a href=\"http://dx.doi.org/10.1007/BF00265557\">http://dx.doi.org/10.1007/BF00265557</a>.","short":"G. Engels, U. Pletat, H.-D. Ehrich, Acta Informatica 9 (1983) 235–254.","ama":"Engels G, Pletat U, Ehrich H-D. An Operational Semantics for Specifications of Abstract Data Types with Error Handling. <i>Acta Informatica</i>. 1983;9(3):235-254. doi:<a href=\"http://dx.doi.org/10.1007/BF00265557\">http://dx.doi.org/10.1007/BF00265557</a>","chicago":"Engels, Gregor, Udo Pletat, and Hans-Dietrich Ehrich. “An Operational Semantics for Specifications of Abstract Data Types with Error Handling.” <i>Acta Informatica</i> 9, no. 3 (1983): 235–54. <a href=\"http://dx.doi.org/10.1007/BF00265557\">http://dx.doi.org/10.1007/BF00265557</a>.","ieee":"G. Engels, U. Pletat, and H.-D. Ehrich, “An Operational Semantics for Specifications of Abstract Data Types with Error Handling,” <i>Acta Informatica</i>, vol. 9, no. 3, pp. 235–254, 1983."},"intvolume":"         9","page":"235-254","year":"1983","issue":"3","doi":"http://dx.doi.org/10.1007/BF00265557","title":"An Operational Semantics for Specifications of Abstract Data Types with Error Handling","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"last_name":"Pletat","full_name":"Pletat, Udo","first_name":"Udo"},{"first_name":"Hans-Dietrich","full_name":"Ehrich, Hans-Dietrich","last_name":"Ehrich"}],"date_created":"2019-01-31T15:56:22Z","volume":9,"date_updated":"2022-01-06T07:03:36Z"},{"status":"public","type":"journal_article","publication":"Acta Informatica","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16806","citation":{"apa":"Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. <i>Acta Informatica</i>, 269–296. <a href=\"https://doi.org/10.1007/bf00265559\">https://doi.org/10.1007/bf00265559</a>","mla":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” <i>Acta Informatica</i>, 1983, pp. 269–96, doi:<a href=\"https://doi.org/10.1007/bf00265559\">10.1007/bf00265559</a>.","short":"F. Meyer auf der Heide, Acta Informatica (1983) 269–296.","bibtex":"@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/bf00265559\">10.1007/bf00265559</a>}, journal={Acta Informatica}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={269–296} }","ama":"Meyer auf der Heide F. Efficiency of universal parallel computers. <i>Acta Informatica</i>. 1983:269-296. doi:<a href=\"https://doi.org/10.1007/bf00265559\">10.1007/bf00265559</a>","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” <i>Acta Informatica</i>, pp. 269–296, 1983.","chicago":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” <i>Acta Informatica</i>, 1983, 269–96. <a href=\"https://doi.org/10.1007/bf00265559\">https://doi.org/10.1007/bf00265559</a>."},"page":"269-296","year":"1983","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]},"doi":"10.1007/bf00265559","title":"Efficiency of universal parallel computers","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-22T08:48:20Z","date_updated":"2022-01-06T06:52:56Z"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16807","status":"public","type":"journal_article","publication":"Acta Informatica","doi":"10.1007/bf00290735","title":"A lower time bound for the knapsack problem on random access machines","date_created":"2020-04-22T08:49:58Z","author":[{"full_name":"Klein, Peter","last_name":"Klein","first_name":"Peter"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","citation":{"apa":"Klein, P., &#38; Meyer auf der Heide, F. (1983). A lower time bound for the knapsack problem on random access machines. <i>Acta Informatica</i>, 385–395. <a href=\"https://doi.org/10.1007/bf00290735\">https://doi.org/10.1007/bf00290735</a>","short":"P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.","mla":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” <i>Acta Informatica</i>, 1983, pp. 385–95, doi:<a href=\"https://doi.org/10.1007/bf00290735\">10.1007/bf00290735</a>.","bibtex":"@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for the knapsack problem on random access machines}, DOI={<a href=\"https://doi.org/10.1007/bf00290735\">10.1007/bf00290735</a>}, journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm}, year={1983}, pages={385–395} }","ama":"Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem on random access machines. <i>Acta Informatica</i>. 1983:385-395. doi:<a href=\"https://doi.org/10.1007/bf00290735\">10.1007/bf00290735</a>","chicago":"Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the Knapsack Problem on Random Access Machines.” <i>Acta Informatica</i>, 1983, 385–95. <a href=\"https://doi.org/10.1007/bf00290735\">https://doi.org/10.1007/bf00290735</a>.","ieee":"P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack problem on random access machines,” <i>Acta Informatica</i>, pp. 385–395, 1983."},"page":"385-395","year":"1983","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]}},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16808","status":"public","publication":"Information Processing Letters","type":"journal_article","doi":"10.1016/0020-0190(83)90001-7","title":"Infinite cube-connected cycles","date_created":"2020-04-22T08:51:01Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:56Z","page":"1-2","citation":{"apa":"Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. <i>Information Processing Letters</i>, 1–2. <a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">https://doi.org/10.1016/0020-0190(83)90001-7</a>","short":"F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.","bibtex":"@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles}, DOI={<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>}, journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm}, year={1983}, pages={1–2} }","mla":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information Processing Letters</i>, 1983, pp. 1–2, doi:<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>.","chicago":"Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” <i>Information Processing Letters</i>, 1983, 1–2. <a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">https://doi.org/10.1016/0020-0190(83)90001-7</a>.","ieee":"F. Meyer auf der Heide, “Infinite cube-connected cycles,” <i>Information Processing Letters</i>, pp. 1–2, 1983.","ama":"Meyer auf der Heide F. Infinite cube-connected cycles. <i>Information Processing Letters</i>. 1983:1-2. doi:<a href=\"https://doi.org/10.1016/0020-0190(83)90001-7\">10.1016/0020-0190(83)90001-7</a>"},"year":"1983","publication_identifier":{"issn":["0020-0190"]},"publication_status":"published"},{"date_created":"2020-04-22T08:52:15Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","doi":"10.1145/800061.808734","title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","publication_identifier":{"isbn":["0897910990"]},"publication_status":"published","citation":{"ama":"Meyer auf der Heide F. A polynomial linear search algorithm for the n-dimensional knapsack problem. In: <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>. ; 1983. doi:<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>","ieee":"F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional knapsack problem,” in <i>Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83</i>, 1983.","chicago":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” In <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>, 1983. <a href=\"https://doi.org/10.1145/800061.808734\">https://doi.org/10.1145/800061.808734</a>.","bibtex":"@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search algorithm for the n-dimensional knapsack problem}, DOI={<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>}, booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","short":"F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 1983.","mla":"Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem.” <i>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83</i>, 1983, doi:<a href=\"https://doi.org/10.1145/800061.808734\">10.1145/800061.808734</a>.","apa":"Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the n-dimensional knapsack problem. In <i>Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC ’83</i>. <a href=\"https://doi.org/10.1145/800061.808734\">https://doi.org/10.1145/800061.808734</a>"},"year":"1983","department":[{"_id":"63"}],"user_id":"15415","_id":"16809","language":[{"iso":"eng"}],"publication":"Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC '83","type":"conference","status":"public"},{"date_created":"2020-04-22T08:53:33Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/bfb0036483","title":"Efficiency of universal parallel computers","publication_status":"published","publication_identifier":{"isbn":["3540119736"]},"citation":{"bibtex":"@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency of universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1983} }","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1983.","mla":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” <i>Lecture Notes in Computer Science</i>, 1983, doi:<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>.","apa":"Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers. In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg. <a href=\"https://doi.org/10.1007/bfb0036483\">https://doi.org/10.1007/bfb0036483</a>","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1983.","chicago":"Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.” In <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg, 1983. <a href=\"https://doi.org/10.1007/bfb0036483\">https://doi.org/10.1007/bfb0036483</a>.","ama":"Meyer auf der Heide F. Efficiency of universal parallel computers. In: <i>Lecture Notes in Computer Science</i>. Berlin/Heidelberg; 1983. doi:<a href=\"https://doi.org/10.1007/bfb0036483\">10.1007/bfb0036483</a>"},"place":"Berlin/Heidelberg","year":"1983","user_id":"15415","department":[{"_id":"63"}],"_id":"16810","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"date_created":"2019-02-20T13:37:37Z","author":[{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"date_updated":"2022-01-06T07:03:46Z","publisher":"Hanser","title":"Specification of a Programming Support Environment by Graph Grammars","citation":{"short":"G. Engels, W. Schäfer, in: Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany), Hanser, München/Leipzig, 1982, pp. 47–62.","bibtex":"@inproceedings{Engels_Schäfer_1982, place={München/Leipzig}, title={Specification of a Programming Support Environment by Graph Grammars}, booktitle={Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)}, publisher={Hanser}, author={Engels, Gregor and Schäfer, Wilhelm}, year={1982}, pages={47–62} }","mla":"Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, Hanser, 1982, pp. 47–62.","apa":"Engels, G., &#38; Schäfer, W. (1982). Specification of a Programming Support Environment by Graph Grammars. In <i>Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i> (pp. 47–62). München/Leipzig: Hanser.","ieee":"G. Engels and W. Schäfer, “Specification of a Programming Support Environment by Graph Grammars,” in <i>Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, 1982, pp. 47–62.","chicago":"Engels, Gregor, and Wilhelm Schäfer. “Specification of a Programming Support Environment by Graph Grammars.” In <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>, 47–62. München/Leipzig: Hanser, 1982.","ama":"Engels G, Schäfer W. Specification of a Programming Support Environment by Graph Grammars. In: <i>Proceedings of the Conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)</i>. München/Leipzig: Hanser; 1982:47-62."},"page":"47-62","place":"München/Leipzig","year":"1982","user_id":"52534","department":[{"_id":"66"}],"_id":"7811","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)","status":"public"},{"type":"conference","publication":"Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)","status":"public","abstract":[{"lang":"eng","text":"We suppose to give conditional specifications of abstract data types hierarchically. Considering algebraic specifications from an operational point of view this approach enables us to present simple syntactic criteria for the Church-Rosser property, which implies the welldefinedness of the operational semantics of a conditional specification. Furthermore, these criteria are su?cient for the termination of the full substitution reduction strategy."}],"user_id":"52534","department":[{"_id":"66"}],"_id":"7812","language":[{"iso":"eng"}],"citation":{"apa":"Pletat, U., Engels, G., &#38; Ehrich, H.-D. (1982). An Operational Approach to Conditional Algebraic Specifications. In <i>Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)</i> (Vol. 82, pp. 254–270).","short":"U. Pletat, G. Engels, H.-D. Ehrich, in: Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France), 1982, pp. 254–270.","mla":"Pletat, Udo, et al. “An Operational Approach to Conditional Algebraic Specifications.” <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>, vol. 82, 1982, pp. 254–70.","bibtex":"@inproceedings{Pletat_Engels_Ehrich_1982, title={An Operational Approach to Conditional Algebraic Specifications}, volume={82}, booktitle={Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1982}, pages={254–270} }","ama":"Pletat U, Engels G, Ehrich H-D. An Operational Approach to Conditional Algebraic Specifications. In: <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>. Vol 82. ; 1982:254-270.","chicago":"Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. “An Operational Approach to Conditional Algebraic Specifications.” In <i>Proceedings of the 7eme Colloque Sur Les Arbres En Algebre et En Programmation, Lille (France)</i>, 82:254–70, 1982.","ieee":"U. Pletat, G. Engels, and H.-D. Ehrich, “An Operational Approach to Conditional Algebraic Specifications,” in <i>Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)</i>, 1982, vol. 82, pp. 254–270."},"page":"254-270","intvolume":"        82","year":"1982","date_created":"2019-02-20T13:39:05Z","author":[{"first_name":"Udo","last_name":"Pletat","full_name":"Pletat, Udo"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"first_name":"Hans-Dietrich","last_name":"Ehrich","full_name":"Ehrich, Hans-Dietrich"}],"volume":82,"date_updated":"2022-01-06T07:03:46Z","title":"An Operational Approach to Conditional Algebraic Specifications"},{"_id":"8184","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"report_number":"OSM-I-3","type":"report","status":"public","publisher":"University of Osnabrück","date_updated":"2022-01-06T07:03:51Z","author":[{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"},{"first_name":"Udo","full_name":"Pletat, Udo","last_name":"Pletat"},{"first_name":"Hans-Dietrich","last_name":"Ehrich","full_name":"Ehrich, Hans-Dietrich"}],"date_created":"2019-03-03T16:12:37Z","title":"Handling Errors and Exceptions in the Algebraic Specifications of Data Types","year":"1981","citation":{"bibtex":"@book{Engels_Pletat_Ehrich_1981, title={Handling Errors and Exceptions in the Algebraic Specifications of Data Types}, publisher={University of Osnabrück}, author={Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}, year={1981} }","short":"G. Engels, U. Pletat, H.-D. Ehrich, Handling Errors and Exceptions in the Algebraic Specifications of Data Types, University of Osnabrück, 1981.","mla":"Engels, Gregor, et al. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981.","apa":"Engels, G., Pletat, U., &#38; Ehrich, H.-D. (1981). <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück.","chicago":"Engels, Gregor, Udo Pletat, and Hans-Dietrich Ehrich. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981.","ieee":"G. Engels, U. Pletat, and H.-D. Ehrich, <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück, 1981.","ama":"Engels G, Pletat U, Ehrich H-D. <i>Handling Errors and Exceptions in the Algebraic Specifications of Data Types</i>. University of Osnabrück; 1981."}},{"language":[{"iso":"eng"}],"_id":"8185","department":[{"_id":"66"}],"user_id":"52534","status":"public","report_number":"118","type":"report","title":"Operational Semantics of Algebraic Specifications with Conditional Equations","publisher":"University of Dortmund, Department of Computer Science","date_updated":"2022-01-06T07:03:51Z","date_created":"2019-03-03T16:12:38Z","author":[{"first_name":"Udo","full_name":"Pletat, Udo","last_name":"Pletat"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Ehrich, Hans-Dietrich","last_name":"Ehrich","first_name":"Hans-Dietrich"}],"year":"1981","citation":{"short":"U. Pletat, G. Engels, H.-D. Ehrich, Operational Semantics of Algebraic Specifications with Conditional Equations, University of Dortmund, Department of Computer Science, 1981.","bibtex":"@book{Pletat_Engels_Ehrich_1981, title={Operational Semantics of Algebraic Specifications with Conditional Equations}, publisher={University of Dortmund, Department of Computer Science}, author={Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}, year={1981} }","mla":"Pletat, Udo, et al. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981.","apa":"Pletat, U., Engels, G., &#38; Ehrich, H.-D. (1981). <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science.","ama":"Pletat U, Engels G, Ehrich H-D. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science; 1981.","ieee":"U. Pletat, G. Engels, and H.-D. Ehrich, <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981.","chicago":"Pletat, Udo, Gregor Engels, and Hans-Dietrich Ehrich. <i>Operational Semantics of Algebraic Specifications with Conditional Equations</i>. University of Dortmund, Department of Computer Science, 1981."}},{"title":"Random access machines and straight-line programs","doi":"10.1007/3-540-10854-8_29","date_updated":"2022-01-06T06:52:56Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Rollik, Anton","last_name":"Rollik","first_name":"Anton"}],"date_created":"2020-04-22T09:03:21Z","year":"1981","place":"Berlin, Heidelberg","citation":{"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>","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.","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.","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} }","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>.","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>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108542","9783540387657"]},"language":[{"iso":"eng"}],"_id":"16813","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Fundamentals of Computation Theory"},{"publication_identifier":{"isbn":["9783540108566","9783540387695"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1981","citation":{"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>","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>.","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.","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>.","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","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} }","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>"},"date_updated":"2022-01-06T06:52:56Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_created":"2020-04-22T09:05:15Z","title":"Time-processor trade-offs for universal parallel computers","doi":"10.1007/3-540-10856-4_111","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","_id":"16814","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"doi":"10.1016/s0304-3975(81)80004-7","title":"A comparison of two variations of a pebble game on graphs","date_created":"2020-04-22T09:33:31Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:56Z","citation":{"mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Theoretical Computer Science</i>, 1981, pp. 315–22, doi:<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>.","bibtex":"@article{Meyer auf der Heide_1981, title={A comparison of two variations of a pebble game on graphs}, DOI={<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981}, pages={315–322} }","short":"F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.","apa":"Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble game on graphs. <i>Theoretical Computer Science</i>, 315–322. <a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">https://doi.org/10.1016/s0304-3975(81)80004-7</a>","chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Theoretical Computer Science</i>, 1981, 315–22. <a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">https://doi.org/10.1016/s0304-3975(81)80004-7</a>.","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” <i>Theoretical Computer Science</i>, pp. 315–322, 1981.","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. <i>Theoretical Computer Science</i>. 1981:315-322. doi:<a href=\"https://doi.org/10.1016/s0304-3975(81)80004-7\">10.1016/s0304-3975(81)80004-7</a>"},"page":"315-322","year":"1981","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16820","status":"public","type":"journal_article","publication":"Theoretical Computer Science"},{"publication_identifier":{"isbn":["9783540103882","9783642678387"],"issn":["0343-3005"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1980","citation":{"ieee":"P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,” in <i>GI - 10. Jahrestagung</i>, Berlin, Heidelberg, 1980.","chicago":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” In <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg, 1980. <a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">https://doi.org/10.1007/978-3-642-67838-7_34</a>.","ama":"Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem. In: <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg; 1980. doi:<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>","short":"P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.","mla":"Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das Rucksack-Problem.” <i>GI - 10. Jahrestagung</i>, 1980, doi:<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>.","bibtex":"@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere Zeitschranken für das Rucksack-Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">10.1007/978-3-642-67838-7_34</a>}, booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide, Friedhelm}, year={1980} }","apa":"Klein, P., &#38; Meyer auf der Heide, F. (1980). Untere Zeitschranken für das Rucksack-Problem. In <i>GI - 10. Jahrestagung</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-67838-7_34\">https://doi.org/10.1007/978-3-642-67838-7_34</a>"},"date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-22T09:06:48Z","author":[{"last_name":"Klein","full_name":"Klein, P.","first_name":"P."},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"title":"Untere Zeitschranken für das Rucksack-Problem","doi":"10.1007/978-3-642-67838-7_34","publication":"GI - 10. Jahrestagung","type":"book_chapter","status":"public","_id":"16815","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"type":"journal_article","publication":"Automata, Languages and Programming. ICALP 1979","status":"public","_id":"16812","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","year":"1979","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Automata, Languages and Programming. ICALP 1979</i>, 1979, 411–21. <a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">https://doi.org/10.1007/3-540-09510-1_32 </a>.","ieee":"F. Meyer auf der Heide, “A comparison of two variations of a pebble game on graphs,” <i>Automata, Languages and Programming. ICALP 1979</i>, pp. 411–421, 1979.","ama":"Meyer auf der Heide F. A comparison of two variations of a pebble game on graphs. <i>Automata, Languages and Programming ICALP 1979</i>. 1979:411-421. doi:<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>","apa":"Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble game on graphs. <i>Automata, Languages and Programming. ICALP 1979</i>, 411–421. <a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">https://doi.org/10.1007/3-540-09510-1_32 </a>","mla":"Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble Game on Graphs.” <i>Automata, Languages and Programming. ICALP 1979</i>, 1979, pp. 411–21, doi:<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>.","short":"F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979) 411–421.","bibtex":"@article{Meyer auf der Heide_1979, title={A comparison of two variations of a pebble game on graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-09510-1_32 \">10.1007/3-540-09510-1_32 </a>}, journal={Automata, Languages and Programming. ICALP 1979}, author={Meyer auf der Heide, Friedhelm}, year={1979}, pages={411–421} }"},"page":"411-421","date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-22T09:02:08Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"A comparison of two variations of a pebble game on graphs","doi":"10.1007/3-540-09510-1_32 "}]