[{"date_updated":"2022-01-06T07:03:52Z","intvolume":"       153","title":"Software Specification by Graph Grammars","year":"1983","author":[{"last_name":"Nagl","first_name":"Manfred","full_name":"Nagl, Manfred"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"},{"first_name":"Rupert","last_name":"Gall","full_name":"Gall, Rupert"},{"full_name":"Schäfer, Wilhelm","first_name":"Wilhelm","last_name":"Schäfer"}],"doi":"dx.doi.org/10.1007/BFb0000113","series_title":"LNCS","language":[{"iso":"eng"}],"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","department":[{"_id":"66"}],"date_created":"2019-03-04T11:52:04Z","status":"public","user_id":"52534","volume":153,"page":"267-287","_id":"8255","publisher":"Springer","citation":{"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>.","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.","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.","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>","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} }","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>","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>."},"place":"Berlin/Heidelberg"},{"user_id":"52534","doi":"http://dx.doi.org/10.1007/BF02251236","volume":31,"page":"317-346","language":[{"iso":"eng"}],"_id":"7411","date_updated":"2022-01-06T07:03:36Z","intvolume":"        31","year":"1983","title":"Software Specification Using Graph Grammars","status":"public","author":[{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"},{"last_name":"Gall","first_name":"Rupert","full_name":"Gall, Rupert"},{"full_name":"Nagl, Manfred","first_name":"Manfred","last_name":"Nagl"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"type":"journal_article","department":[{"_id":"66"}],"date_created":"2019-01-31T15:55:42Z","abstract":[{"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.","lang":"eng"}],"issue":"4","publication":"Computing","citation":{"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>.","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>","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} }","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>","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>.","short":"G. Engels, R. Gall, M. Nagl, W. Schäfer, Computing 31 (1983) 317–346."}},{"citation":{"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} }","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>","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>.","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>.","short":"G. Engels, U. Pletat, H.-D. Ehrich, Acta Informatica 9 (1983) 235–254.","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.","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>"},"issue":"3","publication":"Acta Informatica","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."}],"date_created":"2019-01-31T15:56:22Z","department":[{"_id":"66"}],"type":"journal_article","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Pletat, Udo","last_name":"Pletat","first_name":"Udo"},{"full_name":"Ehrich, Hans-Dietrich","first_name":"Hans-Dietrich","last_name":"Ehrich"}],"status":"public","title":"An Operational Semantics for Specifications of Abstract Data Types with Error Handling","year":"1983","intvolume":"         9","date_updated":"2022-01-06T07:03:36Z","language":[{"iso":"eng"}],"_id":"7412","page":"235-254","volume":9,"doi":"http://dx.doi.org/10.1007/BF00265557","user_id":"52534"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-22T08:48:20Z","publication":"Acta Informatica","citation":{"short":"F. Meyer auf der Heide, Acta Informatica (1983) 269–296.","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>.","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” <i>Acta Informatica</i>, pp. 269–296, 1983.","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>","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>","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>."},"user_id":"15415","doi":"10.1007/bf00265559","page":"269-296","language":[{"iso":"eng"}],"_id":"16806","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","title":"Efficiency of universal parallel computers","year":"1983","status":"public","publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"publication":"Acta Informatica","citation":{"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>","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>.","short":"P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.","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.","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>"},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-22T08:49:58Z","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","year":"1983","title":"A lower time bound for the knapsack problem on random access machines","status":"public","author":[{"first_name":"Peter","last_name":"Klein","full_name":"Klein, Peter"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"publication_identifier":{"issn":["0001-5903","1432-0525"]},"user_id":"15415","doi":"10.1007/bf00290735","page":"385-395","language":[{"iso":"eng"}],"_id":"16807"},{"publication_identifier":{"issn":["0020-0190"]},"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"year":"1983","status":"public","title":"Infinite cube-connected cycles","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","language":[{"iso":"eng"}],"_id":"16808","page":"1-2","user_id":"15415","doi":"10.1016/0020-0190(83)90001-7","citation":{"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>.","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} }","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>","ieee":"F. Meyer auf der Heide, “Infinite cube-connected cycles,” <i>Information Processing Letters</i>, pp. 1–2, 1983.","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.","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>."},"publication":"Information Processing Letters","date_created":"2020-04-22T08:51:01Z","department":[{"_id":"63"}],"type":"journal_article"},{"publication_identifier":{"isbn":["0897910990"]},"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"A polynomial linear search algorithm for the n-dimensional knapsack problem","status":"public","year":"1983","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","language":[{"iso":"eng"}],"_id":"16809","user_id":"15415","doi":"10.1145/800061.808734","citation":{"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>","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.","short":"F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing  - STOC ’83, 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>.","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>.","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>","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} }"},"publication":"Proceedings of the fifteenth annual ACM symposium on Theory of computing  - STOC '83","date_created":"2020-04-22T08:52:15Z","department":[{"_id":"63"}],"type":"conference"},{"user_id":"15415","doi":"10.1007/bfb0036483","language":[{"iso":"eng"}],"_id":"16810","publication_status":"published","date_updated":"2022-01-06T06:52:56Z","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["3540119736"]},"title":"Efficiency of universal parallel computers","year":"1983","status":"public","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-22T08:53:33Z","place":"Berlin/Heidelberg","citation":{"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>.","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} }","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>","ieee":"F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin/Heidelberg, 1983.","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>","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, 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>."},"publication":"Lecture Notes in Computer Science"},{"extern":"1","citation":{"ieee":"R. Biehler, “The mathematization of situations outside mathematics from an educational point of view,” in <i>Proceedings of the Fourth International Congress on Mathematical Education</i>, M. Zweng, Ed. Boston: Birkhäuser, 1983, pp. 291–293.","apa":"Biehler, R. (1983). The mathematization of situations outside mathematics from an educational point of view. In M. Zweng (Ed.), <i>Proceedings of the Fourth International Congress on Mathematical Education</i> (pp. 291–293). Birkhäuser.","short":"R. Biehler, in: M. Zweng (Ed.), Proceedings of the Fourth International Congress on Mathematical Education, Birkhäuser, Boston, 1983, pp. 291–293.","chicago":"Biehler, Rolf. “The Mathematization of Situations Outside Mathematics from an Educational Point of View.” In <i>Proceedings of the Fourth International Congress on Mathematical Education</i>, edited by M. Zweng, 291–93. Boston: Birkhäuser, 1983.","mla":"Biehler, Rolf. “The Mathematization of Situations Outside Mathematics from an Educational Point of View.” <i>Proceedings of the Fourth International Congress on Mathematical Education</i>, edited by M. Zweng, Birkhäuser, 1983, pp. 291–93.","bibtex":"@inbook{Biehler_1983, place={Boston}, title={The mathematization of situations outside mathematics from an educational point of view}, booktitle={Proceedings of the Fourth International Congress on Mathematical Education}, publisher={Birkhäuser}, author={Biehler, Rolf}, editor={Zweng, M.}, year={1983}, pages={291–293} }","ama":"Biehler R. The mathematization of situations outside mathematics from an educational point of view. In: Zweng M, ed. <i>Proceedings of the Fourth International Congress on Mathematical Education</i>. Birkhäuser; 1983:291-293."},"publication":"Proceedings of the Fourth International Congress on Mathematical Education","department":[{"_id":"363"}],"type":"book_chapter","date_created":"2024-10-23T09:18:03Z","place":"Boston","date_updated":"2024-10-23T10:58:28Z","author":[{"first_name":"Rolf","last_name":"Biehler","full_name":"Biehler, Rolf","id":"16274"}],"status":"public","year":"1983","title":"The mathematization of situations outside mathematics from an educational point of view","editor":[{"first_name":"M.","last_name":"Zweng","full_name":"Zweng, M."}],"user_id":"37888","publisher":"Birkhäuser","_id":"56731","language":[{"iso":"eng"}],"page":"291-293"},{"department":[{"_id":"363"}],"type":"book_chapter","place":"Columbus","date_created":"2024-10-23T09:23:07Z","extern":"1","citation":{"bibtex":"@inbook{Biehler_Beck_Kaiser_1983, place={Columbus}, title={Review of Applications in School Mathematics: National Report Federal Republic of Germany}, booktitle={An International Review of Applications in School Mathematics: the Elusive El Dorado}, publisher={ERIC}, author={Biehler, Rolf and Beck, U. and Kaiser, G.}, editor={Burkhardt, H.}, year={1983}, pages={68–93} }","short":"R. Biehler, U. Beck, G. Kaiser, in: H. Burkhardt (Ed.), An International Review of Applications in School Mathematics: The Elusive El Dorado, ERIC, Columbus, 1983, pp. 68–93.","ama":"Biehler R, Beck U, Kaiser G. Review of Applications in School Mathematics: National Report Federal Republic of Germany. In: Burkhardt H, ed. <i>An International Review of Applications in School Mathematics: The Elusive El Dorado</i>. ERIC; 1983:68-93.","chicago":"Biehler, Rolf, U. Beck, and G. Kaiser. “Review of Applications in School Mathematics: National Report Federal Republic of Germany.” In <i>An International Review of Applications in School Mathematics: The Elusive El Dorado</i>, edited by H. Burkhardt, 68–93. Columbus: ERIC, 1983.","ieee":"R. Biehler, U. Beck, and G. Kaiser, “Review of Applications in School Mathematics: National Report Federal Republic of Germany,” in <i>An International Review of Applications in School Mathematics: the Elusive El Dorado</i>, H. Burkhardt, Ed. Columbus: ERIC, 1983, pp. 68–93.","mla":"Biehler, Rolf, et al. “Review of Applications in School Mathematics: National Report Federal Republic of Germany.” <i>An International Review of Applications in School Mathematics: The Elusive El Dorado</i>, edited by H. Burkhardt, ERIC, 1983, pp. 68–93.","apa":"Biehler, R., Beck, U., &#38; Kaiser, G. (1983). Review of Applications in School Mathematics: National Report Federal Republic of Germany. In H. Burkhardt (Ed.), <i>An International Review of Applications in School Mathematics: the Elusive El Dorado</i> (pp. 68–93). ERIC."},"publication":"An International Review of Applications in School Mathematics: the Elusive El Dorado","editor":[{"full_name":"Burkhardt, H.","last_name":"Burkhardt","first_name":"H."}],"user_id":"37888","_id":"56733","publisher":"ERIC","language":[{"iso":"eng"}],"page":"68-93","date_updated":"2024-10-23T10:58:51Z","author":[{"first_name":"Rolf","last_name":"Biehler","full_name":"Biehler, Rolf","id":"16274"},{"full_name":"Beck, U.","first_name":"U.","last_name":"Beck"},{"first_name":"G.","last_name":"Kaiser","full_name":"Kaiser, G."}],"title":"Review of Applications in School Mathematics: National Report Federal Republic of Germany","year":"1983","status":"public"},{"department":[{"_id":"363"}],"type":"book_chapter","date_created":"2024-10-23T09:20:07Z","place":"Bad Salzdetfurth","extern":"1","citation":{"ieee":"R. Biehler, “Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?,” in <i>Beiträge zum Mathematikunterricht 1983</i>, Bad Salzdetfurth: Franzbecker, 1983, pp. 72–75.","apa":"Biehler, R. (1983). Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht? In <i>Beiträge zum Mathematikunterricht 1983</i> (pp. 72–75). Franzbecker.","chicago":"Biehler, Rolf. “Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?” In <i>Beiträge zum Mathematikunterricht 1983</i>, 72–75. Bad Salzdetfurth: Franzbecker, 1983.","short":"R. Biehler, in: Beiträge zum Mathematikunterricht 1983, Franzbecker, Bad Salzdetfurth, 1983, pp. 72–75.","mla":"Biehler, Rolf. “Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?” <i>Beiträge zum Mathematikunterricht 1983</i>, Franzbecker, 1983, pp. 72–75.","bibtex":"@inbook{Biehler_1983, place={Bad Salzdetfurth}, title={Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?}, booktitle={Beiträge zum Mathematikunterricht 1983}, publisher={Franzbecker}, author={Biehler, Rolf}, year={1983}, pages={72–75} }","ama":"Biehler R. Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht? In: <i>Beiträge zum Mathematikunterricht 1983</i>. Franzbecker; 1983:72-75."},"publication":"Beiträge zum Mathematikunterricht 1983","user_id":"37888","language":[{"iso":"ger"}],"_id":"56732","publisher":"Franzbecker","page":"72-75","date_updated":"2024-10-23T10:58:40Z","author":[{"id":"16274","full_name":"Biehler, Rolf","last_name":"Biehler","first_name":"Rolf"}],"year":"1983","title":"Explorative Datenanalyse - Neue Impulse für den Mathematikunterricht?","status":"public"}]