---
_id: '1933'
author:
- first_name: Matthias
full_name: Baumgart, Matthias
last_name: Baumgart
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for
dynamic data management. In: SPAA 2009: Proceedings of the 21st Annual ACM
Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada,
August 11-13, 2009. ; 2009:300--309. doi:10.1145/1583991.1584064'
apa: 'Baumgart, M., Scheideler, C., & Schmid, S. (2009). A DoS-resilient information
system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009 (pp. 300--309). https://doi.org/10.1145/1583991.1584064'
bibtex: '@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient
information system for dynamic data management}, DOI={10.1145/1583991.1584064},
booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009},
author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009},
pages={300--309} }'
chicago: 'Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient
Information System for Dynamic Data Management.” In SPAA 2009: Proceedings
of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures,
Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009. https://doi.org/10.1145/1583991.1584064.'
ieee: 'M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system
for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual
ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta,
Canada, August 11-13, 2009, 2009, pp. 300--309.'
mla: 'Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic
Data Management.” SPAA 2009: Proceedings of the 21st Annual ACM Symposium on
Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August
11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.'
short: 'M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the
21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary,
Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.'
date_created: 2018-03-29T09:18:06Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1583991.1584064
page: 300--309
publication: 'SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009'
publication_identifier:
isbn:
- 978-1-60558-606-9
status: public
title: A DoS-resilient information system for dynamic data management
type: conference
user_id: '15504'
year: '2009'
...
---
_id: '1934'
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement:
On the Time Complexity of Distributed Topological Self-stabilization. In: Stabilization,
Safety, and Security of Distributed Systems, 11th International Symposium, SSS
2009, Lyon, France, November 3-6, 2009. Proceedings. Vol 5873. Lecture Notes
in Computer Science. Springer; 2009:781--782. doi:10.1007/978-3-642-05118-0_58'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological
Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems,
11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
(Vol. 5873, pp. 781--782). Springer. https://doi.org/10.1007/978-3-642-05118-0_58'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture
Notes in Computer Science}, title={Brief Announcement: On the Time Complexity
of Distributed Topological Self-stabilization}, volume={5873}, DOI={10.1007/978-3-642-05118-0_58},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer},
author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian
and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” In Stabilization, Safety, and Security of
Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November
3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science.
Springer, 2009. https://doi.org/10.1007/978-3-642-05118-0_58.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,”
in Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009,
vol. 5873, pp. 781--782.'
mla: 'Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed
Topological Self-Stabilization.” Stabilization, Safety, and Security of Distributed
Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009.
Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer,
2009, pp. 781--782.'
date_created: 2018-03-29T09:19:17Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1007/978-3-642-05118-0_58
intvolume: ' 5873'
page: 781--782
publication: Stabilization, Safety, and Security of Distributed Systems, 11th International
Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings
publication_identifier:
isbn:
- 978-3-642-05117-3
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization'
type: conference
user_id: '15504'
volume: 5873
year: '2009'
...
---
_id: '1935'
author:
- first_name: Benjamin
full_name: Doerr, Benjamin
last_name: Doerr
- first_name: Leslie
full_name: Ann Goldberg, Leslie
last_name: Ann Goldberg
- first_name: Lorenz
full_name: Minder, Lorenz
last_name: Minder
- first_name: Thomas
full_name: Sauerwald, Thomas
last_name: Sauerwald
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing
Consensus with the Power of Two Choices. In: Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009. Vol 09371. Dagstuhl Seminar Proceedings.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:10.1145/1989493.1989516'
apa: Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler, C.
(2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. https://doi.org/10.1145/1989493.1989516
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl
Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices},
volume={09371}, DOI={10.1145/1989493.1989516},
booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009},
publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings}
}'
chicago: Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”
In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, Germany, 2009. https://doi.org/10.1145/1989493.1989516.
ieee: B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing
Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed
Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.
mla: Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”
Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009,
vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009,
doi:10.1145/1989493.1989516.
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic
Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, Germany, 2009.'
date_created: 2018-03-29T09:20:44Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1989493.1989516
intvolume: ' 9371'
publication: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
series_title: Dagstuhl Seminar Proceedings
status: public
title: Stabilizing Consensus with the Power of Two Choices
type: conference
user_id: '15504'
volume: '09371'
year: '2009'
...
---
_id: '1937'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Scheideler C. Algorithms for Overlay Networks. Bulletin of the EATCS.
2008:130--152.
apa: Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the
EATCS, 130--152.
bibtex: '@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin
of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }'
chicago: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of
the EATCS, 2008, 130--152.
ieee: C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS,
pp. 130--152, 2008.
mla: Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the
EATCS, 2008, pp. 130--152.
short: C. Scheideler, Bulletin of the EATCS (2008) 130--152.
date_created: 2018-03-29T09:28:22Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
page: 130--152
publication: Bulletin of the EATCS
status: public
title: Algorithms for Overlay Networks
type: journal_article
user_id: '15504'
year: '2008'
...
---
_id: '1938'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andr{\'{e}}a
full_name: W. Richa, Andr{\'{e}}a
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for
single-hop wireless networks. In: Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008. ACM; 2008:45--54. doi:10.1145/1400751.1400759'
apa: Awerbuch, B., W. Richa, A., & Scheideler, C. (2008). A jamming-resistant
MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008 (pp. 45--54). ACM. https://doi.org/10.1145/1400751.1400759
bibtex: '@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant
MAC protocol for single-hop wireless networks}, DOI={10.1145/1400751.1400759},
booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM},
author={Awerbuch, Baruch and W. Richa, Andr{\’{e}}a and Scheideler, Christian},
year={2008}, pages={45--54} }'
chicago: Awerbuch, Baruch, Andr{\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant
MAC Protocol for Single-Hop Wireless Networks.” In Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, 45--54. ACM, 2008. https://doi.org/10.1145/1400751.1400759.
ieee: B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol
for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual
ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada,
August 18-21, 2008, 2008, pp. 45--54.
mla: Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless
Networks.” Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008,
ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.
short: 'B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh
Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto,
Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.'
date_created: 2018-03-29T09:29:06Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1145/1400751.1400759
page: 45--54
publication: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles
of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008
publication_identifier:
isbn:
- 978-1-59593-989-0
publisher: ACM
status: public
title: A jamming-resistant MAC protocol for single-hop wireless networks
type: conference
user_id: '15504'
year: '2008'
...
---
_id: '1940'
author:
- first_name: Mario
full_name: Mense, Mario
last_name: Mense
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage
in dynamic heterogeneous storage systems. In: Proceedings of the Nineteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California,
USA, January 20-22, 2008. SIAM; 2008:1135--1144.'
apa: 'Mense, M., & Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant
and fair storage in dynamic heterogeneous storage systems. In Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.'
bibtex: '@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme
for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense,
Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }'
chicago: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for
Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In Proceedings
of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008,
San Francisco, California, USA, January 20-22, 2008, 1135--1144. SIAM, 2008.'
ieee: 'M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and
fair storage in dynamic heterogeneous storage systems,” in Proceedings of the
Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco,
California, USA, January 20-22, 2008, 2008, pp. 1135--1144.'
mla: 'Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant
and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of
the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San
Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.'
short: 'M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January
20-22, 2008, SIAM, 2008, pp. 1135--1144.'
date_created: 2018-03-29T09:30:18Z
date_updated: 2022-01-06T06:54:03Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:03:13Z
date_updated: 2018-04-13T10:03:13Z
file_id: '2341'
file_name: SODA08.pdf
file_size: 211264
relation: main_file
file_date_updated: 2018-04-13T10:03:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 1135--1144
publication: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms,
SODA 2008, San Francisco, California, USA, January 20-22, 2008
publisher: SIAM
status: public
title: 'SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous
storage systems'
type: conference
urn: '19408'
user_id: '14955'
year: '2008'
...
---
_id: '1941'
author:
- first_name: Thomas
full_name: Clouser, Thomas
last_name: Clouser
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic
Skip List. In: Stabilization, Safety, and Security of Distributed Systems,
10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008.
Proceedings. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140.
doi:10.1007/978-3-540-89335-6_12'
apa: 'Clouser, T., Nesterenko, M., & Scheideler, C. (2008). Tiara: A Self-stabilizing
Deterministic Skip List. In Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings (Vol. 5340, pp. 124--140). Springer. https://doi.org/10.1007/978-3-540-89335-6_12'
bibtex: '@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes
in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List},
volume={5340}, DOI={10.1007/978-3-540-89335-6_12},
booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer},
author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008},
pages={124--140}, collection={Lecture Notes in Computer Science} }'
chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
A Self-Stabilizing Deterministic Skip List.” In Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in
Computer Science. Springer, 2008. https://doi.org/10.1007/978-3-540-89335-6_12.'
ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing
Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed
Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23,
2008. Proceedings, 2008, vol. 5340, pp. 124--140.'
mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.”
Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings,
vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.'
short: 'T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and
Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit,
MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.'
date_created: 2018-03-29T09:31:18Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-89335-6_12
intvolume: ' 5340'
page: 124--140
publication: Stabilization, Safety, and Security of Distributed Systems, 10th International
Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings
publication_identifier:
isbn:
- 978-3-540-89334-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Tiara: A Self-stabilizing Deterministic Skip List'
type: conference
user_id: '15504'
volume: 5340
year: '2008'
...
---
_id: '1942'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: Taschenbuch
Der Algorithmen. eXamen.press. Springer; 2008:229--236. doi:10.1007/978-3-540-76394-9_22'
apa: 'Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen?
In Taschenbuch der Algorithmen (pp. 229--236). Springer. https://doi.org/10.1007/978-3-540-76394-9_22'
bibtex: '@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie
verbreite ich schnell Informationen?}, DOI={10.1007/978-3-540-76394-9_22},
booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler,
Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }'
chicago: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008.
https://doi.org/10.1007/978-3-540-76394-9_22.'
ieee: 'C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,”
in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.'
mla: 'Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”
Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.'
short: 'C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.'
date_created: 2018-03-29T09:32:34Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '79'
doi: 10.1007/978-3-540-76394-9_22
page: 229--236
publication: Taschenbuch der Algorithmen
publication_identifier:
isbn:
- 978-3-540-76393-2
publisher: Springer
series_title: eXamen.press
status: public
title: 'Broadcasting: Wie verbreite ich schnell Informationen?'
type: book_chapter
user_id: '15504'
year: '2008'
...
---
_id: '2017'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
citation:
ama: Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for Fault-Tolerant
Routing in Circuit-Switched Networks. SIAM J Discrete Math. 2007;(1):141--157.
doi:10.1137/S0895480102419743
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2007). Algorithms
for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math.,
(1), 141--157. https://doi.org/10.1137/S0895480102419743
bibtex: '@article{Bagchi_Chaudhary_Scheideler_Kolman_2007, title={Algorithms for
Fault-Tolerant Routing in Circuit-Switched Networks}, DOI={10.1137/S0895480102419743},
number={1}, journal={SIAM J. Discrete Math.}, author={Bagchi, Amitabha and Chaudhary,
Amitabh and Scheideler, Christian and Kolman, Petr}, year={2007}, pages={141--157}
}'
chicago: 'Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.” SIAM
J. Discrete Math., no. 1 (2007): 141--157. https://doi.org/10.1137/S0895480102419743.'
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant
Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp.
141--157, 2007.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched
Networks.” SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
short: A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math.
(2007) 141--157.
date_created: 2018-03-29T11:50:23Z
date_updated: 2022-01-06T06:54:20Z
department:
- _id: '79'
doi: 10.1137/S0895480102419743
issue: '1'
page: 141--157
publication: SIAM J. Discrete Math.
status: public
title: Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '2020'
author:
- first_name: Melih
full_name: Onus, Melih
last_name: Onus
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Scheideler C. Linearization: Locally Self-Stabilizing
Sorting in Graphs. In: Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007.
; 2007. doi:10.1137/1.9781611972870.10'
apa: 'Onus, M., W. Richa, A., & Scheideler, C. (2007). Linearization: Locally
Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on
Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA,
January 6, 2007. https://doi.org/10.1137/1.9781611972870.10'
bibtex: '@inproceedings{Onus_W. Richa_Scheideler_2007, title={Linearization: Locally
Self-Stabilizing Sorting in Graphs}, DOI={10.1137/1.9781611972870.10},
booktitle={Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007}, author={Onus, Melih
and W. Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: 'Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization:
Locally Self-Stabilizing Sorting in Graphs.” In Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007. https://doi.org/10.1137/1.9781611972870.10.'
ieee: 'M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing
Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering
and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007,
2007.'
mla: 'Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.'
short: 'M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop
on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana,
USA, January 6, 2007, 2007.'
date_created: 2018-03-29T11:54:37Z
date_updated: 2022-01-06T06:54:23Z
department:
- _id: '79'
doi: 10.1137/1.9781611972870.10
publication: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments,
ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007
publication_identifier:
isbn:
- 978-1-61197-287-0
status: public
title: 'Linearization: Locally Self-Stabilizing Sorting in Graphs'
type: conference
user_id: '15504'
year: '2007'
...
---
_id: '2022'
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 Scalable and Robust Overlay Networks. In:
6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA,
USA, February 26-27, 2007. ; 2007.'
apa: Awerbuch, B., & Scheideler, C. (2007). Towards Scalable and Robust Overlay
Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007.
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={Towards Scalable and Robust
Overlay Networks}, booktitle={6th International workshop on Peer-To-Peer Systems,
IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007}, author={Awerbuch, Baruch
and Scheideler, Christian}, year={2007} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust
Overlay Networks.” In 6th International Workshop on Peer-To-Peer Systems, IPTPS
2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
ieee: B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,”
in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007, 2007.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay
Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007,
Bellevue, WA, USA, February 26-27, 2007, 2007.
short: 'B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer
Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.'
date_created: 2018-03-29T11:55:52Z
date_updated: 2022-01-06T06:54:23Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:00:55Z
date_updated: 2018-04-13T10:00:55Z
file_id: '2338'
file_name: IPTPS07.pdf
file_size: 191943
relation: main_file
file_date_updated: 2018-04-13T10:00:55Z
has_accepted_license: '1'
oa: '1'
publication: 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue,
WA, USA, February 26-27, 2007
status: public
title: Towards Scalable and Robust Overlay Networks
type: conference
urn: '20228'
user_id: '15504'
year: '2007'
...
---
_id: '2023'
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. A denial-of-service resistant DHT. In: Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007. ACM; 2007:370--371.
doi:10.1145/1281100.1281178'
apa: Awerbuch, B., & Scheideler, C. (2007). A denial-of-service resistant DHT.
In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed
Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371).
ACM. https://doi.org/10.1145/1281100.1281178
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, title={A denial-of-service resistant
DHT}, DOI={10.1145/1281100.1281178},
booktitle={Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007},
publisher={ACM}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2007},
pages={370--371} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles
of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
370--371. ACM, 2007. https://doi.org/10.1145/1281100.1281178.
ieee: B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings
of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing,
PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007,
ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
short: 'B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM
Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon,
USA, August 12-15, 2007, ACM, 2007, pp. 370--371.'
date_created: 2018-03-29T11:56:35Z
date_updated: 2022-01-06T06:54:24Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/1281100.1281178
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:02:18Z
date_updated: 2018-04-13T10:02:18Z
file_id: '2340'
file_name: DISC-07.pdf
file_size: 193097
relation: main_file
file_date_updated: 2018-04-13T10:02:18Z
has_accepted_license: '1'
oa: '1'
page: 370--371
publication: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of
Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007
publication_identifier:
isbn:
- 978-1-59593-616-5
publisher: ACM
status: public
title: A denial-of-service resistant DHT
type: conference
urn: '20237'
user_id: '15504'
year: '2007'
...
---
_id: '2024'
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. A Denial-of-Service Resistant DHT. In: Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings. Vol 4731. Lecture Notes in Computer Science. Springer;
2007:33--47. doi:10.1007/978-3-540-75142-7_6'
apa: Awerbuch, B., & Scheideler, C. (2007). A Denial-of-Service Resistant DHT.
In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer.
https://doi.org/10.1007/978-3-540-75142-7_6
bibtex: '@inproceedings{Awerbuch_Scheideler_2007, series={Lecture Notes in Computer
Science}, title={A Denial-of-Service Resistant DHT}, volume={4731}, DOI={10.1007/978-3-540-75142-7_6},
booktitle={Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings}, publisher={Springer}, author={Awerbuch,
Baruch and Scheideler, Christian}, year={2007}, pages={33--47}, collection={Lecture
Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in
Computer Science. Springer, 2007. https://doi.org/10.1007/978-3-540-75142-7_6.
ieee: B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed
Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September
24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.
mla: Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant
DHT.” Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp.
33--47, doi:10.1007/978-3-540-75142-7_6.
short: 'B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International
Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer,
2007, pp. 33--47.'
date_created: 2018-03-29T11:57:42Z
date_updated: 2022-01-06T06:54:24Z
department:
- _id: '79'
doi: 10.1007/978-3-540-75142-7_6
intvolume: ' 4731'
page: 33--47
publication: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos,
Cyprus, September 24-26, 2007, Proceedings
publication_identifier:
isbn:
- 978-3-540-75141-0
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Denial-of-Service Resistant DHT
type: conference
user_id: '15504'
volume: 4731
year: '2007'
...
---
_id: '2028'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In:
Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72'
apa: W. Richa, A., & Scheideler, C. (2007). Overlay Networks for Peer-to-Peer
Networks. In Handbook of Approximation Algorithms and Metaheuristics. https://doi.org/10.1201/9781420010749.ch72
bibtex: '@inbook{W. Richa_Scheideler_2007, title={Overlay Networks for Peer-to-Peer
Networks}, DOI={10.1201/9781420010749.ch72},
booktitle={Handbook of Approximation Algorithms and Metaheuristics.}, author={W.
Richa, Andrea and Scheideler, Christian}, year={2007} }'
chicago: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” In Handbook of Approximation Algorithms and Metaheuristics.,
2007. https://doi.org/10.1201/9781420010749.ch72.
ieee: A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,”
in Handbook of Approximation Algorithms and Metaheuristics., 2007.
mla: W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer
Networks.” Handbook of Approximation Algorithms and Metaheuristics., 2007,
doi:10.1201/9781420010749.ch72.
short: 'A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and
Metaheuristics., 2007.'
date_created: 2018-03-29T12:00:39Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1201/9781420010749.ch72
publication: Handbook of Approximation Algorithms and Metaheuristics.
publication_identifier:
isbn:
- 978-1-58488-550-4
status: public
title: Overlay Networks for Peer-to-Peer Networks
type: book_chapter
user_id: '15504'
year: '2007'
...
---
_id: '2214'
abstract:
- lang: eng
text: We present a randomized block-level storage virtualization for arbitrary heterogeneous
storage systems that can distribute data in a fair and redundant way and can adapt
this distribution in an efficient way as storage devices enter or leave the system.
More precisely, our virtualization strategies can distribute a set of data blocks
among a set of storage devices of arbitrary non-uniform capacities so that a storage
device representing x% of the capacity in the system will get x% of the data (as
long as this is in principle possible) and the different copies of each data block
are stored so that no two copies of a data block are located in the same device.
Achieving these two properties is not easy, and no virtualization strategy has
been presented so far that has been formally shown to satisfy fairness and redundancy
while being time- and space-eflcient and allowing an efficient adaptation to a
changing set of devices.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant
data placement. In: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic
and redundant data placement}, booktitle={IEEE International Conference on Distributed
Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }'
chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian
Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference
on Distributed Computing Systems (ICDCS), 2007.
ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic
and redundant data placement,” 2007.
mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 2007.
short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:01:42Z
date_updated: 2018-04-13T10:01:42Z
file_id: '2339'
file_name: ICDCS07.pdf
file_size: 164121
relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '2209'
author:
- first_name: Vinay
full_name: Aggarwal, Vinay
last_name: Aggarwal
- first_name: Anja
full_name: Feldmann, Anja
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for
improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449
apa: Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users
cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449
bibtex: '@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users
cooperate for improved performance?}, DOI={10.1145/1273445.1273449},
journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann,
Anja and Scheideler, Christian}, year={2007} }'
chicago: Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and
P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review,
2007. https://doi.org/10.1145/1273445.1273449.
ieee: V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate
for improved performance?,” ACM Computer Commucation Review, 2007.
mla: Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?”
ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
short: V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review
(2007).
date_created: 2018-04-05T06:08:43Z
date_updated: 2022-01-06T06:55:25Z
department:
- _id: '79'
doi: 10.1145/1273445.1273449
publication: ACM Computer Commucation Review
status: public
title: Can ISPs and P2P users cooperate for improved performance?
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '2029'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem.
J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006
apa: Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable
flow problem. J. Algorithms, 61(1), 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006
bibtex: '@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable
flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006},
number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian},
year={2006}, pages={20--44} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms 61, no. 1 (2006): 20--44. https://doi.org/10.1016/j.jalgor.2004.07.006.'
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
short: P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.
date_created: 2018-03-29T12:01:37Z
date_updated: 2022-01-06T06:54:25Z
department:
- _id: '79'
doi: 10.1016/j.jalgor.2004.07.006
intvolume: ' 61'
issue: '1'
page: 20--44
publication: J. Algorithms
status: public
title: Improved bounds for the unsplittable flow problem
type: journal_article
user_id: '15504'
volume: 61
year: '2006'
...
---
_id: '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'
...