---
_id: '3003'
abstract:
- lang: eng
text: We give a brief introduction to probabilistic encryptions. This serves as
an example how randomness plays a pivotal role in cryptographic systems that satisfy
advanced security concepts.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: Blömer J. Randomness and Secrecy - A Brief Introduction. Journal of Universal
Computer Science (JUCS). 2006;(6):654--671. doi:10.3217/jucs-012-06-0654
apa: Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal
of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654
bibtex: '@article{Blömer_2006, title={Randomness and Secrecy - A Brief Introduction},
DOI={10.3217/jucs-012-06-0654},
number={6}, journal={Journal of Universal Computer Science (J.UCS)}, author={Blömer,
Johannes}, year={2006}, pages={654--671} }'
chicago: 'Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal
of Universal Computer Science (J.UCS), no. 6 (2006): 654--671. https://doi.org/10.3217/jucs-012-06-0654.'
ieee: J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of
Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
mla: Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal
of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.
short: J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.
date_created: 2018-06-05T08:13:39Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.3217/jucs-012-06-0654
issue: '6'
page: 654--671
publication: Journal of Universal Computer Science (J.UCS)
publication_status: published
status: public
title: Randomness and Secrecy - A Brief Introduction
type: journal_article
user_id: '25078'
year: '2006'
...
---
_id: '3004'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg;
2006:106-120. doi:10.1007/11889700_11'
apa: 'Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES.
In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11'
bibtex: '@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based
Collision Attacks on AES}, DOI={10.1007/11889700_11},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }'
chicago: 'Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on
AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.'
ieee: 'J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture
Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg,
2006, pp. 106–120.'
mla: Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp.
106–20, doi:10.1007/11889700_11.
short: 'J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.'
date_created: 2018-06-05T08:14:42Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_11
page: 106-120
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540462507'
- '9783540462514'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Collision Attacks on AES
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3005'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Martin
full_name: Otto, Martin
last_name: Otto
citation:
ama: 'Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.
In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2006:13-23. doi:10.1007/11889700_2'
apa: 'Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm
Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2'
bibtex: '@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack
on a Secure CRT-RSA Algorithm Reconsidered}, DOI={10.1007/11889700_2},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }'
chicago: 'Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA
Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.'
ieee: 'J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,”
in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin
Heidelberg, 2006, pp. 13–23.'
mla: Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm
Reconsidered.” Lecture Notes in Computer Science, Springer Berlin Heidelberg,
2006, pp. 13–23, doi:10.1007/11889700_2.
short: 'J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.'
date_created: 2018-06-05T08:15:48Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_2
page: 13-23
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540462507'
- '9783540462514'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3007'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Martin
full_name: Otto, Martin
last_name: Otto
- first_name: Jean-Pierre
full_name: Seifert, Jean-Pierre
last_name: Seifert
citation:
ama: 'Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve
Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4'
apa: 'Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks
on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp.
36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4'
bibtex: '@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign
Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={10.1007/11889700_4},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006},
pages={36–52} }'
chicago: 'Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault
Attacks on Elliptic Curve Cryptosystems.” In Lecture Notes in Computer Science,
36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_4.'
ieee: 'J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic
Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2006, pp. 36–52.'
mla: Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp.
36–52, doi:10.1007/11889700_4.
short: 'J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science,
Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.'
date_created: 2018-06-05T08:17:12Z
date_updated: 2022-01-06T06:58:50Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/11889700_4
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:18:56Z
date_updated: 2018-06-05T08:18:56Z
file_id: '3009'
file_name: SignChangeFaultAttacksOnECC.pdf
file_size: 259146
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:18:56Z
has_accepted_license: '1'
page: 36-52
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540462507'
- '9783540462514'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Sign Change Fault Attacks on Elliptic Curve Cryptosystems
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '26988'
abstract:
- lang: eng
text: For most of today's IT environments, the tremendous need for storage capacity
in combination with a required minimum I/O performance has become highly critical.
In dynamically growing environments, a storage management solution's underlying
data distribution scheme has great impact to the overall system I/O performance.
The evaluation of a number of open system storage visualization solutions and
volume managers has shown that all of them lack the ability to automatically adapt
to changing access patterns and storage infrastructures; many of them require
an error prone manual re-layout of the data blocks, or rely on a very time consuming
re-striping of all available data. This paper evaluates the performance of conventional
data distribution approaches compared to the adaptive virtualization solution
V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure
are normally not considered in benchmark results, but can have a significant impact
on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such
changing environments with the non-adaptive Linux logical volume manager (LVM).
The performance results of our tests clearly outline the necessity of adaptive
data distribution schemes.
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. Influence of adaptive data
layouts on performance in dynamically changing storage environments. In: 14th
Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06). ; 2006. doi:10.1109/pdp.2006.44'
apa: Brinkmann, A., Effert, S., Heidebuer, M., & Vodisek, M. (2006). Influence
of adaptive data layouts on performance in dynamically changing storage environments.
14th Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06). https://doi.org/10.1109/pdp.2006.44
bibtex: '@inproceedings{Brinkmann_Effert_Heidebuer_Vodisek_2006, title={Influence
of adaptive data layouts on performance in dynamically changing storage environments},
DOI={10.1109/pdp.2006.44}, booktitle={14th
Euromicro International Conference on Parallel, Distributed, and Network-Based
Processing (PDP’06)}, author={Brinkmann, Andre and Effert, Sascha and Heidebuer,
Michael and Vodisek, Mario}, year={2006} }'
chicago: Brinkmann, Andre, Sascha Effert, Michael Heidebuer, and Mario Vodisek.
“Influence of Adaptive Data Layouts on Performance in Dynamically Changing Storage
Environments.” In 14th Euromicro International Conference on Parallel, Distributed,
and Network-Based Processing (PDP’06), 2006. https://doi.org/10.1109/pdp.2006.44.
ieee: 'A. Brinkmann, S. Effert, M. Heidebuer, and M. Vodisek, “Influence of adaptive
data layouts on performance in dynamically changing storage environments,” 2006,
doi: 10.1109/pdp.2006.44.'
mla: Brinkmann, Andre, et al. “Influence of Adaptive Data Layouts on Performance
in Dynamically Changing Storage Environments.” 14th Euromicro International
Conference on Parallel, Distributed, and Network-Based Processing (PDP’06),
2006, doi:10.1109/pdp.2006.44.
short: 'A. Brinkmann, S. Effert, M. Heidebuer, M. Vodisek, in: 14th Euromicro International
Conference on Parallel, Distributed, and Network-Based Processing (PDP’06), 2006.'
date_created: 2021-10-28T08:33:09Z
date_updated: 2022-01-06T06:57:31Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/pdp.2006.44
language:
- iso: eng
publication: 14th Euromicro International Conference on Parallel, Distributed, and
Network-Based Processing (PDP'06)
publication_status: published
status: public
title: Influence of adaptive data layouts on performance in dynamically changing storage
environments
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '20950'
author:
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
citation:
ama: 'Meyer M. Pattern-based Reengineering of Software Systems. In: Proceedings
of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento,
Italy. IEEE Computer Society; 2006:305-306.'
apa: Meyer, M. (2006). Pattern-based Reengineering of Software Systems. Proceedings
of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento,
Italy, 305–306.
bibtex: '@inproceedings{Meyer_2006, title={Pattern-based Reengineering of Software
Systems}, booktitle={Proceedings of the 13th Working Conference on Reverse Engineering
(WCRE 2006), Benevento, Italy}, publisher={IEEE Computer Society}, author={Meyer,
Matthias}, year={2006}, pages={305–306} }'
chicago: Meyer, Matthias. “Pattern-Based Reengineering of Software Systems.” In
Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006),
Benevento, Italy, 305–6. IEEE Computer Society, 2006.
ieee: M. Meyer, “Pattern-based Reengineering of Software Systems,” in Proceedings
of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento,
Italy, 2006, pp. 305–306.
mla: Meyer, Matthias. “Pattern-Based Reengineering of Software Systems.” Proceedings
of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento,
Italy, IEEE Computer Society, 2006, pp. 305–06.
short: 'M. Meyer, in: Proceedings of the 13th Working Conference on Reverse Engineering
(WCRE 2006), Benevento, Italy, IEEE Computer Society, 2006, pp. 305–306.'
date_created: 2021-01-13T10:19:54Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
page: 305-306
publication: Proceedings of the 13th Working Conference on Reverse Engineering (WCRE
2006), Benevento, Italy
publisher: IEEE Computer Society
status: public
title: Pattern-based Reengineering of Software Systems
type: conference
user_id: '5786'
year: '2006'
...
---
_id: '20951'
author:
- first_name: Holger
full_name: Giese, Holger
last_name: Giese
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
- first_name: Robert
full_name: Wagner, Robert
last_name: Wagner
citation:
ama: 'Giese H, Meyer M, Wagner R. A Prototype for Guideline Checking and Model Transformation
in Matlab/Simulink. In: Proc. of the 4th International Fujaba Days 2006, Bayreuth,
Germany. Vol tr-ri-06-275. Technical Report. University of Paderborn; 2006:56-60.'
apa: Giese, H., Meyer, M., & Wagner, R. (2006). A Prototype for Guideline Checking
and Model Transformation in Matlab/Simulink. Proc. of the 4th International
Fujaba Days 2006, Bayreuth, Germany, tr-ri-06-275, 56–60.
bibtex: '@inproceedings{Giese_Meyer_Wagner_2006, series={Technical Report}, title={A
Prototype for Guideline Checking and Model Transformation in Matlab/Simulink},
volume={tr-ri-06-275}, booktitle={Proc. of the 4th International Fujaba Days 2006,
Bayreuth, Germany}, publisher={University of Paderborn}, author={Giese, Holger
and Meyer, Matthias and Wagner, Robert}, year={2006}, pages={56–60}, collection={Technical
Report} }'
chicago: Giese, Holger, Matthias Meyer, and Robert Wagner. “A Prototype for Guideline
Checking and Model Transformation in Matlab/Simulink.” In Proc. of the 4th
International Fujaba Days 2006, Bayreuth, Germany, tr-ri-06-275:56–60. Technical
Report. University of Paderborn, 2006.
ieee: H. Giese, M. Meyer, and R. Wagner, “A Prototype for Guideline Checking and
Model Transformation in Matlab/Simulink,” in Proc. of the 4th International
Fujaba Days 2006, Bayreuth, Germany, 2006, vol. tr-ri-06-275, pp. 56–60.
mla: Giese, Holger, et al. “A Prototype for Guideline Checking and Model Transformation
in Matlab/Simulink.” Proc. of the 4th International Fujaba Days 2006, Bayreuth,
Germany, vol. tr-ri-06-275, University of Paderborn, 2006, pp. 56–60.
short: 'H. Giese, M. Meyer, R. Wagner, in: Proc. of the 4th International Fujaba
Days 2006, Bayreuth, Germany, University of Paderborn, 2006, pp. 56–60.'
date_created: 2021-01-13T10:20:33Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
page: 56-60
publication: Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany
publisher: University of Paderborn
series_title: Technical Report
status: public
title: A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink
type: conference
user_id: '5786'
volume: tr-ri-06-275
year: '2006'
...
---
_id: '20952'
author:
- first_name: Matthias
full_name: Tichy, Matthias
last_name: Tichy
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
- first_name: Holger
full_name: Giese, Holger
last_name: Giese
citation:
ama: 'Tichy M, Meyer M, Giese H. On Semantic Issues in Story Diagrams. In: Proc.
of the 4th International Fujaba Days 2006, Bayreuth, Germany. Vol tr-ri-06-275.
Technical Report. University of Paderborn; 2006:10-14.'
apa: Tichy, M., Meyer, M., & Giese, H. (2006). On Semantic Issues in Story Diagrams.
Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany, tr-ri-06-275,
10–14.
bibtex: '@inproceedings{Tichy_Meyer_Giese_2006, series={Technical Report}, title={On
Semantic Issues in Story Diagrams}, volume={tr-ri-06-275}, booktitle={Proc. of
the 4th International Fujaba Days 2006, Bayreuth, Germany}, publisher={University
of Paderborn}, author={Tichy, Matthias and Meyer, Matthias and Giese, Holger},
year={2006}, pages={10–14}, collection={Technical Report} }'
chicago: Tichy, Matthias, Matthias Meyer, and Holger Giese. “On Semantic Issues
in Story Diagrams.” In Proc. of the 4th International Fujaba Days 2006, Bayreuth,
Germany, tr-ri-06-275:10–14. Technical Report. University of Paderborn, 2006.
ieee: M. Tichy, M. Meyer, and H. Giese, “On Semantic Issues in Story Diagrams,”
in Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany,
2006, vol. tr-ri-06-275, pp. 10–14.
mla: Tichy, Matthias, et al. “On Semantic Issues in Story Diagrams.” Proc. of
the 4th International Fujaba Days 2006, Bayreuth, Germany, vol. tr-ri-06-275,
University of Paderborn, 2006, pp. 10–14.
short: 'M. Tichy, M. Meyer, H. Giese, in: Proc. of the 4th International Fujaba
Days 2006, Bayreuth, Germany, University of Paderborn, 2006, pp. 10–14.'
date_created: 2021-01-13T10:21:09Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
page: 10-14
publication: Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany
publisher: University of Paderborn
series_title: Technical Report
status: public
title: On Semantic Issues in Story Diagrams
type: conference
user_id: '5786'
volume: tr-ri-06-275
year: '2006'
...
---
_id: '20967'
author:
- first_name: Jörg
full_name: Holtmann, Jörg
id: '3875'
last_name: Holtmann
orcid: 0000-0001-6141-4571
citation:
ama: Holtmann J. Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung.
University of Paderborn; 2006.
apa: Holtmann, J. (2006). Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung.
University of Paderborn.
bibtex: '@book{Holtmann_2006, title={Entwicklung von Geschäftsprozessmustern zur
Qualitätssicherung}, publisher={University of Paderborn}, author={Holtmann, Jörg},
year={2006} }'
chicago: Holtmann, Jörg. Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung.
University of Paderborn, 2006.
ieee: J. Holtmann, Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung.
University of Paderborn, 2006.
mla: Holtmann, Jörg. Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung.
University of Paderborn, 2006.
short: J. Holtmann, Entwicklung von Geschäftsprozessmustern Zur Qualitätssicherung,
University of Paderborn, 2006.
date_created: 2021-01-13T10:59:29Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
publisher: University of Paderborn
status: public
title: Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung
type: bachelorsthesis
user_id: '5786'
year: '2006'
...
---
_id: '2110'
author:
- first_name: Giuseppe
full_name: Ateniese, Giuseppe
last_name: Ateniese
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks.
IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138
apa: Ateniese, G., Riley, C., & Scheideler, C. (2006). Survivable Monitoring
in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254. https://doi.org/10.1109/TMC.2006.138
bibtex: '@article{Ateniese_Riley_Scheideler_2006, title={Survivable Monitoring in
Dynamic Networks}, DOI={10.1109/TMC.2006.138},
number={9}, journal={IEEE Trans. Mob. Comput.}, author={Ateniese, Giuseppe and
Riley, Chris and Scheideler, Christian}, year={2006}, pages={1242--1254} }'
chicago: 'Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
Monitoring in Dynamic Networks.” IEEE Trans. Mob. Comput., no. 9 (2006):
1242--1254. https://doi.org/10.1109/TMC.2006.138.'
ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.
mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IEEE
Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
short: G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.
date_created: 2018-04-03T05:21:30Z
date_updated: 2022-01-06T06:54:45Z
department:
- _id: '79'
doi: 10.1109/TMC.2006.138
issue: '9'
page: 1242--1254
publication: IEEE Trans. Mob. Comput.
status: public
title: Survivable Monitoring in Dynamic Networks
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2111'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, Schindelhauer C. Distributed coloring
in O/spl tilde/(/spl radic/(log n)) bit rounds. In: IPDPS. ; 2006.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & Schindelhauer, C. (2006). Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_Schindelhauer_2006, title={Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}, booktitle={IPDPS}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian},
year={2006} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer.
“Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS,
2006.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed
coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.
mla: Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log
n)) Bit Rounds.” IPDPS, 2006.
short: 'K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.'
date_created: 2018-04-03T05:22:43Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:03Z
date_updated: 2018-04-13T09:57:03Z
file_id: '2334'
file_name: IPDPS06.pdf
file_size: 192708
relation: main_file
file_date_updated: 2018-04-13T09:57:03Z
has_accepted_license: '1'
oa: '1'
publication: IPDPS
status: public
title: Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
type: conference
urn: '21110'
user_id: '15504'
year: '2006'
...
---
_id: '2112'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer
Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.'
apa: Awerbuch, B., & Scheideler, C. (2006). Robust Random Number Generation
for Peer-to-Peer Systems. In OPODIS (pp. 275--289).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, series={Lecture Notes in Computer
Science}, title={Robust Random Number Generation for Peer-to-Peer Systems}, booktitle={OPODIS},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2006}, pages={275--289},
collection={Lecture Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer
Science, 2006.
ieee: B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer
Systems,” in OPODIS, 2006, pp. 275--289.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
short: 'B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.'
date_created: 2018-04-03T05:23:39Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:57:51Z
date_updated: 2018-04-13T09:57:51Z
file_id: '2335'
file_name: OPODIS06.pdf
file_size: 198976
relation: main_file
file_date_updated: 2018-04-13T09:57:51Z
has_accepted_license: '1'
oa: '1'
page: 275--289
publication: OPODIS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Random Number Generation for Peer-to-Peer Systems
type: conference
urn: '21128'
user_id: '15504'
year: '2006'
...
---
_id: '2113'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA.
; 2006:318--327.'
apa: Awerbuch, B., & Scheideler, C. (2006). Towards a scalable and robust DHT.
In SPAA (pp. 318--327).
bibtex: '@inproceedings{Awerbuch_Scheideler_2006, title={Towards a scalable and
robust DHT}, booktitle={SPAA}, author={Awerbuch, Baruch and Scheideler, Christian},
year={2006}, pages={318--327} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” In SPAA, 318--327, 2006.
ieee: B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA,
2006, pp. 318--327.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” SPAA, 2006, pp. 318--327.
short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.'
date_created: 2018-04-03T05:24:22Z
date_updated: 2022-01-06T06:54:46Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:09Z
date_updated: 2018-04-13T10:00:09Z
file_id: '2337'
file_name: SPAA06.pdf
file_size: 144588
relation: main_file
file_date_updated: 2018-04-13T10:00:09Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SPAA
status: public
title: Towards a scalable and robust DHT
type: conference
urn: '21137'
user_id: '15504'
year: '2006'
...
---
_id: '17417'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
citation:
ama: 'Rammig F-J, Dangelmaier W, Karl H, Mertsching B, Meyer auf der Heide F, Trächtler
A, eds. Self-Coordinating Systems: The Next Challenge in Research on Distributed
Systems. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2006.'
apa: 'Rammig, F.-J., Dangelmaier, W., Karl, H., Mertsching, B., Meyer auf der Heide,
F., & Trächtler, A. (Eds.). (2006). Self-Coordinating Systems: The Next
Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz
Nixdorf Instituts.'
bibtex: '@book{Rammig_Dangelmaier_Karl_Mertsching_Meyer auf der Heide_Trächtler_2006,
place={Paderborn}, series={Proceedings of the 6th International Heinz Nixdorf
Symposium}, title={Self-Coordinating Systems: The Next Challenge in Research on
Distributed Systems}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
year={2006}, collection={Proceedings of the 6th International Heinz Nixdorf Symposium}
}'
chicago: 'Rammig, Franz-Josef, Wilhelm Dangelmaier, Holger Karl, Bärbel Mertsching,
Friedhelm Meyer auf der Heide, and Ansgar Trächtler, eds. Self-Coordinating
Systems: The Next Challenge in Research on Distributed Systems. Proceedings
of the 6th International Heinz Nixdorf Symposium. Paderborn: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, 2006.'
ieee: 'F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide,
and A. Trächtler, Eds., Self-Coordinating Systems: The Next Challenge in Research
on Distributed Systems. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
Instituts, 2006.'
mla: 'Rammig, Franz-Josef, et al., editors. Self-Coordinating Systems: The Next
Challenge in Research on Distributed Systems. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, 2006.'
short: 'F.-J. Rammig, W. Dangelmaier, H. Karl, B. Mertsching, F. Meyer auf der Heide,
A. Trächtler, eds., Self-Coordinating Systems: The Next Challenge in Research
on Distributed Systems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.'
date_created: 2020-07-27T13:00:52Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
- _id: '26'
editor:
- first_name: Franz-Josef
full_name: Rammig, Franz-Josef
last_name: Rammig
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Bärbel
full_name: Mertsching, Bärbel
last_name: Mertsching
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ansgar
full_name: Trächtler, Ansgar
last_name: Trächtler
language:
- iso: eng
place: Paderborn
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
series_title: Proceedings of the 6th International Heinz Nixdorf Symposium
status: public
title: 'Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems'
type: conference_editor
user_id: '15415'
year: '2006'
...
---
_id: '17475'
alternative_title:
- '6th international Heinz Nixdorf symposium, January 17 - 18, 2006, Heinz Nixdorf
MuseumsForum: within the scope of the {DFG} Collaborative Research Centre 376 Massively
Parallel Computing: algorithms, design, methods, applications'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Monien B, Meyer auf der Heide F. New Trends in Parallel and Distributed
Computing. Vol 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2006.
apa: Monien, B., & Meyer auf der Heide, F. (2006). New trends in parallel
and distributed computing (Vol. 181). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.
bibtex: '@book{Monien_Meyer auf der Heide_2006, series={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, title={New trends in parallel and distributed
computing}, volume={181}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, author={Monien, Burkhard and Meyer auf der Heide, Friedhelm}, year={2006},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel
and Distributed Computing. Vol. 181. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.
ieee: B. Monien and F. Meyer auf der Heide, New trends in parallel and distributed
computing, vol. 181. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2006.
mla: Monien, Burkhard, and Friedhelm Meyer auf der Heide. New Trends in Parallel
and Distributed Computing. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2006.
short: B. Monien, F. Meyer auf der Heide, New Trends in Parallel and Distributed
Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-07-30T09:18:30Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 181'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-939350-00-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: New trends in parallel and distributed computing
type: book
user_id: '5786'
volume: 181
year: '2006'
...
---
_id: '17619'
author:
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Grünewald M, Meyer auf der Heide F, Rührup S, Schindelhauer C, Volbert K.
Directional Communication in Mobile Ad Hoc Networks. In: New Trends in Parallel
& Distributed Computing, 6th Int. Heinz Nixdorf Symposium. Verlagsschriftenreihe
des Heinz Nixdorf Instituts; 2006:225-234.'
apa: Grünewald, M., Meyer auf der Heide, F., Rührup, S., Schindelhauer, C., &
Volbert, K. (2006). Directional Communication in Mobile Ad Hoc Networks. New
Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium,
225–234.
bibtex: '@inproceedings{Grünewald_Meyer auf der Heide_Rührup_Schindelhauer_Volbert_2006,
place={Paderborn}, title={Directional Communication in Mobile Ad Hoc Networks},
booktitle={New Trends in Parallel & Distributed Computing, 6th Int. Heinz
Nixdorf Symposium}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
author={Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan
and Schindelhauer, Christian and Volbert, Klaus}, year={2006}, pages={225–234}
}'
chicago: 'Grünewald, Matthias, Friedhelm Meyer auf der Heide, Stefan Rührup, Christian
Schindelhauer, and Klaus Volbert. “Directional Communication in Mobile Ad Hoc
Networks.” In New Trends in Parallel & Distributed Computing, 6th Int.
Heinz Nixdorf Symposium, 225–34. Paderborn: Verlagsschriftenreihe des Heinz
Nixdorf Instituts, 2006.'
ieee: M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, and K.
Volbert, “Directional Communication in Mobile Ad Hoc Networks,” in New Trends
in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium,
2006, pp. 225–234.
mla: Grünewald, Matthias, et al. “Directional Communication in Mobile Ad Hoc Networks.”
New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2006, pp. 225–34.
short: 'M. Grünewald, F. Meyer auf der Heide, S. Rührup, C. Schindelhauer, K. Volbert,
in: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006,
pp. 225–234.'
date_created: 2020-08-05T09:36:46Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '26'
language:
- iso: eng
page: 225-234
place: Paderborn
publication: New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf
Symposium
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Directional Communication in Mobile Ad Hoc Networks
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18676'
abstract:
- lang: eng
text: We present random sampling algorithms that with probability at least 1 - δ
compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv
ity coefficient, and of the number of bipartite cliques in a graph given as a
stream of edges. Our methods can be extended to approximately count the number
of occurences of fixed constant-size subgraphs. Our a lgorithms only require one
pass over the input stream and their storage space depends only on structural
parameters of the graphs, the approxi- mation guarantee, and the confidence probability.
For examp le, the algorithms to compute the clustering and transitivity coefficient
depend on that coefficient but n ot on the size of the graph. Since many large
social networks have small clustering and transitivity coe fficient, our algorithms
use space independent of the size of the input for these graphs. We implemented
our algorithms and evaluated their performance on networks from different appli-
cation domains. The sizes of the considered input graphs varied from about 8,
000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion
edges. For both algorithms we run experiments with a sample set size varying from
100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee.
Our algorithms appear to be time efficient for the se sample sizes.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Alberto
full_name: Marchetti-Spaccamela, Alberto
last_name: Marchetti-Spaccamela
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Luciana
full_name: Buriol, Luciana
last_name: Buriol
citation:
ama: 'Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Computing
Clustering Coefficients in Data Streams. In: Proceedings of the European Conference
on Complex Systems (ECCS’06). ; 2006.'
apa: Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., & Buriol,
L. (2006). Computing Clustering Coefficients in Data Streams. In Proceedings
of the European Conference on Complex Systems (ECCS’06).
bibtex: '@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006,
title={Computing Clustering Coefficients in Data Streams}, booktitle={Proceedings
of the European Conference on Complex Systems (ECCS’06)}, author={Sohler, Christian
and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and
Buriol, Luciana}, year={2006} }'
chicago: Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano
Leonardi, and Luciana Buriol. “Computing Clustering Coefficients in Data Streams.”
In Proceedings of the European Conference on Complex Systems (ECCS’06),
2006.
ieee: C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol,
“Computing Clustering Coefficients in Data Streams,” in Proceedings of the
European Conference on Complex Systems (ECCS’06), 2006.
mla: Sohler, Christian, et al. “Computing Clustering Coefficients in Data Streams.”
Proceedings of the European Conference on Complex Systems (ECCS’06), 2006.
short: 'C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol,
in: Proceedings of the European Conference on Complex Systems (ECCS’06), 2006.'
date_created: 2020-08-31T08:25:01Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the European Conference on Complex Systems (ECCS'06)
status: public
title: Computing Clustering Coefficients in Data Streams
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18745'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Alberto
full_name: Marchetti-Spaccamela, Alberto
last_name: Marchetti-Spaccamela
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Luciana
full_name: Buriol, Luciana
last_name: Buriol
citation:
ama: 'Sohler C, Frahling G, Marchetti-Spaccamela A, Leonardi S, Buriol L. Counting
Triangles in Data Streams. In: Proceedings of the 25th ACM Symposium on Principles
of Database Systems (PODS), ed. ; 2006.'
apa: Sohler, C., Frahling, G., Marchetti-Spaccamela, A., Leonardi, S., & Buriol,
L. (2006). Counting Triangles in Data Streams. In Proceedings of the 25th ACM
Symposium on Principles of Database Systems (PODS) (Ed.).
bibtex: '@inproceedings{Sohler_Frahling_Marchetti-Spaccamela_Leonardi_Buriol_2006,
title={Counting Triangles in Data Streams}, author={Sohler, Christian and Frahling,
Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana},
editor={Proceedings of the 25th ACM Symposium on Principles of Database Systems
(PODS)Editor}, year={2006} }'
chicago: Sohler, Christian, Gereon Frahling, Alberto Marchetti-Spaccamela, Stefano
Leonardi, and Luciana Buriol. “Counting Triangles in Data Streams.” edited by
Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS),
2006.
ieee: C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, and L. Buriol,
“Counting Triangles in Data Streams,” 2006.
mla: Sohler, Christian, et al. Counting Triangles in Data Streams. Edited
by Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS),
2006.
short: 'C. Sohler, G. Frahling, A. Marchetti-Spaccamela, S. Leonardi, L. Buriol,
in: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)
(Ed.), 2006.'
corporate_editor:
- Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS)
date_created: 2020-09-01T10:34:00Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Counting Triangles in Data Streams
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18746'
abstract:
- lang: eng
text: "In this paper, we present a randomized constant factor approximation\r\nalgorithm
for the metric minimum facility location problem with uniform\r\ncosts and demands
in a distributed setting, in which every point can\r\nopen a facility. In particular,
our distributed algorithm uses three\r\ncommunication rounds with message sizes
bounded to O(log n) bits where\r\nn is the number of points. We also extend our
algorithm to constant\r\npowers of metric spaces, where we also obtain a randomized
constant\r\nfactor approximation algorithm."
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Joachim
full_name: Gehweiler, Joachim
last_name: Gehweiler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Sohler C, Gehweiler J, Lammersen C. A Distributed O(1)-Approximation Algorithm
for the Uniform Facility Location Problem. In: Proceeedings of 18th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ; 2006.'
apa: Sohler, C., Gehweiler, J., & Lammersen, C. (2006). A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem. In Proceeedings of 18th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
bibtex: '@inproceedings{Sohler_Gehweiler_Lammersen_2006, title={A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem}, booktitle={Proceeedings
of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
author={Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}, year={2006}
}'
chicago: Sohler, Christian, Joachim Gehweiler, and Christiane Lammersen. “A Distributed
O(1)-Approximation Algorithm for the Uniform Facility Location Problem.” In Proceeedings
of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2006.
ieee: C. Sohler, J. Gehweiler, and C. Lammersen, “A Distributed O(1)-Approximation
Algorithm for the Uniform Facility Location Problem,” in Proceeedings of 18th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.
mla: Sohler, Christian, et al. “A Distributed O(1)-Approximation Algorithm for the
Uniform Facility Location Problem.” Proceeedings of 18th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2006.
short: 'C. Sohler, J. Gehweiler, C. Lammersen, in: Proceeedings of 18th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2006.'
date_created: 2020-09-01T10:38:29Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA)
status: public
title: A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location
Problem
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '18926'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration.
In: Architecture of Computing Systems - ARCS. ; 2006:341--351. doi:10.1007/11682127_24'
apa: Dynia, M., Korzeniowski, M., & Schindelhauer, C. (2006). Power-Aware Collective
Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351).
https://doi.org/10.1007/11682127_24
bibtex: '@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware
Collective Tree Exploration}, DOI={10.1007/11682127_24},
number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia,
Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006},
pages={341--351} }'
chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware
Collective Tree Exploration.” In Architecture of Computing Systems - ARCS,
341--351, 2006. https://doi.org/10.1007/11682127_24.
ieee: M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree
Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894,
pp. 341--351.
mla: Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” Architecture
of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.
short: 'M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing
Systems - ARCS, 2006, pp. 341--351.'
date_created: 2020-09-03T10:13:56Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/11682127_24
issue: '3894'
language:
- iso: eng
page: 341--351
publication: Architecture of Computing Systems - ARCS
publication_identifier:
isbn:
- '9783540327653'
- '9783540327660'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Power-Aware Collective Tree Exploration
type: conference
user_id: '15415'
year: '2006'
...