---
_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: '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: '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: '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'
...