--- _id: '19612' author: - first_name: Jan full_name: Klein, Jan last_name: Klein citation: ama: Klein J. Efficient Collision Detection for Point and Polygon Based Models. Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models}, volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: J. Klein, Efficient Collision Detection for Point and Polygon Based Models, vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: J. Klein, Efficient Collision Detection for Point and Polygon Based Models, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-09-22T07:48:45Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 186' language: - iso: eng publication_identifier: isbn: - 3-939350-05-2 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101248 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Efficient Collision Detection for Point and Polygon Based Models type: dissertation user_id: '5786' volume: 186 year: '2006' ... --- _id: '19613' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup citation: ama: Rührup S. Position-Based Routing Strategies. Vol 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006. apa: Rührup, S. (2006). Position-based Routing Strategies (Vol. 203). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Rührup_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Position-based Routing Strategies}, volume={203}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Rührup, Stefan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Rührup, Stefan. Position-Based Routing Strategies. Vol. 203. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. ieee: S. Rührup, Position-based Routing Strategies, vol. 203. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. mla: Rührup, Stefan. Position-Based Routing Strategies. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. short: S. Rührup, Position-Based Routing Strategies, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006. date_created: 2020-09-22T07:51:17Z date_updated: 2022-01-06T06:54:08Z department: - _id: '63' - _id: '26' intvolume: ' 203' language: - iso: eng publication_identifier: isbn: - 978-3-939350-22-4 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301169 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Position-based Routing Strategies type: dissertation user_id: '5786' volume: 203 year: '2006' ... --- _id: '19690' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Piotr full_name: Krysta, Piotr last_name: Krysta citation: ama: 'Briest P, Krysta P. Single-Minded Unlimited Supply Pricing on Sparse Instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). ; 2006.' apa: Briest, P., & Krysta, P. (2006). Single-Minded Unlimited Supply Pricing on Sparse Instances. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). bibtex: '@inproceedings{Briest_Krysta_2006, title={Single-Minded Unlimited Supply Pricing on Sparse Instances}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)}, author={Briest, Patrick and Krysta, Piotr}, year={2006} }' chicago: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. ieee: P. Briest and P. Krysta, “Single-Minded Unlimited Supply Pricing on Sparse Instances,” in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. mla: Briest, Patrick, and Piotr Krysta. “Single-Minded Unlimited Supply Pricing on Sparse Instances.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006. short: 'P. Briest, P. Krysta, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.' date_created: 2020-09-25T10:36:04Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) status: public title: Single-Minded Unlimited Supply Pricing on Sparse Instances type: conference user_id: '15415' year: '2006' ... --- _id: '19691' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Christian full_name: Gunia, Christian last_name: Gunia citation: ama: 'Briest P, Gunia C. Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). ; 2006.' apa: Briest, P., & Gunia, C. (2006). Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC). bibtex: '@inproceedings{Briest_Gunia_2006, title={Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels}, booktitle={Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC)}, author={Briest, Patrick and Gunia, Christian}, year={2006} }' chicago: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. ieee: P. Briest and C. Gunia, “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels,” in Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. mla: Briest, Patrick, and Christian Gunia. “Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels.” Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006. short: 'P. Briest, C. Gunia, in: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC), 2006.' date_created: 2020-09-25T10:38:20Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng publication: Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC) status: public title: Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels type: conference user_id: '15415' year: '2006' ... --- _id: '19718' author: - first_name: Bastian full_name: Degener, Bastian last_name: Degener citation: ama: Degener B. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen.; 2006. apa: Degener, B. (2006). Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen. bibtex: '@book{Degener_2006, title={Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen}, author={Degener, Bastian}, year={2006} }' chicago: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006. ieee: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen. 2006. mla: Degener, Bastian. Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen. 2006. short: B. Degener, Die Analyse von Estimation-of-Distribution-Algorithmen Auf Ausgewählten Funktionen, 2006. date_created: 2020-09-28T10:01:34Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng status: public title: Die Analyse von Estimation-of-Distribution-Algorithmen auf ausgewählten Funktionen type: mastersthesis user_id: '15415' year: '2006' ... --- _id: '19808' abstract: - lang: eng text: We study the problem of designing an adaptive hash table for redundant data storage in a system of storage devices with arbitrary capacities. Ideally, such a hash table should make sure that (a) a storage device with x% of the available capacity should get x% of the data, (b) the copies of each data item are distributed among the storage devices so that no two copies are stored at the same device, and (c) only a near-minimum amount of data replacements is necessary to preserve (a) and (b) under any change in the system. Hash tables satisfying (a) and (c) are already known, and it is not difficult to construct hash tables satisfying (a) and (b). However, no hash table is known so far that can satisfy all three properties as long as this is in principle possible. We present a strategy called SPREAD that solves this problem for the first time. As long as (a) and (b) can in principle be satisfied, SPREAD preserves (a) for every storage device nearly optimal, with high probability, guarantees (b) for every data item, and only needs a constant factor more data replacements than minimum possible in order to preserve (a) and (b). author: - first_name: Peter full_name: Mahlmann, Peter last_name: Mahlmann - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Mahlmann P, Schindelhauer C. Distributed random digraph transformations for peer-to-peer networks. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06. ; 2006:308--317. doi:10.1145/1148109.1148162' apa: Mahlmann, P., & Schindelhauer, C. (2006). Distributed random digraph transformations for peer-to-peer networks. In Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06 (pp. 308--317). https://doi.org/10.1145/1148109.1148162 bibtex: '@inproceedings{Mahlmann_Schindelhauer_2006, title={Distributed random digraph transformations for peer-to-peer networks}, DOI={10.1145/1148109.1148162}, booktitle={Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2006}, pages={308--317} }' chicago: Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” In Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 308--317, 2006. https://doi.org/10.1145/1148109.1148162. ieee: P. Mahlmann and C. Schindelhauer, “Distributed random digraph transformations for peer-to-peer networks,” in Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures  - SPAA ’06, 2006, pp. 308--317. mla: Mahlmann, Peter, and Christian Schindelhauer. “Distributed Random Digraph Transformations for Peer-to-Peer Networks.” Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 2006, pp. 308--317, doi:10.1145/1148109.1148162. short: 'P. Mahlmann, C. Schindelhauer, in: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures  - SPAA ’06, 2006, pp. 308--317.' date_created: 2020-09-30T13:07:55Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1148109.1148162 language: - iso: eng page: 308--317 publication: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures - SPAA '06 publication_identifier: isbn: - '1595934529' publication_status: published status: public title: Distributed random digraph transformations for peer-to-peer networks type: conference user_id: '15415' year: '2006' ... --- _id: '19838' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: 'Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). ; 2006. doi:10.1007/11940128_65' apa: Rührup, S., & Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006). https://doi.org/10.1007/11940128_65 bibtex: '@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={10.1007/11940128_65}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }' chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006. https://doi.org/10.1007/11940128_65. ieee: S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006. mla: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65. short: 'S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.' date_created: 2020-10-01T11:51:15Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1007/11940128_65 language: - iso: eng publication: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006) publication_identifier: isbn: - '9783540496946' - '9783540496960' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Online Multi-path Routing in a Maze type: conference user_id: '15415' year: '2006' ... --- _id: '19839' abstract: - lang: eng text: Storage Area Networks commonly consist a more or less static set of n data servers that handle a dynamic collection of m documents. Such SANs can minimize the access time to documents by distributing each document among several servers, allowing users to access documents in parallel. This paper describes an efficient solution for providing parallel access to multiple hard disks for popular content. In extension to previous approaches we provide an efficient and elegant hash table data structure for utilizing the full capacity of each data server. Concerning the dynamics, documents as well as server may be added or removed from the system causing only local changes. We consider sequential and parallel access to data in the average case. For the average time model we present a fast optimal algorithm. author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Schindelhauer C, Schomaker G. SAN Optimal Multi Parameter Access Scheme. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.190' apa: Schindelhauer, C., & Schomaker, G. (2006). SAN Optimal Multi Parameter Access Scheme. 5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.190 bibtex: '@inproceedings{Schindelhauer_Schomaker_2006, title={SAN Optimal Multi Parameter Access Scheme}, DOI={10.1109/icniconsmcl.2006.190}, booktitle={5th International Conference on Networking (ICN)}, author={Schindelhauer, Christian and Schomaker, Gunnar}, year={2006} }' chicago: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” In 5th International Conference on Networking (ICN), 2006. https://doi.org/10.1109/icniconsmcl.2006.190. ieee: 'C. Schindelhauer and G. Schomaker, “SAN Optimal Multi Parameter Access Scheme,” 2006, doi: 10.1109/icniconsmcl.2006.190.' mla: Schindelhauer, Christian, and Gunnar Schomaker. “SAN Optimal Multi Parameter Access Scheme.” 5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.190. short: 'C. Schindelhauer, G. Schomaker, in: 5th International Conference on Networking (ICN), 2006.' date_created: 2020-10-01T11:55:27Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1109/icniconsmcl.2006.190 language: - iso: eng publication: 5th International Conference on Networking (ICN) publication_identifier: isbn: - '0769525520' publication_status: published status: public title: SAN Optimal Multi Parameter Access Scheme type: conference user_id: '15415' year: '2006' ... --- _id: '19840' author: - first_name: Stefan full_name: Rührup, Stefan last_name: Rührup - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer citation: ama: Rührup S, Schindelhauer C. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn; 2006. apa: Rührup, S., & Schindelhauer, C. (2006). Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn. bibtex: '@book{Rührup_Schindelhauer_2006, place={Universität Paderborn}, title={Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }' chicago: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006. ieee: S. Rührup and C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. Universität Paderborn, 2006. mla: Rührup, Stefan, and Christian Schindelhauer. Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks. 2006. short: S. Rührup, C. Schindelhauer, Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks, Universität Paderborn, 2006. date_created: 2020-10-01T12:01:15Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng place: Universität Paderborn status: public title: Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks type: report user_id: '15415' year: '2006' ... --- _id: '19854' abstract: - lang: eng text: In previous publications there have been several proposals
regarding replica generation and placement of movie content in
content-distribution-networks or P2P overlays. Within this paper
we extend approaches for heterogeneous placement scenarios
described in prior publications. Therefor we presume heterogeneous
server peers' bandwidth, HD capacity, and movie popularities.
Movie documents are replicated and placed onto server peers with
respect to the predicted popularity values. Thus each document
aims to gain fair networks resources according to its popularity.
We present simulation results of heuristics of different placement
strategies and compare them with a near optimal technique. author: - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: Christoph full_name: Loeser, Christoph last_name: Loeser - first_name: Matthias full_name: Schubert, Matthias last_name: Schubert citation: ama: 'Schomaker G, Loeser C, Schubert M. Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In: 5th International Conference on Networking (ICN). ; 2006.' apa: Schomaker, G., Loeser, C., & Schubert, M. (2006). Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks. In 5th International Conference on Networking (ICN). bibtex: '@inproceedings{Schomaker_Loeser_Schubert_2006, title={Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks}, booktitle={5th International Conference on Networking (ICN).}, author={Schomaker, Gunnar and Loeser, Christoph and Schubert, Matthias}, year={2006} }' chicago: Schomaker, Gunnar, Christoph Loeser, and Matthias Schubert. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” In 5th International Conference on Networking (ICN)., 2006. ieee: G. Schomaker, C. Loeser, and M. Schubert, “Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks,” in 5th International Conference on Networking (ICN)., 2006. mla: Schomaker, Gunnar, et al. “Predictive Replication and Placement Strategies for Movie Documents in Heterogeneous Content Delivery Networks.” 5th International Conference on Networking (ICN)., 2006. short: 'G. Schomaker, C. Loeser, M. Schubert, in: 5th International Conference on Networking (ICN)., 2006.' date_created: 2020-10-02T11:57:06Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' language: - iso: eng publication: 5th International Conference on Networking (ICN). status: public title: Predictive Replication and Placement Strategies for Movie Documents in heterogeneous Content Delivery Networks type: conference user_id: '15415' year: '2006' ... --- _id: '19870' author: - first_name: Andre full_name: Brinkmann, Andre last_name: Brinkmann - first_name: Sascha full_name: Effert, Sascha last_name: Effert - first_name: Michael full_name: Heidebuer, Michael last_name: Heidebuer - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Effert S, Heidebuer M, Vodisek M. Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. In: 5th International Conference on Networking (ICN). ; 2006. doi:10.1109/icniconsmcl.2006.182' apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments. 5th International Conference on Networking (ICN). https://doi.org/10.1109/icniconsmcl.2006.182 bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments}, DOI={10.1109/icniconsmcl.2006.182}, booktitle={5th International Conference on Networking (ICN)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}, year={2006} }' chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” In 5th International Conference on Networking (ICN), 2006. https://doi.org/10.1109/icniconsmcl.2006.182. ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments,” 2006, doi: 10.1109/icniconsmcl.2006.182.' mla: Brinkmann, Andre, et al. “Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments.” 5th International Conference on Networking (ICN), 2006, doi:10.1109/icniconsmcl.2006.182. short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 5th International Conference on Networking (ICN), 2006.' date_created: 2020-10-05T08:38:26Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' - _id: '58' doi: 10.1109/icniconsmcl.2006.182 language: - iso: eng publication: 5th International Conference on Networking (ICN) publication_identifier: isbn: - '0769525520' publication_status: published status: public title: Realizing Multilevel Snapshots in Dynamically Changing Virtualized Storage Environments type: conference user_id: '15415' year: '2006' ... --- _id: '19932' abstract: - lang: eng text: '#hniid 2484' author: - first_name: Michael full_name: Kortenjan, Michael last_name: Kortenjan - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker citation: ama: 'Kortenjan M, Schomaker G. Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006). ; 2006. doi:10.1145/1108590.1108608' apa: Kortenjan, M., & Schomaker, G. (2006). Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes. In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006). https://doi.org/10.1145/1108590.1108608 bibtex: '@inproceedings{Kortenjan_Schomaker_2006, title={Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes}, DOI={10.1145/1108590.1108608}, booktitle={4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006)}, author={Kortenjan, Michael and Schomaker, Gunnar}, year={2006} }' chicago: Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” In 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006. https://doi.org/10.1145/1108590.1108608. ieee: M. Kortenjan and G. Schomaker, “Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes,” in 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006. mla: Kortenjan, Michael, and Gunnar Schomaker. “Size Equivalent Cluster Trees (SEC-Trees) Realtime Rendering of Large Industrial Scenes.” 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006, doi:10.1145/1108590.1108608. short: 'M. Kortenjan, G. Schomaker, in: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006), 2006.' date_created: 2020-10-06T13:32:47Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1145/1108590.1108608 language: - iso: eng publication: 4th International Conference on Virtual Reality, Computer Graphics, Visualization and Interaction (Afrigraph 2006) status: public title: Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes type: conference user_id: '15415' year: '2006' ... --- _id: '2029' author: - first_name: Petr full_name: Kolman, Petr last_name: Kolman - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006 apa: Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006 bibtex: '@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20--44} }' chicago: 'Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.' ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006. mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006. short: P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44. date_created: 2018-03-29T12:01:37Z date_updated: 2022-01-06T06:54:25Z department: - _id: '79' doi: 10.1016/j.jalgor.2004.07.006 intvolume: ' 61' issue: '1' page: 20--44 publication: J. Algorithms status: public title: Improved bounds for the unsplittable flow problem type: journal_article user_id: '15504' volume: 61 year: '2006' ... --- _id: '2404' abstract: - lang: eng text: ' In this thesis, we propose to use a reconfigurable processor as main computation element in embedded systems for applications from the multi-media and communications domain. A reconfigurable processor integrates an embedded CPU core with a Reconfigurable Processing Unit (RPU). Many of our target applications require real-time signal-processing of data streams and expose a high computational demand. The key challenge in designing embedded systems for these applications is to find an implementation that satisfies the performance goals and is adaptable to new applications, while the system cost is minimized. Implementations that solely use an embedded CPU are likely to miss the performance goals. Application-Specific Integrated Circuit (ASIC)-based coprocessors can be used for some high-volume products with fixed functions, but fall short for systems with varying applications. We argue that a reconfigurable processor with a coarse-grained, dynamically reconfigurable array of modest size provides an attractive implementation platform for our application domain. The computational intensive application kernels are executed on the RPU, while the remaining parts of the application are executed on the CPU. Reconfigurable hardware allows for implementing application specific coprocessors with a high performance, while the function of the coprocessor can still be adapted due to the programmability. So far, reconfigurable technology is used in embedded systems primarily with static configurations, e.g., for implementing glue-logic, replacing ASICs, and for implementing fixed-function coprocessors. Changing the configuration at runtime enables a number of interesting application modes, e.g., on-demand loading of coprocessors and time-multiplexed execution of coprocessors, which is commonly denoted as hardware virtualization. While the use of static configurations is well understood and supported by design-tools, the role of dynamic reconfiguration is not well investigated yet. Current application specification methods and design-tools do not provide an end-to-end tool-flow that considers dynamic reconfiguration. A key idea of our approach is to reduce system cost by keeping the size of the reconfigurable array small and to use hardware virtualization techniques to compensate for the limited hardware resources. The main contribution of this thesis is the codesign of a reconfigurable processor architecture named ZIPPY, the corresponding hardware and software implementation tools, and an application specification model which explicitly considers hardware virtualization. The ZIPPY architecture is widely parametrized and allows for specifying a whole family of processor architectures. The implementation tools are also parametrized and can target any architectural variant. We evaluate the performance of the architecture with a system-level, cycle-accurate cosimulation framework. This framework enables us to perform design-space exploration for a variety of reconfigurable processor architectures. With two case studies, we demonstrate, that hardware virtualization on the Zippy architecture is feasible and enables us to trade-off performance for area in embedded systems. Finally, we present a novel method for optimal temporal partitioning of sequential circuits, which is an important form of hardware virtualization. The method based on Slowdown and Retiming allows us to decompose any sequential circuit into a number of smaller, communicating subcircuits that can be executed on a dynamically reconfigurable architecture. ' author: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 citation: ama: 'Plessl C. Hardware Virtualization on a Coarse-Grained Reconfigurable Processor. Aachen, Germany: Shaker Verlag; 2006. doi:10.2370/9783832255619' apa: 'Plessl, C. (2006). Hardware virtualization on a coarse-grained reconfigurable processor. Aachen, Germany: Shaker Verlag. https://doi.org/10.2370/9783832255619' bibtex: '@book{Plessl_2006, place={Aachen, Germany}, series={Technische Informatik}, title={Hardware virtualization on a coarse-grained reconfigurable processor}, DOI={10.2370/9783832255619}, publisher={Shaker Verlag}, author={Plessl, Christian}, year={2006}, collection={Technische Informatik} }' chicago: 'Plessl, Christian. Hardware Virtualization on a Coarse-Grained Reconfigurable Processor. Technische Informatik. Aachen, Germany: Shaker Verlag, 2006. https://doi.org/10.2370/9783832255619.' ieee: 'C. Plessl, Hardware virtualization on a coarse-grained reconfigurable processor. Aachen, Germany: Shaker Verlag, 2006.' mla: Plessl, Christian. Hardware Virtualization on a Coarse-Grained Reconfigurable Processor. Shaker Verlag, 2006, doi:10.2370/9783832255619. short: C. Plessl, Hardware Virtualization on a Coarse-Grained Reconfigurable Processor, Shaker Verlag, Aachen, Germany, 2006. date_created: 2018-04-17T13:46:27Z date_updated: 2022-01-06T06:56:06Z department: - _id: '518' doi: 10.2370/9783832255619 keyword: - Zippy place: Aachen, Germany publication_identifier: isbn: - 978-3-8322-5561-3 publisher: Shaker Verlag series_title: Technische Informatik status: public title: Hardware virtualization on a coarse-grained reconfigurable processor type: dissertation user_id: '24135' year: '2006' ... --- _id: '2405' author: - first_name: Sven full_name: Groppe, Sven last_name: Groppe - first_name: Stefan full_name: Böttcher, Stefan last_name: Böttcher - first_name: Georg full_name: Birkenheuer, Georg last_name: Birkenheuer - first_name: André full_name: Höing, André last_name: Höing citation: ama: Groppe S, Böttcher S, Birkenheuer G, Höing A. Reformulating XPath queries and XSLT queries on XSLT views. Data & Knowledge Engineering. 2006;57(1):64-110. doi:10.1016/j.datak.2005.04.002 apa: Groppe, S., Böttcher, S., Birkenheuer, G., & Höing, A. (2006). Reformulating XPath queries and XSLT queries on XSLT views. Data & Knowledge Engineering, 57(1), 64–110. https://doi.org/10.1016/j.datak.2005.04.002 bibtex: '@article{Groppe_Böttcher_Birkenheuer_Höing_2006, title={Reformulating XPath queries and XSLT queries on XSLT views}, volume={57}, DOI={10.1016/j.datak.2005.04.002}, number={1}, journal={Data & Knowledge Engineering}, publisher={Elsevier}, author={Groppe, Sven and Böttcher, Stefan and Birkenheuer, Georg and Höing, André}, year={2006}, pages={64–110} }' chicago: 'Groppe, Sven, Stefan Böttcher, Georg Birkenheuer, and André Höing. “Reformulating XPath Queries and XSLT Queries on XSLT Views.” Data & Knowledge Engineering 57, no. 1 (2006): 64–110. https://doi.org/10.1016/j.datak.2005.04.002.' ieee: S. Groppe, S. Böttcher, G. Birkenheuer, and A. Höing, “Reformulating XPath queries and XSLT queries on XSLT views,” Data & Knowledge Engineering, vol. 57, no. 1, pp. 64–110, 2006. mla: Groppe, Sven, et al. “Reformulating XPath Queries and XSLT Queries on XSLT Views.” Data & Knowledge Engineering, vol. 57, no. 1, Elsevier, 2006, pp. 64–110, doi:10.1016/j.datak.2005.04.002. short: S. Groppe, S. Böttcher, G. Birkenheuer, A. Höing, Data & Knowledge Engineering 57 (2006) 64–110. date_created: 2018-04-17T13:47:44Z date_updated: 2022-01-06T06:56:06Z department: - _id: '27' - _id: '69' doi: 10.1016/j.datak.2005.04.002 intvolume: ' 57' issue: '1' page: 64-110 publication: Data & Knowledge Engineering publisher: Elsevier status: public title: Reformulating XPath queries and XSLT queries on XSLT views type: journal_article user_id: '24135' volume: 57 year: '2006' ... --- _id: '24277' abstract: - lang: eng text: "We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.\r\n\r\nWe provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations." author: - first_name: Jarosław full_name: Kutyłowski, Jarosław last_name: Kutyłowski - first_name: Filip full_name: Zagórski, Filip last_name: Zagórski citation: ama: 'Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37' apa: 'Kutyłowski, J., & Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science. https://doi.org/10.1007/11611257_37' bibtex: '@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={10.1007/11611257_37}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }' chicago: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In SOFSEM 2006: Theory and Practice of Computer Science. Berlin, Heidelberg, 2006. https://doi.org/10.1007/11611257_37.' ieee: 'J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: 10.1007/11611257_37.' mla: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” SOFSEM 2006: Theory and Practice of Computer Science, 2006, doi:10.1007/11611257_37.' short: 'J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.' date_created: 2021-09-13T13:28:29Z date_updated: 2022-01-06T06:56:13Z department: - _id: '63' doi: 10.1007/11611257_37 language: - iso: eng place: Berlin, Heidelberg publication: 'SOFSEM 2006: Theory and Practice of Computer Science' publication_identifier: issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: Reliable Broadcasting Without Collision Detection type: conference user_id: '15415' year: '2006' ... --- _id: '3223' author: - first_name: Ingo full_name: Brückner, Ingo last_name: Brückner - first_name: Björn full_name: Metzler, Björn last_name: Metzler - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Brückner I, Metzler B, Wehrheim H. Optimizing Slicing of Formal Specifications by Deductive Verification. Nord J Comput. 2006;(1-2):22--45. apa: Brückner, I., Metzler, B., & Wehrheim, H. (2006). Optimizing Slicing of Formal Specifications by Deductive Verification. Nord. J. Comput., (1–2), 22--45. bibtex: '@article{Brückner_Metzler_Wehrheim_2006, title={Optimizing Slicing of Formal Specifications by Deductive Verification}, number={1–2}, journal={Nord. J. Comput.}, author={Brückner, Ingo and Metzler, Björn and Wehrheim, Heike}, year={2006}, pages={22--45} }' chicago: 'Brückner, Ingo, Björn Metzler, and Heike Wehrheim. “Optimizing Slicing of Formal Specifications by Deductive Verification.” Nord. J. Comput., no. 1–2 (2006): 22--45.' ieee: I. Brückner, B. Metzler, and H. Wehrheim, “Optimizing Slicing of Formal Specifications by Deductive Verification,” Nord. J. Comput., no. 1–2, pp. 22--45, 2006. mla: Brückner, Ingo, et al. “Optimizing Slicing of Formal Specifications by Deductive Verification.” Nord. J. Comput., no. 1–2, 2006, pp. 22--45. short: I. Brückner, B. Metzler, H. Wehrheim, Nord. J. Comput. (2006) 22--45. date_created: 2018-06-14T06:33:37Z date_updated: 2022-01-06T06:59:05Z department: - _id: '77' issue: 1-2 page: 22--45 publication: Nord. J. Comput. status: public title: Optimizing Slicing of Formal Specifications by Deductive Verification type: journal_article user_id: '29719' year: '2006' ... --- _id: '3224' author: - first_name: John full_name: Derrick, John last_name: Derrick - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Derrick J, Wehrheim H. Model Transformations Incorporating Multiple Views. In: Johnson M, Vene V, eds. Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings. Lecture Notes in Computer Science. ; 2006:111--126. doi:10.1007/11784180_11' apa: Derrick, J., & Wehrheim, H. (2006). Model Transformations Incorporating Multiple Views. In M. Johnson & V. Vene (Eds.), Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings (pp. 111--126). https://doi.org/10.1007/11784180_11 bibtex: '@inproceedings{Derrick_Wehrheim_2006, series={Lecture Notes in Computer Science}, title={Model Transformations Incorporating Multiple Views}, DOI={10.1007/11784180_11}, booktitle={Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings}, author={Derrick, John and Wehrheim, Heike}, editor={Johnson, Michael and Vene, VarmoEditors}, year={2006}, pages={111--126}, collection={Lecture Notes in Computer Science} }' chicago: Derrick, John, and Heike Wehrheim. “Model Transformations Incorporating Multiple Views.” In Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, edited by Michael Johnson and Varmo Vene, 111--126. Lecture Notes in Computer Science, 2006. https://doi.org/10.1007/11784180_11. ieee: J. Derrick and H. Wehrheim, “Model Transformations Incorporating Multiple Views,” in Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, 2006, pp. 111--126. mla: Derrick, John, and Heike Wehrheim. “Model Transformations Incorporating Multiple Views.” Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, edited by Michael Johnson and Varmo Vene, 2006, pp. 111--126, doi:10.1007/11784180_11. short: 'J. Derrick, H. Wehrheim, in: M. Johnson, V. Vene (Eds.), Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings, 2006, pp. 111--126.' date_created: 2018-06-14T06:34:47Z date_updated: 2022-01-06T06:59:05Z department: - _id: '77' doi: 10.1007/11784180_11 editor: - first_name: Michael full_name: Johnson, Michael last_name: Johnson - first_name: Varmo full_name: Vene, Varmo last_name: Vene page: 111--126 publication: Algebraic Methodology and Software Technology, 11th International Conference, {AMAST} 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings series_title: Lecture Notes in Computer Science status: public title: Model Transformations Incorporating Multiple Views type: conference user_id: '29719' year: '2006' ... --- _id: '3225' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wehrheim H. Incremental Slicing. In: Liu Z, He J, eds. Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings. Lecture Notes in Computer Science. ; 2006:514--528. doi:10.1007/11901433_28' apa: Wehrheim, H. (2006). Incremental Slicing. In Z. Liu & J. He (Eds.), Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings (pp. 514--528). https://doi.org/10.1007/11901433_28 bibtex: '@inproceedings{Wehrheim_2006, series={Lecture Notes in Computer Science}, title={Incremental Slicing}, DOI={10.1007/11901433_28}, booktitle={Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings}, author={Wehrheim, Heike}, editor={Liu, Zhiming and He, JifengEditors}, year={2006}, pages={514--528}, collection={Lecture Notes in Computer Science} }' chicago: Wehrheim, Heike. “Incremental Slicing.” In Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings, edited by Zhiming Liu and Jifeng He, 514--528. Lecture Notes in Computer Science, 2006. https://doi.org/10.1007/11901433_28. ieee: H. Wehrheim, “Incremental Slicing,” in Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings, 2006, pp. 514--528. mla: Wehrheim, Heike. “Incremental Slicing.” Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings, edited by Zhiming Liu and Jifeng He, 2006, pp. 514--528, doi:10.1007/11901433_28. short: 'H. Wehrheim, in: Z. Liu, J. He (Eds.), Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings, 2006, pp. 514--528.' date_created: 2018-06-14T06:35:54Z date_updated: 2022-01-06T06:59:05Z department: - _id: '77' doi: 10.1007/11901433_28 editor: - first_name: Zhiming full_name: Liu, Zhiming last_name: Liu - first_name: Jifeng full_name: He, Jifeng last_name: He page: 514--528 publication: Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, {ICFEM} 2006, Macao, China, November 1-3, 2006, Proceedings series_title: Lecture Notes in Computer Science status: public title: Incremental Slicing type: conference user_id: '29719' year: '2006' ... --- _id: '3226' citation: ama: Gorrieri R, Wehrheim H, eds. Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings.; 2006. doi:10.1007/11768869 apa: Gorrieri, R., & Wehrheim, H. (Eds.). (2006). Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings. https://doi.org/10.1007/11768869 bibtex: '@book{Gorrieri_Wehrheim_2006, series={Lecture Notes in Computer Science}, title={Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings}, DOI={10.1007/11768869}, year={2006}, collection={Lecture Notes in Computer Science} }' chicago: Gorrieri, Roberto, and Heike Wehrheim, eds. Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings. Lecture Notes in Computer Science, 2006. https://doi.org/10.1007/11768869. ieee: R. Gorrieri and H. Wehrheim, Eds., Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings. 2006. mla: Gorrieri, Roberto, and Heike Wehrheim, editors. Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings. 2006, doi:10.1007/11768869. short: R. Gorrieri, H. Wehrheim, eds., Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings, 2006. date_created: 2018-06-14T06:37:20Z date_updated: 2022-01-06T06:59:05Z department: - _id: '77' doi: 10.1007/11768869 editor: - first_name: Roberto full_name: Gorrieri, Roberto last_name: Gorrieri - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim publication_identifier: isbn: - 3-540-34893-X series_title: Lecture Notes in Computer Science status: public title: Formal Methods for Open Object-Based Distributed Systems, 8th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2006, Bologna, Italy, June 14-16, 2006, Proceedings type: conference_editor user_id: '29719' year: '2006' ...