[{"publication":"Machine processing of remotely sensed data- Quantifying global process: Models, sensor systems, and analytical methods","department":[{"_id":"65"}],"author":[{"first_name":"Gitta","full_name":"Domik, Gitta","last_name":"Domik","id":"90"}],"date_created":"2021-04-12T08:08:07Z","status":"public","title":"Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery","user_id":"14955","page":"248–253","year":"1985","type":"conference","citation":{"chicago":"Domik, Gitta. “Radar Image Simulation as a Tool to Analyze Topographic Effects on Geometry and Radiometry of Radar Imagery.” In Machine Processing of Remotely Sensed Data- Quantifying Global Process: Models, Sensor Systems, and Analytical Methods, 248–253, 1985.","apa":"Domik, G. (1985). Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery. In Machine processing of remotely sensed data- Quantifying global process: Models, sensor systems, and analytical methods (pp. 248–253).","ama":"Domik G. Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery. In: Machine Processing of Remotely Sensed Data- Quantifying Global Process: Models, Sensor Systems, and Analytical Methods. ; 1985:248–253.","bibtex":"@inproceedings{Domik_1985, title={Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery}, booktitle={Machine processing of remotely sensed data- Quantifying global process: Models, sensor systems, and analytical methods}, author={Domik, Gitta}, year={1985}, pages={248–253} }","mla":"Domik, Gitta. “Radar Image Simulation as a Tool to Analyze Topographic Effects on Geometry and Radiometry of Radar Imagery.” Machine Processing of Remotely Sensed Data- Quantifying Global Process: Models, Sensor Systems, and Analytical Methods, 1985, pp. 248–253.","short":"G. Domik, in: Machine Processing of Remotely Sensed Data- Quantifying Global Process: Models, Sensor Systems, and Analytical Methods, 1985, pp. 248–253.","ieee":"G. Domik, “Radar image simulation as a tool to analyze topographic effects on geometry and radiometry of radar imagery,” in Machine processing of remotely sensed data- Quantifying global process: Models, sensor systems, and analytical methods, 1985, pp. 248–253."},"language":[{"iso":"eng"}],"_id":"21606","date_updated":"2022-01-06T06:55:07Z"},{"date_created":"2021-04-12T08:08:09Z","status":"public","publication":"Thematic Applications of SAR data","department":[{"_id":"79"},{"_id":"7"},{"_id":"65"},{"_id":"69"}],"author":[{"last_name":"Raggam","first_name":"J","full_name":"Raggam, J"},{"first_name":"Gerhard","full_name":"Triebnig, Gerhard","last_name":"Triebnig"},{"first_name":"MF","full_name":"Buchroithner, MF","last_name":"Buchroithner"},{"id":"90","last_name":"Domik","full_name":"Domik, Gitta","first_name":"Gitta"},{"first_name":"Franz","full_name":"Leberl, Franz","last_name":"Leberl"}],"title":"Radargrammetric aspects of SAR data evaluation","user_id":"90","page":"57","year":"1985","type":"journal_article","citation":{"chicago":"Raggam, J, Gerhard Triebnig, MF Buchroithner, Gitta Domik, and Franz Leberl. “Radargrammetric Aspects of SAR Data Evaluation.” Thematic Applications of SAR Data, 1985, 57.","apa":"Raggam, J., Triebnig, G., Buchroithner, M., Domik, G., & Leberl, F. (1985). Radargrammetric aspects of SAR data evaluation. Thematic Applications of SAR Data, 57.","ama":"Raggam J, Triebnig G, Buchroithner M, Domik G, Leberl F. Radargrammetric aspects of SAR data evaluation. Thematic Applications of SAR data. 1985:57.","mla":"Raggam, J., et al. “Radargrammetric Aspects of SAR Data Evaluation.” Thematic Applications of SAR Data, 1985, p. 57.","bibtex":"@article{Raggam_Triebnig_Buchroithner_Domik_Leberl_1985, title={Radargrammetric aspects of SAR data evaluation}, journal={Thematic Applications of SAR data}, author={Raggam, J and Triebnig, Gerhard and Buchroithner, MF and Domik, Gitta and Leberl, Franz}, year={1985}, pages={57} }","short":"J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, F. Leberl, Thematic Applications of SAR Data (1985) 57.","ieee":"J. Raggam, G. Triebnig, M. Buchroithner, G. Domik, and F. Leberl, “Radargrammetric aspects of SAR data evaluation,” Thematic Applications of SAR data, p. 57, 1985."},"language":[{"iso":"eng"}],"conference":{"location":"Frascati, Italy"},"date_updated":"2022-01-06T06:55:07Z","_id":"21607"},{"department":[{"_id":"66"}],"publication":"Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany)","publisher":"Springer","author":[{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"volume":186,"date_created":"2019-02-20T13:39:53Z","status":"public","abstract":[{"lang":"eng","text":"We introduce a method to specify the functional behaviour of software tools in an incremental and integrated software development environment. This specification method is based on graph grammars. It is an adequate method to specify the behaviour of all software systems using graphs as internal data structures. We show that a specification can be developed systematically by which the adaptability of the environment is increased towards modification of tools or extension by new tools. Furthermore, guidelines for the implementation can directly be derived from this specification."}],"place":"Berlin/Heidelberg","title":"Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment","user_id":"52534","series_title":"LNCS","page":"179-193","citation":{"ieee":"G. Engels and W. Schäfer, “Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment,” in Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany), 1985, vol. 186, pp. 179–193.","short":"G. Engels, W. Schäfer, in: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany), Springer, Berlin/Heidelberg, 1985, pp. 179–193.","bibtex":"@inproceedings{Engels_Schäfer_1985, place={Berlin/Heidelberg}, series={LNCS}, title={Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment}, volume={186}, booktitle={Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany)}, publisher={Springer}, author={Engels, Gregor and Schäfer, Wilhelm}, year={1985}, pages={179–193}, collection={LNCS} }","mla":"Engels, Gregor, and Wilhelm Schäfer. “Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment.” Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany), vol. 186, Springer, 1985, pp. 179–93.","ama":"Engels G, Schäfer W. Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment. In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany). Vol 186. LNCS. Berlin/Heidelberg: Springer; 1985:179-193.","apa":"Engels, G., & Schäfer, W. (1985). Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany) (Vol. 186, pp. 179–193). Berlin/Heidelberg: Springer.","chicago":"Engels, Gregor, and Wilhelm Schäfer. “Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment.” In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany), 186:179–93. LNCS. Berlin/Heidelberg: Springer, 1985."},"type":"conference","year":"1985","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:46Z","_id":"7813","intvolume":" 186"},{"_id":"7814","date_updated":"2022-01-06T07:03:46Z","citation":{"ieee":"G. Engels and W. Schäfer, “The Design of an Adaptive and Portable Programming Support Environment,” in Proceedings of the International Computing Symposium, Amsterdam (The Netherlands), 1985.","short":"G. Engels, W. Schäfer, in: Proceedings of the International Computing Symposium, Amsterdam (The Netherlands), Florenz, 1985.","mla":"Engels, Gregor, and Wilhelm Schäfer. “The Design of an Adaptive and Portable Programming Support Environment.” Proceedings of the International Computing Symposium, Amsterdam (The Netherlands), 1985.","bibtex":"@inproceedings{Engels_Schäfer_1985, place={Florenz}, title={The Design of an Adaptive and Portable Programming Support Environment}, booktitle={Proceedings of the International Computing Symposium, Amsterdam (The Netherlands)}, author={Engels, Gregor and Schäfer, Wilhelm}, year={1985} }","chicago":"Engels, Gregor, and Wilhelm Schäfer. “The Design of an Adaptive and Portable Programming Support Environment.” In Proceedings of the International Computing Symposium, Amsterdam (The Netherlands). Florenz, 1985.","apa":"Engels, G., & Schäfer, W. (1985). The Design of an Adaptive and Portable Programming Support Environment. In Proceedings of the International Computing Symposium, Amsterdam (The Netherlands). Florenz.","ama":"Engels G, Schäfer W. The Design of an Adaptive and Portable Programming Support Environment. In: Proceedings of the International Computing Symposium, Amsterdam (The Netherlands). Florenz; 1985."},"type":"conference","year":"1985","language":[{"iso":"eng"}],"place":"Florenz","title":"The Design of an Adaptive and Portable Programming Support Environment","user_id":"52534","author":[{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"},{"full_name":"Schäfer, Wilhelm","first_name":"Wilhelm","last_name":"Schäfer"}],"department":[{"_id":"66"}],"publication":"Proceedings of the International Computing Symposium, Amsterdam (The Netherlands)","status":"public","date_created":"2019-02-20T13:40:50Z"},{"page":"101-105","year":"1985","citation":{"ieee":"C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming with two variables,” Information Processing Letters, pp. 101–105, 1985.","short":"C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985) 101–105.","bibtex":"@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for integer programming with two variables}, DOI={10.1016/0020-0190(85)90042-0}, journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer auf der Heide, Friedhelm}, year={1985}, pages={101–105} }","mla":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.","ama":"Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0","apa":"Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for integer programming with two variables. Information Processing Letters, 101–105. https://doi.org/10.1016/0020-0190(85)90042-0","chicago":"Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for Integer Programming with Two Variables.” Information Processing Letters, 1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0."},"type":"journal_article","language":[{"iso":"eng"}],"_id":"16779","date_updated":"2022-01-06T06:52:55Z","doi":"10.1016/0020-0190(85)90042-0","publication":"Information Processing Letters","department":[{"_id":"63"}],"author":[{"first_name":"Clemens","full_name":"Lautemann, Clemens","last_name":"Lautemann"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_identifier":{"issn":["0020-0190"]},"publication_status":"published","date_created":"2020-04-21T10:15:46Z","status":"public","title":"Lower time bounds for integer programming with two variables","user_id":"15415"},{"user_id":"15415","title":"Lower bounds for solving linear diophantine equations on random access machines","date_created":"2020-04-21T10:16:50Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0004-5411","1557-735X"]},"department":[{"_id":"63"}],"publication":"Journal of the ACM (JACM)","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1145/4221.4250","_id":"16780","date_updated":"2022-01-06T06:52:55Z","language":[{"iso":"eng"}],"page":"929-937","citation":{"bibtex":"@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear diophantine equations on random access machines}, DOI={10.1145/4221.4250}, journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={929–937} }","mla":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, pp. 929–37, doi:10.1145/4221.4250.","apa":"Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM), 929–937. https://doi.org/10.1145/4221.4250","ama":"Meyer auf der Heide F. Lower bounds for solving linear diophantine equations on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250","chicago":"Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines.” Journal of the ACM (JACM), 1985, 929–37. https://doi.org/10.1145/4221.4250.","ieee":"F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.","short":"F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937."},"year":"1985","type":"journal_article"},{"doi":"10.1016/0304-3975(85)90079-9","_id":"16781","date_updated":"2022-01-06T06:52:55Z","citation":{"ieee":"F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic computation trees,” Theoretical Computer Science, pp. 325–330, 1985.","short":"F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.","bibtex":"@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic algebraic computation trees}, DOI={10.1016/0304-3975(85)90079-9}, journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1985}, pages={325–330} }","mla":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30, doi:10.1016/0304-3975(85)90079-9.","chicago":"Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30. https://doi.org/10.1016/0304-3975(85)90079-9.","apa":"Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9","ama":"Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9"},"year":"1985","type":"journal_article","page":"325-330","language":[{"iso":"eng"}],"title":"Simulating probabilistic by deterministic algebraic computation trees","user_id":"15415","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","status":"public","date_created":"2020-04-21T11:18:44Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Theoretical Computer Science","department":[{"_id":"63"}]},{"type":"conference","year":"1985","citation":{"short":"F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985.","ieee":"F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,” in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985.","ama":"Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ; 1985. doi:10.1109/sfcs.1985.58","apa":"Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.58","chicago":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.58.","mla":"Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985), 1985, doi:10.1109/sfcs.1985.58.","bibtex":"@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity of parallel sorting}, DOI={10.1109/sfcs.1985.58}, booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)}, author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }"},"language":[{"iso":"eng"}],"_id":"16782","date_updated":"2022-01-06T06:52:55Z","doi":"10.1109/sfcs.1985.58","author":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"publication":"26th Annual Symposium on Foundations of Computer Science (sfcs 1985)","department":[{"_id":"63"}],"publication_identifier":{"isbn":["0818606444"]},"publication_status":"published","status":"public","date_created":"2020-04-21T11:19:34Z","title":"The complexity of parallel sorting","user_id":"15415"},{"title":"One, two, three . . . infinity: lower bounds for parallel computation","user_id":"15415","department":[{"_id":"63"}],"publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","author":[{"last_name":"Fich","first_name":"F E","full_name":"Fich, F E"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Ragde","full_name":"Ragde, P","first_name":"P"},{"last_name":"Wigderson","full_name":"Wigderson, A","first_name":"A"}],"publication_identifier":{"isbn":["0897911512"]},"publication_status":"published","date_created":"2020-04-21T11:20:53Z","status":"public","_id":"16783","date_updated":"2022-01-06T06:52:55Z","doi":"10.1145/22145.22151","type":"conference","year":"1985","citation":{"ieee":"F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two, three . . . infinity: lower bounds for parallel computation,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85, 1985.","short":"F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.","bibtex":"@inproceedings{Fich_Meyer auf der Heide_Ragde_Wigderson_1985, title={One, two, three . . . infinity: lower bounds for parallel computation}, DOI={10.1145/22145.22151}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85}, author={Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P and Wigderson, A}, year={1985} }","mla":"Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985, doi:10.1145/22145.22151.","apa":"Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985). One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22151","ama":"Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . . . infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22151","chicago":"Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One, Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22151."},"language":[{"iso":"eng"}]},{"user_id":"15415","title":"Fast algorithms for n-dimensional restrictions of hard problems","status":"public","date_created":"2020-04-21T11:24:17Z","publication_status":"published","publication_identifier":{"isbn":["0897911512"]},"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85","department":[{"_id":"63"}],"doi":"10.1145/22145.22191","date_updated":"2022-01-06T06:52:56Z","_id":"16784","language":[{"iso":"eng"}],"citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.","ama":"Meyer auf der Heide F. Fast algorithms for n-dimensional restrictions of hard problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22191","apa":"Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions of hard problems. In Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22191","bibtex":"@inproceedings{Meyer auf der Heide_1985, title={Fast algorithms for n-dimensional restrictions of hard problems}, DOI={10.1145/22145.22191}, booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85}, author={Meyer auf der Heide, Friedhelm}, year={1985} }","mla":"Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985, doi:10.1145/22145.22191.","short":"F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.","ieee":"F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC ’85, 1985."},"type":"conference","year":"1985"}]