--- _id: '16551' abstract: - lang: eng text: Spiral patterns have been observed experimentally, numerically, and theoretically in a variety of systems. It is often believed that these spiral wave patterns can occur only in systems of reaction–diffusion equations. We show, both theoretically (using Hopf bifurcation techniques) and numerically (using both direct simulation and continuation of rotating waves) that spiral wave patterns can appear in a single reaction–diffusion equation [ in u(x, t)] on a disk, if one assumes "spiral" boundary conditions (ur = muθ). Spiral boundary conditions are motivated by assuming that a solution is infinitesimally an Archimedian spiral near the boundary. It follows from a bifurcation analysis that for this form of spirals there are no singularities in the spiral pattern (technically there is no spiral tip) and that at bifurcation there is a steep gradient between the "red" and "blue" arms of the spiral. author: - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz - first_name: Martin full_name: Golubitsky, Martin last_name: Golubitsky - first_name: Andreas full_name: Hohmann, Andreas last_name: Hohmann - first_name: Ian full_name: Stewart, Ian last_name: Stewart citation: ama: Dellnitz M, Golubitsky M, Hohmann A, Stewart I. Spirals in Scalar Reaction–Diffusion Equations. International Journal of Bifurcation and Chaos. 1995:1487-1501. doi:10.1142/s0218127495001149 apa: Dellnitz, M., Golubitsky, M., Hohmann, A., & Stewart, I. (1995). Spirals in Scalar Reaction–Diffusion Equations. International Journal of Bifurcation and Chaos, 1487–1501. https://doi.org/10.1142/s0218127495001149 bibtex: '@article{Dellnitz_Golubitsky_Hohmann_Stewart_1995, title={Spirals in Scalar Reaction–Diffusion Equations}, DOI={10.1142/s0218127495001149}, journal={International Journal of Bifurcation and Chaos}, author={Dellnitz, Michael and Golubitsky, Martin and Hohmann, Andreas and Stewart, Ian}, year={1995}, pages={1487–1501} }' chicago: Dellnitz, Michael, Martin Golubitsky, Andreas Hohmann, and Ian Stewart. “Spirals in Scalar Reaction–Diffusion Equations.” International Journal of Bifurcation and Chaos, 1995, 1487–1501. https://doi.org/10.1142/s0218127495001149. ieee: M. Dellnitz, M. Golubitsky, A. Hohmann, and I. Stewart, “Spirals in Scalar Reaction–Diffusion Equations,” International Journal of Bifurcation and Chaos, pp. 1487–1501, 1995. mla: Dellnitz, Michael, et al. “Spirals in Scalar Reaction–Diffusion Equations.” International Journal of Bifurcation and Chaos, 1995, pp. 1487–501, doi:10.1142/s0218127495001149. short: M. Dellnitz, M. Golubitsky, A. Hohmann, I. Stewart, International Journal of Bifurcation and Chaos (1995) 1487–1501. date_created: 2020-04-15T09:05:30Z date_updated: 2022-01-06T06:52:52Z department: - _id: '101' doi: 10.1142/s0218127495001149 language: - iso: eng page: 1487-1501 publication: International Journal of Bifurcation and Chaos publication_identifier: issn: - 0218-1274 - 1793-6551 publication_status: published status: public title: Spirals in Scalar Reaction–Diffusion Equations type: journal_article user_id: '15701' year: '1995' ... --- _id: '16566' author: - first_name: Dany full_name: Breslauer, Dany last_name: Breslauer - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Devdatt P. full_name: Dubhashi, Devdatt P. last_name: Dubhashi - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x apa: Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x bibtex: '@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995}, pages={103–110} }' chicago: Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x. ieee: D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” Information Processing Letters, pp. 103–110, 1995. mla: Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” Information Processing Letters, 1995, pp. 103–10, doi:10.1016/s0020-0190(97)00032-x. short: D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110. date_created: 2020-04-15T11:28:35Z date_updated: 2022-01-06T06:52:52Z department: - _id: '63' doi: 10.1016/s0020-0190(97)00032-x language: - iso: eng page: 103-110 publication: Information Processing Letters publication_identifier: issn: - 0020-0190 publication_status: published status: public title: Transforming comparison model lower bounds to the parallel-random-access-machine type: journal_article user_id: '15415' year: '1995' ... --- _id: '16611' author: - first_name: Martin full_name: Golubitsky, Martin last_name: Golubitsky - first_name: Jerrold full_name: Marsden, Jerrold last_name: Marsden - first_name: Ian full_name: Stewart, Ian last_name: Stewart - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz citation: ama: 'Golubitsky M, Marsden J, Stewart I, Dellnitz M. The constrained Liapunov-Schmidt procedure and periodic orbits. In: Normal Forms and Homoclinic Chaos. Providence, Rhode Island; 1995. doi:10.1090/fic/004/05' apa: Golubitsky, M., Marsden, J., Stewart, I., & Dellnitz, M. (1995). The constrained Liapunov-Schmidt procedure and periodic orbits. In Normal Forms and Homoclinic Chaos. Providence, Rhode Island. https://doi.org/10.1090/fic/004/05 bibtex: '@inbook{Golubitsky_Marsden_Stewart_Dellnitz_1995, place={Providence, Rhode Island}, title={The constrained Liapunov-Schmidt procedure and periodic orbits}, DOI={10.1090/fic/004/05}, booktitle={Normal Forms and Homoclinic Chaos}, author={Golubitsky, Martin and Marsden, Jerrold and Stewart, Ian and Dellnitz, Michael}, year={1995} }' chicago: Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” In Normal Forms and Homoclinic Chaos. Providence, Rhode Island, 1995. https://doi.org/10.1090/fic/004/05. ieee: M. Golubitsky, J. Marsden, I. Stewart, and M. Dellnitz, “The constrained Liapunov-Schmidt procedure and periodic orbits,” in Normal Forms and Homoclinic Chaos, Providence, Rhode Island, 1995. mla: Golubitsky, Martin, et al. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” Normal Forms and Homoclinic Chaos, 1995, doi:10.1090/fic/004/05. short: 'M. Golubitsky, J. Marsden, I. Stewart, M. Dellnitz, in: Normal Forms and Homoclinic Chaos, Providence, Rhode Island, 1995.' date_created: 2020-04-16T08:02:13Z date_updated: 2022-01-06T06:52:53Z department: - _id: '101' doi: 10.1090/fic/004/05 language: - iso: eng place: Providence, Rhode Island publication: Normal Forms and Homoclinic Chaos publication_identifier: isbn: - '9780821803264' - '9781470429720' publication_status: published status: public title: The constrained Liapunov-Schmidt procedure and periodic orbits type: book_chapter user_id: '15701' year: '1995' ... --- _id: '16704' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Berthold full_name: Vöcking, Berthold last_name: Vöcking citation: ama: 'Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81' apa: Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81 bibtex: '@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={10.1007/3-540-59042-0_81}, booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1995} }' chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-59042-0_81. ieee: F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in STACS 95, Berlin, Heidelberg, 1995. mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81. short: 'F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.' date_created: 2020-04-16T13:36:32Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1007/3-540-59042-0_81 language: - iso: eng place: Berlin, Heidelberg publication: STACS 95 publication_identifier: isbn: - '9783540590422' - '9783540491750' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: A packet routing protocol for arbitrary networks type: book_chapter user_id: '15415' year: '1995' ... --- _id: '16705' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Volker full_name: Stemann, Volker last_name: Stemann citation: ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_133' apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133 bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={10.1007/3-540-60313-1_133}, 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 Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133. ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1995. mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133. short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.' date_created: 2020-04-16T13:40:52Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1007/3-540-60313-1_133 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540603139' - '9783540449133' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Shared memory simulations with triple-logarithmic delay type: book_chapter user_id: '15415' year: '1995' ... --- _id: '16706' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Martin full_name: Storch, Martin last_name: Storch - first_name: Rolf full_name: Wanka, Rolf last_name: Wanka citation: ama: 'Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95. ; 1995. doi:10.1145/215399.215430' apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95. https://doi.org/10.1145/215399.215430 bibtex: '@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430}, 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} }' chicago: Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995. https://doi.org/10.1145/215399.215430. ieee: F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” 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.” Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995, doi:10.1145/215399.215430. 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.' date_created: 2020-04-16T13:47:15Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1145/215399.215430 language: - iso: eng publication: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95 publication_identifier: isbn: - '0897917170' publication_status: published status: public title: Optimal trade-offs between size and slowdown for universal parallel networks type: conference user_id: '15415' year: '1995' ... --- _id: '16707' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Volker full_name: Stemann, Volker last_name: Stemann citation: ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: Proceedings Third Israel Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051' apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. Proceedings Third Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051 bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={10.1109/istcs.1995.377051}, 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} }' chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051. ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.' mla: Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051. short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.' date_created: 2020-04-16T13:49:13Z date_updated: 2022-01-06T06:52:54Z department: - _id: '63' doi: 10.1109/istcs.1995.377051 language: - iso: eng publication: Proceedings Third Israel Symposium on the Theory of Computing and Systems publication_identifier: isbn: - '0818669152' publication_status: published status: public title: Improved optimal shared memory simulations, and the power of reconfiguration type: conference user_id: '15415' year: '1995' ... --- _id: '16717' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Matthias full_name: Westermann, Matthias last_name: Westermann citation: ama: 'Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60618-1_77' apa: Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77 bibtex: '@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={10.1007/3-540-60618-1_77}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }' chicago: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77. ieee: F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995. mla: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science, 1995, doi:10.1007/3-540-60618-1_77. short: 'F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.' date_created: 2020-04-17T07:46:18Z date_updated: 2022-01-06T06:52:55Z department: - _id: '63' doi: 10.1007/3-540-60618-1_77 language: - iso: eng place: Berlin, Heidelberg publication: Graph-Theoretic Concepts in Computer Science publication_identifier: isbn: - '9783540606185' - '9783540484875' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Hot-potato routing on multi-dimensional tori type: book_chapter user_id: '15415' year: '1995' ... --- _id: '16874' author: - first_name: Armin full_name: Bäumker, Armin last_name: Bäumker - first_name: Wolfgang full_name: Dittrich, Wolfgang last_name: Dittrich - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: 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: Lecture Notes in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131' apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131' 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={10.1007/3-540-60313-1_131}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={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 Lecture Notes in Computer Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_131.' 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 Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.' mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_131.' short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.' date_created: 2020-04-27T13:59:05Z date_updated: 2022-01-06T06:52:58Z department: - _id: '63' doi: 10.1007/3-540-60313-1_131 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540603139' - '9783540449133' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model' type: book_chapter user_id: '15415' year: '1995' ... --- _id: '10610' author: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Bernhard full_name: Rinner, Bernhard last_name: Rinner - first_name: Reinhold full_name: Weiss, Reinhold last_name: Weiss citation: ama: Platzner M, Rinner B, Weiss R. Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. JUCS Journal of Universal Computer Science. 1995;12:811-820. apa: Platzner, M., Rinner, B., & Weiss, R. (1995). Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation. J.UCS Journal of Universal Computer Science, 12, 811–820. 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} }' chicago: 'Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” J.UCS Journal of Universal Computer Science 12 (1995): 811–20.' ieee: M. Platzner, B. Rinner, and R. Weiss, “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation,” J.UCS Journal of Universal Computer Science, vol. 12, pp. 811–820, 1995. mla: Platzner, Marco, et al. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” J.UCS Journal of Universal Computer Science, vol. 12, Springer, 1995, pp. 811–20. short: M. Platzner, B. Rinner, R. Weiss, J.UCS Journal of Universal Computer Science 12 (1995) 811–820. date_created: 2019-07-10T09:23:10Z date_updated: 2022-01-06T06:50:47Z department: - _id: '78' extern: '1' intvolume: ' 12' language: - iso: eng page: 811-820 publication: J.UCS Journal of Universal Computer Science publisher: Springer status: public title: Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation type: journal_article user_id: '398' volume: 12 year: '1995' ...