---
_id: '16482'
author:
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Juurlink B, Kolman P, Meyer auf der Heide F, Rieping I. Optimal broadcast on
parallel locality models. Journal of Discrete Algorithms. 2003:151-166.
doi:10.1016/s1570-8667(03)00023-6
apa: Juurlink, B., Kolman, P., Meyer auf der Heide, F., & Rieping, I. (2003).
Optimal broadcast on parallel locality models. Journal of Discrete Algorithms,
151–166. https://doi.org/10.1016/s1570-8667(03)00023-6
bibtex: '@article{Juurlink_Kolman_Meyer auf der Heide_Rieping_2003, title={Optimal
broadcast on parallel locality models}, DOI={10.1016/s1570-8667(03)00023-6},
journal={Journal of Discrete Algorithms}, author={Juurlink, Bernhardus and Kolman,
Petr and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={2003}, pages={151–166}
}'
chicago: Juurlink, Bernhardus, Petr Kolman, Friedhelm Meyer auf der Heide, and Ingo
Rieping. “Optimal Broadcast on Parallel Locality Models.” Journal of Discrete
Algorithms, 2003, 151–66. https://doi.org/10.1016/s1570-8667(03)00023-6.
ieee: B. Juurlink, P. Kolman, F. Meyer auf der Heide, and I. Rieping, “Optimal broadcast
on parallel locality models,” Journal of Discrete Algorithms, pp. 151–166,
2003.
mla: Juurlink, Bernhardus, et al. “Optimal Broadcast on Parallel Locality Models.”
Journal of Discrete Algorithms, 2003, pp. 151–66, doi:10.1016/s1570-8667(03)00023-6.
short: B. Juurlink, P. Kolman, F. Meyer auf der Heide, I. Rieping, Journal of Discrete
Algorithms (2003) 151–166.
date_created: 2020-04-09T07:33:09Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/s1570-8667(03)00023-6
language:
- iso: eng
page: 151-166
publication: Journal of Discrete Algorithms
publication_identifier:
issn:
- 1570-8667
publication_status: published
status: public
title: Optimal broadcast on parallel locality models
type: journal_article
user_id: '15415'
year: '2003'
...
---
_id: '16484'
citation:
ama: Rosenberg AL, Meyer auf der Heide F, eds. Proceedings of the Fifteenth Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03.; 2003.
doi:10.1145/777412
apa: Rosenberg, A. L., & Meyer auf der Heide, F. (Eds.). (2003). Proceedings
of the fifteenth annual ACM symposium on Parallel algorithms and architectures
- SPAA ’03. https://doi.org/10.1145/777412
bibtex: '@book{Rosenberg_Meyer auf der Heide_2003, title={Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03}, DOI={10.1145/777412}, year={2003} }'
chicago: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, eds. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03, 2003. https://doi.org/10.1145/777412.
ieee: A. L. Rosenberg and F. Meyer auf der Heide, Eds., Proceedings of the fifteenth
annual ACM symposium on Parallel algorithms and architectures - SPAA ’03.
2003.
mla: Rosenberg, Arnold L., and Friedhelm Meyer auf der Heide, editors. Proceedings
of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’03. 2003, doi:10.1145/777412.
short: A.L. Rosenberg, F. Meyer auf der Heide, eds., Proceedings of the Fifteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’03, 2003.
date_created: 2020-04-09T07:41:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/777412
editor:
- first_name: Arnold L.
full_name: Rosenberg, Arnold L.
last_name: Rosenberg
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
publication_identifier:
isbn:
- '1581136617'
publication_status: published
status: public
title: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and
architectures - SPAA '03
type: conference_editor
user_id: '15415'
year: '2003'
...
---
_id: '16720'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: N.
full_name: Bruls, N.
last_name: Bruls
- first_name: U.
full_name: Kastens, U.
last_name: Kastens
- first_name: D. K.
full_name: Le, D. K.
last_name: Le
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: J.-C.
full_name: Niemann, J.-C.
last_name: Niemann
- first_name: M.
full_name: Porrmann, M.
last_name: Porrmann
- first_name: U.
full_name: Rückert, U.
last_name: Rückert
- first_name: A.
full_name: Slowik, A.
last_name: Slowik
- first_name: M.
full_name: Thies, M.
last_name: Thies
citation:
ama: 'Bonorden O, Bruls N, Kastens U, et al. A holistic methodology for network
processor design. In: 28th Annual IEEE International Conference on Local Computer
Networks. ; 2003. doi:10.1109/LCN.2003.1243185'
apa: Bonorden, O., Bruls, N., Kastens, U., Le, D. K., Meyer auf der Heide, F., Niemann,
J.-C., … Thies, M. (2003). A holistic methodology for network processor design.
In 28th Annual IEEE International Conference on Local Computer Networks.
https://doi.org/10.1109/LCN.2003.1243185
bibtex: '@inproceedings{Bonorden_Bruls_Kastens_Le_Meyer auf der Heide_Niemann_Porrmann_Rückert_Slowik_Thies_2003,
title={A holistic methodology for network processor design}, DOI={10.1109/LCN.2003.1243185},
booktitle={28th Annual IEEE International Conference on Local Computer Networks},
author={Bonorden, Olaf and Bruls, N. and Kastens, U. and Le, D. K. and Meyer auf
der Heide, Friedhelm and Niemann, J.-C. and Porrmann, M. and Rückert, U. and Slowik,
A. and Thies, M.}, year={2003} }'
chicago: Bonorden, Olaf, N. Bruls, U. Kastens, D. K. Le, Friedhelm Meyer auf der
Heide, J.-C. Niemann, M. Porrmann, U. Rückert, A. Slowik, and M. Thies. “A Holistic
Methodology for Network Processor Design.” In 28th Annual IEEE International
Conference on Local Computer Networks, 2003. https://doi.org/10.1109/LCN.2003.1243185.
ieee: O. Bonorden et al., “A holistic methodology for network processor design,”
in 28th Annual IEEE International Conference on Local Computer Networks,
2003.
mla: Bonorden, Olaf, et al. “A Holistic Methodology for Network Processor Design.”
28th Annual IEEE International Conference on Local Computer Networks, 2003,
doi:10.1109/LCN.2003.1243185.
short: 'O. Bonorden, N. Bruls, U. Kastens, D.K. Le, F. Meyer auf der Heide, J.-C.
Niemann, M. Porrmann, U. Rückert, A. Slowik, M. Thies, in: 28th Annual IEEE International
Conference on Local Computer Networks, 2003.'
date_created: 2020-04-17T08:31:57Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/LCN.2003.1243185
language:
- iso: eng
publication: 28th Annual IEEE International Conference on Local Computer Networks
status: public
title: A holistic methodology for network processor design
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '19727'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested
BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In:
Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA). ; 2002:2202-2208.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example. In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA) (pp. 2202–2208).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques
and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2002}, pages={2202–2208} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example.” In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA), 2202–8, 2002.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient
Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,”
in Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA), 2002, pp. 2202–2208.'
mla: 'Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum
Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp.
2202–08.'
short: 'O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.'
date_created: 2020-09-28T10:49:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
page: 2202-2208
publication: Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA)
status: public
title: 'Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation
as an Instructive Example'
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19850'
author:
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36'
apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_36
bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing
Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
DOI={10.1007/3-540-36379-3_36},
booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
author={Wanka, Rolf}, year={2002}, pages={413–420} }'
chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal.” In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36.
ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG), 2002, pp. 413–420.
mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on
Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science
(WG), Berlin, Heidelberg, 2002, pp. 413–420.'
date_created: 2020-10-02T11:16:31Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/3-540-36379-3_36
language:
- iso: eng
page: 413-420
place: Berlin, Heidelberg
publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)
publication_identifier:
isbn:
- '9783540003311'
- '9783540363798'
issn:
- 0302-9743
publication_status: published
status: public
title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs
Is Asymptotically Optimal
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19873'
abstract:
- lang: eng
text: We present a new and easy to use framework for navigating through scenes of
arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints
and viewing directions are rendered and stored on an external volume. During navigation
each image can be displayed within a very short time by loading it from the volume.
For acceleration, our prefetching strategy loads possibly needed images for the
next few frames if the viewer takes a break. The measurements show that we achieve
interactive frame rates, whereby the difference between the minimal and maximal
display time is very small. Our system works well with scenes modelled by polygons,
but also digital photos can easily be used for describing a 3D scene.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Nicolas
full_name: Cuntz, Nicolas
last_name: Cuntz
citation:
ama: 'Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes
Using JPEG Compression. In: Proc. of 4. GI-Informatiktage. ; 2002:224-229.'
apa: Klein, J., Krokowski, J., & Cuntz, N. (2002). Realtime Navigation in Highly
Complex 3D-Scenes Using JPEG Compression. In Proc. of 4. GI-Informatiktage
(pp. 224–229).
bibtex: '@inproceedings{Klein_Krokowski_Cuntz_2002, title={Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression}, booktitle={Proc. of 4. GI-Informatiktage},
author={Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, year={2002}, pages={224–229}
}'
chicago: Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression.” In Proc. of 4. GI-Informatiktage,
224–29, 2002.
ieee: J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex
3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.
mla: Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG
Compression.” Proc. of 4. GI-Informatiktage, 2002, pp. 224–29.
short: 'J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.'
date_created: 2020-10-05T09:51:08Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 224-229
publication: Proc. of 4. GI-Informatiktage
status: public
title: Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '24336'
abstract:
- lang: eng
text: "We define here a distributed abstract state machine (DASM) [7] of
\r\nthe network or routing layer of mobile ad hoc networks [13]. Such networks
re-\r\nquire routing strategies substantially different from those used in static
commu-\r\nnication networks, since storing and updating large routing tables
\ at mobile \r\nhosts would congest the network with administration packets
\ very fast. In [1], \r\nthe hypercubic location service is presented,
\ which considers a very strong \r\ndefinition of fault-tolerance thereby
\ improving state-of-the-art ad hoc routing \r\nprotocols in several respects.
Our goal in modeling the protocols for the distrib-\r\nuted location service and
the position based routing is twofold. First, we support \r\nthe definition and
\ validation of wireless communication protocols and imple-\r\nmentations
based thereon. Second, we feel that the abstract computation model \r\nnaturally
reflects the layering principle of communication architectures in com-\r\nbination
with an uncompromisingly local view of the application domain. Thus \r\nwe can
identify fundamental semantic concepts, such as concurrency, reactivity \r\nand
\ asynchronism, directly with the related concepts as imposed by the
\ given \r\napplication context. "
author:
- first_name: András
full_name: ' Benczúr, András'
last_name: ' Benczúr'
- first_name: Uwe
full_name: Glässer, Uwe
last_name: Glässer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location
Service for Mobile Ad Hoc Networks. Proc of 10th International Workshop on
Abstract State Machines, LNCS. Published online 2002.
apa: Benczúr, A., Glässer, U., & Lukovszki, T. (2002). Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks. Proc. of 10th International
Workshop on Abstract State Machines, LNCS.
bibtex: '@article{ Benczúr_Glässer_Lukovszki_2002, title={Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks}, journal={Proc. of
10th International Workshop on Abstract State Machines, LNCS}, author={ Benczúr,
András and Glässer, Uwe and Lukovszki, Tamás}, year={2002} }'
chicago: Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description
of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th
International Workshop on Abstract State Machines, LNCS, 2002.
ieee: A. Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed
Location Service for Mobile Ad Hoc Networks,” Proc. of 10th International Workshop
on Abstract State Machines, LNCS, 2002.
mla: Benczúr, András, et al. “Formal Description of a Distributed Location Service
for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract
State Machines, LNCS, 2002.
short: A. Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop
on Abstract State Machines, LNCS (2002).
date_created: 2021-09-14T08:51:39Z
date_updated: 2022-01-06T06:56:18Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2021-09-14T09:09:28Z
date_updated: 2021-09-14T09:09:28Z
file_id: '24337'
file_name: asm03.pdf
file_size: 162215
relation: main_file
success: 1
file_date_updated: 2021-09-14T09:09:28Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proc. of 10th International Workshop on Abstract State Machines, LNCS
publication_status: published
status: public
title: Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '24338'
author:
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance
of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th
International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134'
apa: Grünewald, M., Lukovszki, T., Schindelhauer, C., & Volbert, K. (2002).
Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings
of the 8th International Euro-Par Conference. https://doi.org/10.1007/3-540-45706-2_134
bibtex: '@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn,
Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network
Topologies}, DOI={10.1007/3-540-45706-2_134},
booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald,
Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus},
year={2002} }'
chicago: Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus
Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”
In Proceedings of the 8th International Euro-Par Conference. Paderborn,
Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
ieee: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed
Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: 10.1007/3-540-45706-2_134.'
mla: Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient
Wireless Network Topologies.” Proceedings of the 8th International Euro-Par
Conference, 2002, doi:10.1007/3-540-45706-2_134.
short: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings
of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.'
date_created: 2021-09-14T09:15:57Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_134
language:
- iso: eng
place: Paderborn, Germany
publication: Proceedings of the 8th International Euro-Par Conference
publication_identifier:
issn:
- 0302-9743
publication_status: published
status: public
title: Distributed Maintenance of Resource Efficient Wireless Network Topologies
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '26412'
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Volbert K. A simulation environment for ad hoc networks using sector subdivision.
In: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based
Processing. ; 2002. doi:10.1109/empdp.2002.994324'
apa: Volbert, K. (2002). A simulation environment for ad hoc networks using sector
subdivision. Proceedings 10th Euromicro Workshop on Parallel, Distributed and
Network-Based Processing. https://doi.org/10.1109/empdp.2002.994324
bibtex: '@inproceedings{Volbert_2002, title={A simulation environment for ad hoc
networks using sector subdivision}, DOI={10.1109/empdp.2002.994324},
booktitle={Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing}, author={Volbert, Klaus}, year={2002} }'
chicago: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” In Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002. https://doi.org/10.1109/empdp.2002.994324.
ieee: 'K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”
2002, doi: 10.1109/empdp.2002.994324.'
mla: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002, doi:10.1109/empdp.2002.994324.
short: 'K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002.'
date_created: 2021-10-18T15:45:20Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/empdp.2002.994324
language:
- iso: eng
publication: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing
publication_status: published
status: public
title: A simulation environment for ad hoc networks using sector subdivision
type: conference
user_id: '15415'
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: '18853'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property
Testers. Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS). 2002:83-92.
apa: Sohler, C., & Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient
Property Testers. Proceedings of the 43th Symposium on Foundations of Computer
Science (FOCS), 83–92.
bibtex: '@article{Sohler_Czumaj_2002, title={Abstract Combinatorial Programs and
Efficient Property Testers}, journal={Proceedings of the 43th Symposium on Foundations
of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2002},
pages={83–92} }'
chicago: Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and
Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations
of Computer Science (FOCS), 2002, 83–92.
ieee: C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property
Testers,” Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS), pp. 83–92, 2002.
mla: Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient
Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer
Science (FOCS), 2002, pp. 83–92.
short: C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of
Computer Science (FOCS) (2002) 83–92.
date_created: 2020-09-02T12:08:22Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
language:
- iso: eng
page: 83-92
publication: Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS)
status: public
title: Abstract Combinatorial Programs and Efficient Property Testers
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '18961'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: A.
full_name: Benczúr, A.
last_name: Benczúr
citation:
ama: Lukovszki T, Benczúr A. A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. Paderborn; 2002.
apa: Lukovszki, T., & Benczúr, A. (2002). A Degree O(log log n) Fault Tolerant
Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn.
bibtex: '@book{Lukovszki_Benczúr_2002, place={Paderborn}, title={A Degree O(log
log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing},
author={Lukovszki, Tamás and Benczúr, A.}, year={2002} }'
chicago: Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant
Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.
ieee: T. Lukovszki and A. Benczúr, A Degree O(log log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.
mla: Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. 2002.
short: T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.
date_created: 2020-09-03T13:16:48Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
language:
- iso: eng
place: Paderborn
status: public
title: A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic
Ad-Hoc Routing
type: report
user_id: '15415'
year: '2002'
...
---
_id: '18169'
abstract:
- lang: ger
text: Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen
Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder)
stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen
die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen
oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf
Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht
jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen
aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare
Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile
Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung
und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches
Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen
reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur
entnommener ad-hoc Ansätze ergibt.
- lang: eng
text: Quite often, the implementation of well-known algorithms for solving geometric
problems in Euclidean space (such as convex hull computation or intersecting two
polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites
the underlying numerical numerical instabilities can be avoided or are rather
inherent to the problem is investigated by the present work in a model of computation
dating back to Alan Turing himself. Other than algebraic approaches, this does
not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects
the property of actual digital computers to only approximate real numbers by rationals.
In this framework, we devise and present provably stable algorithms for solving
systems of linear equations, matrix diagonalization, and lineare as well as non-linear
optimization. As major technical tool, a new notion of computability for regular
infinite sets of real numbers is introduced that arises from formalizing and systematically
comparing several ad-hoc notions found in previous literature.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.
apa: Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme
(Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler,
Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme.
Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2002.
ieee: M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, vol.
115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
mla: Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
short: M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2002.
date_created: 2020-08-24T11:36:55Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 115'
language:
- iso: ger
publication_identifier:
isbn:
- 3-935433-24-7
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Zur Berechenbarkeit reeller geometrischer Probleme
type: dissertation
user_id: '5786'
volume: 115
year: '2002'
...
---
_id: '18176'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Computability on Regular Subsets of Euclidean Space. Mathematical
Logic Quarterly (MLQ). 2002;48(S1):157-181. doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
apa: Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. Mathematical
Logic Quarterly (MLQ), 48(S1), 157–181. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
bibtex: '@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean
Space}, volume={48}, DOI={10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4},
number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin},
year={2002}, pages={157–181} }'
chicago: 'Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.”
Mathematical Logic Quarterly (MLQ) 48, no. S1 (2002): 157–81. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.'
ieee: M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical
Logic Quarterly (MLQ), vol. 48, no. S1, pp. 157–181, 2002.
mla: Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” Mathematical
Logic Quarterly (MLQ), vol. 48, no. S1, 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.
short: M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
date_created: 2020-08-24T12:05:40Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
intvolume: ' 48'
issue: S1
language:
- iso: eng
page: 157-181
publication: Mathematical Logic Quarterly (MLQ)
publication_identifier:
issn:
- 0942-5616
- 1521-3870
publication_status: published
status: public
title: Computability on Regular Subsets of Euclidean Space
type: journal_article
user_id: '15415'
volume: 48
year: '2002'
...
---
_id: '18177'
abstract:
- lang: eng
text: 'Consider the classical point location problem: for a fixed arrangement of
m hyperplanes and its induced partition of d-space report, upon input of some
point, which face it lies in. With sufficient memory, this is easy to solve in
logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision
Trees) of *minimum* size be? The present work gives lower and upper bounds for
the time complexity of point location under this constraint. They show that, in
addition to m, the maximum number w of walls of a cell turns out to be a crucial
parameter. We also consider a relaxation of the strict minimum-size condition
allowing for constant factor overhead.'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Lukas
full_name: Finschi, Lukas
last_name: Finschi
citation:
ama: 'Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size.
In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02).
; 2002.'
apa: Ziegler, M., Damerow, V., & Finschi, L. (2002). Point Location Algorithms
of Minimum Size. In Proceedings of the 14th Canadian Conference on Computational
Geometry (CCCG’02).
bibtex: '@inproceedings{Ziegler_Damerow_Finschi_2002, title={Point Location Algorithms
of Minimum Size}, booktitle={Proceedings of the 14th Canadian Conference on Computational
Geometry (CCCG’02)}, author={Ziegler, Martin and Damerow, Valentina and Finschi,
Lukas}, year={2002} }'
chicago: Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location
Algorithms of Minimum Size.” In Proceedings of the 14th Canadian Conference
on Computational Geometry (CCCG’02), 2002.
ieee: M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum
Size,” in Proceedings of the 14th Canadian Conference on Computational Geometry
(CCCG’02), 2002.
mla: Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings
of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
short: 'M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian
Conference on Computational Geometry (CCCG’02), 2002.'
date_created: 2020-08-24T12:09:15Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 14th Canadian Conference on Computational Geometry
(CCCG'02)
publication_status: published
status: public
title: Point Location Algorithms of Minimum Size
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18179'
abstract:
- lang: eng
text: Do the solutions of linear equations depend computably on their coefficients?
Implicitly, this has been one of the central questions in linear algebra since
the very beginning of the subject and the famous Gauß algorithm is one of its
numerical answers. Today there exists a tremendous number of algorithms which
solve this problem for different types of linear equations. However, actual implementations
in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned
inputs. This situation raises the question which of these instabilities are intrinsic,
thus caused by the very nature of the problem, and which are just side effects
of specific algorithms. To approach this principle question we revisit linear
equations from the rigorous point of view of computability. Therefore we apply
methods of computable analysis, which is the Turing machine based theory of computable
real number functions. It turns out that, given the coefficients of a system of
linear equations, we can compute the space of solutions, if and only if the dimension
of the solution space is known in advance. Especially, this explains why there
cannot exist any stable algorithms under weaker assumptions.
author:
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science.
Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9'
apa: Brattka, V., & Ziegler, M. (2002). Computability of Linear Equations. In
Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science (pp. 95–106). Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_9
bibtex: '@inproceedings{Brattka_Ziegler_2002, place={Boston, MA}, title={Computability
of Linear Equations}, DOI={10.1007/978-0-387-35608-2_9},
booktitle={Proceedings of the 2nd IFIP International Conference on Theoretical
Computer Science}, author={Brattka, Vasco and Ziegler, Martin}, year={2002}, pages={95–106}
}'
chicago: Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.”
In Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science, 95–106. Boston, MA, 2002. https://doi.org/10.1007/978-0-387-35608-2_9.
ieee: V. Brattka and M. Ziegler, “Computability of Linear Equations,” in Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science,
2002, pp. 95–106.
mla: Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science,
2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.
short: 'V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference
on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.'
date_created: 2020-08-24T12:11:07Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/978-0-387-35608-2_9
language:
- iso: eng
page: 95-106
place: Boston, MA
publication: Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science
publication_status: published
status: public
title: Computability of Linear Equations
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18369'
abstract:
- lang: eng
text: "Visualising is a method used to help experiencing and understanding causal
cohesions in simulation processes. For this purpose, tools for visualising are
already implemented in prevalent simulation systems. The user creates his simulation
model and generates a 3-dimensional (2,5-dimensional) visualising by means of
the simulation system. This helps examining the process which makes it easier
for the viewer to \x93understand\x94 it. Simulation tools usually only provide
the opportunity for a unidirectional visualising. In a 3-dimensional surrounding
the viewer can not implement an interaction with the simulation while the system
is running. Though an interaction during the simulation run enables the user to
gain a better understanding of causal cohesions. Solutions via HLA are sophisticated
and therefore rather suited for extensive projects.\r\nWe present a distributed
system consisting of a commercial manufacturing simulation tool, a coupling module
and a walkthrough system. The distributed system in conjunctions with the coupling
module guarantees generality and a wide field of applications of the walkthrough
system. Further it guarantees flexibility and selection of the specialized graphics
hardware for the walkthrough system. A further contribution of this paper is the
solution of the time synchronisation problem caused by simulation tool and walkthrough
system.\r\n"
author:
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wolfram
full_name: Klemisch, Wolfram
last_name: Klemisch
citation:
ama: 'Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of
Simulation Tools with a Walkthrough-System. In: Simulation Und Visualisierung.
Ghent, BE: SCS European Publishing House; 2002:71-84.'
apa: 'Mueck, B., Dangelmaier, W., Fischer, M., & Klemisch, W. (2002). Bi-directional
Coupling of Simulation Tools with a Walkthrough-System. In Simulation und Visualisierung
(pp. 71–84). Ghent, BE: SCS European Publishing House.'
bibtex: '@inproceedings{Mueck_Dangelmaier_Fischer_Klemisch_2002, place={Ghent, BE},
title={Bi-directional Coupling of Simulation Tools with a Walkthrough-System},
booktitle={Simulation und Visualisierung}, publisher={SCS European Publishing
House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and
Klemisch, Wolfram}, year={2002}, pages={71–84} }'
chicago: 'Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch.
“Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In Simulation
Und Visualisierung, 71–84. Ghent, BE: SCS European Publishing House, 2002.'
ieee: B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling
of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung,
2002, pp. 71–84.
mla: Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.”
Simulation Und Visualisierung, SCS European Publishing House, 2002, pp.
71–84.
short: 'B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung,
SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.'
date_created: 2020-08-26T13:01:43Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '63'
language:
- iso: eng
page: 71-84
place: Ghent, BE
publication: Simulation und Visualisierung
publisher: SCS European Publishing House
status: public
title: Bi-directional Coupling of Simulation Tools with a Walkthrough-System
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18566'
abstract:
- lang: eng
text: "We analyze a randomized pursuit-evasion game on graphs. This game is played
by two players, a hunter and a rabbit. Let G be any connected, undirected graph
with n nodes. The game is played in rounds and in each round both the hunter and
the rabbit are located at a node of the graph. Between rounds both the hunter
and the rabbit can stay at the current node or move to another node. The hunter
is assumed to be restricted to the graph G: in every round, the hunter can move
using at most one edge. For the rabbit we investigate two models: in one model
the rabbit is restricted to the same graph as the hunter, and in the other model
the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe
say that the rabbit is caught as soon as hunter and rabbit are located at the
same node in a round. The goal of the hunter is to catch the rabbit in as few
rounds as possible, whereas the rabbit aims to maximize the number of rounds until
it is caught. Given a randomized hunter strategy for G, the escape length for
that strategy is the worst case expected number of rounds it takes the hunter
to catch the rabbit, where the worst case is with regards to all (possibly randomized)
rabbit strategies. Our main result is a hunter strategy for general graphs with
an escape length of only O\r\n(n log (diam(G))) against restricted as well as
unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower
bound on the escape length in both models. Furthermore, we prove that our upper
bound is optimal up to constant factors against unrestricted rabbits."
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Naveen
full_name: Sivadasan, Naveen
last_name: Sivadasan
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion
in Graphs. In: Proceedings of the 29th International Colloquium on Automata,
Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77'
apa: Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002).
Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International
Colloquium on Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_77
bibtex: '@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin,
Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={10.1007/3-540-45465-9_77},
booktitle={Proceedings of the 29th International Colloquium on Automata, Languages
and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen
and Sohler, Christian and Vöcking, Berthold}, year={2002} }'
chicago: Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold
Vöcking. “Randomized Pursuit-Evasion in Graphs.” In Proceedings of the 29th
International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg,
2002. https://doi.org/10.1007/3-540-45465-9_77.
ieee: M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion
in Graphs,” in Proceedings of the 29th International Colloquium on Automata,
Languages and Programming, 2002.
mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings
of the 29th International Colloquium on Automata, Languages and Programming,
2002, doi:10.1007/3-540-45465-9_77.
short: 'M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings
of the 29th International Colloquium on Automata, Languages and Programming, Berlin,
Heidelberg, 2002.'
date_created: 2020-08-28T12:04:12Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/3-540-45465-9_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Proceedings of the 29th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540438649'
- '9783540454656'
issn:
- 0302-9743
publication_status: published
status: public
title: Randomized Pursuit-Evasion in Graphs
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16489'
author:
- first_name: Christof
full_name: Krick, Christof
last_name: Krick
- 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: Bernhard
full_name: Vöcking, Bernhard
last_name: Vöcking
- first_name: 'Matthias'' '
full_name: 'Westermann, Matthias'' '
last_name: Westermann
citation:
ama: 'Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management
in Networks: Experimental Evaluation of a Provably Good Strategy. Theory of
Computing Systems. Published online 2002:217-245. doi:10.1007/s00224-001-1045-z'
apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., & Westermann,
M. (2002). Data Management in Networks: Experimental Evaluation of a Provably
Good Strategy. Theory of Computing Systems, 217–245. https://doi.org/10.1007/s00224-001-1045-z'
bibtex: '@article{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_2002, title={Data
Management in Networks: Experimental Evaluation of a Provably Good Strategy},
DOI={10.1007/s00224-001-1045-z},
journal={Theory of Computing Systems}, author={Krick, Christof and Meyer auf der
Heide, Friedhelm and Räcke, Harald and Vöcking, Bernhard and Westermann, Matthias’
}, year={2002}, pages={217–245} }'
chicago: 'Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard
Vöcking, and Matthias’ Westermann. “Data Management in Networks: Experimental
Evaluation of a Provably Good Strategy.” Theory of Computing Systems, 2002,
217–45. https://doi.org/10.1007/s00224-001-1045-z.'
ieee: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann,
“Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,”
Theory of Computing Systems, pp. 217–245, 2002, doi: 10.1007/s00224-001-1045-z.'
mla: 'Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation
of a Provably Good Strategy.” Theory of Computing Systems, 2002, pp. 217–45,
doi:10.1007/s00224-001-1045-z.'
short: C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory
of Computing Systems (2002) 217–245.
date_created: 2020-04-09T10:03:55Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/s00224-001-1045-z
language:
- iso: eng
page: 217-245
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: 'Data Management in Networks: Experimental Evaluation of a Provably Good Strategy'
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '16490'
abstract:
- lang: eng
text: "We present a new data structure for rendering highly complex virtual environments
of arbitrary topology. The special feature of our approach is that it allows an
interactive navigation in very large scenes (30 GB/400 million polygons in our
benchmark scenes) that cannot be stored in main memory, but only on a local or
remote hard disk. Furthermore, it allows interactive rendering of substantially
more complex scenes by instantiating objects.\r\n\r\nFor the computation of an
approximate image of the scene, a sampling technique is used. In the preprocessing,
a so-called sample tree is built whose nodes contain randomly selected polygons
from the scene. This tree only uses space that is linear in the number of polygons.
In order to produce an image of the scene, the tree is traversed and polygons
stored in the visited nodes are rendered. During the interactive walkthrough,
parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe
implemented our algorithm in a prototypical walkthrough system. Analysis and experiments
show that the quality of our images is comparable to images computed by the conventional
z-buffer algorithm regardless of the scene topology."
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The
randomized sample tree: a data structure for interactive walkthroughs in externally
stored virtual environments. In: Proceedings of the ACM Symposium on Virtual
Reality Software and Technology - VRST ’02. ; 2002. doi:10.1145/585740.585764'
apa: 'Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., & Meyer auf
der Heide, F. (2002). The randomized sample tree: a data structure for interactive
walkthroughs in externally stored virtual environments. In Proceedings of the
ACM symposium on Virtual reality software and technology - VRST ’02. https://doi.org/10.1145/585740.585764'
bibtex: '@inproceedings{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2002,
title={The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments}, DOI={10.1145/585740.585764},
booktitle={Proceedings of the ACM symposium on Virtual reality software and technology
- VRST ’02}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and
Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2002}
}'
chicago: 'Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka,
and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure
for Interactive Walkthroughs in Externally Stored Virtual Environments.” In Proceedings
of the ACM Symposium on Virtual Reality Software and Technology - VRST ’02,
2002. https://doi.org/10.1145/585740.585764.'
ieee: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der
Heide, “The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments,” in Proceedings of the ACM symposium
on Virtual reality software and technology - VRST ’02, 2002.'
mla: 'Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive
Walkthroughs in Externally Stored Virtual Environments.” Proceedings of the
ACM Symposium on Virtual Reality Software and Technology - VRST ’02, 2002,
doi:10.1145/585740.585764.'
short: 'J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der
Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology
- VRST ’02, 2002.'
date_created: 2020-04-09T10:10:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/585740.585764
language:
- iso: eng
publication: Proceedings of the ACM symposium on Virtual reality software and technology -
VRST '02
publication_identifier:
isbn:
- '1581135300'
publication_status: published
status: public
title: 'The randomized sample tree: a data structure for interactive walkthroughs
in externally stored virtual environments'
type: conference
user_id: '15415'
year: '2002'
...