---
_id: '1905'
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. Time Complexity
of Distributed Topological Self-stabilization: The Case of Graph Linearization.
In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings. Vol 6034. Lecture Notes in Computer
Science. Springer; 2010:294--305. doi:10.1007/978-3-642-12200-2_27'
apa: 'Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig,
H. (2010). Time Complexity of Distributed Topological Self-stabilization: The
Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin
American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034,
pp. 294--305). Springer. https://doi.org/10.1007/978-3-642-12200-2_27'
bibtex: '@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture
Notes in Computer Science}, title={Time Complexity of Distributed Topological
Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={10.1007/978-3-642-12200-2_27},
booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” In LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
6034:294--305. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-12200-2_27.'
ieee: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig,
“Time Complexity of Distributed Topological Self-stabilization: The Case of Graph
Linearization,” in LATIN 2010: Theoretical Informatics, 9th Latin American
Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 2010, vol. 6034,
pp. 294--305.'
mla: 'Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization:
The Case of Graph Linearization.” LATIN 2010: Theoretical Informatics, 9th
Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings,
vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.'
short: 'D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in:
LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico,
April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.'
date_created: 2018-03-28T07:22:42Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1007/978-3-642-12200-2_27
intvolume: ' 6034'
page: 294--305
publication: 'LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca,
Mexico, April 19-23, 2010. Proceedings'
publication_identifier:
isbn:
- 978-3-642-12199-9
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Time Complexity of Distributed Topological Self-stabilization: The Case of
Graph Linearization'
type: conference
user_id: '15504'
volume: 6034
year: '2010'
...
---
_id: '1906'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Richa AW, Zhang J, Scheideler C, Schmid S. Brief announcement: towards robust
medium access in multi-hop networks. In: Proceedings of the 29th Annual ACM
Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland,
July 25-28, 2010. ACM; 2010:114--115. doi:10.1145/1835698.1835726'
apa: 'Richa, A. W., Zhang, J., Scheideler, C., & Schmid, S. (2010). Brief announcement:
towards robust medium access in multi-hop networks. In Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010 (pp. 114--115). ACM. https://doi.org/10.1145/1835698.1835726'
bibtex: '@inproceedings{Richa_Zhang_Scheideler_Schmid_2010, title={Brief announcement:
towards robust medium access in multi-hop networks}, DOI={10.1145/1835698.1835726},
booktitle={Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010}, publisher={ACM},
author={Richa, Andrea W. and Zhang, Jin and Scheideler, Christian and Schmid,
Stefan}, year={2010}, pages={114--115} }'
chicago: 'Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid.
“Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.” In Proceedings
of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC
2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010. https://doi.org/10.1145/1835698.1835726.'
ieee: 'A. W. Richa, J. Zhang, C. Scheideler, and S. Schmid, “Brief announcement:
towards robust medium access in multi-hop networks,” in Proceedings of the
29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, 2010, pp. 114--115.'
mla: 'Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access
in Multi-Hop Networks.” Proceedings of the 29th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010,
ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.'
short: 'A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich,
Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.'
date_created: 2018-03-28T07:23:32Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '79'
doi: 10.1145/1835698.1835726
page: 114--115
publication: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010
publication_identifier:
isbn:
- 978-1-60558-888-9
publisher: ACM
status: public
title: 'Brief announcement: towards robust medium access in multi-hop networks'
type: conference
user_id: '15504'
year: '2010'
...
---
_id: '1907'
author:
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: 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: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. A Jamming-Resistant MAC Protocol
for Multi-Hop Wireless Networks. In: Distributed Computing, 24th International
Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings.
Vol 6343. Lecture Notes in Computer Science. Springer; 2010:179--193. doi:10.1007/978-3-642-15763-9_17'
apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2010). A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings (Vol. 6343, pp. 179--193). Springer. https://doi.org/10.1007/978-3-642-15763-9_17
bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2010, series={Lecture Notes
in Computer Science}, title={A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks}, volume={6343}, DOI={10.1007/978-3-642-15763-9_17},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Richa,
Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2010},
pages={179--193}, collection={Lecture Notes in Computer Science} }'
chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A
Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.” In Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science.
Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_17.
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “A Jamming-Resistant
MAC Protocol for Multi-Hop Wireless Networks,” in Distributed Computing, 24th
International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010.
Proceedings, 2010, vol. 6343, pp. 179--193.
mla: Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless
Networks.” Distributed Computing, 24th International Symposium, DISC 2010,
Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer,
2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings, Springer, 2010, pp. 179--193.'
date_created: 2018-03-28T07:24:22Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_17
intvolume: ' 6343'
page: 179--193
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publication_identifier:
isbn:
- 978-3-642-15762-2
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1908'
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. Brief Announcement:
Stabilizing Consensus with the Power of Two Choices. In: Distributed Computing,
24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15,
2010. Proceedings. Vol 6343. Lecture Notes in Computer Science. Springer;
2010:528--530. doi:10.1007/978-3-642-15763-9_50'
apa: 'Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., & Scheideler,
C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices.
In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.
https://doi.org/10.1007/978-3-642-15763-9_50'
bibtex: '@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2010, series={Lecture
Notes in Computer Science}, title={Brief Announcement: Stabilizing Consensus with
the Power of Two Choices}, volume={6343}, DOI={10.1007/978-3-642-15763-9_50},
booktitle={Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings}, publisher={Springer}, author={Doerr,
Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and
Scheideler, Christian}, year={2010}, pages={528--530}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald,
and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” In Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530.
Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-15763-9_50.'
ieee: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Brief
Announcement: Stabilizing Consensus with the Power of Two Choices,” in Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, 2010, vol. 6343, pp. 528--530.'
mla: 'Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the
Power of Two Choices.” Distributed Computing, 24th International Symposium,
DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343,
Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.'
short: 'B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed
Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September
13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.'
date_created: 2018-03-28T07:25:45Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '79'
doi: 10.1007/978-3-642-15763-9_50
intvolume: ' 6343'
page: 528--530
publication: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge,
MA, USA, September 13-15, 2010. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Brief Announcement: Stabilizing Consensus with the Power of Two Choices'
type: conference
user_id: '15504'
volume: 6343
year: '2010'
...
---
_id: '1925'
author:
- first_name: Robert
full_name: D. Kleinberg, Robert
last_name: D. Kleinberg
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: D. Kleinberg R, Scheideler C. Foreword. Theory Comput Syst. 2009;(2):187.
doi:10.1007/s00224-009-9202-x
apa: D. Kleinberg, R., & Scheideler, C. (2009). Foreword. Theory Comput.
Syst., (2), 187. https://doi.org/10.1007/s00224-009-9202-x
bibtex: '@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={10.1007/s00224-009-9202-x},
number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler,
Christian}, year={2009}, pages={187} }'
chicago: 'D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory
Comput. Syst., no. 2 (2009): 187. https://doi.org/10.1007/s00224-009-9202-x.'
ieee: R. D. Kleinberg and C. Scheideler, “Foreword,” Theory Comput. Syst.,
no. 2, p. 187, 2009.
mla: D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” Theory Comput.
Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
short: R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.
date_created: 2018-03-29T09:01:30Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-009-9202-x
issue: '2'
page: '187'
publication: Theory Comput. Syst.
status: public
title: Foreword
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1927'
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. Theory Comput
Syst. 2009;(2):234--260. doi:10.1007/s00224-008-9099-9
apa: Awerbuch, B., & Scheideler, C. (2009). Towards a Scalable and Robust DHT.
Theory Comput. Syst., (2), 234--260. https://doi.org/10.1007/s00224-008-9099-9
bibtex: '@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust
DHT}, DOI={10.1007/s00224-008-9099-9},
number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={234--260} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2 (2009): 234--260. https://doi.org/10.1007/s00224-008-9099-9.'
ieee: B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” Theory
Comput. Syst., no. 2, pp. 234--260, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust
DHT.” Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
short: B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.
date_created: 2018-03-29T09:08:11Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '79'
doi: 10.1007/s00224-008-9099-9
issue: '2'
page: 234--260
publication: Theory Comput. Syst.
status: public
title: Towards a Scalable and Robust DHT
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1928'
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. Theor Comput Sci. 2009;(6-7):453--466. doi:10.1016/j.tcs.2008.10.003
apa: Awerbuch, B., & Scheideler, C. (2009). Robust random number generation
for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466. https://doi.org/10.1016/j.tcs.2008.10.003
bibtex: '@article{Awerbuch_Scheideler_2009, title={Robust random number generation
for peer-to-peer systems}, DOI={10.1016/j.tcs.2008.10.003},
number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2009}, pages={453--466} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7 (2009): 453--466.
https://doi.org/10.1016/j.tcs.2008.10.003.'
ieee: B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer
systems,” Theor. Comput. Sci., no. 6–7, pp. 453--466, 2009.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation
for Peer-to-Peer Systems.” Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466,
doi:10.1016/j.tcs.2008.10.003.
short: B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.
date_created: 2018-03-29T09:08:12Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2008.10.003
issue: 6-7
page: 453--466
publication: Theor. Comput. Sci.
status: public
title: Robust random number generation for peer-to-peer systems
type: journal_article
user_id: '15504'
year: '2009'
...
---
_id: '1929'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II. Vol 5556. Lecture Notes in
Computer Science. Springer; 2009:571--582. doi:10.1007/978-3-642-02930-1_47'
apa: Scheideler, C., & Schmid, S. (2009). A Distributed and Oblivious Heap.
In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp.
571--582). Springer. https://doi.org/10.1007/978-3-642-02930-1_47
bibtex: '@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer
Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={10.1007/978-3-642-02930-1_47},
booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer},
author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582},
collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious
Heap.” In Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582.
Lecture Notes in Computer Science. Springer, 2009. https://doi.org/10.1007/978-3-642-02930-1_47.
ieee: C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in Automata,
Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes,
Greece, July 5-12, 2009, Proceedings, Part II, 2009, vol. 5556, pp. 571--582.
mla: Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”
Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP
2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer,
2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
short: 'C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th
Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings,
Part II, Springer, 2009, pp. 571--582.'
date_created: 2018-03-29T09:08:14Z
date_updated: 2022-01-06T06:54:01Z
department:
- _id: '79'
doi: 10.1007/978-3-642-02930-1_47
intvolume: ' 5556'
page: 571--582
publication: Automata, Languages and Programming, 36th Internatilonal Colloquium,
ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II
publication_identifier:
isbn:
- 978-3-642-02929-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Distributed and Oblivious Heap
type: conference
user_id: '15504'
volume: 5556
year: '2009'
...
---
_id: '1930'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Stephan
full_name: Ritscher, Stephan
last_name: Ritscher
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local
Delaunay Graph Construction. In: Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings.
Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:10.1007/978-3-642-10631-6_78'
apa: Jacob, R., Ritscher, S., Scheideler, C., & Schmid, S. (2009). A Self-stabilizing
and Local Delaunay Graph Construction. In Algorithms and Computation, 20th
International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009.
Proceedings (Vol. 5878, pp. 771--780). Springer. https://doi.org/10.1007/978-3-642-10631-6_78
bibtex: '@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes
in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction},
volume={5878}, DOI={10.1007/978-3-642-10631-6_78},
booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer},
author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid,
Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer
Science} }'
chicago: Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
“A Self-Stabilizing and Local Delaunay Graph Construction.” In Algorithms and
Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA,
December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer
Science. Springer, 2009. https://doi.org/10.1007/978-3-642-10631-6_78.
ieee: R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and
Local Delaunay Graph Construction,” in Algorithms and Computation, 20th International
Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings,
2009, vol. 5878, pp. 771--780.
mla: Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”
Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu,
Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009,
pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
short: 'R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation,
20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18,
2009. Proceedings, Springer, 2009, pp. 771--780.'
date_created: 2018-03-29T09:12:59Z
date_updated: 2022-01-06T06:54:02Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-10631-6_78
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:05:53Z
date_updated: 2018-04-13T10:05:53Z
file_id: '2342'
file_name: isaac09.pdf
file_size: 139275
relation: main_file
file_date_updated: 2018-04-13T10:05:53Z
has_accepted_license: '1'
intvolume: ' 5878'
oa: '1'
page: 771--780
publication: Algorithms and Computation, 20th International Symposium, ISAAC 2009,
Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: A Self-stabilizing and Local Delaunay Graph Construction
type: conference
urn: '19304'
user_id: '15504'
volume: 5878
year: '2009'
...
---
_id: '1932'
author:
- 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: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic
time algorithm for self-stabilizing skip graphs. In: Proceedings of the 28th
Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary,
Alberta, Canada, August 10-12, 2009. ; 2009:131--140. doi:10.1145/1582716.1582741'
apa: Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2009).
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).
https://doi.org/10.1145/1582716.1582741
bibtex: '@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={10.1145/1582716.1582741},
booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob,
Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig,
Hanjo}, year={2009}, pages={131--140} }'
chicago: Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” In Proceedings of the 28th Annual ACM Symposium on Principles
of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
131--140, 2009. https://doi.org/10.1145/1582716.1582741.
ieee: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed
polylogarithmic time algorithm for self-stabilizing skip graphs,” in Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.
mla: Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing
Skip Graphs.” Proceedings of the 28th Annual ACM Symposium on Principles of
Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009,
2009, pp. 131--140, doi:10.1145/1582716.1582741.
short: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings
of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC
2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.'
date_created: 2018-03-29T09:16:22Z
date_updated: 2022-01-06T06:54:02Z
department:
- _id: '79'
doi: 10.1145/1582716.1582741
page: 131--140
publication: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed
Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009
publication_identifier:
isbn:
- 978-1-60558-396-9
status: public
title: A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
type: conference
user_id: '15504'
year: '2009'
...
---
_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'
...
---
_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: '2043'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of
Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2006). The Effect of Faults on Network Expansion. Theory Comput. Syst.,
(6), 903--928. https://doi.org/10.1007/s00224-006-1349-0
bibtex: '@article{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2006, title={The
Effect of Faults on Network Expansion}, DOI={10.1007/s00224-006-1349-0},
number={6}, journal={Theory Comput. Syst.}, author={Bagchi, Amitabha and Bhargava,
Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler, Christian}, year={2006},
pages={903--928} }'
chicago: 'Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” Theory Comput.
Syst., no. 6 (2006): 903--928. https://doi.org/10.1007/s00224-006-1349-0.'
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp.
903--928, 2006.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” Theory
Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
short: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory
Comput. Syst. (2006) 903--928.
date_created: 2018-03-29T12:32:54Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
doi: 10.1007/s00224-006-1349-0
issue: '6'
page: 903--928
publication: Theory Comput. Syst.
status: public
title: The Effect of Faults on Network Expansion
type: journal_article
user_id: '15504'
year: '2006'
...
---
_id: '2213'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Towards a paradigm for robust distributed algorithms and data
structures. In: 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing. ; 2006.'
apa: Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms
and data structures. In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing.
bibtex: '@inproceedings{Scheideler_2006, title={Towards a paradigm for robust distributed
algorithms and data structures}, booktitle={6th International HNI Symposium on
New Trends in Parallel and Distributed Computing}, author={Scheideler, Christian},
year={2006} }'
chicago: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
ieee: C. Scheideler, “Towards a paradigm for robust distributed algorithms and data
structures,” in 6th International HNI Symposium on New Trends in Parallel and
Distributed Computing, 2006.
mla: Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms
and Data Structures.” 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.
short: 'C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel
and Distributed Computing, 2006.'
date_created: 2018-04-05T07:06:44Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T09:59:14Z
date_updated: 2018-04-13T09:59:14Z
file_id: '2336'
file_name: HNI-Symposium-06.pdf
file_size: 85116
relation: main_file
file_date_updated: 2018-04-13T09:59:14Z
has_accepted_license: '1'
oa: '1'
publication: 6th International HNI Symposium on New Trends in Parallel and Distributed
Computing
status: public
title: Towards a paradigm for robust distributed algorithms and data structures
type: conference
urn: '22137'
user_id: '15504'
year: '2006'
...
---
_id: '2114'
author:
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make
Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.'
apa: Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment. In ISPAN
(pp. 182--187).
bibtex: '@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN},
author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187}
}'
chicago: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN,
182--187, 2005.
ieee: M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to
Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005,
pp. 182--187.
mla: Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures,
or How to Make Search Trees Robust in a Distributed Environment.” ISPAN,
2005, pp. 182--187.
short: 'M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.'
date_created: 2018-04-03T05:25:16Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:45:41Z
date_updated: 2018-04-13T08:45:41Z
file_id: '2325'
file_name: KS-ISPAN-05-TransData.pdf
file_size: 110389
relation: main_file
file_date_updated: 2018-04-13T08:45:41Z
has_accepted_license: '1'
oa: '1'
page: 182--187
publication: ISPAN
status: public
title: Transparent Data Structures, or How to Make Search Trees Robust in a Distributed
Environment
type: conference
urn: '21146'
user_id: '15504'
year: '2005'
...
---
_id: '2115'
author:
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN.
; 2005:188--193.'
apa: Kothapalli, K., & Scheideler, C. (2005). Supervised Peer-to-Peer Systems.
In ISPAN (pp. 188--193).
bibtex: '@inproceedings{Kothapalli_Scheideler_2005, title={Supervised Peer-to-Peer
Systems}, booktitle={ISPAN}, author={Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={188--193} }'
chicago: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer
Systems.” In ISPAN, 188--193, 2005.
ieee: K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN,
2005, pp. 188--193.
mla: Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.”
ISPAN, 2005, pp. 188--193.
short: 'K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.'
date_created: 2018-04-03T05:26:10Z
date_updated: 2022-01-06T06:54:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:50:40Z
date_updated: 2018-04-13T08:50:40Z
file_id: '2326'
file_name: KS-ISPAN-05-Supervised.pdf
file_size: 69350
relation: main_file
file_date_updated: 2018-04-13T08:50:40Z
has_accepted_license: '1'
oa: '1'
page: 188--193
publication: ISPAN
status: public
title: Supervised Peer-to-Peer Systems
type: conference
urn: '21156'
user_id: '15504'
year: '2005'
...
---
_id: '2116'
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: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and
Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.'
apa: Onus, M., W. Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).
bibtex: '@inproceedings{Onus_W. Richa_Kothapalli_Scheideler_2005, title={Efficient
Broadcasting and Gathering in Wireless Ad-Hoc Networks}, booktitle={ISPAN}, author={Onus,
Melih and W. Richa, Andrea and Kothapalli, Kishore and Scheideler, Christian},
year={2005}, pages={346--351} }'
chicago: Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler.
“Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN,
346--351, 2005.
ieee: M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting
and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.
mla: Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc
Networks.” ISPAN, 2005, pp. 346--351.
short: 'M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp.
346--351.'
date_created: 2018-04-03T05:26:50Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:55:51Z
date_updated: 2018-04-13T08:55:51Z
file_id: '2327'
file_name: KORS-ISPAN-05.pdf
file_size: 135267
relation: main_file
file_date_updated: 2018-04-13T08:55:51Z
has_accepted_license: '1'
oa: '1'
page: 346--351
publication: ISPAN
status: public
title: Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
type: conference
urn: '21165'
user_id: '15504'
year: '2005'
...
---
_id: '2117'
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: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
citation:
ama: 'Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners
for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.'
apa: Kothapalli, K., Scheideler, C., Onus, M., & W. Richa, A. (2005). Constant
density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).
bibtex: '@inproceedings{Kothapalli_Scheideler_Onus_W. Richa_2005, title={Constant
density spanners for wireless ad-hoc networks}, booktitle={SPAA}, author={Kothapalli,
Kishore and Scheideler, Christian and Onus, Melih and W. Richa, Andrea}, year={2005},
pages={116--125} }'
chicago: Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa.
“Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125,
2005.
ieee: K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density
spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.
mla: Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc
Networks.” SPAA, 2005, pp. 116--125.
short: 'K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp.
116--125.'
date_created: 2018-04-03T05:28:33Z
date_updated: 2022-01-06T06:54:48Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:56:49Z
date_updated: 2018-04-13T08:56:49Z
file_id: '2328'
file_name: SPAA-05.pdf
file_size: 118644
relation: main_file
file_date_updated: 2018-04-13T08:56:49Z
has_accepted_license: '1'
oa: '1'
page: 116--125
publication: SPAA
status: public
title: Constant density spanners for wireless ad-hoc networks
type: conference
urn: '21175'
user_id: '15504'
year: '2005'
...
---
_id: '2118'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ;
2005:704--713.'
apa: 'Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC
(pp. 704--713).'
bibtex: '@inproceedings{Scheideler_2005, title={How to spread adversarial nodes?:
rotate!}, booktitle={STOC}, author={Scheideler, Christian}, year={2005}, pages={704--713}
}'
chicago: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In
STOC, 704--713, 2005.'
ieee: 'C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC,
2005, pp. 704--713.'
mla: 'Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC,
2005, pp. 704--713.'
short: 'C. Scheideler, in: STOC, 2005, pp. 704--713.'
date_created: 2018-04-03T05:29:27Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:58:22Z
date_updated: 2018-04-13T08:58:22Z
file_id: '2330'
file_name: STOC-05.pdf
file_size: 134460
relation: main_file
file_date_updated: 2018-04-13T08:58:22Z
has_accepted_license: '1'
oa: '1'
page: 704--713
publication: STOC
status: public
title: 'How to spread adversarial nodes?: rotate!'
type: conference
urn: '21185'
user_id: '15504'
year: '2005'
...
---
_id: '2212'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop
on Wireless Communications. ; 2005.'
apa: Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA
Workshop on Wireless Communications.
bibtex: '@inproceedings{Scheideler_2005, title={Overlay networks for wireless ad
hoc networks}, booktitle={IMA Workshop on Wireless Communications}, author={Scheideler,
Christian}, year={2005} }'
chicago: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.”
In IMA Workshop on Wireless Communications, 2005.
ieee: C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA
Workshop on Wireless Communications, 2005.
mla: Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA
Workshop on Wireless Communications, 2005.
short: 'C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.'
date_created: 2018-04-05T07:05:16Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:57:39Z
date_updated: 2018-04-13T08:57:39Z
file_id: '2329'
file_name: IMA-05.pdf
file_size: 295333
relation: main_file
file_date_updated: 2018-04-13T08:57:39Z
has_accepted_license: '1'
oa: '1'
publication: IMA Workshop on Wireless Communications
status: public
title: Overlay networks for wireless ad hoc networks
type: conference
urn: '22129'
user_id: '15504'
year: '2005'
...
---
_id: '2119'
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. Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1
apa: Kolman, P., & Scheideler, C. (2004). Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233. https://doi.org/10.1007/s00453-004-1086-1
bibtex: '@article{Kolman_Scheideler_2004, title={Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem}, DOI={10.1007/s00453-004-1086-1},
number={3}, journal={Algorithmica}, author={Kolman, Petr and Scheideler, Christian},
year={2004}, pages={209--233} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” Algorithmica, no. 3 (2004): 209--233.
https://doi.org/10.1007/s00453-004-1086-1.'
ieee: P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint
Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” Algorithmica, no. 3, 2004, pp. 209--233,
doi:10.1007/s00453-004-1086-1.
short: P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.
date_created: 2018-04-03T05:30:23Z
date_updated: 2022-01-06T06:54:49Z
department:
- _id: '79'
doi: 10.1007/s00453-004-1086-1
issue: '3'
page: 209--233
publication: Algorithmica
status: public
title: Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
type: journal_article
user_id: '15504'
year: '2004'
...
---
_id: '2120'
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. Group Spreading: A Protocol for Provably Secure
Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer
Science. ; 2004:183--195.'
apa: 'Awerbuch, B., & Scheideler, C. (2004). Group Spreading: A Protocol for
Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).'
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer
Science}, title={Group Spreading: A Protocol for Provably Secure Distributed Name
Service}, volume={3142}, booktitle={ICALP}, author={Awerbuch, Baruch and Scheideler,
Christian}, year={2004}, pages={183--195}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol
for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195.
Lecture Notes in Computer Science, 2004.'
ieee: 'B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably
Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.'
mla: 'Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for
Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp.
183--195.'
short: 'B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.'
date_created: 2018-04-03T05:31:04Z
date_updated: 2022-01-06T06:54:49Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:20:16Z
date_updated: 2018-04-12T09:20:16Z
file_id: '2312'
file_name: ICALP-04.pdf
file_size: 145383
relation: main_file
file_date_updated: 2018-04-12T09:20:16Z
has_accepted_license: '1'
intvolume: ' 3142'
oa: '1'
page: 183--195
publication: ICALP
series_title: Lecture Notes in Computer Science
status: public
title: 'Group Spreading: A Protocol for Provably Secure Distributed Name Service'
type: conference
urn: '21200'
user_id: '15504'
volume: 3142
year: '2004'
...
---
_id: '2121'
author:
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Riley C, Scheideler C. A Distributed Hash Table for Computational Grids. In:
IPDPS. ; 2004.'
apa: Riley, C., & Scheideler, C. (2004). A Distributed Hash Table for Computational
Grids. In IPDPS.
bibtex: '@inproceedings{Riley_Scheideler_2004, title={A Distributed Hash Table for
Computational Grids}, booktitle={IPDPS}, author={Riley, Chris and Scheideler,
Christian}, year={2004} }'
chicago: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational
Grids.” In IPDPS, 2004.
ieee: C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,”
in IPDPS, 2004.
mla: Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational
Grids.” IPDPS, 2004.
short: 'C. Riley, C. Scheideler, in: IPDPS, 2004.'
date_created: 2018-04-03T05:31:59Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:50:26Z
date_updated: 2018-04-12T09:50:26Z
file_id: '2316'
file_name: IPDPS-04.pdf
file_size: 91542
relation: main_file
file_date_updated: 2018-04-12T09:50:26Z
has_accepted_license: '1'
oa: '1'
publication: IPDPS
status: public
title: A Distributed Hash Table for Computational Grids
type: conference
urn: '21212'
user_id: '15504'
year: '2004'
...
---
_id: '2122'
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 Distributed Name Service. In: IPTPS.
Vol 3279. Lecture Notes in Computer Science. ; 2004:237--249.'
apa: Awerbuch, B., & Scheideler, C. (2004). Robust Distributed Name Service.
In IPTPS (Vol. 3279, pp. 237--249).
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, series={Lecture Notes in Computer
Science}, title={Robust Distributed Name Service}, volume={3279}, booktitle={IPTPS},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={237--249},
collection={Lecture Notes in Computer Science} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.
ieee: B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS,
2004, vol. 3279, pp. 237--249.
mla: Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.”
IPTPS, vol. 3279, 2004, pp. 237--249.
short: 'B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.'
date_created: 2018-04-03T05:32:33Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T11:39:38Z
date_updated: 2018-04-12T11:39:38Z
file_id: '2318'
file_name: IPTPS-04.pdf
file_size: 136987
relation: main_file
file_date_updated: 2018-04-12T11:39:38Z
has_accepted_license: '1'
intvolume: ' 3279'
oa: '1'
page: 237--249
publication: IPTPS
series_title: Lecture Notes in Computer Science
status: public
title: Robust Distributed Name Service
type: conference
urn: '21229'
user_id: '15504'
volume: 3279
year: '2004'
...
---
_id: '2123'
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.
In: IWIA. ; 2004:33--47.'
apa: Ateniese, G., Riley, C., & Scheideler, C. (2004). Survivable Monitoring
in Dynamic Networks. In IWIA (pp. 33--47).
bibtex: '@inproceedings{Ateniese_Riley_Scheideler_2004, title={Survivable Monitoring
in Dynamic Networks}, booktitle={IWIA}, author={Ateniese, Giuseppe and Riley,
Chris and Scheideler, Christian}, year={2004}, pages={33--47} }'
chicago: Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable
Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.
ieee: G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic
Networks,” in IWIA, 2004, pp. 33--47.
mla: Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA,
2004, pp. 33--47.
short: 'G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.'
date_created: 2018-04-03T05:33:37Z
date_updated: 2022-01-06T06:54:50Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T11:38:22Z
date_updated: 2018-04-12T11:38:22Z
file_id: '2317'
file_name: IIAW-04.pdf
file_size: 255111
relation: main_file
file_date_updated: 2018-04-12T11:38:22Z
has_accepted_license: '1'
oa: '1'
page: 33--47
publication: IWIA
status: public
title: Survivable Monitoring in Dynamic Networks
type: conference
urn: '21238'
user_id: '15504'
year: '2004'
...
---
_id: '2124'
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. The hyperring: a low-congestion deterministic data
structure for distributed environments. In: SODA. ; 2004:318--327.'
apa: 'Awerbuch, B., & Scheideler, C. (2004). The hyperring: a low-congestion
deterministic data structure for distributed environments. In SODA (pp.
318--327).'
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={The hyperring: a low-congestion
deterministic data structure for distributed environments}, booktitle={SODA},
author={Awerbuch, Baruch and Scheideler, Christian}, year={2004}, pages={318--327}
}'
chicago: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
Deterministic Data Structure for Distributed Environments.” In SODA, 318--327,
2004.'
ieee: 'B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic
data structure for distributed environments,” in SODA, 2004, pp. 318--327.'
mla: 'Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion
Deterministic Data Structure for Distributed Environments.” SODA, 2004,
pp. 318--327.'
short: 'B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.'
date_created: 2018-04-03T05:34:17Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T08:36:08Z
date_updated: 2018-04-13T08:36:08Z
file_id: '2323'
file_name: SODA-04.pdf
file_size: 193831
relation: main_file
file_date_updated: 2018-04-13T08:36:08Z
has_accepted_license: '1'
oa: '1'
page: 318--327
publication: SODA
status: public
title: 'The hyperring: a low-congestion deterministic data structure for distributed
environments'
type: conference
urn: '21247'
user_id: '15504'
year: '2004'
...
---
_id: '2125'
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. Consistent and compact data management in distributed
storage systems. In: SPAA. ; 2004:44--53.'
apa: Awerbuch, B., & Scheideler, C. (2004). Consistent and compact data management
in distributed storage systems. In SPAA (pp. 44--53).
bibtex: '@inproceedings{Awerbuch_Scheideler_2004, title={Consistent and compact
data management in distributed storage systems}, booktitle={SPAA}, author={Awerbuch,
Baruch and Scheideler, Christian}, year={2004}, pages={44--53} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data
Management in Distributed Storage Systems.” In SPAA, 44--53, 2004.
ieee: B. Awerbuch and C. Scheideler, “Consistent and compact data management in
distributed storage systems,” in SPAA, 2004, pp. 44--53.
mla: Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management
in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.
short: 'B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.'
date_created: 2018-04-03T05:34:56Z
date_updated: 2022-01-06T06:54:51Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:41:38Z
date_updated: 2018-04-12T09:41:38Z
file_id: '2315'
file_name: AS-SPAA-04.pdf
file_size: 170429
relation: main_file
file_date_updated: 2018-04-12T09:41:38Z
has_accepted_license: '1'
oa: '1'
page: 44--53
publication: SPAA
status: public
title: Consistent and compact data management in distributed storage systems
type: conference
urn: '21256'
user_id: '15504'
year: '2004'
...
---
_id: '2126'
author:
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Kishore
full_name: Kothapalli, Kishore
last_name: Kothapalli
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Mark
full_name: Thober, Mark
last_name: Thober
citation:
ama: 'Bhargava A, Kothapalli K, Riley C, Scheideler C, Thober M. Pagoda: a dynamic
overlay network for routing, data management, and multicasting. In: SPAA.
; 2004:170--179.'
apa: 'Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., & Thober, M.
(2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting.
In SPAA (pp. 170--179).'
bibtex: '@inproceedings{Bhargava_Kothapalli_Riley_Scheideler_Thober_2004, title={Pagoda:
a dynamic overlay network for routing, data management, and multicasting}, booktitle={SPAA},
author={Bhargava, Ankur and Kothapalli, Kishore and Riley, Chris and Scheideler,
Christian and Thober, Mark}, year={2004}, pages={170--179} }'
chicago: 'Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler,
and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management,
and Multicasting.” In SPAA, 170--179, 2004.'
ieee: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda:
a dynamic overlay network for routing, data management, and multicasting,” in
SPAA, 2004, pp. 170--179.'
mla: 'Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data
Management, and Multicasting.” SPAA, 2004, pp. 170--179.'
short: 'A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA,
2004, pp. 170--179.'
date_created: 2018-04-03T05:35:31Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:40:12Z
date_updated: 2018-04-12T09:40:42Z
file_id: '2314'
file_name: BKRST-SPAA-04.pdf
file_size: 118175
relation: main_file
file_date_updated: 2018-04-12T09:40:42Z
has_accepted_license: '1'
oa: '1'
page: 170--179
publication: SPAA
status: public
title: 'Pagoda: a dynamic overlay network for routing, data management, and multicasting'
type: conference
urn: '21266'
user_id: '15504'
year: '2004'
...
---
_id: '2127'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Ankur
full_name: Bhargava, Ankur
last_name: Bhargava
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The effect of
faults on network expansion. In: SPAA. ACM; 2004:286--293.'
apa: Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., & Scheideler, C.
(2004). The effect of faults on network expansion. In SPAA (pp. 286--293).
ACM.
bibtex: '@inproceedings{Bagchi_Bhargava_Chaudhary_Eppstein_Scheideler_2004, title={The
effect of faults on network expansion}, booktitle={SPAA}, publisher={ACM}, author={Bagchi,
Amitabha and Bhargava, Ankur and Chaudhary, Amitabh and Eppstein, David and Scheideler,
Christian}, year={2004}, pages={286--293} }'
chicago: Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and
Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA,
286--293. ACM, 2004.
ieee: A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The
effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.
mla: Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA,
ACM, 2004, pp. 286--293.
short: 'A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA,
ACM, 2004, pp. 286--293.'
date_created: 2018-04-03T05:36:11Z
date_updated: 2022-01-06T06:54:52Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:21:24Z
date_updated: 2018-04-12T09:21:24Z
file_id: '2313'
file_name: BBCES-SPAA-04.pdf
file_size: 197503
relation: main_file
file_date_updated: 2018-04-12T09:21:24Z
has_accepted_license: '1'
oa: '1'
page: 286--293
publication: SPAA
publisher: ACM
status: public
title: The effect of faults on network expansion
type: conference
urn: '21276'
user_id: '15504'
year: '2004'
...
---
_id: '19790'
abstract:
- lang: eng
text: The advances in Internet technology have led to tremendous improvements in
business, education, and science and have changed the way we think, live, and
communicate. Information exchange has become ubiquitous by the possibilities offered
through modern technologies. We are able to offer information 24 hours a day through
our web sites and can leave messages every time and from anywhere in the world.
This change in communication has led to new challenges. Enterprises have to deal
with an information amount that doubles every year. The technological foundation
to cope with this information explosion is given by Storage Area Networks (SANs),
which are able to connect a great number of storage systems over a fast interconnection
network. However, to be able to use the benefits of a SAN, an easy-to-use and
efficient management support has to be given to the storage administrator. In
this paper, we will suggest new storage management concepts and we will introduce
a new management environment that is able to significantly reduce management costs
and increases the performance and resource utilization of the given SAN infrastructure.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Mario
full_name: Vodisek, Mario
last_name: Vodisek
- first_name: Ulrich
full_name: Rückert, Ulrich
last_name: Rückert
citation:
ama: 'Scheideler C, Salzwedel K, Meyer auf der Heide F, Brinkmann A, Vodisek M,
Rückert U. Storage Management as Means to cope with Exponential Information Growth.
In: Proceedings of SSGRR 2003. ; 2003.'
apa: Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek,
M., & Rückert, U. (2003). Storage Management as Means to cope with Exponential
Information Growth. In Proceedings of SSGRR 2003.
bibtex: '@inproceedings{Scheideler_Salzwedel_Meyer auf der Heide_Brinkmann_Vodisek_Rückert_2003,
title={Storage Management as Means to cope with Exponential Information Growth},
booktitle={Proceedings of SSGRR 2003}, author={Scheideler, Christian and Salzwedel,
Kay and Meyer auf der Heide, Friedhelm and Brinkmann, André and Vodisek, Mario
and Rückert, Ulrich}, year={2003} }'
chicago: Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André
Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to
Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003,
2003.
ieee: C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
and U. Rückert, “Storage Management as Means to cope with Exponential Information
Growth,” in Proceedings of SSGRR 2003, 2003.
mla: Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential
Information Growth.” Proceedings of SSGRR 2003, 2003.
short: 'C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek,
U. Rückert, in: Proceedings of SSGRR 2003, 2003.'
date_created: 2020-09-30T12:04:14Z
date_updated: 2022-01-06T06:54:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '58'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-30T12:03:57Z
date_updated: 2020-09-30T12:03:57Z
file_id: '19793'
file_name: pub-hni-908.pdf
file_size: 499057
relation: main_file
success: 1
file_date_updated: 2020-09-30T12:03:57Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of SSGRR 2003
status: public
title: Storage Management as Means to cope with Exponential Information Growth
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '2128'
author:
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Damerow V, Meyer auf der Heide F, Räcke H, Scheideler C, Sohler C. Smoothed
Motion Complexity. In: ESA. Vol 2832. Lecture Notes in Computer Science.
Springer; 2003:161--171. doi:10.1007/978-3-540-39658-1_17'
apa: Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., & Sohler,
C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171).
Springer. https://doi.org/10.1007/978-3-540-39658-1_17
bibtex: '@inproceedings{Damerow_Meyer auf der Heide_Räcke_Scheideler_Sohler_2003,
series={Lecture Notes in Computer Science}, title={Smoothed Motion Complexity},
volume={2832}, DOI={10.1007/978-3-540-39658-1_17},
booktitle={ESA}, publisher={Springer}, author={Damerow, Valentina and Meyer auf
der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian},
year={2003}, pages={161--171}, collection={Lecture Notes in Computer Science}
}'
chicago: Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian
Scheideler, and Christian Sohler. “Smoothed Motion Complexity.” In ESA,
2832:161--171. Lecture Notes in Computer Science. Springer, 2003. https://doi.org/10.1007/978-3-540-39658-1_17.
ieee: V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler,
“Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.
mla: Damerow, Valentina, et al. “Smoothed Motion Complexity.” ESA, vol. 2832,
Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
short: 'V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler,
in: ESA, Springer, 2003, pp. 161--171.'
date_created: 2018-04-03T05:37:10Z
date_updated: 2022-01-06T06:54:52Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-540-39658-1_17
intvolume: ' 2832'
language:
- iso: eng
page: 161--171
publication: ESA
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Smoothed Motion Complexity
type: conference
user_id: '14955'
volume: 2832
year: '2003'
...