--- _id: '16568' abstract: - lang: eng text: "We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Willy-Bernhard full_name: Strothmann, Willy-Bernhard last_name: Strothmann citation: ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: 5th Annual European Symposium on Algorithms (ESA ’97). Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:10.1007/3-540-63397-9_13' apa: Fischer, M., Meyer auf der Heide, F., & Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. 5th Annual European Symposium on Algorithms (ESA ’97), 1284, 157–170. https://doi.org/10.1007/3-540-63397-9_13 bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={10.1007/3-540-63397-9_13}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }' chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In 5th Annual European Symposium on Algorithms (ESA ’97), 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. https://doi.org/10.1007/3-540-63397-9_13.' ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in 5th Annual European Symposium on Algorithms (ESA ’97), 1997, vol. 1284, pp. 157–170, doi: 10.1007/3-540-63397-9_13.' mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” 5th Annual European Symposium on Algorithms (ESA ’97), vol. 1284, Springer, 1997, pp. 157–70, doi:10.1007/3-540-63397-9_13. short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.' date_created: 2020-04-15T11:44:36Z date_updated: 2026-02-23T16:05:33Z department: - _id: '63' doi: 10.1007/3-540-63397-9_13 intvolume: ' 1284' language: - iso: eng page: 157-170 place: Berlin, Heidelberg publication: 5th Annual European Symposium on Algorithms (ESA '97) publication_identifier: isbn: - '9783540633976' - '9783540695363' issn: - 0302-9743 - 1611-3349 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Dynamic data structures for realtime management of large geometric scenes type: conference user_id: '14972' volume: 1284 year: '1997' ... --- _id: '19816' author: - first_name: Hans full_name: Kleine Büning, Hans last_name: Kleine Büning - first_name: Theodor full_name: Lettmann, Theodor id: '315' last_name: Lettmann orcid: 0000-0001-5859-2457 citation: ama: 'Kleine Büning H, Lettmann T. Learning a representation for optimizable formulas. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61863-5_33' apa: Kleine Büning, H., & Lettmann, T. (1996). Learning a representation for optimizable formulas. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-61863-5_33 bibtex: '@inbook{Kleine Büning_Lettmann_1996, place={Berlin, Heidelberg}, title={Learning a representation for optimizable formulas}, DOI={10.1007/3-540-61863-5_33}, booktitle={Lecture Notes in Computer Science}, author={Kleine Büning, Hans and Lettmann, Theodor}, year={1996} }' chicago: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” In Lecture Notes in Computer Science. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-61863-5_33. ieee: H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable formulas,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996. mla: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable Formulas.” Lecture Notes in Computer Science, 1996, doi:10.1007/3-540-61863-5_33. short: 'H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996.' date_created: 2020-10-01T08:15:08Z date_updated: 2022-01-06T06:54:13Z department: - _id: '34' - _id: '355' - _id: '7' doi: 10.1007/3-540-61863-5_33 language: - iso: eng place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540618638' - '9783540707196' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Learning a representation for optimizable formulas type: book_chapter user_id: '315' year: '1996' ... --- _id: '19958' author: - first_name: Frank full_name: Schwarze, Frank last_name: Schwarze - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Klaus full_name: Schröder, Klaus last_name: Schröder citation: ama: Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306. apa: Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I, 299–306. bibtex: '@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par 1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder, Klaus}, year={1996}, pages={299–306} }' chicago: 'Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I (1996): 299–306.' ieee: F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp. 299–306, 1996. mla: Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306. short: F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996) 299–306. date_created: 2020-10-08T12:04:41Z date_updated: 2022-01-06T06:54:17Z department: - _id: '63' language: - iso: eng page: 299-306 publication: Euro-Par 1996 status: public title: Routing on Networks of Optical Crossbars (Extended Abstract). type: journal_article user_id: '15415' volume: I year: '1996' ... --- _id: '3260' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wehrheim H. Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design. University of Hildesheim, Germany; 1996.' apa: 'Wehrheim, H. (1996). Specifying reactive systems with action dependencies: modelling and hierarchical design. University of Hildesheim, Germany.' bibtex: '@book{Wehrheim_1996, title={Specifying reactive systems with action dependencies: modelling and hierarchical design}, publisher={University of Hildesheim, Germany}, author={Wehrheim, Heike}, year={1996} }' chicago: 'Wehrheim, Heike. Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design. University of Hildesheim, Germany, 1996.' ieee: 'H. Wehrheim, Specifying reactive systems with action dependencies: modelling and hierarchical design. University of Hildesheim, Germany, 1996.' mla: 'Wehrheim, Heike. Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design. University of Hildesheim, Germany, 1996.' short: 'H. Wehrheim, Specifying Reactive Systems with Action Dependencies: Modelling and Hierarchical Design, University of Hildesheim, Germany, 1996.' date_created: 2018-06-14T07:44:32Z date_updated: 2022-01-06T06:59:07Z department: - _id: '77' publisher: University of Hildesheim, Germany status: public title: 'Specifying reactive systems with action dependencies: modelling and hierarchical design' type: dissertation user_id: '29719' year: '1996' ... --- _id: '3261' author: - first_name: Ursula full_name: Goltz, Ursula last_name: Goltz - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Goltz U, Wehrheim H. Modelling Causality via Action Dependencies in Branching Time Semantics. Inf Process Lett. 1996;(4):179--184. doi:10.1016/0020-0190(96)00111-1 apa: Goltz, U., & Wehrheim, H. (1996). Modelling Causality via Action Dependencies in Branching Time Semantics. Inf. Process. Lett., (4), 179--184. https://doi.org/10.1016/0020-0190(96)00111-1 bibtex: '@article{Goltz_Wehrheim_1996, title={Modelling Causality via Action Dependencies in Branching Time Semantics}, DOI={10.1016/0020-0190(96)00111-1}, number={4}, journal={Inf. Process. Lett.}, author={Goltz, Ursula and Wehrheim, Heike}, year={1996}, pages={179--184} }' chicago: 'Goltz, Ursula, and Heike Wehrheim. “Modelling Causality via Action Dependencies in Branching Time Semantics.” Inf. Process. Lett., no. 4 (1996): 179--184. https://doi.org/10.1016/0020-0190(96)00111-1.' ieee: U. Goltz and H. Wehrheim, “Modelling Causality via Action Dependencies in Branching Time Semantics,” Inf. Process. Lett., no. 4, pp. 179--184, 1996. mla: Goltz, Ursula, and Heike Wehrheim. “Modelling Causality via Action Dependencies in Branching Time Semantics.” Inf. Process. Lett., no. 4, 1996, pp. 179--184, doi:10.1016/0020-0190(96)00111-1. short: U. Goltz, H. Wehrheim, Inf. Process. Lett. (1996) 179--184. date_created: 2018-06-14T07:52:02Z date_updated: 2022-01-06T06:59:07Z department: - _id: '77' doi: 10.1016/0020-0190(96)00111-1 issue: '4' page: 179--184 publication: Inf. Process. Lett. status: public title: Modelling Causality via Action Dependencies in Branching Time Semantics type: journal_article user_id: '29719' year: '1996' ... --- _id: '3262' author: - first_name: Ursula full_name: Goltz, Ursula last_name: Goltz - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Goltz U, Wehrheim H. Causal Testing. In: Penczek W, Szalas A, eds. Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings. Lecture Notes in Computer Science. ; 1996:394--406. doi:10.1007/3-540-61550-4_165' apa: Goltz, U., & Wehrheim, H. (1996). Causal Testing. In W. Penczek & A. Szalas (Eds.), Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings (pp. 394--406). https://doi.org/10.1007/3-540-61550-4_165 bibtex: '@inproceedings{Goltz_Wehrheim_1996, series={Lecture Notes in Computer Science}, title={Causal Testing}, DOI={10.1007/3-540-61550-4_165}, booktitle={Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings}, author={Goltz, Ursula and Wehrheim, Heike}, editor={Penczek, Wojciech and Szalas, AndrzejEditors}, year={1996}, pages={394--406}, collection={Lecture Notes in Computer Science} }' chicago: Goltz, Ursula, and Heike Wehrheim. “Causal Testing.” In Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings, edited by Wojciech Penczek and Andrzej Szalas, 394--406. Lecture Notes in Computer Science, 1996. https://doi.org/10.1007/3-540-61550-4_165. ieee: U. Goltz and H. Wehrheim, “Causal Testing,” in Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings, 1996, pp. 394--406. mla: Goltz, Ursula, and Heike Wehrheim. “Causal Testing.” Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings, edited by Wojciech Penczek and Andrzej Szalas, 1996, pp. 394--406, doi:10.1007/3-540-61550-4_165. short: 'U. Goltz, H. Wehrheim, in: W. Penczek, A. Szalas (Eds.), Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS’96, Cracow, Poland, September 2-6, 1996, Proceedings, 1996, pp. 394--406.' date_created: 2018-06-14T07:53:08Z date_updated: 2022-01-06T06:59:07Z department: - _id: '77' doi: 10.1007/3-540-61550-4_165 editor: - first_name: Wojciech full_name: Penczek, Wojciech last_name: Penczek - first_name: Andrzej full_name: Szalas, Andrzej last_name: Szalas page: 394--406 publication: Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings series_title: Lecture Notes in Computer Science status: public title: Causal Testing type: conference user_id: '29719' year: '1996' ... --- _id: '17418' 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. Contention Resolution in Hashing Based Shared Memory Simulations.; 1996. apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention Resolution in Hashing Based Shared Memory Simulations. bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University of Paderborn} }' chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB, University of Paderborn, 1996. ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations. 1996. mla: Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory Simulations. 1996. short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, 1996. date_created: 2020-07-27T13:03:41Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' language: - iso: eng report_number: tr-rsfb-96-005 series_title: Technical Report SFB, University of Paderborn status: public title: Contention Resolution in Hashing Based Shared Memory Simulations type: report user_id: '15415' year: '1996' ... --- _id: '17419' abstract: - lang: eng text: We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality. author: - first_name: Dima full_name: Grigoriev, Dima last_name: Grigoriev - first_name: Marek full_name: Karpinski, Marek last_name: Karpinski - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Roman full_name: Smolensky, Roman last_name: Smolensky citation: ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.' apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In Proc. of 28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization. bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996, series={Lecture Notes in Computer Science}, title={A lower bound for randomized algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC}, publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }' chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996. ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC, 1996, vol. 65453, pp. 612–621. mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21. short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.' date_created: 2020-07-27T13:09:09Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' intvolume: ' 65453' language: - iso: eng page: 612-621 publication: Proc. of 28th ACM-STOC publisher: Eurographics Symposium on Parallel Graphics and Visualization series_title: Lecture Notes in Computer Science status: public title: A lower bound for randomized algebraic decision trees type: conference user_id: '15415' volume: 65453 year: '1996' ... --- _id: '17483' abstract: - lang: eng text: "In this paper we develop a model for communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. The implementation of the service network is done on a free configurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi-linear function. The cost model includes the parameters packet size, send hot spot, and the number of processors accessing global variables. These parameters influence the communication time in a high degree and capture important parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components algorithm (among others) and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programmer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on-line the optimal parameter values for an access to a global variable achieves good speed ups." author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jochen full_name: Rethmann, Jochen last_name: Rethmann - first_name: Alf full_name: Wachsmann, Alf last_name: Wachsmann citation: ama: 'Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.' apa: 'Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27). Amsterdam: IOS Press.' bibtex: '@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996}, pages={13–27} }' chicago: 'Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 13–27. Amsterdam: IOS Press, 1996.' ieee: M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27. mla: Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27. short: 'M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.' date_created: 2020-07-30T14:45:12Z date_updated: 2022-01-06T06:53:13Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T10:15:36Z date_updated: 2020-08-26T10:15:36Z file_id: '18354' file_name: hni-1454.pdf file_size: 285707 relation: main_file success: 1 file_date_updated: 2020-08-26T10:15:36Z has_accepted_license: '1' language: - iso: eng page: 13–27 place: Amsterdam publication: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96) publication_identifier: isbn: - 905199267X publisher: IOS Press status: public title: A Realistic Cost Model for the Communication Time in Parallel Programs type: conference user_id: '15415' year: '1996' ... --- _id: '17564' 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 - first_name: Ingo full_name: Rieping, Ingo last_name: Rieping citation: ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725' apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725' bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin, Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}, DOI={10.1007/bfb0024725}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376} }' chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.' ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.' mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.' short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.' date_created: 2020-08-03T13:11:02Z date_updated: 2022-01-06T06:53:15Z department: - _id: '63' doi: 10.1007/bfb0024725 language: - iso: eng page: 369-376 place: Berlin, Heidelberg publication: Lecture Notes in Computer Science publication_identifier: isbn: - '9783540616276' - '9783540706366' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model' type: book_chapter user_id: '15415' year: '1996' ... --- _id: '1918' author: - first_name: Bernd full_name: Dreier, Bernd last_name: Dreier - first_name: Annja full_name: Huber, Annja last_name: Huber - first_name: 'Markus ' full_name: 'Zahn, Markus ' last_name: Zahn - first_name: Holger full_name: Karl, Holger last_name: Karl - first_name: Theo full_name: Ungerer, Theo last_name: Ungerer citation: ama: 'Dreier B, Huber A, Zahn M, Karl H, Ungerer T. ReGTime - Rent Gigaflops someTimes. In: Proceedings Trends in Distributed Systems. ; 1996.' apa: Dreier, B., Huber, A., Zahn, M., Karl, H., & Ungerer, T. (1996). ReGTime - Rent Gigaflops someTimes. In Proceedings Trends in Distributed Systems. bibtex: '@inproceedings{Dreier_Huber_Zahn_Karl_Ungerer_1996, title={ReGTime - Rent Gigaflops someTimes}, booktitle={Proceedings Trends in Distributed Systems}, author={Dreier, Bernd and Huber, Annja and Zahn, Markus and Karl, Holger and Ungerer, Theo}, year={1996} }' chicago: Dreier, Bernd, Annja Huber, Markus Zahn, Holger Karl, and Theo Ungerer. “ReGTime - Rent Gigaflops SomeTimes.” In Proceedings Trends in Distributed Systems, 1996. ieee: B. Dreier, A. Huber, M. Zahn, H. Karl, and T. Ungerer, “ReGTime - Rent Gigaflops someTimes,” in Proceedings Trends in Distributed Systems, 1996. mla: Dreier, Bernd, et al. “ReGTime - Rent Gigaflops SomeTimes.” Proceedings Trends in Distributed Systems, 1996. short: 'B. Dreier, A. Huber, M. Zahn, H. Karl, T. Ungerer, in: Proceedings Trends in Distributed Systems, 1996.' date_created: 2018-03-28T11:31:47Z date_updated: 2022-01-06T06:53:59Z department: - _id: '75' publication: Proceedings Trends in Distributed Systems status: public title: ReGTime - Rent Gigaflops someTimes type: conference user_id: '15572' year: '1996' ... --- _id: '18352' abstract: - lang: eng text: "In this report, we develop a cost model for the communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. Because we do not have a parallel computer at our disposal that is equipped with a service network, we emulate the service network on a reconfigurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi­linear function. The cost model includes the parameters packet size, send hot spot (the number of messages sent out by one processor), and number of processors accessing global variables. We show that these parameters influence the communication time in a high degree and capture important parameters like network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication, and Connected Components algorithm, and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony and show that the influence of hot spots to the communication time is not as high as one would expect from theoretical considerations in a synchronous model. Therefore, we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on­line the optimal parameter values for an access to a global variable achieves good speed ups.\r\n" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jochen full_name: Rethmann, Jochen last_name: Rethmann - first_name: Alf full_name: Wachsmann, Alf last_name: Wachsmann citation: ama: Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn; 1996. apa: Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn. bibtex: '@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996} }' chicago: Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996. ieee: M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. Universität Paderborn, 1996. mla: Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware. 1996. short: M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996. date_created: 2020-08-26T10:06:31Z date_updated: 2022-01-06T06:53:30Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-26T10:05:35Z date_updated: 2020-08-26T10:05:35Z file_id: '18353' file_name: tr-rsfb-96-007.pdf file_size: 519632 relation: main_file success: 1 file_date_updated: 2020-08-26T10:05:35Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn status: public title: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware type: report user_id: '15415' year: '1996' ... --- _id: '2181' author: - first_name: Christian full_name: Scheideler, Christian last_name: Scheideler citation: ama: Scheideler C. Universal Routing Strategies. University of Paderborn, Germany; 1996. apa: Scheideler, C. (1996). Universal routing strategies. University of Paderborn, Germany. bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }' chicago: Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996. ieee: C. Scheideler, Universal routing strategies. University of Paderborn, Germany, 1996. mla: Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996. short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany, 1996. date_created: 2018-04-03T09:29:45Z date_updated: 2022-01-06T06:55:15Z department: - _id: '79' - _id: '63' language: - iso: eng publisher: University of Paderborn, Germany status: public title: Universal routing strategies type: dissertation user_id: '14955' year: '1996' ... --- _id: '2182' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Volker full_name: Stemann, Volker last_name: Stemann citation: ama: Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281. doi:10.1016/0304-3975(96)00032-1 apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1 bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }' chicago: 'Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.' ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput. Sci., no. 2, pp. 245--281, 1996. mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1. short: F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281. date_created: 2018-04-03T09:30:20Z date_updated: 2022-01-06T06:55:16Z department: - _id: '79' - _id: '63' doi: 10.1016/0304-3975(96)00032-1 issue: '2' language: - iso: eng page: 245--281 publication: Theor. Comput. Sci. status: public title: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations type: journal_article user_id: '14955' year: '1996' ... --- _id: '2183' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.' apa: 'Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).' bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={370--379} }' chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.' ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.' mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.' short: 'F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.' date_created: 2018-04-03T09:31:52Z date_updated: 2022-01-06T06:55:17Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T07:01:11Z date_updated: 2018-04-12T07:10:17Z file_id: '2281' file_name: FOCS96.pdf file_size: 248409 relation: main_file file_date_updated: 2018-04-12T07:10:17Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 370--379 publication: FOCS status: public title: 'Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols' type: conference urn: '21832' user_id: '14955' year: '1996' ... --- _id: '2184' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.' apa: Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer. bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes in Computer Science}, title={Communication in Parallel Systems}, volume={1175}, booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes in Computer Science} }' chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996. ieee: F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in SOFSEM, 1996, vol. 1175, pp. 16--33. mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33. short: 'F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.' date_created: 2018-04-03T09:32:47Z date_updated: 2022-01-06T06:55:17Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T07:01:59Z date_updated: 2018-04-12T07:10:36Z file_id: '2282' file_name: SOFSEM96.pdf file_size: 597639 relation: main_file file_date_updated: 2018-04-12T07:10:36Z has_accepted_license: '1' intvolume: ' 1175' language: - iso: eng oa: '1' page: 16--33 publication: SOFSEM publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Communication in Parallel Systems type: conference urn: '21840' user_id: '14955' volume: 1175 year: '1996' ... --- _id: '2186' author: - first_name: Robert full_name: Cypher, Robert last_name: Cypher - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Berthold full_name: Vöcking, Berthold last_name: Vöcking citation: ama: 'Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.' apa: Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM. bibtex: '@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM}, author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}, year={1996}, pages={356--365} }' chicago: Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996. ieee: R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996, pp. 356--365. mla: Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365. short: 'R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.' date_created: 2018-04-03T09:39:17Z date_updated: 2022-01-06T06:55:18Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T06:58:59Z date_updated: 2018-04-12T07:11:03Z file_id: '2280' file_name: STOC96.pdf file_size: 700595 relation: main_file file_date_updated: 2018-04-12T07:11:03Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 356--365 publication: STOC publisher: ACM status: public title: Universal Algorithms for Store-and-Forward and Wormhole Routing type: conference urn: '21868' user_id: '14955' year: '1996' ... --- _id: '7796' citation: ama: 'Engels G, Ehrig H, Rozenberg G, Skowron A, eds. Special Issue on Graph Transformations. Vol 26. Amsterdam: IOS Press; 1996.' apa: 'Engels, G., Ehrig, H., Rozenberg, G., & Skowron, A. (Eds.). (1996). Special Issue on Graph Transformations (Vol. 26). Amsterdam: IOS Press.' bibtex: '@book{Engels_Ehrig_Rozenberg_Skowron_1996, place={Amsterdam}, series={Fundamenta Informaticae}, title={Special Issue on Graph Transformations}, volume={26}, number={3–4}, publisher={IOS Press}, year={1996}, collection={Fundamenta Informaticae} }' chicago: 'Engels, Gregor, Hartmut Ehrig, Grzegorz Rozenberg, and Andrzej Skowron, eds. Special Issue on Graph Transformations. Vol. 26. Fundamenta Informaticae. Amsterdam: IOS Press, 1996.' ieee: 'G. Engels, H. Ehrig, G. Rozenberg, and A. Skowron, Eds., Special Issue on Graph Transformations, vol. 26, no. 3–4. Amsterdam: IOS Press, 1996.' mla: Engels, Gregor, et al., editors. Special Issue on Graph Transformations. Vol. 26, no. 3–4, IOS Press, 1996. short: G. Engels, H. Ehrig, G. Rozenberg, A. Skowron, eds., Special Issue on Graph Transformations, IOS Press, Amsterdam, 1996. date_created: 2019-02-19T19:17:49Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' editor: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Hartmut full_name: Ehrig, Hartmut last_name: Ehrig - first_name: Grzegorz full_name: Rozenberg, Grzegorz last_name: Rozenberg - first_name: Andrzej full_name: Skowron, Andrzej last_name: Skowron intvolume: ' 26' issue: 3-4 language: - iso: eng place: Amsterdam publisher: IOS Press series_title: Fundamenta Informaticae status: public title: Special Issue on Graph Transformations type: conference_editor user_id: '52534' volume: 26 year: '1996' ... --- _id: '7834' abstract: - lang: eng text: The concept of views is used on two levels. First, so-called design views are developed for structuring specifications, that is, a system is modeled according to different views (e.g., representing the needs of different kinds of users) which have to be synchronized afterwards in order to build the whole system. Views can be specified by means of typed graph transformation systems, where the type graph determines the visible types and the productions describe the known operations of that view. The synchronization of views is done by the construction of cooperative parallel composition of graph transformation systems, developed by Leila Ribeiro and presented at the same seminar. If the specification is complete, a view may describe an observation of the system in operation. In this case we speak of a user view. It turns out that the semantics of such a view cannot be described by computations (i.e., graph transformations), but just by observations of computations of the global system. Such observations of computations cannot be represented by graph transformations in the usual sense because a local view may lack operations (productions) of the global system, so that state changes may be observed that do not have a cause in the local view. Therefore, the notion of graph transition is introduced as loose semantics for productions, where the production specifies only a lower bound to the activities that are to happen during application. Contrastingly, in the classical doublepushout approach to graph rewriting, productions are interpreted as complete descriptions of the transformations to be performed. For typed graph transformation systems a transition sequence semantics is developed, comprising all finite and infinite sequences of transitions in a system. Moreover, this semantics is shown to be compositional w.r.t. the synchronization of views. author: - first_name: Hartmut full_name: Ehrig, Hartmut last_name: Ehrig - first_name: Reiko full_name: Heckel, Reiko last_name: Heckel - first_name: Julia full_name: Padberg, Julia last_name: Padberg - first_name: Gabriele full_name: Taentzer, Gabriele last_name: Taentzer - first_name: Uwe full_name: Wolter, Uwe last_name: Wolter - first_name: Andrea full_name: Corradini, Andrea last_name: Corradini - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Ehrig H, Heckel R, Padberg J, et al. Synchronization of Views and Loose Semantics of Typed Graph Productions. In: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science. Technical University of Berlin; 1996:11-12.' apa: Ehrig, H., Heckel, R., Padberg, J., Taentzer, G., Wolter, U., Corradini, A., & Engels, G. (1996). Synchronization of Views and Loose Semantics of Typed Graph Productions. In Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science (pp. 11–12). Technical University of Berlin. bibtex: '@inproceedings{Ehrig_Heckel_Padberg_Taentzer_Wolter_Corradini_Engels_1996, title={Synchronization of Views and Loose Semantics of Typed Graph Productions}, number={155}, booktitle={Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science}, publisher={Technical University of Berlin}, author={Ehrig, Hartmut and Heckel, Reiko and Padberg, Julia and Taentzer, Gabriele and Wolter, Uwe and Corradini, Andrea and Engels, Gregor}, year={1996}, pages={11–12} }' chicago: Ehrig, Hartmut, Reiko Heckel, Julia Padberg, Gabriele Taentzer, Uwe Wolter, Andrea Corradini, and Gregor Engels. “Synchronization of Views and Loose Semantics of Typed Graph Productions.” In Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, 11–12. Technical University of Berlin, 1996. ieee: H. Ehrig et al., “Synchronization of Views and Loose Semantics of Typed Graph Productions,” in Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, 1996, no. 155, pp. 11–12. mla: Ehrig, Hartmut, et al. “Synchronization of Views and Loose Semantics of Typed Graph Productions.” Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, no. 155, Technical University of Berlin, 1996, pp. 11–12. short: 'H. Ehrig, R. Heckel, J. Padberg, G. Taentzer, U. Wolter, A. Corradini, G. Engels, in: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, Technical University of Berlin, 1996, pp. 11–12.' date_created: 2019-02-20T14:02:31Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' issue: '155' language: - iso: eng page: 11-12 publication: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science publisher: Technical University of Berlin status: public title: Synchronization of Views and Loose Semantics of Typed Graph Productions type: conference user_id: '52534' year: '1996' ... --- _id: '7835' author: - first_name: Reiko full_name: Heckel, Reiko last_name: Heckel citation: ama: 'Heckel R. Behavioral Constraints for Loose Graph Transformation Systems. In: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science. Dagstuhl-Seminar-Report. Technical University of Berlin; 1996:12-13.' apa: Heckel, R. (1996). Behavioral Constraints for Loose Graph Transformation Systems. In Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science (pp. 12–13). Technical University of Berlin. bibtex: '@inproceedings{Heckel_1996, series={Dagstuhl-Seminar-Report}, title={Behavioral Constraints for Loose Graph Transformation Systems}, number={155}, booktitle={Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science}, publisher={Technical University of Berlin}, author={Heckel, Reiko}, year={1996}, pages={12–13}, collection={Dagstuhl-Seminar-Report} }' chicago: Heckel, Reiko. “Behavioral Constraints for Loose Graph Transformation Systems.” In Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, 12–13. Dagstuhl-Seminar-Report. Technical University of Berlin, 1996. ieee: R. Heckel, “Behavioral Constraints for Loose Graph Transformation Systems,” in Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, 1996, no. 155, pp. 12–13. mla: Heckel, Reiko. “Behavioral Constraints for Loose Graph Transformation Systems.” Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, no. 155, Technical University of Berlin, 1996, pp. 12–13. short: 'R. Heckel, in: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science, Technical University of Berlin, 1996, pp. 12–13.' date_created: 2019-02-20T14:03:34Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' issue: '155' language: - iso: eng page: 12-13 publication: Report on the Dagstuhl-Seminar 9637 on Graph Transformations in Computer Science publisher: Technical University of Berlin series_title: Dagstuhl-Seminar-Report status: public title: Behavioral Constraints for Loose Graph Transformation Systems type: conference user_id: '52534' year: '1996' ...