---
_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'
...
---
_id: '2129'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Brinkmann A, Scheideler C. Anycasting in Adversarial Systems:
Routing and Admission Control. In: ICALP. Vol 2719. Lecture Notes in Computer
Science. Springer; 2003:1153--1168.'
apa: 'Awerbuch, B., Brinkmann, A., & Scheideler, C. (2003). Anycasting in Adversarial
Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168).
Springer.'
bibtex: '@inproceedings{Awerbuch_Brinkmann_Scheideler_2003, series={Lecture Notes
in Computer Science}, title={Anycasting in Adversarial Systems: Routing and Admission
Control}, volume={2719}, booktitle={ICALP}, publisher={Springer}, author={Awerbuch,
Baruch and Brinkmann, André and Scheideler, Christian}, year={2003}, pages={1153--1168},
collection={Lecture Notes in Computer Science} }'
chicago: 'Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting
in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168.
Lecture Notes in Computer Science. Springer, 2003.'
ieee: 'B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial
Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp.
1153--1168.'
mla: 'Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission
Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.'
short: 'B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp.
1153--1168.'
date_created: 2018-04-03T05:38:36Z
date_updated: 2022-01-06T06:54:53Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:04:48Z
date_updated: 2018-04-12T09:04:48Z
file_id: '2307'
file_name: ICALP-03.pdf
file_size: 154427
relation: main_file
file_date_updated: 2018-04-12T09:04:48Z
has_accepted_license: '1'
intvolume: ' 2719'
language:
- iso: eng
oa: '1'
page: 1153--1168
publication: ICALP
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Anycasting in Adversarial Systems: Routing and Admission Control'
type: conference
urn: '21297'
user_id: '14955'
volume: 2719
year: '2003'
...
---
_id: '2130'
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. Peer-to-peer systems for prefix search. In: PODC.
ACM; 2003:123--132.'
apa: Awerbuch, B., & Scheideler, C. (2003). Peer-to-peer systems for prefix
search. In PODC (pp. 123--132). ACM.
bibtex: '@inproceedings{Awerbuch_Scheideler_2003, title={Peer-to-peer systems for
prefix search}, booktitle={PODC}, publisher={ACM}, author={Awerbuch, Baruch and
Scheideler, Christian}, year={2003}, pages={123--132} }'
chicago: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix
Search.” In PODC, 123--132. ACM, 2003.
ieee: B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in
PODC, 2003, pp. 123--132.
mla: Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix
Search.” PODC, ACM, 2003, pp. 123--132.
short: 'B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.'
date_created: 2018-04-03T05:39:48Z
date_updated: 2022-01-06T06:54:53Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:10:10Z
date_updated: 2018-04-12T09:10:10Z
file_id: '2308'
file_name: PODC-03.pdf
file_size: 127013
relation: main_file
file_date_updated: 2018-04-12T09:10:10Z
has_accepted_license: '1'
oa: '1'
page: 123--132
publication: PODC
publisher: ACM
status: public
title: Peer-to-peer systems for prefix search
type: conference
urn: '21303'
user_id: '15504'
year: '2003'
...
---
_id: '2131'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Chris
full_name: Riley, Chris
last_name: Riley
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Riley C, Scheideler C. Perfectly Balanced Allocation. In: RANDOM-APPROX.
Vol 2764. Lecture Notes in Computer Science. Springer; 2003:240--251.'
apa: Czumaj, A., Riley, C., & Scheideler, C. (2003). Perfectly Balanced Allocation.
In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.
bibtex: '@inproceedings{Czumaj_Riley_Scheideler_2003, series={Lecture Notes in Computer
Science}, title={Perfectly Balanced Allocation}, volume={2764}, booktitle={RANDOM-APPROX},
publisher={Springer}, author={Czumaj, Artur and Riley, Chris and Scheideler, Christian},
year={2003}, pages={240--251}, collection={Lecture Notes in Computer Science}
}'
chicago: Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced
Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer
Science. Springer, 2003.
ieee: A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in
RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.
mla: Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX,
vol. 2764, Springer, 2003, pp. 240--251.
short: 'A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp.
240--251.'
date_created: 2018-04-03T05:41:01Z
date_updated: 2022-01-06T06:54:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:16:17Z
date_updated: 2018-04-12T09:16:17Z
file_id: '2310'
file_name: RANDOM-03.pdf
file_size: 112587
relation: main_file
file_date_updated: 2018-04-12T09:16:17Z
has_accepted_license: '1'
intvolume: ' 2764'
oa: '1'
page: 240--251
publication: RANDOM-APPROX
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Perfectly Balanced Allocation
type: conference
urn: '21313'
user_id: '15504'
volume: 2764
year: '2003'
...
---
_id: '2132'
author:
- first_name: Lujun
full_name: Jia, Lujun
last_name: Jia
- first_name: Rajmohan
full_name: Rajaraman, Rajmohan
last_name: Rajaraman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Jia L, Rajaraman R, Scheideler C. On local algorithms for topology control
and routing in ad hoc networks. In: SPAA. ACM; 2003:220--229.'
apa: Jia, L., Rajaraman, R., & Scheideler, C. (2003). On local algorithms for
topology control and routing in ad hoc networks. In SPAA (pp. 220--229).
ACM.
bibtex: '@inproceedings{Jia_Rajaraman_Scheideler_2003, title={On local algorithms
for topology control and routing in ad hoc networks}, booktitle={SPAA}, publisher={ACM},
author={Jia, Lujun and Rajaraman, Rajmohan and Scheideler, Christian}, year={2003},
pages={220--229} }'
chicago: Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms
for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229.
ACM, 2003.
ieee: L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology
control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.
mla: Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in
Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.
short: 'L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.'
date_created: 2018-04-03T05:41:53Z
date_updated: 2022-01-06T06:54:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:18:55Z
date_updated: 2018-04-12T09:18:55Z
file_id: '2311'
file_name: JRS-SPAA-03.pdf
file_size: 224200
relation: main_file
file_date_updated: 2018-04-12T09:18:55Z
has_accepted_license: '1'
oa: '1'
page: 220--229
publication: SPAA
publisher: ACM
status: public
title: On local algorithms for topology control and routing in ad hoc networks
type: conference
urn: '21320'
user_id: '15504'
year: '2003'
...
---
_id: '2133'
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. Information gathering in adversarial systems:
lines and cycles. In: SPAA. ACM; 2003:333--342.'
apa: 'Kothapalli, K., & Scheideler, C. (2003). Information gathering in adversarial
systems: lines and cycles. In SPAA (pp. 333--342). ACM.'
bibtex: '@inproceedings{Kothapalli_Scheideler_2003, title={Information gathering
in adversarial systems: lines and cycles}, booktitle={SPAA}, publisher={ACM},
author={Kothapalli, Kishore and Scheideler, Christian}, year={2003}, pages={333--342}
}'
chicago: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering
in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.'
ieee: 'K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems:
lines and cycles,” in SPAA, 2003, pp. 333--342.'
mla: 'Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial
Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.'
short: 'K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.'
date_created: 2018-04-03T05:42:48Z
date_updated: 2022-01-06T06:54:55Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:13:43Z
date_updated: 2018-04-12T09:15:24Z
file_id: '2309'
file_name: KS-SPAA-03.pdf
file_size: 121448
relation: main_file
file_date_updated: 2018-04-12T09:15:24Z
has_accepted_license: '1'
oa: '1'
page: 333--342
publication: SPAA
publisher: ACM
status: public
title: 'Information gathering in adversarial systems: lines and cycles'
type: conference
urn: '21338'
user_id: '15504'
year: '2003'
...
---
_id: '2134'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica.
2002;(3):361--399. doi:10.1007/s004930200018
apa: Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop
Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018
bibtex: '@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job
Shop Scheduling}, DOI={10.1007/s004930200018},
number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian},
year={2002}, pages={361--399} }'
chicago: 'Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.'
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,”
Combinatorica, no. 3, pp. 361--399, 2002.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
short: U. Feige, C. Scheideler, Combinatorica (2002) 361--399.
date_created: 2018-04-03T05:43:36Z
date_updated: 2022-01-06T06:54:55Z
department:
- _id: '79'
doi: 10.1007/s004930200018
issue: '3'
page: 361--399
publication: Combinatorica
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling
type: journal_article
user_id: '15504'
year: '2002'
...
---
_id: '2135'
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.
In: SODA. ACM/SIAM; 2002:184--193.'
apa: Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable
flow problem. In SODA (pp. 184--193). ACM/SIAM.
bibtex: '@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable
flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and
Scheideler, Christian}, year={2002}, pages={184--193} }'
chicago: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
in SODA, 2002, pp. 184--193.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
short: 'P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.'
date_created: 2018-04-03T05:44:11Z
date_updated: 2022-01-06T06:54:55Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:58Z
date_updated: 2018-04-12T08:59:58Z
file_id: '2303'
file_name: SODA-02.pdf
file_size: 246604
relation: main_file
file_date_updated: 2018-04-12T08:59:58Z
has_accepted_license: '1'
oa: '1'
page: 184--193
publication: SODA
publisher: ACM/SIAM
status: public
title: Improved bounds for the unsplittable flow problem
type: conference
urn: '21357'
user_id: '15504'
year: '2002'
...
---
_id: '2136'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes
for non-uniform requirements. In: SPAA. ; 2002:53--62.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive
placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive
placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann,
André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62}
}'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive
Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement
schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform
Requirements.” SPAA, 2002, pp. 53--62.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.'
date_created: 2018-04-03T05:44:56Z
date_updated: 2022-01-06T06:54:56Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:02:22Z
date_updated: 2018-04-12T09:02:22Z
file_id: '2305'
file_name: BSS-SPAA-02.pdf
file_size: 123373
relation: main_file
file_date_updated: 2018-04-12T09:02:22Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 53--62
publication: SPAA
status: public
title: Compact, adaptive placement schemes for non-uniform requirements
type: conference
urn: '21366'
user_id: '14955'
year: '2002'
...
---
_id: '2137'
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. In: SPAA. ; 2002:265--274.'
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms
for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).
bibtex: '@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms
for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi,
Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002},
pages={265--274} }'
chicago: Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA,
265--274, 2002.
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant
routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit
Switched Networks.” SPAA, 2002, pp. 265--274.
short: 'A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.'
date_created: 2018-04-03T05:45:44Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:03:44Z
date_updated: 2018-04-12T09:03:44Z
file_id: '2306'
file_name: BCKS-SPAA-02.pdf
file_size: 187124
relation: main_file
file_date_updated: 2018-04-12T09:03:44Z
has_accepted_license: '1'
oa: '1'
page: 265--274
publication: SPAA
status: public
title: Algorithms for fault-tolerant routing in circuit switched networks
type: conference
urn: '21376'
user_id: '15504'
year: '2002'
...
---
_id: '2138'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Models and Techniques for Communication in Dynamic Networks.
In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.'
apa: Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks.
In STACS (Vol. 2285, pp. 27--49). Springer.
bibtex: '@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science},
title={Models and Techniques for Communication in Dynamic Networks}, volume={2285},
booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002},
pages={27--49}, collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer,
2002.
ieee: C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,”
in STACS, 2002, vol. 2285, pp. 27--49.
mla: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
short: 'C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.'
date_created: 2018-04-03T05:46:38Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:01:03Z
date_updated: 2018-04-12T09:01:03Z
file_id: '2304'
file_name: STACS-02.pdf
file_size: 273875
relation: main_file
file_date_updated: 2018-04-12T09:01:03Z
has_accepted_license: '1'
intvolume: ' 2285'
oa: '1'
page: 27--49
publication: STACS
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Models and Techniques for Communication in Dynamic Networks
type: conference
urn: '21386'
user_id: '15504'
volume: 2285
year: '2002'
...
---
_id: '2139'
author:
- 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: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '2140'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies
for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.'
apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple
Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE
Computer Society.
bibtex: '@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple
Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE
Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann,
André and Scheideler, Christian}, year={2001}, pages={158--167} }'
chicago: Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler.
“Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167.
IEEE Computer Society, 2001.
ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing
Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.”
FOCS, IEEE Computer Society, 2001, pp. 158--167.
short: 'B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE
Computer Society, 2001, pp. 158--167.'
date_created: 2018-04-03T05:48:28Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:00Z
date_updated: 2018-04-12T08:59:00Z
file_id: '2302'
file_name: FOCS-01.pdf
file_size: 151156
relation: main_file
file_date_updated: 2018-04-12T08:59:00Z
has_accepted_license: '1'
oa: '1'
page: 158--167
publication: FOCS
publisher: IEEE Computer Society
status: public
title: Simple Routing Strategies for Adversarial Systems
type: conference
urn: '21406'
user_id: '15504'
year: '2001'
...
---
_id: '2141'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for
Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation
Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer
Society.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation
Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer
Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian},
year={2001}, pages={227--234} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A
Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE
Computer Society, 2001.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
for Storage Area Networks,” in PDP, 2001, pp. 227--234.
mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society,
2001, pp. 227--234.'
date_created: 2018-04-03T05:49:21Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:39:01Z
date_updated: 2018-04-12T08:39:01Z
file_id: '2298'
file_name: PDP-00.pdf
file_size: 85778
relation: main_file
file_date_updated: 2018-04-12T08:39:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 227--234
publication: PDP
publisher: IEEE Computer Society
status: public
title: SIMLAB-A Simulation Environment for Storage Area Networks
type: conference
urn: '21415'
user_id: '14955'
year: '2001'
...
---
_id: '2142'
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. In: SPAA. ; 2001:38--47.'
apa: Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the
maximum disjoint paths problem. In SPAA (pp. 38--47).
bibtex: '@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms
for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr
and Scheideler, Christian}, year={2001}, pages={38--47} }'
chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint
paths problem,” in SPAA, 2001, pp. 38--47.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
short: 'P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.'
date_created: 2018-04-03T05:50:16Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:58:07Z
date_updated: 2018-04-12T08:58:07Z
file_id: '2301'
file_name: SPAA-01.pdf
file_size: 335171
relation: main_file
file_date_updated: 2018-04-12T08:58:07Z
has_accepted_license: '1'
oa: '1'
page: 38--47
publication: SPAA
status: public
title: Simple on-line algorithms for the maximum disjoint paths problem
type: conference
urn: '21421'
user_id: '15504'
year: '2001'
...
---
_id: '2143'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless
Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
apa: Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies
for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.
https://doi.org/10.1007/s002240010006
bibtex: '@article{Adler_Scheideler_2000, title={Efficient Communication Strategies
for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006},
number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler,
Christian}, year={2000}, pages={337--391} }'
chicago: 'Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000):
337--391. https://doi.org/10.1007/s002240010006.'
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc
Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391,
2000.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6,
2000, pp. 337--391, doi:10.1007/s002240010006.
short: M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
date_created: 2018-04-03T05:51:02Z
date_updated: 2022-01-06T06:54:59Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240010006
intvolume: ' 33'
issue: 5/6
language:
- iso: eng
page: 337--391
publication: Theory Comput. Syst.
status: public
title: Efficient Communication Strategies for Ad Hoc Wireless Networks
type: journal_article
user_id: '14955'
volume: 33
year: '2000'
...
---
_id: '2145'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431'
apa: 'Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput.,
30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431'
bibtex: '@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431},
number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking,
Berthold}, year={2000}, pages={1126--1155} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.
30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol.
30, no. 4, pp. 1126--1155, 2000.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.,
vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.'
short: C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
date_created: 2018-04-03T06:12:15Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1137/S0097539799353431
intvolume: ' 30'
issue: '4'
language:
- iso: eng
page: 1126--1155
publication: SIAM J. Comput.
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: journal_article
user_id: '14955'
volume: 30
year: '2000'
...
---
_id: '2146'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage
Networks. In: PDPTA. ; 2000.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path
Selection for Storage Networks. In PDPTA.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed
Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra
and Brinkmann, André and Scheideler, Christian}, year={2000} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed
Path Selection for Storage Networks.” In PDPTA, 2000.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection
for Storage Networks,” in PDPTA, 2000.
mla: Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.”
PDPTA, 2000.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.'
date_created: 2018-04-03T06:13:07Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:47:50Z
date_updated: 2018-04-12T08:47:50Z
file_id: '2299'
file_name: PDPTA-00.pdf
file_size: 168677
relation: main_file
file_date_updated: 2018-04-12T08:47:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: PDPTA
status: public
title: Distributed Path Selection for Storage Networks
type: conference
urn: '21467'
user_id: '14955'
year: '2000'
...
---
_id: '2147'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma. In SODA (pp.
30--39).'
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA},
author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39}
}'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA,
30--39, 2000.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000,
pp. 30--39.'
short: 'A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.'
date_created: 2018-04-03T06:16:48Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:36:17Z
date_updated: 2018-04-12T08:36:17Z
file_id: '2295'
file_name: SODA-00.pdf
file_size: 185001
relation: main_file
file_date_updated: 2018-04-12T08:36:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 30--39
publication: SODA
status: public
title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general
Lovász local lemma'
type: conference
urn: '21476'
user_id: '14955'
year: '2000'
...
---
_id: '2148'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma. Random Struct.
Algorithms, 17(3–4), 213--237.'
bibtex: '@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4},
journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian},
year={2000}, pages={213--237} }'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms 17, no. 3–4 (2000): 213--237.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma,” Random Struct. Algorithms,
vol. 17, no. 3–4, pp. 213--237, 2000.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.'
short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
date_created: 2018-04-03T06:17:52Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
intvolume: ' 17'
issue: 3-4
language:
- iso: eng
page: 213--237
publication: Random Struct. Algorithms
status: public
title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general
Lovász local lemma'
type: journal_article
user_id: '14955'
volume: 17
year: '2000'
...
---
_id: '2149'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement
strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed
data placement strategies for storage area networks (extended abstract). In SPAA
(pp. 119--128).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed
data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA},
author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000},
pages={119--128} }'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient,
Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).”
In SPAA, 119--128, 2000.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data
placement strategies for storage area networks (extended abstract),” in SPAA,
2000, pp. 119--128.
mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies
for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.'
date_created: 2018-04-03T06:18:45Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:38:13Z
date_updated: 2018-04-12T08:38:13Z
file_id: '2297'
file_name: spaa_00.pdf
file_size: 222176
relation: main_file
file_date_updated: 2018-04-12T08:38:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 119--128
publication: SPAA
status: public
title: Efficient, distributed data placement strategies for storage area networks
(extended abstract)
type: conference
urn: '21493'
user_id: '14955'
year: '2000'
...