[{"year":"2001","page":"91--108","citation":{"ama":"Fischer C, Olderog E-R, Wehrheim H. A {CSP} View on {UML-RT} Structure Diagrams. In: Hu{\\ss}mann H, ed. <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>. Lecture Notes in Computer Science. ; 2001:91--108. doi:<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>","ieee":"C. Fischer, E.-R. Olderog, and H. Wehrheim, “A {CSP} View on {UML-RT} Structure Diagrams,” in <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, 2001, pp. 91--108.","chicago":"Fischer, Clemens, Ernst-Rüdiger Olderog, and Heike Wehrheim. “A {CSP} View on {UML-RT} Structure Diagrams.” In <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, edited by Heinrich Hu{\\ss}mann, 91--108. Lecture Notes in Computer Science, 2001. <a href=\"https://doi.org/10.1007/3-540-45314-8_8\">https://doi.org/10.1007/3-540-45314-8_8</a>.","mla":"Fischer, Clemens, et al. “A {CSP} View on {UML-RT} Structure Diagrams.” <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i>, edited by Heinrich Hu{\\ss}mann, 2001, pp. 91--108, doi:<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>.","bibtex":"@inproceedings{Fischer_Olderog_Wehrheim_2001, series={Lecture Notes in Computer Science}, title={A {CSP} View on {UML-RT} Structure Diagrams}, DOI={<a href=\"https://doi.org/10.1007/3-540-45314-8_8\">10.1007/3-540-45314-8_8</a>}, booktitle={Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings}, author={Fischer, Clemens and Olderog, Ernst-Rüdiger and Wehrheim, Heike}, editor={Hu{\\ss}mann, HeinrichEditor}, year={2001}, pages={91--108}, collection={Lecture Notes in Computer Science} }","short":"C. Fischer, E.-R. Olderog, H. Wehrheim, in: H. Hu{\\ss}mann (Ed.), Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings, 2001, pp. 91--108.","apa":"Fischer, C., Olderog, E.-R., &#38; Wehrheim, H. (2001). A {CSP} View on {UML-RT} Structure Diagrams. In H. Hu{\\ss}mann (Ed.), <i>Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings</i> (pp. 91--108). <a href=\"https://doi.org/10.1007/3-540-45314-8_8\">https://doi.org/10.1007/3-540-45314-8_8</a>"},"date_updated":"2022-01-06T06:59:07Z","date_created":"2018-06-14T07:15:07Z","author":[{"first_name":"Clemens","full_name":"Fischer, Clemens","last_name":"Fischer"},{"first_name":"Ernst-Rüdiger","last_name":"Olderog","full_name":"Olderog, Ernst-Rüdiger"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"title":"A {CSP} View on {UML-RT} Structure Diagrams","doi":"10.1007/3-540-45314-8_8","publication":"Fundamental Approaches to Software Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings","type":"conference","editor":[{"first_name":"Heinrich","full_name":"Hu{\\ss}mann, Heinrich","last_name":"Hu{\\ss}mann"}],"status":"public","_id":"3246","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science"},{"status":"public","type":"journal_article","publication":"Combinatorica","language":[{"iso":"eng"}],"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"_id":"2139","citation":{"apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>, <i>21</i>(1), 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>","bibtex":"@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>}, number={1}, journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2001}, pages={95--138} }","short":"F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i>, vol. 21, no. 1, 2001, pp. 95--138, doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. <i>Combinatorica</i>. 2001;21(1):95--138. doi:<a href=\"https://doi.org/10.1007/s004930170007\">10.1007/s004930170007</a>","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.” <i>Combinatorica</i> 21, no. 1 (2001): 95--138. <a href=\"https://doi.org/10.1007/s004930170007\">https://doi.org/10.1007/s004930170007</a>.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” <i>Combinatorica</i>, vol. 21, no. 1, pp. 95--138, 2001."},"page":"95--138","intvolume":"        21","year":"2001","issue":"1","doi":"10.1007/s004930170007","title":"Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols","date_created":"2018-04-03T05:47:20Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"volume":21,"date_updated":"2022-01-06T06:54:57Z"},{"has_accepted_license":"1","citation":{"ama":"Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies for Adversarial Systems. In: <i>FOCS</i>. IEEE Computer Society; 2001:158--167.","ieee":"B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing Strategies for Adversarial Systems,” in <i>FOCS</i>, 2001, pp. 158--167.","chicago":"Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In <i>FOCS</i>, 158--167. IEEE Computer Society, 2001.","apa":"Awerbuch, B., Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In <i>FOCS</i> (pp. 158--167). IEEE Computer Society.","short":"B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.","mla":"Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” <i>FOCS</i>, IEEE Computer Society, 2001, pp. 158--167.","bibtex":"@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={158--167} }"},"page":"158--167","year":"2001","author":[{"first_name":"Baruch","last_name":"Awerbuch","full_name":"Awerbuch, Baruch"},{"first_name":"Petra","full_name":"Berenbrink, Petra","last_name":"Berenbrink"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-04-03T05:48:28Z","oa":"1","publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:54:59Z","title":"Simple Routing Strategies for Adversarial Systems","type":"conference","publication":"FOCS","file":[{"date_updated":"2018-04-12T08:59:00Z","creator":"florida","date_created":"2018-04-12T08:59:00Z","file_size":151156,"access_level":"open_access","file_id":"2302","file_name":"FOCS-01.pdf","content_type":"application/pdf","relation":"main_file"}],"status":"public","urn":"21406","user_id":"15504","department":[{"_id":"79"}],"_id":"2140","file_date_updated":"2018-04-12T08:59:00Z","ddc":["040"]},{"type":"conference","publication":"PDP","file":[{"date_created":"2018-04-12T08:39:01Z","creator":"florida","date_updated":"2018-04-12T08:39:01Z","file_name":"PDP-00.pdf","file_id":"2298","access_level":"open_access","file_size":85778,"content_type":"application/pdf","relation":"main_file"}],"status":"public","urn":"21415","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"_id":"2141","file_date_updated":"2018-04-12T08:39:01Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2001}, pages={227--234} }","mla":"Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” <i>PDP</i>, IEEE Computer Society, 2001, pp. 227--234.","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In <i>PDP</i> (pp. 227--234). IEEE Computer Society.","ama":"Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for Storage Area Networks. In: <i>PDP</i>. IEEE Computer Society; 2001:227--234.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment for Storage Area Networks,” in <i>PDP</i>, 2001, pp. 227--234.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In <i>PDP</i>, 227--234. IEEE Computer Society, 2001."},"page":"227--234","year":"2001","author":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-04-03T05:49:21Z","oa":"1","date_updated":"2022-01-06T06:54:59Z","publisher":"IEEE Computer Society","title":"SIMLAB-A Simulation Environment for Storage Area Networks"},{"publication":"SPAA","type":"conference","urn":"21421","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T08:58:07Z","date_created":"2018-04-12T08:58:07Z","creator":"florida","file_size":335171,"file_id":"2301","access_level":"open_access","file_name":"SPAA-01.pdf"}],"_id":"2142","department":[{"_id":"79"}],"user_id":"15504","ddc":["040"],"file_date_updated":"2018-04-12T08:58:07Z","has_accepted_license":"1","year":"2001","page":"38--47","citation":{"ama":"Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint paths problem. In: <i>SPAA</i>. ; 2001:38--47.","ieee":"P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint paths problem,” in <i>SPAA</i>, 2001, pp. 38--47.","chicago":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In <i>SPAA</i>, 38--47, 2001.","apa":"Kolman, P., &#38; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In <i>SPAA</i> (pp. 38--47).","mla":"Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” <i>SPAA</i>, 2001, pp. 38--47.","bibtex":"@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr and Scheideler, Christian}, year={2001}, pages={38--47} }","short":"P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47."},"oa":"1","date_updated":"2022-01-06T06:54:59Z","date_created":"2018-04-03T05:50:16Z","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"title":"Simple on-line algorithms for the maximum disjoint paths problem"},{"title":"Testing Hypergraph Coloring","doi":"10.1007/3-540-48224-5_41","date_updated":"2022-01-06T06:53:51Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"date_created":"2020-09-01T10:48:38Z","year":"2001","page":"493-505","citation":{"ieee":"A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, pp. 493–505, 2001.","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>.","ama":"Czumaj A, Sohler C. Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>. 2001:493-505. doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>","apa":"Czumaj, A., &#38; Sohler, C. (2001). Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>","bibtex":"@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>}, journal={Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001}, pages={493–505} }","short":"A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, pp. 493–505, doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>."},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422877","9783540482246"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"18749","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","type":"journal_article"},{"page":"865-872","citation":{"ama":"Sohler C, Czumaj A. Soft Kinetic Data Structures. In: <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>. ; 2001:865-872.","ieee":"C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, pp. 865–872.","chicago":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 865–72, 2001.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.","mla":"Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i>, 2001, pp. 865–72.","bibtex":"@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures}, booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }","apa":"Sohler, C., &#38; Czumaj, A. (2001). Soft Kinetic Data Structures. In <i>Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 865–872)."},"year":"2001","title":"Soft Kinetic Data Structures","date_created":"2020-09-01T10:56:39Z","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"}],"date_updated":"2022-01-06T06:53:51Z","status":"public","publication":"Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18750"},{"date_updated":"2022-01-06T06:53:53Z","author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"date_created":"2020-09-02T12:24:25Z","title":"Property Testing with Geometric Queries","doi":"10.1007/3-540-44676-1_22","year":"2001","citation":{"apa":"Sohler, C., &#38; Czumaj, A. (2001). Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 266–277. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>","short":"C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01) (2001) 266–277.","bibtex":"@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>}, journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)}, author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }","mla":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, pp. 266–77, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>.","chicago":"Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, 2001, 266–77. <a href=\"https://doi.org/10.1007/3-540-44676-1_22\">https://doi.org/10.1007/3-540-44676-1_22</a>.","ieee":"C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>, pp. 266–277, 2001.","ama":"Sohler C, Czumaj A. Property Testing with Geometric Queries. <i>Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)</i>. 2001:266-277. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1_22\">10.1007/3-540-44676-1_22</a>"},"page":"266-277","_id":"18857","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)","abstract":[{"text":"This paper investigates geometric problems in the context of property testing algorithms. Property testing is an emerging area in computer science in which one is aiming at verifying whether a given object has a predetermined property or is “far” from any object having the property. Although there has been some research previously done in testing geometric properties, prior works have been mostly dealing with the study of combinatorial notion of the distance defining whether an object is “far” or it is “close”; very little research has been done for geometric notion of distance measures, that is, distance measures that are based on the geometry underlying input objects.\r\n\r\nThe main objective of this work is to develop sound models to study geometric problems in the context of property testing. Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of geometric data structures as basic primitives to design the testers. We believe that the second aspect is of special importance in the context of property testing and that the use of specialized data structures as basic primitives in the testers can be applied to other important problems in this area.\r\n\r\nWe shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing convex position, testing map labeling, and testing clusterability.","lang":"eng"}],"status":"public"},{"status":"public","publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS","type":"conference","language":[{"iso":"eng"}],"_id":"18964","department":[{"_id":"63"}],"user_id":"15415","year":"2001","citation":{"apa":"Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>","short":"T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.","bibtex":"@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}, DOI={<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>}, booktitle={Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }","mla":"Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>.","chicago":"Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>.","ieee":"T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001.","ama":"Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540430025","9783540452942"]},"publication_status":"published","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","doi":"10.1007/3-540-45294-x_21","date_updated":"2022-01-06T06:53:55Z","date_created":"2020-09-03T13:26:01Z","author":[{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"full_name":"Maheshwari, Anil","last_name":"Maheshwari","first_name":"Anil"},{"first_name":"Norbert","last_name":"Zeh","full_name":"Zeh, Norbert"}]},{"language":[{"iso":"eng"}],"_id":"23731","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"<jats:p>\r\n            On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z\r\n            <jats:sub>2</jats:sub>\r\n            was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication.\r\n          </jats:p>"}],"status":"public","type":"journal_article","publication":"ACM SIGSAM Bulletin","title":"Factoring a binary polynomial of degree over one million","doi":"10.1145/504331.504333","date_updated":"2022-01-06T06:55:58Z","author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"},{"first_name":"Joachim","last_name":"von zur Gathen","full_name":"von zur Gathen, Joachim"},{"first_name":"Jürgen","last_name":"Gerhard","full_name":"Gerhard, Jürgen"},{"last_name":"Müller","full_name":"Müller, Olaf","first_name":"Olaf"}],"date_created":"2021-09-03T09:08:27Z","year":"2001","citation":{"bibtex":"@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>}, journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }","mla":"Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, pp. 16–18, doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>.","short":"O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.","apa":"Bonorden, O., von zur Gathen, J., Gerhard, J., &#38; Müller, O. (2001). Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>","chicago":"Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>.","ieee":"O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” <i>ACM SIGSAM Bulletin</i>, pp. 16–18, 2001.","ama":"Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>. 2001:16-18. doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>"},"page":"16-18","publication_status":"published","publication_identifier":{"issn":["0163-5824"]}},{"publication_status":"published","publication_identifier":{"isbn":["9783540421979","9783540453352"],"issn":["0302-9743"]},"citation":{"apa":"Ziegler, M., &#38; Brattka, V. (2001). A Computable Spectral Theorem. In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i> (Vol. 2064, pp. 378–388). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>","short":"M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>}, booktitle={Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001}, pages={378–388} }","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, vol. 2064, 2001, pp. 378–88, doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>.","ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2001, vol. 2064, pp. 378–388.","chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2064:378–88. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>.","ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>. Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>"},"page":"378-388","intvolume":"      2064","year":"2001","place":"Berlin, Heidelberg","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"},{"first_name":"Vasco","last_name":"Brattka","full_name":"Brattka, Vasco"}],"date_created":"2020-08-24T10:14:06Z","volume":2064,"date_updated":"2022-01-06T06:53:26Z","doi":"10.1007/3-540-45335-0_23","title":"A Computable Spectral Theorem","type":"conference","publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","status":"public","abstract":[{"lang":"eng","text":"Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions."}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18152","language":[{"iso":"eng"}]},{"status":"public","abstract":[{"lang":"eng","text":"What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers."}],"type":"conference","publication":"Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18166","citation":{"ama":"Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>. Vol AA. ; 2001:155-164.","chicago":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, AA:155–64, 2001.","ieee":"M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, 2001, vol. AA, pp. 155–164.","short":"M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.","bibtex":"@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)}, author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164} }","mla":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, vol. AA, 2001, pp. 155–64.","apa":"Ziegler, M., &#38; Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i> (Vol. AA, pp. 155–164)."},"page":"155-164","year":"2001","title":"New Bounds for Hypercube Slicing Numbers","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"},{"full_name":"Emamy-Khansari, M. Reza","last_name":"Emamy-Khansari","first_name":"M. Reza"}],"date_created":"2020-08-24T11:29:08Z","volume":"AA","date_updated":"2022-01-06T06:53:26Z"},{"language":[{"iso":"eng"}],"_id":"18168","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","text":"We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable."}],"status":"public","publication":"Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)","type":"conference","title":"Turing Computability of (Non-)Linear Optimization","date_updated":"2022-01-06T06:53:26Z","author":[{"first_name":"Vasco","last_name":"Brattka","full_name":"Brattka, Vasco"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-24T11:33:12Z","year":"2001","page":"181-184","citation":{"bibtex":"@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001}, pages={181–184} }","short":"V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.","mla":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 2001, pp. 181–84.","apa":"Brattka, V., &#38; Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i> (pp. 181–184).","ama":"Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>. ; 2001:181-184.","chicago":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 181–84, 2001.","ieee":"V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 2001, pp. 181–184."}},{"type":"conference","publication":"Proc. of 3. GI-Informatiktage 2001","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2020-08-26T13:08:08Z","creator":"koala","date_updated":"2020-08-26T13:08:08Z","access_level":"closed","file_name":"hni-id-1450.pdf","file_id":"18371","file_size":146136}],"status":"public","abstract":[{"text":"We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18370","language":[{"iso":"eng"}],"file_date_updated":"2020-08-26T13:08:08Z","ddc":["000"],"has_accepted_license":"1","citation":{"mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–78.","bibtex":"@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc. of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001}, pages={275–278} }","short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.","apa":"Klein, J., &#38; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In <i>Proc. of 3. GI-Informatiktage 2001</i> (pp. 275–278). Bad Schussenried.","ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: <i>Proc. of 3. GI-Informatiktage 2001</i>. Bad Schussenried; 2001:275-278.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–278.","chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In <i>Proc. of 3. GI-Informatiktage 2001</i>, 275–78. Bad Schussenried, 2001."},"page":"275 - 278","year":"2001","place":"Bad Schussenried","date_created":"2020-08-26T13:08:24Z","author":[{"first_name":"Jan","last_name":"Klein","full_name":"Klein, Jan"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"}],"date_updated":"2022-01-06T06:53:30Z","title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph"},{"title":"Proceedings of the workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)","volume":"tr-ri-01-223","date_created":"2019-02-19T19:08:50Z","publisher":"University of Paderborn","date_updated":"2022-01-06T07:03:46Z","citation":{"chicago":"Mehner, Katharina, M. Mezini, Elke Pulvermüller, and Andreas Speck, eds. <i>Proceedings of the Workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)</i>. Vol. tr-ri-01-223. Forschungsbericht. University of Paderborn, 2001.","ieee":"K. Mehner, M. Mezini, E. Pulvermüller, and A. Speck, Eds., <i>Proceedings of the workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)</i>, vol. tr-ri-01-223. University of Paderborn, 2001.","ama":"Mehner K, Mezini M, Pulvermüller E, Speck A, eds. <i>Proceedings of the Workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)</i>. Vol tr-ri-01-223. University of Paderborn; 2001.","mla":"Mehner, Katharina, et al., editors. <i>Proceedings of the Workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)</i>. Vol. tr-ri-01-223, University of Paderborn, 2001.","short":"K. Mehner, M. Mezini, E. Pulvermüller, A. Speck, eds., Proceedings of the Workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany), University of Paderborn, 2001.","bibtex":"@book{Mehner_Mezini_Pulvermüller_Speck_2001, series={Forschungsbericht}, title={Proceedings of the workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)}, volume={tr-ri-01-223}, publisher={University of Paderborn}, year={2001}, collection={Forschungsbericht} }","apa":"Mehner, K., Mezini, M., Pulvermüller, E., &#38; Speck, A. (Eds.). (2001). <i>Proceedings of the workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)</i> (Vol. tr-ri-01-223). University of Paderborn."},"year":"2001","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","series_title":"Forschungsbericht","_id":"7787","status":"public","editor":[{"full_name":"Mehner, Katharina","last_name":"Mehner","first_name":"Katharina"},{"last_name":"Mezini","full_name":"Mezini, M.","first_name":"M."},{"first_name":"Elke","full_name":"Pulvermüller, Elke","last_name":"Pulvermüller"},{"first_name":"Andreas","full_name":"Speck, Andreas","last_name":"Speck"}],"type":"conference_editor"},{"publisher":"Gesellschaft für Informatik (GI)","date_updated":"2022-01-06T07:03:46Z","date_created":"2019-02-19T19:09:37Z","volume":1,"title":"Modellierung 2001","year":"2001","place":"Bonn","citation":{"ama":"Engels G, Oberweis A, Zündorf A, eds. <i>Modellierung 2001</i>. Vol 1. Bonn: Gesellschaft für Informatik (GI); 2001.","chicago":"Engels, Gregor, A. Oberweis, and Albert Zündorf, eds. <i>Modellierung 2001</i>. Vol. 1. Lecture Notes in Informatics. Bonn: Gesellschaft für Informatik (GI), 2001.","ieee":"G. Engels, A. Oberweis, and A. Zündorf, Eds., <i>Modellierung 2001</i>, vol. 1. Bonn: Gesellschaft für Informatik (GI), 2001.","short":"G. Engels, A. Oberweis, A. Zündorf, eds., Modellierung 2001, Gesellschaft für Informatik (GI), Bonn, 2001.","bibtex":"@book{Engels_Oberweis_Zündorf_2001, place={Bonn}, series={Lecture Notes in Informatics}, title={Modellierung 2001}, volume={1}, publisher={Gesellschaft für Informatik (GI)}, year={2001}, collection={Lecture Notes in Informatics} }","mla":"Engels, Gregor, et al., editors. <i>Modellierung 2001</i>. Vol. 1, Gesellschaft für Informatik (GI), 2001.","apa":"Engels, G., Oberweis, A., &#38; Zündorf, A. (Eds.). (2001). <i>Modellierung 2001</i> (Vol. 1). Bonn: Gesellschaft für Informatik (GI)."},"intvolume":"         1","_id":"7788","user_id":"52534","series_title":"Lecture Notes in Informatics","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"conference_editor","editor":[{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"},{"first_name":"A.","last_name":"Oberweis","full_name":"Oberweis, A."},{"first_name":"Albert","last_name":"Zündorf","full_name":"Zündorf, Albert"}],"status":"public"},{"citation":{"apa":"Böllert, K., Streitferdt, D., Heuzeroth, D., Mehner, K., &#38; Hanenberg, S. (Eds.). (2001). <i>Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)</i>.","mla":"Böllert, K., et al., editors. <i>Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)</i>. 2001.","bibtex":"@book{Böllert_Streitferdt_Heuzeroth_Mehner_Hanenberg_2001, title={Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)}, year={2001} }","short":"K. Böllert, D. Streitferdt, D. Heuzeroth, K. Mehner, S. Hanenberg, eds., Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany), 2001.","ama":"Böllert K, Streitferdt D, Heuzeroth D, Mehner K, Hanenberg S, eds. <i>Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)</i>.; 2001.","chicago":"Böllert, K., D. Streitferdt, D. Heuzeroth, Katharina Mehner, and S. Hanenberg, eds. <i>Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)</i>, 2001.","ieee":"K. Böllert, D. Streitferdt, D. Heuzeroth, K. Mehner, and S. Hanenberg, Eds., <i>Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)</i>. 2001."},"year":"2001","title":"Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE '01), Erfurt (Germany)","date_created":"2019-02-19T19:10:41Z","date_updated":"2022-01-06T07:03:46Z","status":"public","editor":[{"full_name":"Böllert, K.","last_name":"Böllert","first_name":"K."},{"last_name":"Streitferdt","full_name":"Streitferdt, D.","first_name":"D."},{"last_name":"Heuzeroth","full_name":"Heuzeroth, D.","first_name":"D."},{"full_name":"Mehner, Katharina","last_name":"Mehner","first_name":"Katharina"},{"last_name":"Hanenberg","full_name":"Hanenberg, S.","first_name":"S."}],"type":"conference_editor","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7789"},{"type":"conference","publication":"Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)","status":"public","user_id":"52534","department":[{"_id":"66"}],"_id":"7879","language":[{"iso":"eng"}],"citation":{"ieee":"B. Lütkemeier and S. Thöne, “Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle,” in <i>Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)</i>, 2001.","chicago":"Lütkemeier, Björn, and Sebastian Thöne. “Prozessorientierte Integration von Softwarekomponenten Durch XML-Basierte Workflow-Modelle.” In <i>Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)</i>. Konradin-Verlag, 2001.","ama":"Lütkemeier B, Thöne S. Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle. In: <i>Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)</i>. Konradin-Verlag; 2001.","apa":"Lütkemeier, B., &#38; Thöne, S. (2001). Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle. In <i>Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)</i>. Konradin-Verlag.","short":"B. Lütkemeier, S. Thöne, in: Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany), Konradin-Verlag, 2001.","mla":"Lütkemeier, Björn, and Sebastian Thöne. “Prozessorientierte Integration von Softwarekomponenten Durch XML-Basierte Workflow-Modelle.” <i>Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)</i>, Konradin-Verlag, 2001.","bibtex":"@inproceedings{Lütkemeier_Thöne_2001, title={Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle}, booktitle={Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)}, publisher={Konradin-Verlag}, author={Lütkemeier, Björn and Thöne, Sebastian}, year={2001} }"},"year":"2001","author":[{"last_name":"Lütkemeier","full_name":"Lütkemeier, Björn","first_name":"Björn"},{"last_name":"Thöne","full_name":"Thöne, Sebastian","first_name":"Sebastian"}],"date_created":"2019-02-21T10:39:54Z","date_updated":"2022-01-06T07:03:47Z","publisher":"Konradin-Verlag","title":"Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle"},{"author":[{"first_name":"Paolo","full_name":"Baldan, Paolo","last_name":"Baldan"},{"first_name":"Andrea","full_name":"Corradini, Andrea","last_name":"Corradini"},{"first_name":"Hartmut","last_name":"Ehrig","full_name":"Ehrig, Hartmut"},{"first_name":"Reiko","last_name":"Heckel","full_name":"Heckel, Reiko"}],"date_created":"2019-02-21T10:40:17Z","volume":2154,"date_updated":"2022-01-06T07:03:47Z","publisher":"Springer","title":"Compositional Modeling of Reactive Systems Using Open Nets","citation":{"apa":"Baldan, P., Corradini, A., Ehrig, H., &#38; Heckel, R. (2001). Compositional Modeling of Reactive Systems Using Open Nets. In <i>Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)</i> (Vol. 2154, pp. 502–518). Berlin/Heidelberg: Springer.","bibtex":"@inproceedings{Baldan_Corradini_Ehrig_Heckel_2001, place={Berlin/Heidelberg}, series={LNCS}, title={Compositional Modeling of Reactive Systems Using Open Nets}, volume={2154}, booktitle={Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)}, publisher={Springer}, author={Baldan, Paolo and Corradini, Andrea and Ehrig, Hartmut and Heckel, Reiko}, year={2001}, pages={502–518}, collection={LNCS} }","short":"P. Baldan, A. Corradini, H. Ehrig, R. Heckel, in: Proceedings of the Conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark), Springer, Berlin/Heidelberg, 2001, pp. 502–518.","mla":"Baldan, Paolo, et al. “Compositional Modeling of Reactive Systems Using Open Nets.” <i>Proceedings of the Conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)</i>, vol. 2154, Springer, 2001, pp. 502–18.","ieee":"P. Baldan, A. Corradini, H. Ehrig, and R. Heckel, “Compositional Modeling of Reactive Systems Using Open Nets,” in <i>Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)</i>, 2001, vol. 2154, pp. 502–518.","chicago":"Baldan, Paolo, Andrea Corradini, Hartmut Ehrig, and Reiko Heckel. “Compositional Modeling of Reactive Systems Using Open Nets.” In <i>Proceedings of the Conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)</i>, 2154:502–18. LNCS. Berlin/Heidelberg: Springer, 2001.","ama":"Baldan P, Corradini A, Ehrig H, Heckel R. Compositional Modeling of Reactive Systems Using Open Nets. In: <i>Proceedings of the Conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)</i>. Vol 2154. LNCS. Berlin/Heidelberg: Springer; 2001:502-518."},"page":"502-518","intvolume":"      2154","place":"Berlin/Heidelberg","year":"2001","series_title":"LNCS","user_id":"52534","department":[{"_id":"66"}],"_id":"7880","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)","status":"public"},{"author":[{"first_name":"Jochen","last_name":"Küster","full_name":"Küster, Jochen"},{"full_name":"Stroop, Joachim","last_name":"Stroop","first_name":"Joachim"}],"date_created":"2019-02-21T10:40:47Z","publisher":"IEEE Computer Society","date_updated":"2022-01-06T07:03:47Z","doi":"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815","title":"Consistent Design of Embedded Real-Time Systems with UML-RT","page":"31-40","citation":{"ama":"Küster J, Stroop J. Consistent Design of Embedded Real-Time Systems with UML-RT. In: <i>Proceedings of the Conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)</i>. Washington, DC, USA: IEEE Computer Society; 2001:31-40. doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815\">https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815</a>","ieee":"J. Küster and J. Stroop, “Consistent Design of Embedded Real-Time Systems with UML-RT,” in <i>Proceedings of the conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)</i>, 2001, pp. 31–40.","chicago":"Küster, Jochen, and Joachim Stroop. “Consistent Design of Embedded Real-Time Systems with UML-RT.” In <i>Proceedings of the Conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)</i>, 31–40. Washington, DC, USA: IEEE Computer Society, 2001. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815\">https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815</a>.","apa":"Küster, J., &#38; Stroop, J. (2001). Consistent Design of Embedded Real-Time Systems with UML-RT. In <i>Proceedings of the conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)</i> (pp. 31–40). Washington, DC, USA: IEEE Computer Society. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815\">https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815</a>","bibtex":"@inproceedings{Küster_Stroop_2001, place={Washington, DC, USA}, title={Consistent Design of Embedded Real-Time Systems with UML-RT}, DOI={<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815\">https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815</a>}, booktitle={Proceedings of the conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)}, publisher={IEEE Computer Society}, author={Küster, Jochen and Stroop, Joachim}, year={2001}, pages={31–40} }","short":"J. Küster, J. Stroop, in: Proceedings of the Conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany), IEEE Computer Society, Washington, DC, USA, 2001, pp. 31–40.","mla":"Küster, Jochen, and Joachim Stroop. “Consistent Design of Embedded Real-Time Systems with UML-RT.” <i>Proceedings of the Conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)</i>, IEEE Computer Society, 2001, pp. 31–40, doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815\">https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815</a>."},"year":"2001","place":"Washington, DC, USA","department":[{"_id":"66"}],"user_id":"52534","_id":"7881","language":[{"iso":"eng"}],"publication":"Proceedings of the conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)","type":"conference","status":"public"}]