[{"date_updated":"2022-01-06T06:57:18Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"title":"Stability versus Speed in a Computable Algebraic Model","status":"public","year":"2003","user_id":"15415","language":[{"iso":"eng"}],"_id":"26263","page":"47-64","citation":{"mla":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 2003, pp. 47–64.","bibtex":"@inproceedings{Ziegler_2003, title={Stability versus Speed in a Computable Algebraic Model}, booktitle={Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA}, author={Ziegler, Martin}, year={2003}, pages={47–64} }","ama":"Ziegler M. Stability versus Speed in a Computable Algebraic Model. In: <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>. ; 2003:47-64.","ieee":"M. Ziegler, “Stability versus Speed in a Computable Algebraic Model,” in <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 2003, pp. 47–64.","apa":"Ziegler, M. (2003). Stability versus Speed in a Computable Algebraic Model. <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 47–64.","chicago":"Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.” In <i>Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA</i>, 47–64, 2003.","short":"M. Ziegler, in: Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA, 2003, pp. 47–64."},"publication":"Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","date_created":"2021-10-15T11:00:14Z"},{"year":"2003","title":"Computable Operators on Regular Sets","status":"public","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:57:18Z","page":"389-406","_id":"26277","series_title":"Informatik Berichte","language":[{"iso":"eng"}],"user_id":"15415","volume":"302-8/2003","publication":"Computability and Complexity in Analysis","citation":{"short":"M. Ziegler, in: Computability and Complexity in Analysis, 2003, pp. 389–406.","chicago":"Ziegler, Martin. “Computable Operators on Regular Sets.” In <i>Computability and Complexity in Analysis</i>, 302-8/2003:389–406. Informatik Berichte, 2003.","ieee":"M. Ziegler, “Computable Operators on Regular Sets,” in <i>Computability and Complexity in Analysis</i>, 2003, vol. 302–8/2003, pp. 389–406.","apa":"Ziegler, M. (2003). Computable Operators on Regular Sets. <i>Computability and Complexity in Analysis</i>, <i>302-8/2003</i>, 389–406.","bibtex":"@inproceedings{Ziegler_2003, series={Informatik Berichte}, title={Computable Operators on Regular Sets}, volume={302–8/2003}, booktitle={Computability and Complexity in Analysis}, author={Ziegler, Martin}, year={2003}, pages={389–406}, collection={Informatik Berichte} }","ama":"Ziegler M. Computable Operators on Regular Sets. In: <i>Computability and Complexity in Analysis</i>. Vol 302-8/2003. Informatik Berichte. ; 2003:389-406.","mla":"Ziegler, Martin. “Computable Operators on Regular Sets.” <i>Computability and Complexity in Analysis</i>, vol. 302-8/2003, 2003, pp. 389–406."},"date_created":"2021-10-15T12:13:22Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}]},{"date_created":"2018-04-03T05:37:10Z","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","citation":{"mla":"Damerow, Valentina, et al. “Smoothed Motion Complexity.” <i>ESA</i>, vol. 2832, Springer, 2003, pp. 161--171, doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>.","bibtex":"@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003, series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity}, volume={2832}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>}, booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian}, year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science} }","ama":"Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed Motion Complexity. In: <i>ESA</i>. Vol 2832. Lecture Notes in Computer Science. Springer; 2003:161--171. doi:<a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">10.1007/978-3-540-39658-1_17</a>","ieee":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in <i>ESA</i>, 2003, vol. 2832, pp. 161--171.","apa":"Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &#38; Sohler, C. (2003). Smoothed Motion Complexity. In <i>ESA</i> (Vol. 2832, pp. 161--171). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>","short":"V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.","chicago":"Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In <i>ESA</i>, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39658-1_17\">https://doi.org/10.1007/978-3-540-39658-1_17</a>."},"publication":"ESA","publisher":"Springer","_id":"2128","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","page":"161--171","volume":2832,"user_id":"14955","doi":"10.1007/978-3-540-39658-1_17","author":[{"first_name":"Valentina","last_name":"Damerow","full_name":"Damerow, Valentina"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"year":"2003","title":"Smoothed Motion Complexity","status":"public","intvolume":"      2832","date_updated":"2022-01-06T06:54:52Z"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","title":"Anycasting in Adversarial Systems: Routing and Admission Control","year":"2003","author":[{"full_name":"Awerbuch, Baruch","first_name":"Baruch","last_name":"Awerbuch"},{"last_name":"Brinkmann","first_name":"André","full_name":"Brinkmann, André"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:54:53Z","intvolume":"      2719","file":[{"date_updated":"2018-04-12T09:04:48Z","relation":"main_file","access_level":"open_access","file_size":154427,"file_name":"ICALP-03.pdf","content_type":"application/pdf","file_id":"2307","creator":"florida","date_created":"2018-04-12T09:04:48Z"}],"date_created":"2018-04-03T05:38:36Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"publication":"ICALP","page":"1153--1168","_id":"2129","urn":"21297","publisher":"Springer","user_id":"14955","ddc":["040"],"volume":2719,"status":"public","has_accepted_license":"1","oa":"1","file_date_updated":"2018-04-12T09:04:48Z","citation":{"ieee":"B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in <i>ICALP</i>, 2003, vol. 2719, pp. 1153--1168.","apa":"Awerbuch, B., Brinkmann, A., &#38; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In <i>ICALP</i> (Vol. 2719, pp. 1153--1168). Springer.","short":"B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.","chicago":"Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In <i>ICALP</i>, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.","mla":"Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” <i>ICALP</i>, vol. 2719, Springer, 2003, pp. 1153--1168.","bibtex":"@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch, Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168}, collection={Lecture Notes in Computer Science} }","ama":"Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems: Routing and Admission Control. In: <i>ICALP</i>. Vol 2719. Lecture Notes in Computer Science. Springer; 2003:1153--1168."}},{"date_updated":"2022-01-06T06:53:11Z","author":[{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"}],"title":"Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment","status":"public","year":"2003","user_id":"15415","_id":"17423","publisher":"SCS - Europe","language":[{"iso":"eng"}],"page":"367-371","citation":{"mla":"Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” <i>15th European Simulation Symposium (ESS 2003)</i>, SCS - Europe, 2003, pp. 367–71.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}, booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003}, pages={367–371} }","ama":"Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: <i>15th European Simulation Symposium (ESS 2003)</i>. SCS - Europe; 2003:367-371.","ieee":"B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in <i>15th European Simulation Symposium (ESS 2003)</i>, 2003, pp. 367–371.","apa":"Mueck, B., Dangelmaier, W., &#38; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In <i>15th European Simulation Symposium (ESS 2003)</i> (pp. 367–371). SCS - Europe.","short":"B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In <i>15th European Simulation Symposium (ESS 2003)</i>, 367–71. SCS - Europe, 2003."},"publication":"15th European Simulation Symposium (ESS 2003)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-07-28T08:05:14Z"},{"user_id":"15415","language":[{"iso":"eng"}],"_id":"18791","page":"813–822","date_updated":"2022-01-06T06:53:52Z","publication_identifier":{"isbn":["0898715385"]},"author":[{"last_name":"Magen","first_name":"Avner","full_name":"Magen, Avner"},{"full_name":"Ergun, Funda","first_name":"Funda","last_name":"Ergun"},{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"full_name":"Rubinfeld, Ronitt","first_name":"Ronitt","last_name":"Rubinfeld"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"full_name":"Newman, Ilan","first_name":"Ilan","last_name":"Newman"},{"full_name":"Fortnow, Lance","first_name":"Lance","last_name":"Fortnow"}],"title":"Sublinear Approximation of Euclidean Minimum Spanning Tree","status":"public","year":"2003","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-01T14:15:33Z","abstract":[{"lang":"eng","text":"We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + ε using only \\~{O}(√ poly(1/ε)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries."}],"citation":{"apa":"Magen, A., Ergun, F., Sohler, C., Rubinfeld, R., Czumaj, A., Newman, I., &#38; Fortnow, L. (2003). Sublinear Approximation of Euclidean Minimum Spanning Tree. In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i> (pp. 813–822).","ieee":"A. Magen <i>et al.</i>, “Sublinear Approximation of Euclidean Minimum Spanning Tree,” in <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","chicago":"Magen, Avner, Funda Ergun, Christian Sohler, Ronitt Rubinfeld, Artur Czumaj, Ilan Newman, and Lance Fortnow. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” In <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 813–822, 2003.","short":"A. Magen, F. Ergun, C. Sohler, R. Rubinfeld, A. Czumaj, I. Newman, L. Fortnow, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), 2003, pp. 813–822.","mla":"Magen, Avner, et al. “Sublinear Approximation of Euclidean Minimum Spanning Tree.” <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>, 2003, pp. 813–822.","ama":"Magen A, Ergun F, Sohler C, et al. Sublinear Approximation of Euclidean Minimum Spanning Tree. In: <i>Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)</i>. ; 2003:813–822.","bibtex":"@inproceedings{Magen_Ergun_Sohler_Rubinfeld_Czumaj_Newman_Fortnow_2003, title={Sublinear Approximation of Euclidean Minimum Spanning Tree}, booktitle={Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)}, author={Magen, Avner and Ergun, Funda and Sohler, Christian and Rubinfeld, Ronitt and Czumaj, Artur and Newman, Ilan and Fortnow, Lance}, year={2003}, pages={813–822} }"},"publication":"Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003)"},{"user_id":"15415","doi":"10.1145/777412.777418","_id":"18907","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:54Z","publication_identifier":{"isbn":["1581136617"]},"author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"last_name":"Korzeniowski","first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"}],"title":"A practical algorithm for constructing oblivious routing schemes","status":"public","year":"2003","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T07:44:01Z","abstract":[{"lang":"eng","text":"In a (randomized) oblivious routing scheme the path chosen for a request <br>between a source $s$ and a target $t$ is independent from the current traffic <br>in the network. Hence, such a scheme consists of probability distributions<br>over $s-t$ paths for every source-target pair $s,t$ in the network.<br><br>In a recent result citeR02 it was shown that for any undirected network <br>there is an oblivious routing scheme that achieves a polylogarithmic<br>competitive ratio with respect to congestion. Subsequently, Azar et <br>al. citeACF+03 gave a polynomial time algorithm that for a given network <br>constructs the best oblivious routing scheme, i.e. the scheme that guarantees<br>the best possible competitive ratio.  <br>Unfortunately, the latter result is based on the Ellipsoid algorithm; hence <br>it is unpractical for large networks. <br><br>In this paper we present a combinatorial algorithm for constructing an<br>oblivious routing scheme that guarantees a competitive ratio of $O(log^4n)$<br>for undirected networks. Furthermore, our approach yields a proof <br>for the existence of an oblivious routing scheme with competitive ratio<br>$O(log^3n)$, which is much simpler than the original proof from citeR02."}],"citation":{"ieee":"M. Bienkowski, M. Korzeniowski, and H. Räcke, “A practical algorithm for constructing oblivious routing schemes,” in <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>, 2003.","apa":"Bienkowski, M., Korzeniowski, M., &#38; Räcke, H. (2003). A practical algorithm for constructing oblivious routing schemes. In <i>Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03</i>. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>","chicago":"Bienkowski, Marcin, Miroslaw Korzeniowski, and Harald Räcke. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” In <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777418\">https://doi.org/10.1145/777412.777418</a>.","short":"M. Bienkowski, M. Korzeniowski, H. Räcke, in: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03, 2003.","mla":"Bienkowski, Marcin, et al. “A Practical Algorithm for Constructing Oblivious Routing Schemes.” <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_Räcke_2003, title={A practical algorithm for constructing oblivious routing schemes}, DOI={<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>}, booktitle={Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’03}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw and Räcke, Harald}, year={2003} }","ama":"Bienkowski M, Korzeniowski M, Räcke H. A practical algorithm for constructing oblivious routing schemes. In: <i>Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777418\">10.1145/777412.777418</a>"},"publication":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '03"},{"author":[{"first_name":"Carsten","last_name":"Rust","full_name":"Rust, Carsten"},{"first_name":"Friedhelm","last_name":"Stappert","full_name":"Stappert, Friedhelm"},{"full_name":"Lukovszki, Tamás","first_name":"Tamás","last_name":"Lukovszki"}],"status":"public","year":"2003","title":"A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture","date_updated":"2022-01-06T06:53:55Z","language":[{"iso":"eng"}],"_id":"18947","user_id":"15415","citation":{"apa":"Rust, C., Stappert, F., &#38; Lukovszki, T. (2003). A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>.","ieee":"C. Rust, F. Stappert, and T. Lukovszki, “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture,” in <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","short":"C. Rust, F. Stappert, T. Lukovszki, in: 7th World Multiconference on Systemics, Cybernetics and Informatics, 2003.","chicago":"Rust, Carsten, Friedhelm Stappert, and Tamás Lukovszki. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” In <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","mla":"Rust, Carsten, et al. “A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture.” <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>, 2003.","ama":"Rust C, Stappert F, Lukovszki T. A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture. In: <i>7th World Multiconference on Systemics, Cybernetics and Informatics</i>. ; 2003.","bibtex":"@inproceedings{Rust_Stappert_Lukovszki_2003, title={A Petri Net Model for the Network Layer of a Mobile Ad Hoc Network Architecture}, booktitle={7th World Multiconference on Systemics, Cybernetics and Informatics}, author={Rust, Carsten and Stappert, Friedhelm and Lukovszki, Tamás}, year={2003} }"},"publication":"7th World Multiconference on Systemics, Cybernetics and Informatics","abstract":[{"text":"In this paper, we define a Petri net model for the network or routing layer of a mobile ad hoc network. Such networks require routing strategies substantially different from those used in static communication networks. The model pre- sented consists of two layers, a location service and a po- sition based routing. Both are described in detail. Our ap- proach considers a very strong definition of fault tolerance thereby improving state-of-the-art ad hoc routing protocols in several respects. Modeling of the communication archi- tecture for mobile ad hoc networks is part of our overall effort towards a design methodology for distributed embed- ded real-time systems including dynamically evolving com- ponents.","lang":"eng"}],"date_created":"2020-09-03T11:50:06Z","department":[{"_id":"63"}],"type":"conference"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-03T13:10:50Z","abstract":[{"lang":"eng","text":"We investigate distributed algorithms for mobile ad hoc networks for   moving radio stations with adjustable transmission power in a worst   case scenario. We consider two models to find a reasonable   restriction on the worst-case mobility. In the pedestrian model we   assume a maximum speed $v_max$ of the radio stations, while in   the vehicular model we assume a maximum acceleration $a_max$ of   the points.      Our goal is to maintain persistent routes with nice communication   network properties like hop-distance, energy-consumption, congestion   and number of interferences. A route is persistent, if we can   guarantee that all edges of this route can be uphold for a given   time span $Delta$, which is a parameter denoting the minimum time   the mobile network needs to adopt changes, i.e. update routing   tables, change directory entries, etc. This $Delta$ can be used as   the length of an update interval for a proactive routing scheme.      We extend some known notions such as transmission range,   interferences, spanner, power spanner and congestion to both   mobility models and introduce a new parameter called crowdedness   that states a lower bound on the number of radio interferences. Then   we prove that a mobile spanner hosts a path system that   polylogarithmically approximates the optimal congestion.    We present distributed algorithms based on a grid clustering   technique and a high-dimensional representation of the dynamical   start situation which construct mobile spanners with low congestion,   low interference number, low energy-consumption, and low degree.  We   measure the optimality of the output of our algorithm by comparing   it with the optimal choice of persistent routes under the same   circumstances with respect to pedestrian or vehicular worst-case   movements. Finally, we present solutions for dynamic position   information management under our mobility models."}],"publication":"Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)","citation":{"mla":"Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>.","ama":"Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>","bibtex":"@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>}, booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, year={2003} }","apa":"Schindelhauer, C., Lukovszki, T., Rührup, S., &#38; Volbert, K. (2003). Worst case mobility in ad hoc networks. In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>","ieee":"C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003.","short":"C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.","chicago":"Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>."},"doi":"10.1145/777412.777448","user_id":"15415","language":[{"iso":"eng"}],"_id":"18960","date_updated":"2022-01-06T06:53:55Z","publication_status":"published","year":"2003","title":"Worst case mobility in ad hoc networks","status":"public","author":[{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"full_name":"Rührup, Stefan","last_name":"Rührup","first_name":"Stefan"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"}],"publication_identifier":{"isbn":["1581136617"]}},{"language":[{"iso":"eng"}],"_id":"18966","user_id":"15415","doi":"10.1145/780542.780599","publication_identifier":{"isbn":["1581136749"]},"author":[{"last_name":"Azar","first_name":"Yossi","full_name":"Azar, Yossi"},{"last_name":"Cohen","first_name":"Edith","full_name":"Cohen, Edith"},{"full_name":"Fiat, Amos","last_name":"Fiat","first_name":"Amos"},{"last_name":"Kaplan","first_name":"Haim","full_name":"Kaplan, Haim"},{"last_name":"Racke","first_name":"Harald","full_name":"Racke, Harald"}],"year":"2003","title":"Optimal oblivious routing in polynomial time","status":"public","publication_status":"published","date_updated":"2022-01-06T06:53:56Z","date_created":"2020-09-03T14:34:33Z","department":[{"_id":"63"}],"type":"conference","citation":{"apa":"Azar, Y., Cohen, E., Fiat, A., Kaplan, H., &#38; Racke, H. (2003). Optimal oblivious routing in polynomial time. In <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>","ieee":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke, “Optimal oblivious routing in polynomial time,” in <i>Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03</i>, 2003.","short":"Y. Azar, E. Cohen, A. Fiat, H. Kaplan, H. Racke, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03, 2003.","chicago":"Azar, Yossi, Edith Cohen, Amos Fiat, Haim Kaplan, and Harald Racke. “Optimal Oblivious Routing in Polynomial Time.” In <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003. <a href=\"https://doi.org/10.1145/780542.780599\">https://doi.org/10.1145/780542.780599</a>.","mla":"Azar, Yossi, et al. “Optimal Oblivious Routing in Polynomial Time.” <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>, 2003, doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>.","ama":"Azar Y, Cohen E, Fiat A, Kaplan H, Racke H. Optimal oblivious routing in polynomial time. In: <i>Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing  - STOC ’03</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>","bibtex":"@inproceedings{Azar_Cohen_Fiat_Kaplan_Racke_2003, title={Optimal oblivious routing in polynomial time}, DOI={<a href=\"https://doi.org/10.1145/780542.780599\">10.1145/780542.780599</a>}, booktitle={Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC ’03}, author={Azar, Yossi and Cohen, Edith and Fiat, Amos and Kaplan, Haim and Racke, Harald}, year={2003} }"},"publication":"Proceedings of the thirty-fifth ACM symposium on Theory of computing  - STOC '03","abstract":[{"lang":"eng","text":"A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network."}]},{"citation":{"chicago":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","short":"J. Gehweiler, Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java, Universität Paderborn, 2003.","apa":"Gehweiler, J. (2003). <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn.","ieee":"J. Gehweiler, <i>Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java</i>. Universität Paderborn, 2003.","ama":"Gehweiler J. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. Universität Paderborn; 2003.","bibtex":"@book{Gehweiler_2003, place={Universität Paderborn}, title={Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java}, author={Gehweiler, Joachim}, year={2003} }","mla":"Gehweiler, Joachim. <i>Entwurf Und Implementierung Einer Laufzeitumgebung Für Parallele Algorithmen in Java</i>. 2003."},"file_date_updated":"2020-09-04T08:03:11Z","abstract":[{"text":"In dieser Studienarbeit wurde ein System entworfen und implementiert, das der Ausführung paralleler Algorithmen nach dem Bulk-Synchronous Parallel (BSP)-Modell dient. Von der Paderborn University BSP Library (PUB) unterscheidet es sich dadurch, dass es vom Einsatzgebiet her nicht für Parallelrechner konzipiert ist, sondern vielmehr für eine Ansammlung von PCs und Workstations, die über das gesamte Internet verteilt sind.<br>Gegenüber anderen bekannten Web-Computing Projekten wie z.B. SETI@home oder distributed.net zeichnet sich dieses System dadurch aus, dass nicht Clients von einem zentralen Server \"häppchenweise\" unabhängige Teilprobleme anfordern und lösen, sondern dass die Clients gemeinsam an einem Problem arbeiten, indem sie nach dem BSP-Modell miteinander kommunizieren und sich synchronisieren.","lang":"ger"}],"date_created":"2020-09-04T08:03:37Z","place":"Universität Paderborn","file":[{"file_name":"pub-hni-2464.pdf","access_level":"closed","file_size":703144,"relation":"main_file","date_updated":"2020-09-04T08:03:11Z","file_id":"18985","content_type":"application/pdf","success":1,"creator":"koala","date_created":"2020-09-04T08:03:11Z"}],"department":[{"_id":"63"}],"type":"mastersthesis","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"}],"year":"2003","title":"Entwurf und Implementierung einer Laufzeitumgebung für parallele Algorithmen in Java","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:53:56Z","_id":"18982","language":[{"iso":"eng"}],"user_id":"15415","ddc":["004"]},{"publication":"Complex Systems","issue":"3","citation":{"ieee":"H. Hamann, “Definition and Behavior of Langton’s Ant in Three Dimensions,” <i>Complex Systems</i>, vol. 14, no. 3, pp. 263--268, 2003.","apa":"Hamann, H. (2003). Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>, <i>14</i>(3), 263--268.","short":"H. Hamann, Complex Systems 14 (2003) 263--268.","chicago":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i> 14, no. 3 (2003): 263--268.","mla":"Hamann, Heiko. “Definition and Behavior of Langton’s Ant in Three Dimensions.” <i>Complex Systems</i>, vol. 14, no. 3, 2003, pp. 263--268.","bibtex":"@article{Hamann_2003, title={Definition and Behavior of Langton’s Ant in Three Dimensions}, volume={14}, number={3}, journal={Complex Systems}, author={Hamann, Heiko}, year={2003}, pages={263--268} }","ama":"Hamann H. Definition and Behavior of Langton’s Ant in Three Dimensions. <i>Complex Systems</i>. 2003;14(3):263--268."},"date_created":"2020-11-19T12:15:45Z","type":"journal_article","department":[{"_id":"63"},{"_id":"238"}],"status":"public","title":"Definition and Behavior of Langton's Ant in Three Dimensions","year":"2003","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"}],"date_updated":"2022-01-06T06:54:27Z","intvolume":"        14","page":"263--268","language":[{"iso":"eng"}],"_id":"20435","user_id":"15415","volume":14},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-24T14:18:19Z","abstract":[{"text":"Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of degree up to N or multi-evaluate one at N points simultaneously within quasi-linear time O(N polylog N). An extension to (and in fact the mere definition of) polynomials over fields R and C to the SKEW-field H of quaternions is promising but still missing. The present work proposes three approaches which in the commutative case coincide but for H turn out to differ, each one satisfying some desirable properties while lacking others. For each notion, we devise algorithms for according arithmetic; these are quasi-optimal in that their running times match lower complexity bounds up to polylogarithmic factors.","lang":"eng"}],"citation":{"apa":"Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i> (pp. 705–715). <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>","ieee":"M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–715.","chicago":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” In <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer, Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">https://doi.org/10.1007/978-3-540-24587-2_72</a>.","short":"M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.","mla":"Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>, 2003, pp. 705–15, doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>.","ama":"Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>. Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715. doi:<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>","bibtex":"@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion Polynomials}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24587-2_72\">10.1007/978-3-540-24587-2_72</a>}, booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }"},"publication":"Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03)","user_id":"15415","doi":"10.1007/978-3-540-24587-2_72","_id":"18196","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg","page":"705-715","publication_status":"published","date_updated":"2022-01-06T06:53:27Z","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"isbn":["9783540206958","9783540245872"],"issn":["0302-9743","1611-3349"]},"year":"2003","title":"Quasi-optimal Arithmetic for Quaternion Polynomials","status":"public"},{"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-25T10:15:14Z","abstract":[{"text":"Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).","lang":"eng"}],"publication":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-45078-8_13","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:53:28Z","publication_status":"published","intvolume":"      2748","title":"Fast Relative Approximation of Potential Fields","year":"2003","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540405450","9783540450788"]},"author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"corporate_editor":["Algorithms and Data Structures. WADS 2003"],"place":"Berlin, Heidelberg","citation":{"chicago":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>.","short":"M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.","apa":"Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>","ieee":"M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.","ama":"Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>","bibtex":"@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Fast Relative Approximation of Potential Fields}, volume={2748}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler, Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer Science} }","mla":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>."},"user_id":"15415","editor":[{"full_name":"Dehne, F.","first_name":"F.","last_name":"Dehne"},{"full_name":"Sack, JR.","first_name":"JR.","last_name":"Sack"},{"last_name":"Smid","first_name":"M.","full_name":"Smid, M."}],"volume":2748,"publisher":"Springer","_id":"18258","status":"public"},{"abstract":[{"lang":"eng","text":"Unternehmen operieren zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu; die Produktlebenszyklen werden kürzer; gleichzeitig werden die Produkte komplexer; der harte Wettbewerb zwingt die Unternehmen, auf Marktveränderungen zu reagieren. Aus dieser Entwicklung resultieren hohe Anforderungen an die Gestaltung der Fertigungsprozesse. Im Wesentlichen kommt es darauf an, die Fertigungsprozesse möglichst rasch an die neuen Gegebenheiten anzupassen, bzw. neue Fertigungsprozesse so zu planen, dass sie auf Anhieb die erforderlichen Resultate bringen.\r\nEin wichtiges Mittel hierfür der Einsatz von Materialflusssimulationen. Hierzu ist zunächst die Erstellung eines Simulationsmodells notwendig. Dafür wird in einem ersten Schritt das zu betrachtende System analysiert und ein rechnerinternes Modell erzeugt. Dieses beinhaltet die Modellierung von Funktionen, Prozessen, Verhaltensweisen oder Regeln, die im Modell die tatsächlichen Wirkzusammenhänge im Unternehmen widerspiegeln sollen. Die so modellierten Aspekte sind untereinander so vernetzt, dass alle Funktionen des Modells ein Ganzes ergeben. Für viele Fragenstellungen werden umfangreiche Modelle mit einem komplexen Verhalten benötigt. Andererseits steigt mit zunehmender Größe und Komplexität des Simulationsmodells auch der Modellierungsaufwand, die Fehleranfälligkeit, die Laufzeit und der Interpretationsaufwand bei der Ergebnisauswertung. Fehler bei der Modellbildung führen bei der Simulation zu Fehlinterpretationen und falschen Ergebnissen.\r\nEinen wesentlichen Anteil daran hat die Gestaltung der Benutzungsschnittstelle: Das übliche, wenig intuitive WIMP-Interface (Windows, Icons, Mouse, Pointer) erfordert sehr gut geschulte Benutzer, sodass die Erzeugung der meist komplexen Simulationsmodelle mit großen Zeitaufwand verbunden ist. Die Präsentation der Simulationsergebnisse erfolgt in Form von Wertetabellen und zweidimensionalen, abstrakten Darstellungen des Fertigungssystems. Für die Simulationsexperten erscheint dies ausreichend, für ein aus verschiedenen Bereichen und Disziplinen zusammengesetztes Planungsteam ist das aber nicht akzeptabel. So können Fehlinterpretationen aufgrund der unklaren Darstellungen auftreten.\r\nDurch eine durchgängige Unterstützung von der Modellierung über die Ausführung bis zur Analyse von Simulationen durch Augmented-Reality und Virtual-Reality werden viele dieser Probleme überwunden aber viele neue Probleme entstehen.\r\nMarktgängige Simulatoren unterstützen zwar z.T. schon Virtual Reality; eine durchgängige Simulationsunterstützung wird aber in der Virtuellen Umgebung nicht geboten. Argumented Reality-Komponenten sind bisher nicht bekannt.\r\nIn diesem Artikel werden nach einer Analyse der benötigten Technologien die Nutzenpotentiale insb. durch den Einsatz von AR ausgelotet.\r\n"}],"publication":"Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management","type":"conference","department":[{"_id":"63"}],"file":[{"date_updated":"2020-08-26T12:52:18Z","relation":"main_file","access_level":"closed","file_size":221846,"file_name":"hni-id-1445.pdf","content_type":"application/pdf","success":1,"file_id":"18368","creator":"koala","date_created":"2020-08-26T12:52:18Z"}],"date_created":"2020-08-26T12:53:13Z","date_updated":"2022-01-06T06:53:30Z","intvolume":"         5","title":"Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation","year":"2003","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Grafe","first_name":"Michael","full_name":"Grafe, Michael"},{"full_name":"Matysczok, Carsten","first_name":"Carsten","last_name":"Matysczok"},{"last_name":"Mueck","first_name":"Bengt","full_name":"Mueck, Bengt"},{"full_name":"Schoo, Michael","first_name":"Michael","last_name":"Schoo"}],"series_title":"ESIM - European Series in Industrial Management","language":[{"iso":"eng"}],"file_date_updated":"2020-08-26T12:52:18Z","citation":{"ama":"Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>. Vol 5. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag; 2003:170-177.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Mueck_Schoo_2003, place={Karlsruhe}, series={ESIM - European Series in Industrial Management}, title={Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation}, volume={5}, booktitle={Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management}, publisher={Shaker Verlag}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt and Schoo, Michael}, year={2003}, pages={170–177}, collection={ESIM - European Series in Industrial Management} }","mla":"Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, vol. 5, Shaker Verlag, 2003, pp. 170–77.","short":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, M. Schoo, in: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, Shaker Verlag, Karlsruhe, 2003, pp. 170–177.","chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and Michael Schoo. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag, 2003.","apa":"Fischer, M., Grafe, M., Matysczok, C., Mueck, B., &#38; Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i> (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag.","ieee":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation,” in <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 2003, vol. 5, pp. 170–177."},"place":"Karlsruhe","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"15415","volume":5,"page":"170-177","_id":"18367","publisher":"Shaker Verlag"},{"volume":123,"ddc":["000"],"user_id":"15415","_id":"18372","page":"141-151","has_accepted_license":"1","status":"public","citation":{"bibtex":"@inproceedings{Dangelmaier_ Franke_Mueck_Fischer_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Dangelmaier, Wilhelm and  Franke, Werner and Mueck, Bengt and Fischer, Matthias}, year={2003}, pages={141–151}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Dangelmaier W,  Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.","mla":"Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, 2003, pp. 141–51.","short":"W. Dangelmaier, W.  Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.","chicago":"Dangelmaier, Wilhelm, Werner  Franke, Bengt Mueck, and Matthias Fischer. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:141–51. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2003.","ieee":"W. Dangelmaier, W.  Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 141–151.","apa":"Dangelmaier, W.,  Franke, W., Mueck, B., &#38; Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 123, pp. 141–151)."},"file_date_updated":"2020-08-26T13:15:56Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"       123","date_updated":"2022-01-06T06:53:31Z","author":[{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"full_name":" Franke, Werner","last_name":" Franke","first_name":"Werner"},{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"title":"Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen","year":"2003","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-26T13:16:08Z","file":[{"creator":"koala","date_created":"2020-08-26T13:15:56Z","access_level":"closed","file_size":166316,"file_name":"hni-id-1340.pdf","date_updated":"2020-08-26T13:15:56Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"18373"}],"abstract":[{"lang":"ger","text":"Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben. Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam zu werden und diese zu entschärfen.\r\nEs wird der Entwurf eines Werkzeugs beschrieben, dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung (Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren. Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation die kritische Situation experimentell untersuchen können. Da der kritische Moment in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten zurück zu setzen.\r\nDie virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt, an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität und Darstellungsperformance zu erreichen.\r\n"}],"publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung"},{"citation":{"ama":"Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003:153-166.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Schoo_Mueck_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Schoo, Michael and Mueck, Bengt}, year={2003}, pages={153–166}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66.","short":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.","chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","apa":"Fischer, M., Grafe, M., Matysczok, C., Schoo, M., &#38; Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>123</i>, 153–166.","ieee":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 153–166."},"file_date_updated":"2020-08-26T13:24:28Z","_id":"18374","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"153-166","volume":123,"user_id":"5786","ddc":["000"],"status":"public","has_accepted_license":"1","date_created":"2020-08-26T13:24:57Z","file":[{"date_created":"2020-08-26T13:24:28Z","creator":"koala","content_type":"application/pdf","success":1,"file_id":"18375","access_level":"closed","file_size":906882,"file_name":"hni-id-1343.pdf","date_updated":"2020-08-26T13:24:28Z","relation":"main_file"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"conference","publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","abstract":[{"text":"In der heutigen Zeit operieren Unternehmen zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu und die Produktlebenszyklen werden kürzer. Daraus resultieren hohe Anforderungen an die Planung von Fertigungssysteme. Um diesen Prozess zu unterstützen, sollen die Technologien Augmented Reality und Virtual Reality in einem integrierten System genutzt werden. Dieses System unterstützt den Anwender bei der Modellbildung, der Validierung des Simulationsmodells sowie der folgenden Optimierung des Fertigungssystems. Durch die Entwicklung geeigneter Kopplungs- bzw. Integrationsmechanismen wird eine durchgängige Nutzung der Technologien AR, VR und Simulation realisiert. Die Visualisierung der anfallenden 3D-Daten innerhalb der VR- und ARUmgebungen erfolgt mittels einer 3D-Renderinglibrary, die es durch den Einsatz von neuen entwickelten Verfahren ermöglicht, die verwendeten 3D-Modelle weitgehend automatisiert aus unternehmensinternen 3D-CAD-Modellen zu generieren.","lang":"ger"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Grafe, Michael","last_name":"Grafe","first_name":"Michael"},{"full_name":"Matysczok, Carsten","last_name":"Matysczok","first_name":"Carsten"},{"first_name":"Michael","last_name":"Schoo","full_name":"Schoo, Michael"},{"full_name":"Mueck, Bengt","first_name":"Bengt","last_name":"Mueck"}],"year":"2003","title":"Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation","intvolume":"       123","date_updated":"2022-01-06T06:53:31Z"},{"date_created":"2020-08-28T12:14:18Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Combinatorics, Probability & Computing","citation":{"ieee":"M. Adler, B. Vöcking, C. Sohler, H. Räcke, and N. Sivadasan, “Randomized Pursuit-Evasion in Graphs,” <i>Combinatorics, Probability &#38; Computing</i>, pp. 225–244, 2003.","apa":"Adler, M., Vöcking, B., Sohler, C., Räcke, H., &#38; Sivadasan, N. (2003). Randomized Pursuit-Evasion in Graphs. <i>Combinatorics, Probability &#38; Computing</i>, 225–244.","chicago":"Adler, Micah, Berthold Vöcking, Christian Sohler, Harald Räcke, and Naveen Sivadasan. “Randomized Pursuit-Evasion in Graphs.” <i>Combinatorics, Probability &#38; Computing</i>, 2003, 225–44.","short":"M. Adler, B. Vöcking, C. Sohler, H. Räcke, N. Sivadasan, Combinatorics, Probability &#38; Computing (2003) 225–244.","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Combinatorics, Probability &#38; Computing</i>, 2003, pp. 225–44.","bibtex":"@article{Adler_Vöcking_Sohler_Räcke_Sivadasan_2003, title={Randomized Pursuit-Evasion in Graphs}, journal={Combinatorics, Probability &#38; Computing}, author={Adler, Micah and Vöcking, Berthold and Sohler, Christian and Räcke, Harald and Sivadasan, Naveen}, year={2003}, pages={225–244} }","ama":"Adler M, Vöcking B, Sohler C, Räcke H, Sivadasan N. Randomized Pursuit-Evasion in Graphs. <i>Combinatorics, Probability &#38; Computing</i>. 2003:225-244."},"page":"225-244","_id":"18567","language":[{"iso":"eng"}],"user_id":"15415","title":"Randomized Pursuit-Evasion in Graphs","year":"2003","status":"public","author":[{"first_name":"Micah","last_name":"Adler","full_name":"Adler, Micah"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"first_name":"Naveen","last_name":"Sivadasan","full_name":"Sivadasan, Naveen"}],"date_updated":"2022-01-06T06:53:40Z"},{"citation":{"bibtex":"@book{Sohler_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Property Testing and Geometry}, volume={119}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Sohler, Christian}, year={2003}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Sohler C. <i>Property Testing and Geometry</i>. Vol 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003.","mla":"Sohler, Christian. <i>Property Testing and Geometry</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","short":"C. Sohler, Property Testing and Geometry, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","chicago":"Sohler, Christian. <i>Property Testing and Geometry</i>. Vol. 119. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","ieee":"C. Sohler, <i>Property Testing and Geometry</i>, vol. 119. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","apa":"Sohler, C. (2003). <i>Property Testing and Geometry</i> (Vol. 119). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101281","relation":"confirmation"}]},"date_created":"2020-08-28T13:11:56Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"status":"public","year":"2003","title":"Property Testing and Geometry","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"}],"publication_identifier":{"isbn":["3-935433-28-X"]},"date_updated":"2022-01-06T06:53:40Z","intvolume":"       119","_id":"18573","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":119},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)","status":"public","year":"2003","publication_identifier":{"issn":["2196-7032","1611-2776"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"doi":"10.1524/itit.45.2.108.19606","user_id":"15415","_id":"16481","language":[{"iso":"eng"}],"abstract":[{"text":"<jats:title>Zusammenfassung</jats:title><jats:p>Vernetzte Systeme sind zu unverzichtbaren Bestandteilen unseres Umfelds geworden, zum Beispiel als Höchstleistungsrechner, als Kommunikations- und Informationssysteme oder als Planungs- und Steuerungskomponenten von Transport- und Produktionssystemen. Die ständig wachsende Komplexität solcher Systeme stellt Informatiker und Ingenieure vor immer neue Herausforderungen. In diesem Beitrag beschreibe ich die Zielsetzungen und die Struktur des SFB 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen. Als Beispiel für unsere Arbeiten beschreibe ich einen algorithmisch orientierten Forschungszweig, in dem wir, ausgehend von theoretischen Problemen über effiziente Simulationen zwischen parallelen Rechenmodellen, Methoden, Techniken und Implementierungen entwickelt haben, die zu produktnahen Prototypen für die Speichervirtualisierung in verteilten Datenservern führen.</jats:p>","lang":"eng"}],"publication":"it - Information Technology","citation":{"short":"F. Meyer auf der Heide, It - Information Technology (2003).","chicago":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>.","apa":"Meyer auf der Heide, F. (2003). Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>It - Information Technology</i>. <a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">https://doi.org/10.1524/itit.45.2.108.19606</a>","ieee":"F. Meyer auf der Heide, “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications),” <i>it - Information Technology</i>, 2003.","ama":"Meyer auf der Heide F. Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications). <i>it - Information Technology</i>. 2003. doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>","bibtex":"@article{Meyer auf der Heide_2003, title={Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications)}, DOI={<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>}, journal={it - Information Technology}, author={Meyer auf der Heide, Friedhelm}, year={2003} }","mla":"Meyer auf der Heide, Friedhelm. “Sonderforschungsbereich 376 Massive Parallelität: Algorithmen – Entwurfsmethoden – Anwendungen (Massively Parallel Computing: Algorithms – Design Methods – Applications).” <i>It - Information Technology</i>, 2003, doi:<a href=\"https://doi.org/10.1524/itit.45.2.108.19606\">10.1524/itit.45.2.108.19606</a>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-09T07:27:56Z"}]