[{"_id":"16611","language":[{"iso":"eng"}],"doi":"10.1090/fic/004/05","user_id":"15701","title":"The constrained Liapunov-Schmidt procedure and periodic orbits","status":"public","year":"1995","publication_identifier":{"isbn":["9780821803264","9781470429720"]},"author":[{"first_name":"Martin","last_name":"Golubitsky","full_name":"Golubitsky, Martin"},{"first_name":"Jerrold","last_name":"Marsden","full_name":"Marsden, Jerrold"},{"first_name":"Ian","last_name":"Stewart","full_name":"Stewart, Ian"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"}],"date_updated":"2022-01-06T06:52:53Z","publication_status":"published","place":"Providence, Rhode Island","date_created":"2020-04-16T08:02:13Z","type":"book_chapter","department":[{"_id":"101"}],"publication":"Normal Forms and Homoclinic Chaos","citation":{"mla":"Golubitsky, Martin, et al. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” <i>Normal Forms and Homoclinic Chaos</i>, 1995, doi:<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>.","bibtex":"@inbook{Golubitsky_Marsden_Stewart_Dellnitz_1995, place={Providence, Rhode Island}, title={The constrained Liapunov-Schmidt procedure and periodic orbits}, DOI={<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>}, booktitle={Normal Forms and Homoclinic Chaos}, author={Golubitsky, Martin and Marsden, Jerrold and Stewart, Ian and Dellnitz, Michael}, year={1995} }","ama":"Golubitsky M, Marsden J, Stewart I, Dellnitz M. The constrained Liapunov-Schmidt procedure and periodic orbits. In: <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island; 1995. doi:<a href=\"https://doi.org/10.1090/fic/004/05\">10.1090/fic/004/05</a>","ieee":"M. Golubitsky, J. Marsden, I. Stewart, and M. Dellnitz, “The constrained Liapunov-Schmidt procedure and periodic orbits,” in <i>Normal Forms and Homoclinic Chaos</i>, Providence, Rhode Island, 1995.","apa":"Golubitsky, M., Marsden, J., Stewart, I., &#38; Dellnitz, M. (1995). The constrained Liapunov-Schmidt procedure and periodic orbits. In <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island. <a href=\"https://doi.org/10.1090/fic/004/05\">https://doi.org/10.1090/fic/004/05</a>","chicago":"Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” In <i>Normal Forms and Homoclinic Chaos</i>. Providence, Rhode Island, 1995. <a href=\"https://doi.org/10.1090/fic/004/05\">https://doi.org/10.1090/fic/004/05</a>.","short":"M. Golubitsky, J. Marsden, I. Stewart, M. Dellnitz, in: Normal Forms and Homoclinic Chaos, Providence, Rhode Island, 1995."}},{"publication_identifier":{"isbn":["9783540590422","9783540491750"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"status":"public","title":"A packet routing protocol for arbitrary networks","year":"1995","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16704","doi":"10.1007/3-540-59042-0_81","user_id":"15415","citation":{"ieee":"F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in <i>STACS 95</i>, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In <i>STACS 95</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In <i>STACS 95</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” <i>STACS 95</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>.","bibtex":"@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>}, booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1995} }","ama":"Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: <i>STACS 95</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>"},"publication":"STACS 95","place":"Berlin, Heidelberg","date_created":"2020-04-16T13:36:32Z","department":[{"_id":"63"}],"type":"book_chapter"},{"user_id":"15415","doi":"10.1007/3-540-60313-1_133","language":[{"iso":"eng"}],"_id":"16705","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1995","status":"public","title":"Shared memory simulations with triple-logarithmic delay","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Volker","last_name":"Stemann","full_name":"Stemann, Volker"}],"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-16T13:40:52Z","place":"Berlin, Heidelberg","publication":"Lecture Notes in Computer Science","citation":{"ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","mla":"Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>","bibtex":"@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>}, booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995."}},{"user_id":"15415","doi":"10.1145/215399.215430","language":[{"iso":"eng"}],"_id":"16706","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1995","status":"public","title":"Optimal trade-offs between size and slowdown for universal parallel networks","publication_identifier":{"isbn":["0897917170"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Storch, Martin","last_name":"Storch","first_name":"Martin"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:47:15Z","publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","citation":{"ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>, 1995.","apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>","chicago":"Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995, doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>}, booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}, year={1995} }","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>. ; 1995. doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>"}},{"date_created":"2020-04-16T13:49:13Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","citation":{"ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. ; 1995. doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>}, booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","mla":"Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995, doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: <a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>."},"language":[{"iso":"eng"}],"_id":"16707","doi":"10.1109/istcs.1995.377051","user_id":"15415","status":"public","title":"Improved optimal shared memory simulations, and the power of reconfiguration","year":"1995","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"isbn":["0818669152"]},"date_updated":"2022-01-06T06:52:54Z","publication_status":"published"},{"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","title":"Hot-potato routing on multi-dimensional tori","status":"public","year":"1995","publication_identifier":{"isbn":["9783540606185","9783540484875"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Westermann","first_name":"Matthias","full_name":"Westermann, Matthias"}],"doi":"10.1007/3-540-60618-1_77","user_id":"15415","language":[{"iso":"eng"}],"_id":"16717","publication":"Graph-Theoretic Concepts in Computer Science","citation":{"ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>.","chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>","ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg, 1995."},"type":"book_chapter","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-17T07:46:18Z"},{"citation":{"mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>.","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg}, title={Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995."},"publication":"Lecture Notes in Computer Science","date_created":"2020-04-27T13:59:05Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bäumker, Armin","first_name":"Armin","last_name":"Bäumker"},{"last_name":"Dittrich","first_name":"Wolfgang","full_name":"Dittrich, Wolfgang"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"status":"public","year":"1995","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","publication_status":"published","date_updated":"2022-01-06T06:52:58Z","_id":"16874","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/3-540-60313-1_131"},{"intvolume":"        12","date_updated":"2022-01-06T06:50:47Z","author":[{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"full_name":"Rinner, Bernhard","first_name":"Bernhard","last_name":"Rinner"},{"full_name":"Weiss, Reinhold","last_name":"Weiss","first_name":"Reinhold"}],"title":"Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation","status":"public","year":"1995","volume":12,"user_id":"398","language":[{"iso":"eng"}],"_id":"10610","publisher":"Springer","page":"811-820","extern":"1","citation":{"bibtex":"@article{Platzner_Rinner_Weiss_1995, title={Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation}, volume={12}, journal={J.UCS Journal of Universal Computer Science}, publisher={Springer}, author={Platzner, Marco and Rinner, Bernhard and Weiss, Reinhold}, year={1995}, pages={811–820} }","ama":"Platzner M, Rinner B, Weiss R. Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. <i>JUCS Journal of Universal Computer Science</i>. 1995;12:811-820.","mla":"Platzner, Marco, et al. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” <i>J.UCS Journal of Universal Computer Science</i>, vol. 12, Springer, 1995, pp. 811–20.","chicago":"Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” <i>J.UCS Journal of Universal Computer Science</i> 12 (1995): 811–20.","short":"M. Platzner, B. Rinner, R. Weiss, J.UCS Journal of Universal Computer Science 12 (1995) 811–820.","ieee":"M. Platzner, B. Rinner, and R. Weiss, “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation,” <i>J.UCS Journal of Universal Computer Science</i>, vol. 12, pp. 811–820, 1995.","apa":"Platzner, M., Rinner, B., &#38; Weiss, R. (1995). Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. <i>J.UCS Journal of Universal Computer Science</i>, <i>12</i>, 811–820."},"publication":"J.UCS Journal of Universal Computer Science","department":[{"_id":"78"}],"type":"journal_article","date_created":"2019-07-10T09:23:10Z"},{"oa":"1","department":[{"_id":"54"}],"type":"conference","date_created":"2019-07-12T05:27:40Z","abstract":[{"lang":"eng","text":"Clustering techniques have been integrated at different levels into the training procedure of a continuous-density hidden Markov model (HMM) speech recognizer. These clustering techniques can be used in two ways. First acoustically similar states are tied together. It will help to reduce the number of parameters but also allow to train otherwise rarely seen states together with more robust ones (state-tying). Secondly densities are clustered across states, this reduces the number of densities while at the same time keeping the best performances of our recognizer (density-clustering). We have applied these techniques both to word-based small-vocabulary and phoneme-based large-vocabulary recognition tasks. On the WSJ task, we could achieve a reduction of the word error rate by 7%. On the TI/NIST-connected digit task, the number of parameters was reduced by a factor 2-3 while keeping the same string error rate."}],"citation":{"ama":"Dugast C, Beyerlein P, Haeb-Umbach R. Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition. In: <i>ICASSP, Detroit</i>. ; 1995.","bibtex":"@inproceedings{Dugast_Beyerlein_Haeb-Umbach_1995, title={Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition}, booktitle={ICASSP, Detroit}, author={Dugast, Christian and Beyerlein, Peter and Haeb-Umbach, Reinhold}, year={1995} }","mla":"Dugast, Christian, et al. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” <i>ICASSP, Detroit</i>, 1995.","short":"C. Dugast, P. Beyerlein, R. Haeb-Umbach, in: ICASSP, Detroit, 1995.","chicago":"Dugast, Christian, Peter Beyerlein, and Reinhold Haeb-Umbach. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” In <i>ICASSP, Detroit</i>, 1995.","apa":"Dugast, C., Beyerlein, P., &#38; Haeb-Umbach, R. (1995). Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition. In <i>ICASSP, Detroit</i>.","ieee":"C. Dugast, P. Beyerlein, and R. Haeb-Umbach, “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition,” in <i>ICASSP, Detroit</i>, 1995."},"publication":"ICASSP, Detroit","user_id":"44006","_id":"11757","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/1995/ICASSP_1995_Haeb_paper.pdf"}],"date_updated":"2022-01-06T06:51:08Z","author":[{"last_name":"Dugast","first_name":"Christian","full_name":"Dugast, Christian"},{"last_name":"Beyerlein","first_name":"Peter","full_name":"Beyerlein, Peter"},{"last_name":"Haeb-Umbach","first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold","id":"242"}],"title":"Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition","year":"1995","status":"public"},{"date_updated":"2022-01-06T06:51:08Z","status":"public","title":"User interface design of voice controlled consumer electronics","year":"1995","author":[{"last_name":"Gamm","first_name":"Stephan","full_name":"Gamm, Stephan"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach"}],"user_id":"44006","_id":"11764","language":[{"iso":"eng"}],"abstract":[{"text":"Today speech recognition of a small vocabulary can be realized so cost-effectively that the technology can penetrate into consumer electronics. But, as first applications that failed on the market show, it is by no means obvious how to incorporate voice control in a user interface. This paper addresses the issue of how to design a voice control so that the user perceives it as a benefit. User interface guidelines that are adapted or specific to voice control are presented. Then the process of designing a voice control in the user-centred approach is described. By means of two examples, the car stereo and telephone answering machine, it is shown how this is turned into practice.","lang":"eng"}],"publication":"Philips Journal of Research","citation":{"apa":"Gamm, S., &#38; Haeb-Umbach, R. (1995). User interface design of voice controlled consumer electronics. <i>Philips Journal of Research</i>.","mla":"Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice Controlled Consumer Electronics.” <i>Philips Journal of Research</i>, 1995.","ieee":"S. Gamm and R. Haeb-Umbach, “User interface design of voice controlled consumer electronics,” <i>Philips Journal of Research</i>, 1995.","ama":"Gamm S, Haeb-Umbach R. User interface design of voice controlled consumer electronics. <i>Philips Journal of Research</i>. 1995.","short":"S. Gamm, R. Haeb-Umbach, Philips Journal of Research (1995).","chicago":"Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice Controlled Consumer Electronics.” <i>Philips Journal of Research</i>, 1995.","bibtex":"@article{Gamm_Haeb-Umbach_1995, title={User interface design of voice controlled consumer electronics}, journal={Philips Journal of Research}, author={Gamm, Stephan and Haeb-Umbach, Reinhold}, year={1995} }"},"type":"journal_article","department":[{"_id":"54"}],"date_created":"2019-07-12T05:27:48Z"},{"user_id":"44006","language":[{"iso":"eng"}],"_id":"11765","date_updated":"2022-01-06T06:51:08Z","author":[{"full_name":"Gamm, Stephan","first_name":"Stephan","last_name":"Gamm"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach"}],"title":"Human Factors of a Voice-Controlled Car Stereo","year":"1995","status":"public","department":[{"_id":"54"}],"type":"conference","date_created":"2019-07-12T05:27:49Z","citation":{"mla":"Gamm, Stephan, and Reinhold Haeb-Umbach. “Human Factors of a Voice-Controlled Car Stereo.” <i>Eurospeech, Madrid</i>, 1995.","bibtex":"@inproceedings{Gamm_Haeb-Umbach_1995, title={Human Factors of a Voice-Controlled Car Stereo}, booktitle={Eurospeech, Madrid}, author={Gamm, Stephan and Haeb-Umbach, Reinhold}, year={1995} }","ama":"Gamm S, Haeb-Umbach R. Human Factors of a Voice-Controlled Car Stereo. In: <i>Eurospeech, Madrid</i>. ; 1995.","ieee":"S. Gamm and R. Haeb-Umbach, “Human Factors of a Voice-Controlled Car Stereo,” in <i>Eurospeech, Madrid</i>, 1995.","apa":"Gamm, S., &#38; Haeb-Umbach, R. (1995). Human Factors of a Voice-Controlled Car Stereo. In <i>Eurospeech, Madrid</i>.","chicago":"Gamm, Stephan, and Reinhold Haeb-Umbach. “Human Factors of a Voice-Controlled Car Stereo.” In <i>Eurospeech, Madrid</i>, 1995.","short":"S. Gamm, R. Haeb-Umbach, in: Eurospeech, Madrid, 1995."},"publication":"Eurospeech, Madrid"},{"date_updated":"2022-01-06T06:51:08Z","year":"1995","title":"The Usability Engineering of a Voice-Controlled Answering Machine","status":"public","author":[{"first_name":"Stephan","last_name":"Gamm","full_name":"Gamm, Stephan"},{"full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","last_name":"Haeb-Umbach","id":"242"},{"last_name":"Langmann","first_name":"Det","full_name":"Langmann, Det"}],"user_id":"44006","language":[{"iso":"eng"}],"_id":"11768","publication":"International Symposium on Human Factors in Telecommunications, Melbourne","citation":{"chicago":"Gamm, Stephan, Reinhold Haeb-Umbach, and Det Langmann. “The Usability Engineering of a Voice-Controlled Answering Machine.” In <i>International Symposium on Human Factors in Telecommunications, Melbourne</i>, 1995.","short":"S. Gamm, R. Haeb-Umbach, D. Langmann, in: International Symposium on Human Factors in Telecommunications, Melbourne, 1995.","apa":"Gamm, S., Haeb-Umbach, R., &#38; Langmann, D. (1995). The Usability Engineering of a Voice-Controlled Answering Machine. In <i>International Symposium on Human Factors in Telecommunications, Melbourne</i>.","ieee":"S. Gamm, R. Haeb-Umbach, and D. Langmann, “The Usability Engineering of a Voice-Controlled Answering Machine,” in <i>International Symposium on Human Factors in Telecommunications, Melbourne</i>, 1995.","ama":"Gamm S, Haeb-Umbach R, Langmann D. The Usability Engineering of a Voice-Controlled Answering Machine. In: <i>International Symposium on Human Factors in Telecommunications, Melbourne</i>. ; 1995.","bibtex":"@inproceedings{Gamm_Haeb-Umbach_Langmann_1995, title={The Usability Engineering of a Voice-Controlled Answering Machine}, booktitle={International Symposium on Human Factors in Telecommunications, Melbourne}, author={Gamm, Stephan and Haeb-Umbach, Reinhold and Langmann, Det}, year={1995} }","mla":"Gamm, Stephan, et al. “The Usability Engineering of a Voice-Controlled Answering Machine.” <i>International Symposium on Human Factors in Telecommunications, Melbourne</i>, 1995."},"type":"conference","department":[{"_id":"54"}],"date_created":"2019-07-12T05:27:53Z"},{"publication":"Philips Journal of Research","citation":{"ama":"Haeb-Umbach R, Beyerlein P, Geller D. Speech recognition algorithms for voice control interfaces. <i>Philips Journal of Research</i>. 1995.","bibtex":"@article{Haeb-Umbach_Beyerlein_Geller_1995, title={Speech recognition algorithms for voice control interfaces}, journal={Philips Journal of Research}, author={Haeb-Umbach, Reinhold and Beyerlein, Peter and Geller, Dieter}, year={1995} }","mla":"Haeb-Umbach, Reinhold, et al. “Speech Recognition Algorithms for Voice Control Interfaces.” <i>Philips Journal of Research</i>, 1995.","chicago":"Haeb-Umbach, Reinhold, Peter Beyerlein, and Dieter Geller. “Speech Recognition Algorithms for Voice Control Interfaces.” <i>Philips Journal of Research</i>, 1995.","short":"R. Haeb-Umbach, P. Beyerlein, D. Geller, Philips Journal of Research (1995).","apa":"Haeb-Umbach, R., Beyerlein, P., &#38; Geller, D. (1995). Speech recognition algorithms for voice control interfaces. <i>Philips Journal of Research</i>.","ieee":"R. Haeb-Umbach, P. Beyerlein, and D. Geller, “Speech recognition algorithms for voice control interfaces,” <i>Philips Journal of Research</i>, 1995."},"abstract":[{"lang":"eng","text":"Recognition accuracy has been the primary objective of most speech recognition research, and impressive results have been obtained, e.g. less than 0.3% word error rate on a speaker-independent digit recognition task. When it comes to real-world applications, robustness and real-time response might be more important issues. For the first requirement we review some of the work on robustness and discuss one specific technique, spectral normalization, in more detail. The requirement of real-time response has to be considered in the light of the limited hardware resources in voice control applications, which are due to the tight cost constraints. In this paper we discuss in detail one specific means to reduce the processing and memory demands: a clustering technique applied at various levels within the acoustic modelling."}],"date_created":"2019-07-12T05:28:14Z","type":"journal_article","department":[{"_id":"54"}],"title":"Speech recognition algorithms for voice control interfaces","status":"public","year":"1995","author":[{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"full_name":"Beyerlein, Peter","first_name":"Peter","last_name":"Beyerlein"},{"full_name":"Geller, Dieter","first_name":"Dieter","last_name":"Geller"}],"date_updated":"2022-01-06T06:51:08Z","_id":"11786","language":[{"iso":"eng"}],"user_id":"44006"},{"date_updated":"2022-01-06T06:51:08Z","author":[{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"full_name":"Beyerlein, P.","first_name":"P.","last_name":"Beyerlein"},{"last_name":"Thelen","first_name":"E.","full_name":"Thelen, E."}],"year":"1995","status":"public","title":"Automatic Transcription of Unknown Words in a Speech Recognition System","user_id":"44006","_id":"11787","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/1995/ICASSP_1995_Haeb1_paper.pdf"}],"abstract":[{"lang":"eng","text":"We address the problem of automatically finding an acoustic representation (i.e. a transcription) of unknown words as a sequence of subword units, given a few sample utterances of the unknown words, and an inventory of speaker-independent subword units. The problem arises if a user wants to add his own vocabulary to a speaker-independent recognition system simply by speaking the words a few times. Two methods are investigated which are both based on a maximum-likelihood formulation of the problem. The experimental results show that both automatic transcription methods provide a good estimate of the acoustic models of unknown words. The recognition error rates obtained with such models in a speaker-independent recognition task are clearly better than those resulting from separate whole-word models. They are comparable with the performance of transcriptions drawn from a dictionary."}],"citation":{"mla":"Haeb-Umbach, Reinhold, et al. “Automatic Transcription of Unknown Words in a Speech Recognition System.” <i>ICASSP, Detroit</i>, 1995.","bibtex":"@inproceedings{Haeb-Umbach_Beyerlein_Thelen_1995, title={Automatic Transcription of Unknown Words in a Speech Recognition System}, booktitle={ICASSP, Detroit}, author={Haeb-Umbach, Reinhold and Beyerlein, P. and Thelen, E.}, year={1995} }","ama":"Haeb-Umbach R, Beyerlein P, Thelen E. Automatic Transcription of Unknown Words in a Speech Recognition System. In: <i>ICASSP, Detroit</i>. ; 1995.","ieee":"R. Haeb-Umbach, P. Beyerlein, and E. Thelen, “Automatic Transcription of Unknown Words in a Speech Recognition System,” in <i>ICASSP, Detroit</i>, 1995.","apa":"Haeb-Umbach, R., Beyerlein, P., &#38; Thelen, E. (1995). Automatic Transcription of Unknown Words in a Speech Recognition System. In <i>ICASSP, Detroit</i>.","chicago":"Haeb-Umbach, Reinhold, P. Beyerlein, and E. Thelen. “Automatic Transcription of Unknown Words in a Speech Recognition System.” In <i>ICASSP, Detroit</i>, 1995.","short":"R. Haeb-Umbach, P. Beyerlein, E. Thelen, in: ICASSP, Detroit, 1995."},"publication":"ICASSP, Detroit","oa":"1","department":[{"_id":"54"}],"type":"conference","date_created":"2019-07-12T05:28:15Z"},{"department":[{"_id":"54"}],"type":"journal_article","date_created":"2019-07-12T05:30:31Z","abstract":[{"text":"This paper gives an overview of the Philips Research system for continuous-speech recognition. The recognition architecture is based on an integrated statistical approach. The system has been successfully applied to various tasks in American English and German, ranging from small vocabulary tasks to very large vocabulary tasks and from recognition only to speech understanding. Here, we concentrate on phoneme-based continuous-speech recognition for large vocabulary recognition as used for dictation, which covers a significant part of our research work on speech recognition. We describe this task and report on experimental results. In order to allow a comparison with the performance of other systems, a section with an evaluation on the standard North American Business news (NAB2) task (dictation of American English newspaper text) is supplied.","lang":"eng"}],"citation":{"short":"V. Steinbiss, H.J. Ney, X.L. Aubert, S. Besling, C. Dugast, U. Essen, D. Geller, R. Haeb-Umbach, R. Kneser, H.G. Meier, M. Oerder, B.H. Tran, Philips Journal of Research (1995).","chicago":"Steinbiss, Volker, Hermann J. Ney, Xavier L. Aubert, Stefan Besling, Christian Dugast, Ute Essen, Dieter Geller, et al. “The Philips Research System for Continuous-Speech Dictation.” <i>Philips Journal of Research</i>, 1995.","ieee":"V. Steinbiss <i>et al.</i>, “The Philips Research system for continuous-speech dictation,” <i>Philips Journal of Research</i>, 1995.","apa":"Steinbiss, V., Ney, H. J., Aubert, X. L., Besling, S., Dugast, C., Essen, U., … Tran, B. H. (1995). The Philips Research system for continuous-speech dictation. <i>Philips Journal of Research</i>.","bibtex":"@article{Steinbiss_Ney_Aubert_Besling_Dugast_Essen_Geller_Haeb-Umbach_Kneser_Meier_et al._1995, title={The Philips Research system for continuous-speech dictation}, journal={Philips Journal of Research}, author={Steinbiss, Volker and Ney, Hermann J. and Aubert, Xavier L. and Besling, Stefan and Dugast, Christian and Essen, Ute and Geller, Dieter and Haeb-Umbach, Reinhold and Kneser, Reinhard and Meier, Hans Günter and et al.}, year={1995} }","ama":"Steinbiss V, Ney HJ, Aubert XL, et al. The Philips Research system for continuous-speech dictation. <i>Philips Journal of Research</i>. 1995.","mla":"Steinbiss, Volker, et al. “The Philips Research System for Continuous-Speech Dictation.” <i>Philips Journal of Research</i>, 1995."},"publication":"Philips Journal of Research","user_id":"44006","language":[{"iso":"eng"}],"_id":"11905","date_updated":"2022-01-06T06:51:12Z","author":[{"full_name":"Steinbiss, Volker","last_name":"Steinbiss","first_name":"Volker"},{"last_name":"Ney","first_name":"Hermann J.","full_name":"Ney, Hermann J."},{"full_name":"Aubert, Xavier L.","first_name":"Xavier L.","last_name":"Aubert"},{"last_name":"Besling","first_name":"Stefan","full_name":"Besling, Stefan"},{"first_name":"Christian","last_name":"Dugast","full_name":"Dugast, Christian"},{"full_name":"Essen, Ute","first_name":"Ute","last_name":"Essen"},{"first_name":"Dieter","last_name":"Geller","full_name":"Geller, Dieter"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"first_name":"Reinhard","last_name":"Kneser","full_name":"Kneser, Reinhard"},{"full_name":"Meier, Hans Günter","last_name":"Meier","first_name":"Hans Günter"},{"first_name":"Martin","last_name":"Oerder","full_name":"Oerder, Martin"},{"last_name":"Tran","first_name":"Bach Hiep","full_name":"Tran, Bach Hiep"}],"status":"public","year":"1995","title":"The Philips Research system for continuous-speech dictation"},{"language":[{"iso":"eng"}],"_id":"11948","user_id":"44006","author":[{"first_name":"Volker","last_name":"Steinbiss","full_name":"Steinbiss, Volker"},{"full_name":"Ney, Hermann J.","last_name":"Ney","first_name":"Hermann J."},{"full_name":"Essen, Ute","first_name":"Ute","last_name":"Essen"},{"full_name":"Tran, Bach Hiep","first_name":"Bach Hiep","last_name":"Tran"},{"full_name":"Aubert, Xavier L.","first_name":"Xavier L.","last_name":"Aubert"},{"full_name":"Dugast, Christian","first_name":"Christian","last_name":"Dugast"},{"first_name":"Reinhard","last_name":"Kneser","full_name":"Kneser, Reinhard"},{"full_name":"Meier, Hans Günter","last_name":"Meier","first_name":"Hans Günter"},{"full_name":"Oerder, Martin","last_name":"Oerder","first_name":"Martin"},{"last_name":"Haeb-Umbach","first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold","id":"242"},{"last_name":"Geller","first_name":"Dieter","full_name":"Geller, Dieter"},{"full_name":"Hoellerbauer, W.","first_name":"W.","last_name":"Hoellerbauer"},{"first_name":"H.","last_name":"Bartosik","full_name":"Bartosik, H."}],"year":"1995","title":"Continuous speech dictation - From theory to practice","status":"public","date_updated":"2022-01-06T06:51:13Z","date_created":"2019-07-12T12:22:00Z","department":[{"_id":"54"}],"type":"journal_article","citation":{"chicago":"Steinbiss, Volker, Hermann J. Ney, Ute Essen, Bach Hiep Tran, Xavier L. Aubert, Christian Dugast, Reinhard Kneser, et al. “Continuous Speech Dictation - From Theory to Practice.” <i>Speech Communication</i>, 1995.","short":"V. Steinbiss, H.J. Ney, U. Essen, B.H. Tran, X.L. Aubert, C. Dugast, R. Kneser, H.G. Meier, M. Oerder, R. Haeb-Umbach, D. Geller, W. Hoellerbauer, H. Bartosik, Speech Communication (1995).","apa":"Steinbiss, V., Ney, H. J., Essen, U., Tran, B. H., Aubert, X. L., Dugast, C., … Bartosik, H. (1995). Continuous speech dictation - From theory to practice. <i>Speech Communication</i>.","ieee":"V. Steinbiss <i>et al.</i>, “Continuous speech dictation - From theory to practice,” <i>Speech Communication</i>, 1995.","ama":"Steinbiss V, Ney HJ, Essen U, et al. Continuous speech dictation - From theory to practice. <i>Speech Communication</i>. 1995.","bibtex":"@article{Steinbiss_Ney_Essen_Tran_Aubert_Dugast_Kneser_Meier_Oerder_Haeb-Umbach_et al._1995, title={Continuous speech dictation - From theory to practice}, journal={Speech Communication}, author={Steinbiss, Volker and Ney, Hermann J. and Essen, Ute and Tran, Bach Hiep and Aubert, Xavier L. and Dugast, Christian and Kneser, Reinhard and Meier, Hans Günter and Oerder, Martin and Haeb-Umbach, Reinhold and et al.}, year={1995} }","mla":"Steinbiss, Volker, et al. “Continuous Speech Dictation - From Theory to Practice.” <i>Speech Communication</i>, 1995."},"publication":"Speech Communication","abstract":[{"lang":"eng","text":"This paper gives an overview of the Philips research system for phoneme-based, large-vocabulary, continuousspeech recognition. The system has been successfully applied to various tasks in the German and (American) English languages, ranging from small vocabulary tasks to very large vocabulary tasks. Here, we concentrate on continuousspeech recognition for dictation in real applications, the dictation of legal reports and radiology reports in German. We describe this task and report on experimental results. We also describe a commercial PC-based dictation system which includes a PC implementation of our scientific recognition prototype. In order to allow for a comparison with the performance of other systems, a section with an evaluation on the standard Wall Street Journal task (dictation of American English newspaper text) is supplied. The recognition architecture is based on an integrated statistical approach. We describe the characteristic features of the system as opposed to other systems: 1. the Viterbi criterion is consistently applied both in training and testing; 2. continuous mixture densities are used without tying or smoothing; 3. time-synchronous beam search in connection with a phoneme look-ahead is applied to a tree-organized lexicon."}]},{"date_updated":"2022-01-06T06:51:27Z","author":[{"full_name":"Hellebrand, Sybille","first_name":"Sybille","orcid":"0000-0002-3717-3939","last_name":"Hellebrand","id":"209"},{"full_name":"Wunderlich, Hans-Joachim","first_name":"Hans-Joachim","last_name":"Wunderlich"}],"status":"public","title":"Synthesis Procedures for Self-Testable Controllers","year":"1995","user_id":"659","_id":"13026","language":[{"iso":"eng"}],"extern":"1","citation":{"apa":"Hellebrand, S., &#38; Wunderlich, H.-J. (1995). <i>Synthesis Procedures for Self-Testable Controllers</i>. University of Siegen, Germany.","ieee":"S. Hellebrand and H.-J. Wunderlich, <i>Synthesis Procedures for Self-Testable Controllers</i>. University of Siegen, Germany, 1995.","chicago":"Hellebrand, Sybille, and Hans-Joachim Wunderlich. <i>Synthesis Procedures for Self-Testable Controllers</i>. University of Siegen, Germany, 1995.","short":"S. Hellebrand, H.-J. Wunderlich, Synthesis Procedures for Self-Testable Controllers, University of Siegen, Germany, 1995.","mla":"Hellebrand, Sybille, and Hans-Joachim Wunderlich. <i>Synthesis Procedures for Self-Testable Controllers</i>. 1995.","ama":"Hellebrand S, Wunderlich H-J. <i>Synthesis Procedures for Self-Testable Controllers</i>. University of Siegen, Germany; 1995.","bibtex":"@book{Hellebrand_Wunderlich_1995, place={University of Siegen, Germany}, title={Synthesis Procedures for Self-Testable Controllers}, author={Hellebrand, Sybille and Wunderlich, Hans-Joachim}, year={1995} }"},"department":[{"_id":"48"}],"type":"report","place":"University of Siegen, Germany","date_created":"2019-08-28T10:32:24Z"},{"type":"report","department":[{"_id":"48"}],"place":"University Siegen, Germany","date_created":"2019-08-28T10:32:25Z","extern":"1","citation":{"ieee":"S. Hellebrand, H.-J. Wunderlich, F. Goncalves, and J. Paulo Teixeira, <i>Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis</i>. University Siegen, Germany, 1995.","apa":"Hellebrand, S., Wunderlich, H.-J., Goncalves, F., &#38; Paulo Teixeira, J. (1995). <i>Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis</i>. University Siegen, Germany.","chicago":"Hellebrand, Sybille, Hans-Joachim Wunderlich, F. Goncalves, and Joao Paulo Teixeira. <i>Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis</i>. University Siegen, Germany, 1995.","short":"S. Hellebrand, H.-J. Wunderlich, F. Goncalves, J. Paulo Teixeira, Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis, University Siegen, Germany, 1995.","mla":"Hellebrand, Sybille, et al. <i>Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis</i>. 1995.","bibtex":"@book{Hellebrand_Wunderlich_Goncalves_Paulo Teixeira_1995, place={University Siegen, Germany}, title={Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis}, author={Hellebrand, Sybille and Wunderlich, Hans-Joachim and Goncalves, F. and Paulo Teixeira, Joao}, year={1995} }","ama":"Hellebrand S, Wunderlich H-J, Goncalves F, Paulo Teixeira J. <i>Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis</i>. University Siegen, Germany; 1995."},"user_id":"659","_id":"13027","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:27Z","year":"1995","status":"public","title":"Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis","author":[{"full_name":"Hellebrand, Sybille","orcid":"0000-0002-3717-3939","last_name":"Hellebrand","first_name":"Sybille","id":"209"},{"first_name":"Hans-Joachim","last_name":"Wunderlich","full_name":"Wunderlich, Hans-Joachim"},{"full_name":"Goncalves, F.","last_name":"Goncalves","first_name":"F."},{"last_name":"Paulo Teixeira","first_name":"Joao","full_name":"Paulo Teixeira, Joao"}]},{"extern":"1","citation":{"chicago":"Hellebrand, Sybille, Maik Herzog, and Hans-Joachim Wunderlich. <i>Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing</i>. University of Siegen, Germany, 1995.","short":"S. Hellebrand, M. Herzog, H.-J. Wunderlich, Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing, University of Siegen, Germany, 1995.","ieee":"S. Hellebrand, M. Herzog, and H.-J. Wunderlich, <i>Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing</i>. University of Siegen, Germany, 1995.","apa":"Hellebrand, S., Herzog, M., &#38; Wunderlich, H.-J. (1995). <i>Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing</i>. University of Siegen, Germany.","bibtex":"@book{Hellebrand_Herzog_Wunderlich_1995, place={University of Siegen, Germany}, title={Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing}, author={Hellebrand, Sybille and Herzog, Maik and Wunderlich, Hans-Joachim}, year={1995} }","ama":"Hellebrand S, Herzog M, Wunderlich H-J. <i>Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing</i>. University of Siegen, Germany; 1995.","mla":"Hellebrand, Sybille, et al. <i>Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing</i>. 1995."},"type":"report","department":[{"_id":"48"}],"date_created":"2019-08-28T10:32:26Z","place":"University of Siegen, Germany","date_updated":"2022-01-06T06:51:27Z","year":"1995","title":"Partitioning of CMOS-Circuits for On-Chip IDDQ-Testing","status":"public","author":[{"full_name":"Hellebrand, Sybille","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","first_name":"Sybille","id":"209"},{"first_name":"Maik","last_name":"Herzog","full_name":"Herzog, Maik"},{"full_name":"Wunderlich, Hans-Joachim","last_name":"Wunderlich","first_name":"Hans-Joachim"}],"user_id":"659","_id":"13028","language":[{"iso":"eng"}]},{"page":"150-154","language":[{"iso":"eng"}],"_id":"15294","user_id":"49109","editor":[{"full_name":"Zimmermann, H.J.","first_name":"H.J.","last_name":"Zimmermann"}],"title":"Towards modelling of fuzzy functions","status":"public","year":"1995","author":[{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"date_updated":"2022-01-06T06:52:20Z","date_created":"2019-12-11T15:17:11Z","type":"conference","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"publication":"in Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany","citation":{"apa":"Hüllermeier, E. (1995). Towards modelling of fuzzy functions. In H. J. Zimmermann (Ed.), <i>in Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany</i> (pp. 150–154).","ieee":"E. Hüllermeier, “Towards modelling of fuzzy functions,” in <i>in Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany</i>, 1995, pp. 150–154.","short":"E. Hüllermeier, in: H.J. Zimmermann (Ed.), In Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany, 1995, pp. 150–154.","chicago":"Hüllermeier, Eyke. “Towards Modelling of Fuzzy Functions.” In <i>In Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany</i>, edited by H.J. Zimmermann, 150–54, 1995.","mla":"Hüllermeier, Eyke. “Towards Modelling of Fuzzy Functions.” <i>In Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany</i>, edited by H.J. Zimmermann, 1995, pp. 150–54.","ama":"Hüllermeier E. Towards modelling of fuzzy functions. In: Zimmermann HJ, ed. <i>In Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany</i>. ; 1995:150-154.","bibtex":"@inproceedings{Hüllermeier_1995, title={Towards modelling of fuzzy functions}, booktitle={in Proceedings EUFIT-95 3rd European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany}, author={Hüllermeier, Eyke}, editor={Zimmermann, H.J.Editor}, year={1995}, pages={150–154} }"}}]