---
_id: '18972'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
citation:
ama: Damerow V. Average and Smoothed Complexity of Geometric Structures.
Vol 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.
apa: Damerow, V. (2006). Average and Smoothed Complexity of Geometric Structures
(Vol. 190). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Damerow_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Average and Smoothed Complexity of Geometric Structures}, volume={190},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Damerow,
Valentina}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures.
Vol. 190. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
ieee: V. Damerow, Average and Smoothed Complexity of Geometric Structures,
vol. 190. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
mla: Damerow, Valentina. Average and Smoothed Complexity of Geometric Structures.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
short: V. Damerow, Average and Smoothed Complexity of Geometric Structures, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-09-04T06:47:03Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 190'
language:
- iso: eng
publication_identifier:
isbn:
- 3-939350-09-5
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-2007022210
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: Average and Smoothed Complexity of Geometric Structures
type: dissertation
user_id: '5786'
volume: 190
year: '2006'
...
---
_id: '18999'
abstract:
- lang: eng
text: "We present a web computing library (PUBWCL) in Java that allows to execute
tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style
on PCs distributed over the internet whose owners are willing to donate their
unused computation power. PUBWCL is realized as a peer-to-peer system and features
migration and restoration of BSP processes executed on it. The use of Java guarantees
a high level of security and makes PUBWCL platform- independent. In order to estimate
the loss of efficiency inherent in such a Java-based system, we have compared
it to our C-based PUB-Library.\r\nAs the unused computation power of the participating
PCs is unpredictable, we need novel strategies for load balancing that have no
access to future changes of the computation power available for the application.
We develop, analyze, and compare different load balancing strategies for PUBWCL.
In order to handle the influence of the fluctuating available computation power,
we classify the external work load.\r\nDuring our evaluation of the load balancing
algorithms we simulated the external work load in order to have repeatable testing
conditions. With the best performing load balancing strategy we could save 39%
of the execution time on average and even up to 50% in particular cases, in our
test environment.\r\n"
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
citation:
ama: 'Bonorden O, Meyer auf der Heide F, Gehweiler J. A Web Computing Environment
for Parallel Algorithms in Java. In: Journal on Scalable Computing: Practice
and Experience. ; 2006:1-14.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Gehweiler, J. (2006). A Web Computing
Environment for Parallel Algorithms in Java. In Journal on Scalable Computing:
Practice and Experience (pp. 1–14).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Gehweiler_2006, title={A Web
Computing Environment for Parallel Algorithms in Java}, booktitle={Journal on
Scalable Computing: Practice and Experience}, author={Bonorden, Olaf and Meyer
auf der Heide, Friedhelm and Gehweiler, Joachim}, year={2006}, pages={1–14} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Joachim Gehweiler.
“A Web Computing Environment for Parallel Algorithms in Java.” In Journal on
Scalable Computing: Practice and Experience, 1–14, 2006.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and J. Gehweiler, “A Web Computing Environment
for Parallel Algorithms in Java,” in Journal on Scalable Computing: Practice
and Experience, 2006, pp. 1–14.'
mla: 'Bonorden, Olaf, et al. “A Web Computing Environment for Parallel Algorithms
in Java.” Journal on Scalable Computing: Practice and Experience, 2006,
pp. 1–14.'
short: 'O. Bonorden, F. Meyer auf der Heide, J. Gehweiler, in: Journal on Scalable
Computing: Practice and Experience, 2006, pp. 1–14.'
date_created: 2020-09-04T09:50:01Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
language:
- iso: eng
page: 1-14
publication: 'Journal on Scalable Computing: Practice and Experience'
status: public
title: A Web Computing Environment for Parallel Algorithms in Java
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '19001'
abstract:
- lang: eng
text: "We present a novel architecture for distributed computing in a peer-to-peer
network. In particular, we realize the Paderborn University BSP-based Web Computing
Library (PUBWCL), which formerly used a centralized client-server architecture
for scheduling and load balancing, as a pure peer-to-peer system. Using distributed
heterogeneous hash tables (DHHT), our architecture features scheduling and load
balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous
(BSP) style with a minimal number of migrations.\r\n"
author:
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
citation:
ama: 'Gehweiler J, Schomaker G. Distributed Load Balancing in Heterogeneous Peer-to-Peer
Networks for Web Computing Libraries. In: Proceeedings of 10th IEEE/ACM International
Symposium on Distributed Simulation and Real Time Applications (DS-RT). ;
2006:51-58. doi:10.1109/ds-rt.2006.15'
apa: Gehweiler, J., & Schomaker, G. (2006). Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries. In Proceeedings of 10th
IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
(DS-RT) (pp. 51–58). https://doi.org/10.1109/ds-rt.2006.15
bibtex: '@inproceedings{Gehweiler_Schomaker_2006, title={Distributed Load Balancing
in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries}, DOI={10.1109/ds-rt.2006.15},
booktitle={Proceeedings of 10th IEEE/ACM International Symposium on Distributed
Simulation and Real Time Applications (DS-RT)}, author={Gehweiler, Joachim and
Schomaker, Gunnar}, year={2006}, pages={51–58} }'
chicago: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in
Heterogeneous Peer-to-Peer Networks for Web Computing Libraries.” In Proceeedings
of 10th IEEE/ACM International Symposium on Distributed Simulation and Real Time
Applications (DS-RT), 51–58, 2006. https://doi.org/10.1109/ds-rt.2006.15.
ieee: J. Gehweiler and G. Schomaker, “Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries,” in Proceeedings of 10th
IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
(DS-RT), 2006, pp. 51–58.
mla: Gehweiler, Joachim, and Gunnar Schomaker. “Distributed Load Balancing in Heterogeneous
Peer-to-Peer Networks for Web Computing Libraries.” Proceeedings of 10th IEEE/ACM
International Symposium on Distributed Simulation and Real Time Applications (DS-RT),
2006, pp. 51–58, doi:10.1109/ds-rt.2006.15.
short: 'J. Gehweiler, G. Schomaker, in: Proceeedings of 10th IEEE/ACM International
Symposium on Distributed Simulation and Real Time Applications (DS-RT), 2006,
pp. 51–58.'
date_created: 2020-09-04T09:56:41Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1109/ds-rt.2006.15
language:
- iso: eng
page: 51-58
publication: Proceeedings of 10th IEEE/ACM International Symposium on Distributed
Simulation and Real Time Applications (DS-RT)
publication_identifier:
isbn:
- '0769526977'
publication_status: published
status: public
title: Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing
Libraries
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '23881'
abstract:
- lang: eng
text: Computing a maximum weighted stable set in a bipartite graph is considered
well-solved and usually approached with preflow-push, Ford–Fulkerson or network
simplex algorithms. We present a combinatorial algorithm for the problem that
is not based on flows. Numerical tests suggest that this algorithm performs quite
well in practice and is competitive with flow based algorithms especially in the
case of dense graphs.
author:
- first_name: Ulrich
full_name: Faigle, Ulrich
last_name: Faigle
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: Faigle U, Frahling G. A combinatorial algorithm for weighted stable sets in
bipartite graphs. Discrete Applied Mathematics. 2006:1380-1391. doi:10.1016/j.dam.2005.05.037
apa: Faigle, U., & Frahling, G. (2006). A combinatorial algorithm for weighted
stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391.
https://doi.org/10.1016/j.dam.2005.05.037
bibtex: '@article{Faigle_Frahling_2006, title={A combinatorial algorithm for weighted
stable sets in bipartite graphs}, DOI={10.1016/j.dam.2005.05.037},
journal={Discrete Applied Mathematics}, author={Faigle, Ulrich and Frahling, Gereon},
year={2006}, pages={1380–1391} }'
chicago: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted
Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, 1380–91.
https://doi.org/10.1016/j.dam.2005.05.037.
ieee: U. Faigle and G. Frahling, “A combinatorial algorithm for weighted stable
sets in bipartite graphs,” Discrete Applied Mathematics, pp. 1380–1391,
2006.
mla: Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted
Stable Sets in Bipartite Graphs.” Discrete Applied Mathematics, 2006, pp.
1380–91, doi:10.1016/j.dam.2005.05.037.
short: U. Faigle, G. Frahling, Discrete Applied Mathematics (2006) 1380–1391.
date_created: 2021-09-07T12:54:05Z
date_updated: 2022-01-06T06:56:02Z
department:
- _id: '63'
doi: 10.1016/j.dam.2005.05.037
language:
- iso: eng
page: 1380-1391
publication: Discrete Applied Mathematics
publication_identifier:
issn:
- 0166-218X
publication_status: published
status: public
title: A combinatorial algorithm for weighted stable sets in bipartite graphs
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '23882'
abstract:
- lang: eng
text: In this paper we develop an efficient implementation for a k-means clustering
algorithm. Our algorithm is a variant of KMHybrid [28, 20], i.e. it uses a combination
of Lloyd-steps and random swaps, but as a novel feature it uses coresets to speed
up the algorithm. A coreset is a small weighted set of points that approximates
the original point set with respect to the considered problem. The main strength
of the algorithm is that it can quickly determine clusterings of the same point
set for many values of k. This is necessary in many applications, since, typically,
one does not know a good value for k in advance. Once we have clusterings for
many different values of k we can determine a good choice of k using a quality
measure of clusterings that is independent of k, for example the average silhouette
coefficient. The average silhouette coefficient can be approximated using coresets.To
evaluate the performance of our algorithm we compare it with algorithm KMHybrid
[28] on typical 3D data sets for an image compression application and on artificially
created instances. Our data sets consist of 300,000 to 4.9 million points. We
show that our algorithm significantly outperforms KMHybrid on most of these input
instances. Additionally, the quality of the solutions computed by our algorithm
deviates less than that of KMHybrid.We also computed clusterings and approximate
average silhouette coefficient for k=1,…,100 for our input instances and discuss
the performance of our algorithm in detail.
author:
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Frahling G, Sohler C. A fast k-means implementation using coresets. In: Proceedings
of the Twenty-Second Annual Symposium on Computational Geometry - SCG ’06.
; 2006. doi:10.1145/1137856.1137879'
apa: Frahling, G., & Sohler, C. (2006). A fast k-means implementation using
coresets. In Proceedings of the twenty-second annual symposium on Computational
geometry - SCG ’06. https://doi.org/10.1145/1137856.1137879
bibtex: '@inproceedings{Frahling_Sohler_2006, title={A fast k-means implementation
using coresets}, DOI={10.1145/1137856.1137879},
booktitle={Proceedings of the twenty-second annual symposium on Computational
geometry - SCG ’06}, author={Frahling, Gereon and Sohler, Christian}, year={2006}
}'
chicago: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation
Using Coresets.” In Proceedings of the Twenty-Second Annual Symposium on Computational
Geometry - SCG ’06, 2006. https://doi.org/10.1145/1137856.1137879.
ieee: G. Frahling and C. Sohler, “A fast k-means implementation using coresets,”
in Proceedings of the twenty-second annual symposium on Computational geometry
- SCG ’06, 2006.
mla: Frahling, Gereon, and Christian Sohler. “A Fast K-Means Implementation Using
Coresets.” Proceedings of the Twenty-Second Annual Symposium on Computational
Geometry - SCG ’06, 2006, doi:10.1145/1137856.1137879.
short: 'G. Frahling, C. Sohler, in: Proceedings of the Twenty-Second Annual Symposium
on Computational Geometry - SCG ’06, 2006.'
date_created: 2021-09-07T13:03:31Z
date_updated: 2022-01-06T06:56:02Z
department:
- _id: '63'
doi: 10.1145/1137856.1137879
language:
- iso: eng
publication: Proceedings of the twenty-second annual symposium on Computational geometry -
SCG '06
publication_status: published
status: public
title: A fast k-means implementation using coresets
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '2401'
abstract:
- lang: eng
text: ' This paper presents a novel method for optimal temporal partitioning of
sequential circuits for time-multiplexed reconfigurable architectures. The method
bases on slowdown and retiming and maximizes the circuit''s performance during
execution while restricting the size of the partitions to respect the resource
constraints of the reconfigurable architecture. We provide a mixed integer linear
program (MILP) formulation of the problem, which can be solved exactly. In contrast
to related work, our approach optimizes performance directly, takes structural
modifications of the circuit into account, and is extensible. We present the application
of the new method to temporal partitioning for a coarse-grained reconfigurable
architecture. '
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
citation:
ama: 'Plessl C, Platzner M, Thiele L. Optimal Temporal Partitioning based on Slowdown
and Retiming. In: Proc. Int. Conf. on Field Programmable Technology (ICFPT).
IEEE Computer Society; 2006:345-348. doi:10.1109/FPT.2006.270344'
apa: Plessl, C., Platzner, M., & Thiele, L. (2006). Optimal Temporal Partitioning
based on Slowdown and Retiming. In Proc. Int. Conf. on Field Programmable Technology
(ICFPT) (pp. 345–348). IEEE Computer Society. https://doi.org/10.1109/FPT.2006.270344
bibtex: '@inproceedings{Plessl_Platzner_Thiele_2006, title={Optimal Temporal Partitioning
based on Slowdown and Retiming}, DOI={10.1109/FPT.2006.270344},
booktitle={Proc. Int. Conf. on Field Programmable Technology (ICFPT)}, publisher={IEEE
Computer Society}, author={Plessl, Christian and Platzner, Marco and Thiele, Lothar},
year={2006}, pages={345–348} }'
chicago: Plessl, Christian, Marco Platzner, and Lothar Thiele. “Optimal Temporal
Partitioning Based on Slowdown and Retiming.” In Proc. Int. Conf. on Field
Programmable Technology (ICFPT), 345–48. IEEE Computer Society, 2006. https://doi.org/10.1109/FPT.2006.270344.
ieee: C. Plessl, M. Platzner, and L. Thiele, “Optimal Temporal Partitioning based
on Slowdown and Retiming,” in Proc. Int. Conf. on Field Programmable Technology
(ICFPT), 2006, pp. 345–348.
mla: Plessl, Christian, et al. “Optimal Temporal Partitioning Based on Slowdown
and Retiming.” Proc. Int. Conf. on Field Programmable Technology (ICFPT),
IEEE Computer Society, 2006, pp. 345–48, doi:10.1109/FPT.2006.270344.
short: 'C. Plessl, M. Platzner, L. Thiele, in: Proc. Int. Conf. on Field Programmable
Technology (ICFPT), IEEE Computer Society, 2006, pp. 345–348.'
date_created: 2018-04-17T13:43:21Z
date_updated: 2022-01-06T06:56:05Z
department:
- _id: '518'
- _id: '78'
doi: 10.1109/FPT.2006.270344
keyword:
- temporal partitioning
- retiming
- ILP
page: 345-348
publication: Proc. Int. Conf. on Field Programmable Technology (ICFPT)
publisher: IEEE Computer Society
status: public
title: Optimal Temporal Partitioning based on Slowdown and Retiming
type: conference
user_id: '24135'
year: '2006'
...
---
_id: '2043'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of
Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2006). The Effect of Faults on Network Expansion. Theory Comput. Syst.,
(6), 903--928. https://doi.org/10.1007/s00224-006-1349-0
bibtex: '@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The
Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0},
number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava,
Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006},
pages={903--928} }'
chicago: 'Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput.
Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0.'
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp.
903--928, 2006.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory
Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
short: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory
Comput. Syst. (2006) 903--928.
date_created: 2018-03-29T12:32:54Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
doi: 10.1007/s00224-006-1349-0
issue: '6'
page: 903--928
publication: Theory Comput. Syst.
status: public
title: The Effect of Faults on Network Expansion
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '20436'
author:
- first_name: Heiko
full_name: Hamann, Heiko
last_name: Hamann
citation:
ama: Hamann H. Modeling and Investigation of Robot Swarms.; 2006.
apa: Hamann, H. (2006). Modeling and Investigation of Robot Swarms.
bibtex: '@book{Hamann_2006, title={Modeling and Investigation of Robot Swarms},
author={Hamann, Heiko}, year={2006} }'
chicago: Hamann, Heiko. Modeling and Investigation of Robot Swarms, 2006.
ieee: H. Hamann, Modeling and Investigation of Robot Swarms. 2006.
mla: Hamann, Heiko. Modeling and Investigation of Robot Swarms. 2006.
short: H. Hamann, Modeling and Investigation of Robot Swarms, 2006.
date_created: 2020-11-19T12:18:36Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
status: public
title: Modeling and Investigation of Robot Swarms
type: mastersthesis
user_id: '15415'
year: '2006'
...
---
_id: '17979'
author:
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Schindelhauer C, Volbert K, Ziegler M. Geometric spanners with applications
in wireless networks. Computational Geometry. 2006:197-214. doi:10.1016/j.comgeo.2006.02.001
apa: Schindelhauer, C., Volbert, K., & Ziegler, M. (2006). Geometric spanners
with applications in wireless networks. Computational Geometry, 197–214.
https://doi.org/10.1016/j.comgeo.2006.02.001
bibtex: '@article{Schindelhauer_Volbert_Ziegler_2006, title={Geometric spanners
with applications in wireless networks}, DOI={10.1016/j.comgeo.2006.02.001},
journal={Computational Geometry}, author={Schindelhauer, Christian and Volbert,
Klaus and Ziegler, Martin}, year={2006}, pages={197–214} }'
chicago: Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Geometric
Spanners with Applications in Wireless Networks.” Computational Geometry,
2006, 197–214. https://doi.org/10.1016/j.comgeo.2006.02.001.
ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Geometric spanners with applications
in wireless networks,” Computational Geometry, pp. 197–214, 2006.
mla: Schindelhauer, Christian, et al. “Geometric Spanners with Applications in Wireless
Networks.” Computational Geometry, 2006, pp. 197–214, doi:10.1016/j.comgeo.2006.02.001.
short: C. Schindelhauer, K. Volbert, M. Ziegler, Computational Geometry (2006) 197–214.
date_created: 2020-08-14T13:26:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.comgeo.2006.02.001
language:
- iso: eng
page: 197-214
publication: Computational Geometry
publication_identifier:
issn:
- 0925-7721
publication_status: published
status: public
title: Geometric spanners with applications in wireless networks
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '17985'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Effectively open real functions. Journal of Complexity. 2006:827-849.
doi:10.1016/j.jco.2006.05.002
apa: Ziegler, M. (2006). Effectively open real functions. Journal of Complexity,
827–849. https://doi.org/10.1016/j.jco.2006.05.002
bibtex: '@article{Ziegler_2006, title={Effectively open real functions}, DOI={10.1016/j.jco.2006.05.002},
journal={Journal of Complexity}, author={Ziegler, Martin}, year={2006}, pages={827–849}
}'
chicago: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity,
2006, 827–49. https://doi.org/10.1016/j.jco.2006.05.002.
ieee: M. Ziegler, “Effectively open real functions,” Journal of Complexity,
pp. 827–849, 2006.
mla: Ziegler, Martin. “Effectively Open Real Functions.” Journal of Complexity,
2006, pp. 827–49, doi:10.1016/j.jco.2006.05.002.
short: M. Ziegler, Journal of Complexity (2006) 827–849.
date_created: 2020-08-14T13:40:13Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.jco.2006.05.002
language:
- iso: eng
page: 827-849
publication: Journal of Complexity
publication_identifier:
issn:
- 0885-064X
publication_status: published
status: public
title: Effectively open real functions
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '17987'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: Logical
Approaches to Computational Barriers. Berlin, Heidelberg; 2006. doi:10.1007/11780342_39'
apa: Meer, K., & Ziegler, M. (2006). Uncomputability Below the Real Halting
Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg.
https://doi.org/10.1007/11780342_39
bibtex: '@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability
Below the Real Halting Problem}, DOI={10.1007/11780342_39},
booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus
and Ziegler, Martin}, year={2006} }'
chicago: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting
Problem.” In Logical Approaches to Computational Barriers. Berlin, Heidelberg,
2006. https://doi.org/10.1007/11780342_39.
ieee: K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,”
in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.
mla: Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”
Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39.
short: 'K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin,
Heidelberg, 2006.'
date_created: 2020-08-14T13:43:09Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/11780342_39
language:
- iso: eng
place: Berlin, Heidelberg
publication: Logical Approaches to Computational Barriers
publication_identifier:
isbn:
- '9783540354666'
- '9783540354680'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Uncomputability Below the Real Halting Problem
type: book_chapter
user_id: '15415'
year: '2006'
...
---
_id: '18351'
abstract:
- lang: eng
text: In this paper the ideas of a new research project are presented. The material
flow simu- lator d3FACT insight shall manage multiple parallel and time synchronous
simulations to grand the power of real-time visualization in combination with
statistical analysis. This research is issued to overcome the conflict of simulation
run repetition for a good statistical basis and real-time immersive visualization.
A side effect will be the reduc- tion of time needed for simulation experiments.
The planned simulation tool has the feature of triggered cloning, i.e., the user
can decide during runtime to clone a set of simulations after changing parameters
to preserve the original system. The simulations will be aggregated by visualization
and statistics. The rendering is planned to overlay several simulations using
effects like inking and transparency. Simulation data will be aggregated with
statistical functions and diagrams.
author:
- first_name: 'Wilhelm '
full_name: 'Dangelmaier, Wilhelm '
last_name: Dangelmaier
- first_name: 'Daniel '
full_name: 'Huber, Daniel '
last_name: Huber
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Mark
full_name: Aufenanger, Mark
last_name: Aufenanger
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Michael
full_name: Kortenjan, Michael
last_name: Kortenjan
citation:
ama: 'Dangelmaier W, Huber D, Laroque C, et al. d3FACT insight goes parallel
- Aggregation of multiple simulations. In: Simulation and Visualization 2006
(SimViS). SCS European Publishing House; 2006:79-88.'
apa: Dangelmaier, W., Huber, D., Laroque, C., Aufenanger, M., Fischer, M., Krokowski,
J., & Kortenjan, M. (2006). d3FACT insight goes parallel - Aggregation
of multiple simulations. In Simulation and Visualization 2006 (SimViS)
(pp. 79–88). SCS European Publishing House.
bibtex: '@inproceedings{Dangelmaier_Huber_Laroque_Aufenanger_Fischer_Krokowski_Kortenjan_2006,
title={d3FACT insight goes parallel - Aggregation of multiple simulations},
booktitle={Simulation and Visualization 2006 (SimViS)}, publisher={SCS European
Publishing House}, author={Dangelmaier, Wilhelm and Huber, Daniel and Laroque,
Christoph and Aufenanger, Mark and Fischer, Matthias and Krokowski, Jens and
Kortenjan, Michael}, year={2006}, pages={79–88} }'
chicago: Dangelmaier, Wilhelm , Daniel Huber, Christoph Laroque, Mark Aufenanger,
Matthias Fischer, Jens Krokowski, and Michael Kortenjan. “D3FACT Insight
Goes Parallel - Aggregation of Multiple Simulations.” In Simulation and Visualization
2006 (SimViS), 79–88. SCS European Publishing House, 2006.
ieee: W. Dangelmaier et al., “d3FACT insight goes parallel - Aggregation
of multiple simulations,” in Simulation and Visualization 2006 (SimViS),
2006, pp. 79–88.
mla: Dangelmaier, Wilhelm, et al. “D3FACT Insight Goes Parallel - Aggregation
of Multiple Simulations.” Simulation and Visualization 2006 (SimViS), SCS
European Publishing House, 2006, pp. 79–88.
short: 'W. Dangelmaier, D. Huber, C. Laroque, M. Aufenanger, M. Fischer, J. Krokowski,
M. Kortenjan, in: Simulation and Visualization 2006 (SimViS), SCS European Publishing
House, 2006, pp. 79–88.'
date_created: 2020-08-26T09:48:35Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
language:
- iso: eng
page: 79-88
publication: Simulation and Visualization 2006 (SimViS)
publisher: SCS European Publishing House
status: public
title: d³FACT insight goes parallel - Aggregation of multiple simulations
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18672'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Sublinear-time Algorithms. EATCS Bulletin. 2006;(89):23--47.
apa: Sohler, C., & Czumaj, A. (2006). Sublinear-time Algorithms. EATCS Bulletin,
(89), 23--47.
bibtex: '@article{Sohler_Czumaj_2006, title={Sublinear-time Algorithms}, number={89},
journal={EATCS Bulletin}, author={Sohler, Christian and Czumaj, Artur}, year={2006},
pages={23--47} }'
chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS
Bulletin, no. 89 (2006): 23--47.'
ieee: C. Sohler and A. Czumaj, “Sublinear-time Algorithms,” EATCS Bulletin,
no. 89, pp. 23--47, 2006.
mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Algorithms.” EATCS
Bulletin, no. 89, 2006, pp. 23--47.
short: C. Sohler, A. Czumaj, EATCS Bulletin (2006) 23--47.
date_created: 2020-08-31T08:18:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
issue: '89'
language:
- iso: eng
page: 23--47
publication: EATCS Bulletin
status: public
title: Sublinear-time Algorithms
type: journal_article
user_id: '15415'
year: '2006'
...
---
_id: '2213'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Towards a paradigm for robust distributed algorithms and data
structures. In: 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing. ; 2006.'
apa: Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms
and data structures. In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing.
bibtex: '@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed
algorithms and data structures}, booktitle={6th International HNI Symposium on
New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian},
year={2006} }'
chicago: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
ieee: C. Scheideler, “Towards a paradigm for robust distributed algorithms and data
structures,” in 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing, 2006.
mla: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
short: 'C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.'
date_created: 2018-04-05T07:06:44Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:59:14Z
date_updated: 2018-04-13T09:59:14Z
file_id: '2336'
file_name: HNI-Symposium-06.pdf
file_size: 85116
relation: main_file
file_date_updated: 2018-04-13T09:59:14Z
has_accepted_license: '1'
oa: '1'
publication: 6th International HNI Symposium on New Trends in Parallel and Distributed
Computing
status: public
title: Towards a paradigm for robust distributed algorithms and data structures
type: conference
urn: '22137'
user_id: '15504'
year: '2006'
...
---
_id: '21777'
author:
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
- first_name: Frank
full_name: Goetz, Frank
last_name: Goetz
citation:
ama: 'Domik G, Goetz F. A Breadth-First Approach for Teaching Computer Graphics.
In: Brown J, Hansmann W, eds. EG Education Papers. The Eurographics Association;
2006:1-5. doi:10.2312/eged.20061001'
apa: Domik, G., & Goetz, F. (2006). A Breadth-First Approach for Teaching Computer
Graphics. In J. Brown & W. Hansmann (Eds.), EG Education Papers (pp.
1–5). The Eurographics Association. https://doi.org/10.2312/eged.20061001
bibtex: '@inproceedings{Domik_Goetz_2006, title={A Breadth-First Approach for Teaching
Computer Graphics}, DOI={10.2312/eged.20061001},
booktitle={EG Education Papers}, publisher={The Eurographics Association}, author={Domik,
Gitta and Goetz, Frank}, editor={Brown, Judy and Hansmann, WernerEditors}, year={2006},
pages={1–5} }'
chicago: Domik, Gitta, and Frank Goetz. “A Breadth-First Approach for Teaching Computer
Graphics.” In EG Education Papers, edited by Judy Brown and Werner Hansmann,
1–5. The Eurographics Association, 2006. https://doi.org/10.2312/eged.20061001.
ieee: G. Domik and F. Goetz, “A Breadth-First Approach for Teaching Computer Graphics,”
in EG Education Papers, 2006, pp. 1–5.
mla: Domik, Gitta, and Frank Goetz. “A Breadth-First Approach for Teaching Computer
Graphics.” EG Education Papers, edited by Judy Brown and Werner Hansmann,
The Eurographics Association, 2006, pp. 1–5, doi:10.2312/eged.20061001.
short: 'G. Domik, F. Goetz, in: J. Brown, W. Hansmann (Eds.), EG Education Papers,
The Eurographics Association, 2006, pp. 1–5.'
date_created: 2021-04-25T17:19:42Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '65'
doi: 10.2312/eged.20061001
editor:
- first_name: Judy
full_name: Brown, Judy
last_name: Brown
- first_name: Werner
full_name: Hansmann, Werner
last_name: Hansmann
language:
- iso: eng
page: 1-5
publication: EG Education Papers
publisher: The Eurographics Association
status: public
title: A Breadth-First Approach for Teaching Computer Graphics
type: conference
user_id: '14955'
year: '2006'
...
---
_id: '21778'
author:
- first_name: Frank
full_name: Goetz, Frank
last_name: Goetz
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
citation:
ama: 'Goetz F, Domik G. Visual Shaditor: A Seamless Way to Compose High-Level Shader
Programs. In: ACM SIGGRAPH 2006 Research Posters. SIGGRAPH ’06. New York,
NY, USA: Association for Computing Machinery; 2006:51–es. doi:10.1145/1179622.1179681'
apa: 'Goetz, F., & Domik, G. (2006). Visual Shaditor: A Seamless Way to Compose
High-Level Shader Programs. In ACM SIGGRAPH 2006 Research Posters (pp.
51–es). New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/1179622.1179681'
bibtex: '@inproceedings{Goetz_Domik_2006, place={New York, NY, USA}, series={SIGGRAPH
’06}, title={Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs},
DOI={10.1145/1179622.1179681},
booktitle={ACM SIGGRAPH 2006 Research Posters}, publisher={Association for Computing
Machinery}, author={Goetz, Frank and Domik, Gitta}, year={2006}, pages={51–es},
collection={SIGGRAPH ’06} }'
chicago: 'Goetz, Frank, and Gitta Domik. “Visual Shaditor: A Seamless Way to Compose
High-Level Shader Programs.” In ACM SIGGRAPH 2006 Research Posters, 51–es.
SIGGRAPH ’06. New York, NY, USA: Association for Computing Machinery, 2006. https://doi.org/10.1145/1179622.1179681.'
ieee: 'F. Goetz and G. Domik, “Visual Shaditor: A Seamless Way to Compose High-Level
Shader Programs,” in ACM SIGGRAPH 2006 Research Posters, 2006, pp. 51–es.'
mla: 'Goetz, Frank, and Gitta Domik. “Visual Shaditor: A Seamless Way to Compose
High-Level Shader Programs.” ACM SIGGRAPH 2006 Research Posters, Association
for Computing Machinery, 2006, pp. 51–es, doi:10.1145/1179622.1179681.'
short: 'F. Goetz, G. Domik, in: ACM SIGGRAPH 2006 Research Posters, Association
for Computing Machinery, New York, NY, USA, 2006, pp. 51–es.'
date_created: 2021-04-25T17:19:43Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '65'
doi: 10.1145/1179622.1179681
language:
- iso: eng
page: 51–es
place: New York, NY, USA
publication: ACM SIGGRAPH 2006 Research Posters
publication_identifier:
isbn:
- '1595933646'
publisher: Association for Computing Machinery
series_title: SIGGRAPH '06
status: public
title: 'Visual Shaditor: A Seamless Way to Compose High-Level Shader Programs'
type: conference
user_id: '14955'
year: '2006'
...
---
_id: '7780'
citation:
ama: Pleuß A, Van den Bergh J, Hußmann H, Sauer S, Bödcher A, eds. Proceedings
of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite
of the MoDELS 2006 Conference. Vol 214. CEUR-WS.org; 2006.
apa: Pleuß, A., Van den Bergh, J., Hußmann, H., Sauer, S., & Bödcher, A. (Eds.).
(2006). Proceedings of the Workshop on Model Driven Development of Advanced
User Interfaces, satellite of the MoDELS 2006 conference (Vol. 214). CEUR-WS.org.
bibtex: '@book{Pleuß_Van den Bergh_Hußmann_Sauer_Bödcher_2006, series={CEUR Workshop
Proceedings}, title={Proceedings of the Workshop on Model Driven Development of
Advanced User Interfaces, satellite of the MoDELS 2006 conference}, volume={214},
publisher={CEUR-WS.org}, year={2006}, collection={CEUR Workshop Proceedings} }'
chicago: Pleuß, Andreas, Jan Van den Bergh, Heinrich Hußmann, Stefan Sauer, and
Alexander Bödcher, eds. Proceedings of the Workshop on Model Driven Development
of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference. Vol.
214. CEUR Workshop Proceedings. CEUR-WS.org, 2006.
ieee: A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, and A. Bödcher, Eds., Proceedings
of the Workshop on Model Driven Development of Advanced User Interfaces, satellite
of the MoDELS 2006 conference, vol. 214. CEUR-WS.org, 2006.
mla: Pleuß, Andreas, et al., editors. Proceedings of the Workshop on Model Driven
Development of Advanced User Interfaces, Satellite of the MoDELS 2006 Conference.
Vol. 214, CEUR-WS.org, 2006.
short: A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, A. Bödcher, eds., Proceedings
of the Workshop on Model Driven Development of Advanced User Interfaces, Satellite
of the MoDELS 2006 Conference, CEUR-WS.org, 2006.
date_created: 2019-02-19T18:41:21Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Andreas
full_name: Pleuß, Andreas
last_name: Pleuß
- first_name: Jan
full_name: Van den Bergh, Jan
last_name: Van den Bergh
- first_name: Heinrich
full_name: Hußmann, Heinrich
last_name: Hußmann
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Alexander
full_name: Bödcher, Alexander
last_name: Bödcher
intvolume: ' 214'
language:
- iso: eng
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Proceedings of the Workshop on Model Driven Development of Advanced User Interfaces,
satellite of the MoDELS 2006 conference
type: conference_editor
user_id: '52534'
volume: 214
year: '2006'
...
---
_id: '7947'
author:
- first_name: Christoph
full_name: Loeser, Christoph
last_name: Loeser
- first_name: Gunnar
full_name: Schomaker, Gunnar
last_name: Schomaker
- first_name: Matthias
full_name: Schubert, Matthias
last_name: Schubert
- first_name: Tim
full_name: Schattkowsky, Tim
last_name: Schattkowsky
citation:
ama: 'Loeser C, Schomaker G, Schubert M, Schattkowsky T. Fairness Considerations
in Replication and Placement Strategies for large Documents in heterogeneous Content
Delivery Networks. In: Proceedings of the 5th International Conference on Networking
(ICN 2006), Morne (Mauritius). Washington, DC, USA: IEEE Computer Society;
2006:105. doi:http://dx.doi.org/10.1109/ICNICONSMCL.2006.96'
apa: 'Loeser, C., Schomaker, G., Schubert, M., & Schattkowsky, T. (2006). Fairness
Considerations in Replication and Placement Strategies for large Documents in
heterogeneous Content Delivery Networks. In Proceedings of the 5th International
Conference on Networking (ICN 2006), Morne (Mauritius) (p. 105). Washington,
DC, USA: IEEE Computer Society. http://dx.doi.org/10.1109/ICNICONSMCL.2006.96'
bibtex: '@inproceedings{Loeser_Schomaker_Schubert_Schattkowsky_2006, place={Washington,
DC, USA}, title={Fairness Considerations in Replication and Placement Strategies
for large Documents in heterogeneous Content Delivery Networks}, DOI={http://dx.doi.org/10.1109/ICNICONSMCL.2006.96},
booktitle={Proceedings of the 5th International Conference on Networking (ICN
2006), Morne (Mauritius)}, publisher={IEEE Computer Society}, author={Loeser,
Christoph and Schomaker, Gunnar and Schubert, Matthias and Schattkowsky, Tim},
year={2006}, pages={105} }'
chicago: 'Loeser, Christoph, Gunnar Schomaker, Matthias Schubert, and Tim Schattkowsky.
“Fairness Considerations in Replication and Placement Strategies for Large Documents
in Heterogeneous Content Delivery Networks.” In Proceedings of the 5th International
Conference on Networking (ICN 2006), Morne (Mauritius), 105. Washington, DC,
USA: IEEE Computer Society, 2006. http://dx.doi.org/10.1109/ICNICONSMCL.2006.96.'
ieee: C. Loeser, G. Schomaker, M. Schubert, and T. Schattkowsky, “Fairness Considerations
in Replication and Placement Strategies for large Documents in heterogeneous Content
Delivery Networks,” in Proceedings of the 5th International Conference on Networking
(ICN 2006), Morne (Mauritius), 2006, p. 105.
mla: Loeser, Christoph, et al. “Fairness Considerations in Replication and Placement
Strategies for Large Documents in Heterogeneous Content Delivery Networks.” Proceedings
of the 5th International Conference on Networking (ICN 2006), Morne (Mauritius),
IEEE Computer Society, 2006, p. 105, doi:http://dx.doi.org/10.1109/ICNICONSMCL.2006.96.
short: 'C. Loeser, G. Schomaker, M. Schubert, T. Schattkowsky, in: Proceedings of
the 5th International Conference on Networking (ICN 2006), Morne (Mauritius),
IEEE Computer Society, Washington, DC, USA, 2006, p. 105.'
date_created: 2019-02-21T11:40:26Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1109/ICNICONSMCL.2006.96
language:
- iso: eng
page: '105'
place: Washington, DC, USA
publication: Proceedings of the 5th International Conference on Networking (ICN 2006),
Morne (Mauritius)
publisher: IEEE Computer Society
status: public
title: Fairness Considerations in Replication and Placement Strategies for large Documents
in heterogeneous Content Delivery Networks
type: conference
user_id: '52534'
year: '2006'
...
---
_id: '7948'
author:
- first_name: Tim
full_name: Schattkowsky, Tim
last_name: Schattkowsky
- first_name: Alexander
full_name: Förster, Alexander
last_name: Förster
- first_name: Christoph
full_name: Loeser, Christoph
last_name: Loeser
citation:
ama: 'Schattkowsky T, Förster A, Loeser C. Secure Storage for Physically Exposed
Web- and Application Servers. In: Proceedings of the 5th International Conference
on Networking (ICN 2006), Morne (Mauritius). Washington, DC, USA: IEEE Computer
Society; 2006:86.'
apa: 'Schattkowsky, T., Förster, A., & Loeser, C. (2006). Secure Storage for
Physically Exposed Web- and Application Servers. In Proceedings of the 5th
International Conference on Networking (ICN 2006), Morne (Mauritius) (p. 86).
Washington, DC, USA: IEEE Computer Society.'
bibtex: '@inproceedings{Schattkowsky_Förster_Loeser_2006, place={Washington, DC,
USA}, title={Secure Storage for Physically Exposed Web- and Application Servers},
booktitle={Proceedings of the 5th International Conference on Networking (ICN
2006), Morne (Mauritius)}, publisher={IEEE Computer Society}, author={Schattkowsky,
Tim and Förster, Alexander and Loeser, Christoph}, year={2006}, pages={86} }'
chicago: 'Schattkowsky, Tim, Alexander Förster, and Christoph Loeser. “Secure Storage
for Physically Exposed Web- and Application Servers.” In Proceedings of the
5th International Conference on Networking (ICN 2006), Morne (Mauritius),
86. Washington, DC, USA: IEEE Computer Society, 2006.'
ieee: T. Schattkowsky, A. Förster, and C. Loeser, “Secure Storage for Physically
Exposed Web- and Application Servers,” in Proceedings of the 5th International
Conference on Networking (ICN 2006), Morne (Mauritius), 2006, p. 86.
mla: Schattkowsky, Tim, et al. “Secure Storage for Physically Exposed Web- and Application
Servers.” Proceedings of the 5th International Conference on Networking (ICN
2006), Morne (Mauritius), IEEE Computer Society, 2006, p. 86.
short: 'T. Schattkowsky, A. Förster, C. Loeser, in: Proceedings of the 5th International
Conference on Networking (ICN 2006), Morne (Mauritius), IEEE Computer Society,
Washington, DC, USA, 2006, p. 86.'
date_created: 2019-02-21T11:40:28Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
language:
- iso: eng
page: '86'
place: Washington, DC, USA
publication: Proceedings of the 5th International Conference on Networking (ICN 2006),
Morne (Mauritius)
publisher: IEEE Computer Society
status: public
title: Secure Storage for Physically Exposed Web- and Application Servers
type: conference
user_id: '52534'
year: '2006'
...
---
_id: '7949'
author:
- first_name: Tim
full_name: Schattkowsky, Tim
last_name: Schattkowsky
- first_name: Jan
full_name: Hendrik Hausmann, Jan
last_name: Hendrik Hausmann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Schattkowsky T, Hendrik Hausmann J, Engels G. Using UML Activities for System-on-Chip
Design and Synthesis. In: Proceedings of the International Conference on Model
Driven Engineering Languages and Systems (MoDELS 2006), Genova (Italy). Vol
4199/2006. LNCS. Berlin/Heidelberg: Springer; 2006:737-752. doi:dx.doi.org/10.1007/11880240_51'
apa: 'Schattkowsky, T., Hendrik Hausmann, J., & Engels, G. (2006). Using UML
Activities for System-on-Chip Design and Synthesis. In Proceedings of the International
Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova
(Italy) (Vol. 4199/2006, pp. 737–752). Berlin/Heidelberg: Springer. https://doi.org/dx.doi.org/10.1007/11880240_51'
bibtex: '@inproceedings{Schattkowsky_Hendrik Hausmann_Engels_2006, place={Berlin/Heidelberg},
series={LNCS}, title={Using UML Activities for System-on-Chip Design and Synthesis},
volume={4199/2006}, DOI={dx.doi.org/10.1007/11880240_51},
booktitle={Proceedings of the International Conference on Model Driven Engineering
Languages and Systems (MoDELS 2006), Genova (Italy)}, publisher={Springer}, author={Schattkowsky,
Tim and Hendrik Hausmann, Jan and Engels, Gregor}, year={2006}, pages={737–752},
collection={LNCS} }'
chicago: 'Schattkowsky, Tim, Jan Hendrik Hausmann, and Gregor Engels. “Using UML
Activities for System-on-Chip Design and Synthesis.” In Proceedings of the
International Conference on Model Driven Engineering Languages and Systems (MoDELS
2006), Genova (Italy), 4199/2006:737–52. LNCS. Berlin/Heidelberg: Springer,
2006. https://doi.org/dx.doi.org/10.1007/11880240_51.'
ieee: T. Schattkowsky, J. Hendrik Hausmann, and G. Engels, “Using UML Activities
for System-on-Chip Design and Synthesis,” in Proceedings of the International
Conference on Model Driven Engineering Languages and Systems (MoDELS 2006), Genova
(Italy), 2006, vol. 4199/2006, pp. 737–752.
mla: Schattkowsky, Tim, et al. “Using UML Activities for System-on-Chip Design and
Synthesis.” Proceedings of the International Conference on Model Driven Engineering
Languages and Systems (MoDELS 2006), Genova (Italy), vol. 4199/2006, Springer,
2006, pp. 737–52, doi:dx.doi.org/10.1007/11880240_51.
short: 'T. Schattkowsky, J. Hendrik Hausmann, G. Engels, in: Proceedings of the
International Conference on Model Driven Engineering Languages and Systems (MoDELS
2006), Genova (Italy), Springer, Berlin/Heidelberg, 2006, pp. 737–752.'
date_created: 2019-02-21T11:40:29Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
doi: dx.doi.org/10.1007/11880240_51
language:
- iso: eng
page: 737-752
place: Berlin/Heidelberg
publication: Proceedings of the International Conference on Model Driven Engineering
Languages and Systems (MoDELS 2006), Genova (Italy)
publisher: Springer
series_title: LNCS
status: public
title: Using UML Activities for System-on-Chip Design and Synthesis
type: conference
user_id: '52534'
volume: 4199/2006
year: '2006'
...