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