---
_id: '18959'
abstract:
- lang: eng
  text: We investigate the problem of constructing spanners for a given set of points
    that are tolerant for edge/vertex faults. Let S be a set of $n$ points in the
    d-dimensional space and let k be an integer number. A k-edge/vertex fault tolerant
    spanner for S has the property that after the deletion of k arbitrary edges/vertices
    each pair of points in the remaining graph is still connected by a short path.<br><br>Recently
    it was shown that for each set S of n points there exists a k-edge/vertex fault
    tolerant spanner with O(k^2 n) edges which can be constructed in O(n log n + k^2
    n) time. Furthermore, it was shown that for each set S of n points there exists
    a k-edge/vertex fault tolerant spanner whose degree is bouned by O(c^k+1) for
    some constant c.<br><br>Our first contribution is a construction of a k-vertex
    fault tolerant spanner with O(kn) edges which is a tight bound. The computation
    takes O(n log^d-1 n + k n log log n) time. Then we show that the same k-vertex
    fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct
    a k-vertex fault tolerant spanner with O(k^2 n) edges whose degree is bounded
    by O(k^2). Finally, we give a more natural but stronger definition of k-edge fault
    tolerance which not necessarily can be satisfied if one allows only simple edges
    between the points of S. We investigate the question whether Steiner points help.
    We answer this question affirmatively and prove Theta(kn) bounds on the number
    of Steiner points and on the number of edges in such spanners.
author:
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
citation:
  ama: 'Lukovszki T. New Results on Fault Tolerant Geometric Spanners. In: <i>Proceedings
    of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>. ; 1999:193-204.
    doi:<a href="https://doi.org/10.1007/3-540-48447-7_20">10.1007/3-540-48447-7_20</a>'
  apa: Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In
    <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
    LNCS</i> (pp. 193–204). <a href="https://doi.org/10.1007/3-540-48447-7_20">https://doi.org/10.1007/3-540-48447-7_20</a>
  bibtex: '@inproceedings{Lukovszki_1999, title={New Results on Fault Tolerant Geometric
    Spanners}, DOI={<a href="https://doi.org/10.1007/3-540-48447-7_20">10.1007/3-540-48447-7_20</a>},
    booktitle={Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
    LNCS}, author={Lukovszki, Tamás}, year={1999}, pages={193–204} }'
  chicago: Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” In
    <i>Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS’99),
    LNCS</i>, 193–204, 1999. <a href="https://doi.org/10.1007/3-540-48447-7_20">https://doi.org/10.1007/3-540-48447-7_20</a>.
  ieee: T. Lukovszki, “New Results on Fault Tolerant Geometric Spanners,” in <i>Proceedings
    of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999,
    pp. 193–204.
  mla: Lukovszki, Tamás. “New Results on Fault Tolerant Geometric Spanners.” <i>Proceedings
    of the 6th Workshop on Algorithms an Data Structures (WADS’99), LNCS</i>, 1999,
    pp. 193–204, doi:<a href="https://doi.org/10.1007/3-540-48447-7_20">10.1007/3-540-48447-7_20</a>.
  short: 'T. Lukovszki, in: Proceedings of the 6th Workshop on Algorithms an Data
    Structures (WADS’99), LNCS, 1999, pp. 193–204.'
date_created: 2020-09-03T13:03:45Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-48447-7_20
language:
- iso: eng
page: 193-204
publication: Proceedings of the 6th Workshop on Algorithms an Data Structures (WADS'99),
  LNCS
publication_identifier:
  isbn:
  - '9783540662792'
  - '9783540484479'
  issn:
  - 0302-9743
publication_status: published
status: public
title: New Results on Fault Tolerant Geometric Spanners
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18965'
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: Berthold
  full_name: Vöcking, Berthold
  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. In: <i>Proceedings
    of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures 
    - SPAA ’99</i>. ; 1999:165-174. doi:<a href="https://doi.org/10.1145/305619.305637">10.1145/305619.305637</a>'
  apa: 'Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann,
    M. (1999). Data management in networks: experimental evaluation of a provably
    good strategy. In <i>Proceedings of the eleventh annual ACM symposium on Parallel
    algorithms and architectures  - SPAA ’99</i> (pp. 165–174). <a href="https://doi.org/10.1145/305619.305637">https://doi.org/10.1145/305619.305637</a>'
  bibtex: '@inproceedings{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_1999,
    title={Data management in networks: experimental evaluation of a provably good
    strategy}, DOI={<a href="https://doi.org/10.1145/305619.305637">10.1145/305619.305637</a>},
    booktitle={Proceedings of the eleventh annual ACM symposium on Parallel algorithms
    and architectures  - SPAA ’99}, author={Krick, Christof and Meyer auf der Heide,
    Friedhelm and Räcke, Harald and Vöcking, Berthold and Westermann, Matthias}, year={1999},
    pages={165–174} }'
  chicago: 'Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold
    Vöcking, and Matthias Westermann. “Data Management in Networks: Experimental Evaluation
    of a Provably Good Strategy.” In <i>Proceedings of the Eleventh Annual ACM Symposium
    on Parallel Algorithms and Architectures  - SPAA ’99</i>, 165–74, 1999. <a href="https://doi.org/10.1145/305619.305637">https://doi.org/10.1145/305619.305637</a>.'
  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,”
    in <i>Proceedings of the eleventh annual ACM symposium on Parallel algorithms
    and architectures  - SPAA ’99</i>, 1999, pp. 165–174.'
  mla: 'Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation
    of a Provably Good Strategy.” <i>Proceedings of the Eleventh Annual ACM Symposium
    on Parallel Algorithms and Architectures  - SPAA ’99</i>, 1999, pp. 165–74, doi:<a
    href="https://doi.org/10.1145/305619.305637">10.1145/305619.305637</a>.'
  short: 'C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, in:
    Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures 
    - SPAA ’99, 1999, pp. 165–174.'
date_created: 2020-09-03T14:27:14Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.1145/305619.305637
language:
- iso: eng
page: 165-174
publication: Proceedings of the eleventh annual ACM symposium on Parallel algorithms
  and architectures  - SPAA '99
publication_identifier:
  isbn:
  - '1581131240'
publication_status: published
status: public
title: 'Data management in networks: experimental evaluation of a provably good strategy'
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '18576'
abstract:
- lang: eng
  text: In this paper we deal with two problems on star-shaped polygons. First, we
    present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon
    whose vertices are given by a point set ( S ) of ( n ) points in the plane that
    does not admit degenerate star-shaped polygons. The expected running time of the
    algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped
    polygon degenerate if its kernel has 0 area.<br><br>Secondly, we show how to count
    all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n)
    ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation.
    We also present lower and upper bounds on the number of star-shaped polygons.
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Sohler C. Generating Random Star-Shaped Polygons. In: <i>Proceedings of the
    11th Canadian Conference on Computational Geometry (''CCCG’99)</i>. ; 1999:174-177.'
  apa: Sohler, C. (1999). Generating Random Star-Shaped Polygons. In <i>Proceedings
    of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i> (pp.
    174–177).
  bibtex: '@inproceedings{Sohler_1999, title={Generating Random Star-Shaped Polygons},
    booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry
    (''CCCG’99)}, author={Sohler, Christian}, year={1999}, pages={174–177} }'
  chicago: Sohler, Christian. “Generating Random Star-Shaped Polygons.” In <i>Proceedings
    of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 174–77,
    1999.
  ieee: C. Sohler, “Generating Random Star-Shaped Polygons,” in <i>Proceedings of
    the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 1999, pp.
    174–177.
  mla: Sohler, Christian. “Generating Random Star-Shaped Polygons.” <i>Proceedings
    of the 11th Canadian Conference on Computational Geometry ('CCCG’99)</i>, 1999,
    pp. 174–77.
  short: 'C. Sohler, in: Proceedings of the 11th Canadian Conference on Computational
    Geometry (''CCCG’99), 1999, pp. 174–177.'
date_created: 2020-08-28T14:20:42Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 174-177
publication: Proceedings of the 11th Canadian Conference on Computational Geometry
  ('CCCG'99)
status: public
title: Generating Random Star-Shaped Polygons
type: conference
user_id: '15415'
year: '1999'
...
---
_id: '2210'
author:
- first_name: Petra
  full_name: Berenbrink, Petra
  last_name: Berenbrink
- first_name: Marco
  full_name: Riedel, Marco
  last_name: Riedel
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage
    Network (Extended Abstract). In: <i>International Workshop on Communication and
    Data Management in Large Networks (CDMLarge)</i>. ; 1999:2-12.'
  apa: Berenbrink, P., Riedel, M., &#38; Scheideler, C. (1999). Design of the PRESTO
    Multimedia Storage Network (Extended Abstract). In <i>International Workshop on
    Communication and Data Management in Large Networks (CDMLarge)</i> (pp. 2–12).
  bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the
    PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International
    Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink,
    Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12}
    }'
  chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the
    PRESTO Multimedia Storage Network (Extended Abstract).” In <i>International Workshop
    on Communication and Data Management in Large Networks (CDMLarge)</i>, 2–12, 1999.
  ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia
    Storage Network (Extended Abstract),” in <i>International Workshop on Communication
    and Data Management in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.
  mla: Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network
    (Extended Abstract).” <i>International Workshop on Communication and Data Management
    in Large Networks (CDMLarge)</i>, 1999, pp. 2–12.
  short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication
    and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.'
date_created: 2018-04-05T07:00:11Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T08:34:00Z
  date_updated: 2018-04-12T08:34:00Z
  file_id: '2294'
  file_name: CDMLarge-99.pdf
  file_size: 211926
  relation: main_file
file_date_updated: 2018-04-12T08:34:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 2-12
publication: International Workshop on Communication and Data Management in Large
  Networks (CDMLarge)
status: public
title: Design of the PRESTO Multimedia Storage Network (Extended Abstract)
type: conference
urn: '22109'
user_id: '14955'
year: '1999'
...
---
_id: '2166'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
    of Store-and-Forward Protocols. In: <i>STOC</i>. ; 1999:215--224.'
  apa: 'Scheideler, C., &#38; Vöcking, B. (1999). From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols. In <i>STOC</i> (pp.
    215--224).'
  bibtex: '@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler,
    Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }'
  chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols.” In <i>STOC</i>, 215--224,
    1999.'
  ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
    Transformations of Store-and-Forward Protocols,” in <i>STOC</i>, 1999, pp. 215--224.'
  mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
    Efficient Transformations of Store-and-Forward Protocols.” <i>STOC</i>, 1999,
    pp. 215--224.'
  short: 'C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.'
date_created: 2018-04-03T08:57:30Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:35:46Z
  date_updated: 2018-04-12T07:35:46Z
  file_id: '2289'
  file_name: STOC-99.pdf
  file_size: 227305
  relation: main_file
file_date_updated: 2018-04-12T07:35:46Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 215--224
publication: STOC
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
  Protocols'
type: conference
urn: '21668'
user_id: '14955'
year: '1999'
...
---
_id: '16501'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: Meyer auf der Heide F, Vöcking B. Shortest-Path Routing in Arbitrary Networks.
    <i>Journal of Algorithms</i>. 1999:105-131. doi:<a href="https://doi.org/10.1006/jagm.1998.0980">10.1006/jagm.1998.0980</a>
  apa: Meyer auf der Heide, F., &#38; Vöcking, B. (1999). Shortest-Path Routing in
    Arbitrary Networks. <i>Journal of Algorithms</i>, 105–131. <a href="https://doi.org/10.1006/jagm.1998.0980">https://doi.org/10.1006/jagm.1998.0980</a>
  bibtex: '@article{Meyer auf der Heide_Vöcking_1999, title={Shortest-Path Routing
    in Arbitrary Networks}, DOI={<a href="https://doi.org/10.1006/jagm.1998.0980">10.1006/jagm.1998.0980</a>},
    journal={Journal of Algorithms}, author={Meyer auf der Heide, Friedhelm and Vöcking,
    Berthold}, year={1999}, pages={105–131} }'
  chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
    in Arbitrary Networks.” <i>Journal of Algorithms</i>, 1999, 105–31. <a href="https://doi.org/10.1006/jagm.1998.0980">https://doi.org/10.1006/jagm.1998.0980</a>.
  ieee: F. Meyer auf der Heide and B. Vöcking, “Shortest-Path Routing in Arbitrary
    Networks,” <i>Journal of Algorithms</i>, pp. 105–131, 1999.
  mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Shortest-Path Routing
    in Arbitrary Networks.” <i>Journal of Algorithms</i>, 1999, pp. 105–31, doi:<a
    href="https://doi.org/10.1006/jagm.1998.0980">10.1006/jagm.1998.0980</a>.
  short: F. Meyer auf der Heide, B. Vöcking, Journal of Algorithms (1999) 105–131.
date_created: 2020-04-14T11:50:52Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/jagm.1998.0980
language:
- iso: eng
page: 105-131
publication: Journal of Algorithms
publication_identifier:
  issn:
  - 0196-6774
publication_status: published
status: public
title: Shortest-Path Routing in Arbitrary Networks
type: journal_article
user_id: '15415'
year: '1999'
...
---
_id: '16502'
author:
- first_name: P.
  full_name: Berenbrink, P.
  last_name: Berenbrink
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: K.
  full_name: Schröder, K.
  last_name: Schröder
citation:
  ama: Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in
    Parallel. <i>Theory of Computing Systems</i>. 1999:281-300. doi:<a href="https://doi.org/10.1007/s002240000119">10.1007/s002240000119</a>
  apa: Berenbrink, P., Meyer auf der Heide, F., &#38; Schröder, K. (1999). Allocating
    Weighted Jobs in Parallel. <i>Theory of Computing Systems</i>, 281–300. <a href="https://doi.org/10.1007/s002240000119">https://doi.org/10.1007/s002240000119</a>
  bibtex: '@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating
    Weighted Jobs in Parallel}, DOI={<a href="https://doi.org/10.1007/s002240000119">10.1007/s002240000119</a>},
    journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der
    Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }'
  chicago: Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating
    Weighted Jobs in Parallel.” <i>Theory of Computing Systems</i>, 1999, 281–300.
    <a href="https://doi.org/10.1007/s002240000119">https://doi.org/10.1007/s002240000119</a>.
  ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted
    Jobs in Parallel,” <i>Theory of Computing Systems</i>, pp. 281–300, 1999.
  mla: Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” <i>Theory of
    Computing Systems</i>, 1999, pp. 281–300, doi:<a href="https://doi.org/10.1007/s002240000119">10.1007/s002240000119</a>.
  short: P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems
    (1999) 281–300.
date_created: 2020-04-14T12:00:32Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000119
language:
- iso: eng
page: 281-300
publication: Theory of Computing Systems
publication_identifier:
  issn:
  - 1432-4350
  - 1433-0490
publication_status: published
status: public
title: Allocating Weighted Jobs in Parallel
type: journal_article
user_id: '15415'
year: '1999'
...
---
_id: '17052'
author:
- first_name: E. W.
  full_name: Mayr, E. W.
  last_name: Mayr
- 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: 'Mayr EW, Meyer auf der Heide F, Wanka R. International Workshop on Communication
    and Data Management in Large Networks. In: <i>Informatik Aktuell</i>. ; 1999.
    doi:<a href="https://doi.org/10.1007/978-3-662-01069-3_47">10.1007/978-3-662-01069-3_47</a>'
  apa: Mayr, E. W., Meyer auf der Heide, F., &#38; Wanka, R. (1999). International
    Workshop on Communication and Data Management in Large Networks. In <i>Informatik
    aktuell</i>. <a href="https://doi.org/10.1007/978-3-662-01069-3_47">https://doi.org/10.1007/978-3-662-01069-3_47</a>
  bibtex: '@inbook{Mayr_Meyer auf der Heide_Wanka_1999, place={Berlin, Heidelberg},
    title={International Workshop on Communication and Data Management in Large Networks},
    DOI={<a href="https://doi.org/10.1007/978-3-662-01069-3_47">10.1007/978-3-662-01069-3_47</a>},
    booktitle={Informatik aktuell}, author={Mayr, E. W. and Meyer auf der Heide, Friedhelm
    and Wanka, Rolf}, year={1999} }'
  chicago: Mayr, E. W., Friedhelm Meyer auf der Heide, and Rolf Wanka. “International
    Workshop on Communication and Data Management in Large Networks.” In <i>Informatik
    Aktuell</i>. Berlin, Heidelberg, 1999. <a href="https://doi.org/10.1007/978-3-662-01069-3_47">https://doi.org/10.1007/978-3-662-01069-3_47</a>.
  ieee: E. W. Mayr, F. Meyer auf der Heide, and R. Wanka, “International Workshop
    on Communication and Data Management in Large Networks,” in <i>Informatik aktuell</i>,
    Berlin, Heidelberg, 1999.
  mla: Mayr, E. W., et al. “International Workshop on Communication and Data Management
    in Large Networks.” <i>Informatik Aktuell</i>, 1999, doi:<a href="https://doi.org/10.1007/978-3-662-01069-3_47">10.1007/978-3-662-01069-3_47</a>.
  short: 'E.W. Mayr, F. Meyer auf der Heide, R. Wanka, in: Informatik Aktuell, Berlin,
    Heidelberg, 1999.'
date_created: 2020-05-20T13:16:56Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/978-3-662-01069-3_47
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik aktuell
publication_identifier:
  isbn:
  - '9783540664505'
  - '9783662010693'
  issn:
  - 1431-472X
publication_status: published
status: public
title: International Workshop on Communication and Data Management in Large Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_id: '17053'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
- first_name: Matthias
  full_name: Westermann, Matthias
  last_name: Westermann
citation:
  ama: 'Meyer auf der Heide F, Vöcking B, Westermann M. Provably Good and Practical
    Strategies for Non-uniform Data Management in Networks. In: <i>Algorithms - ESA’
    99</i>. Berlin, Heidelberg; 1999. doi:<a href="https://doi.org/10.1007/3-540-48481-7_9">10.1007/3-540-48481-7_9</a>'
  apa: Meyer auf der Heide, F., Vöcking, B., &#38; Westermann, M. (1999). Provably
    Good and Practical Strategies for Non-uniform Data Management in Networks. In
    <i>Algorithms - ESA’ 99</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-48481-7_9">https://doi.org/10.1007/3-540-48481-7_9</a>
  bibtex: '@inbook{Meyer auf der Heide_Vöcking_Westermann_1999, place={Berlin, Heidelberg},
    title={Provably Good and Practical Strategies for Non-uniform Data Management
    in Networks}, DOI={<a href="https://doi.org/10.1007/3-540-48481-7_9">10.1007/3-540-48481-7_9</a>},
    booktitle={Algorithms - ESA’ 99}, author={Meyer auf der Heide, Friedhelm and Vöcking,
    Berthold and Westermann, Matthias}, year={1999} }'
  chicago: Meyer auf der Heide, Friedhelm, Berthold Vöcking, and Matthias Westermann.
    “Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.”
    In <i>Algorithms - ESA’ 99</i>. Berlin, Heidelberg, 1999. <a href="https://doi.org/10.1007/3-540-48481-7_9">https://doi.org/10.1007/3-540-48481-7_9</a>.
  ieee: F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Provably Good and
    Practical Strategies for Non-uniform Data Management in Networks,” in <i>Algorithms
    - ESA’ 99</i>, Berlin, Heidelberg, 1999.
  mla: Meyer auf der Heide, Friedhelm, et al. “Provably Good and Practical Strategies
    for Non-Uniform Data Management in Networks.” <i>Algorithms - ESA’ 99</i>, 1999,
    doi:<a href="https://doi.org/10.1007/3-540-48481-7_9">10.1007/3-540-48481-7_9</a>.
  short: 'F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Algorithms - ESA’
    99, Berlin, Heidelberg, 1999.'
date_created: 2020-05-20T13:35:49Z
date_updated: 2022-01-06T06:53:03Z
department:
- _id: '63'
doi: 10.1007/3-540-48481-7_9
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms - ESA’ 99
publication_identifier:
  isbn:
  - '9783540662518'
  - '9783540484813'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Provably Good and Practical Strategies for Non-uniform Data Management in Networks
type: book_chapter
user_id: '15415'
year: '1999'
...
---
_id: '19639'
author:
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: Vöcking B. <i>Static and Dynamic Data Management in Networks</i>. Vol 46. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 1998.
  apa: Vöcking, B. (1998). <i>Static and Dynamic Data Management in Networks</i> (Vol.
    46). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Vöcking_1998, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Static and Dynamic Data Management in Networks}, volume={46},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Vöcking,
    Berthold}, year={1998}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn} }'
  chicago: Vöcking, Berthold. <i>Static and Dynamic Data Management in Networks</i>.
    Vol. 46. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1998.
  ieee: B. Vöcking, <i>Static and Dynamic Data Management in Networks</i>, vol. 46.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1998.
  mla: Vöcking, Berthold. <i>Static and Dynamic Data Management in Networks</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1998.
  short: B. Vöcking, Static and Dynamic Data Management in Networks, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 1998.
date_created: 2020-09-22T13:05:43Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-09-22T13:05:04Z
  date_updated: 2020-09-22T13:05:04Z
  file_id: '19640'
  file_name: pub-hni-478.pdf
  file_size: 592479
  relation: main_file
  success: 1
file_date_updated: 2020-09-22T13:05:04Z
has_accepted_license: '1'
intvolume: '        46'
language:
- iso: eng
publication_identifier:
  isbn:
  - 3-931466-45-0
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
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: Static and Dynamic Data Management in Networks
type: dissertation
user_id: '5786'
volume: 46
year: '1998'
...
---
_id: '19735'
abstract:
- lang: eng
  text: The Paderborn University BSP (PUB) library is a parallel C library based on
    the BSP model. The basic library supports buffered and unbuffered asynchronous
    communication between any pair of processors, and a mechanism for synchronizing
    the processors in a barrier style. In addition, it provides routines for collective
    communication on arbitrary subsets of processors, partition operations, and a
    zero-cost synchronization mechanism. Furthermore, some techniques used in the
    implementation of the PUB library deviate significantly from the techniques used
    in other BSP libraries.
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Ingo
  full_name: Rieping, Ingo
  last_name: Rieping
- first_name: Ingo
  full_name: von Otte, Ingo
  last_name: von Otte
- first_name: Bernhardus
  full_name: Juurlink, Bernhardus
  last_name: Juurlink
citation:
  ama: Bonorden O, Rieping I, von Otte I, Juurlink B. <i>The Paderborn University
    BSP (PUB) Library - Design, Implementation and Performance</i>.; 1998.
  apa: Bonorden, O., Rieping, I., von Otte, I., &#38; Juurlink, B. (1998). <i>The
    Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>.
  bibtex: '@book{Bonorden_Rieping_von Otte_Juurlink_1998, title={The Paderborn University
    BSP (PUB) Library - Design, Implementation and Performance}, author={Bonorden,
    Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={1998}
    }'
  chicago: Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. <i>The
    Paderborn University BSP (PUB) Library - Design, Implementation and Performance</i>,
    1998.
  ieee: O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, <i>The Paderborn University
    BSP (PUB) Library - Design, Implementation and Performance</i>. 1998.
  mla: Bonorden, Olaf, et al. <i>The Paderborn University BSP (PUB) Library - Design,
    Implementation and Performance</i>. 1998.
  short: O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, The Paderborn University
    BSP (PUB) Library - Design, Implementation and Performance, 1998.
date_created: 2020-09-28T12:41:20Z
date_updated: 2022-01-06T06:54:11Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-09-28T12:41:08Z
  date_updated: 2020-09-28T12:41:08Z
  file_id: '19736'
  file_name: pub-hni-1350.pdf
  file_size: 255806
  relation: main_file
  success: 1
file_date_updated: 2020-09-28T12:41:08Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
type: report
user_id: '15415'
year: '1998'
...
---
_id: '17412'
abstract:
- lang: eng
  text: "We study algorithmic aspects in the management of geometric scenes in interactive
    walkthrough animations. We consider arbitrarily large scenes consisting of unit
    size balls. For a smooth navigation in the scene we have to fulfill hard real
    time requirements. Therefore, we need algorithms whose running time is independent
    of the total number of objects in the scene and that use as small space as possible.
    In this work we focus on one of the basic operations in our walkthrough system:
    reporting the objects around the visitor within a certain distance. Previously
    a randomized data structure was presented that supports reporting the balls around
    the visitor in an output sensitive time and allows insertion and deletion of objects
    nearly as fast as searching. These results were achieved by exploiting the fact
    that the visitor moves ''slowly'' through the scene. A serious disadvantage of
    the aforementioned data structure is a big space overhead and the use of randomization.
    Our first result is a construction of weak spanners that leads to an improvement
    of the space requirement of the previously known data structures. Then we develop
    a deterministic data structure for the searching problem in which insertion of
    objects are allowed. Our incremental data structure supports O(1+k) reporting
    time, where k is a certain quantity close to the number of reported objects. The
    insertion time is similar to the reporting time and the space is linear to the
    total number of objects.\r\n"
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations
    with Weak Spanners in Real Time. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg;
    1998. doi:<a href="https://doi.org/10.1007/3-540-68530-8_14">10.1007/3-540-68530-8_14</a>'
  apa: Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). Geometric Searching in
    Walkthrough Animations with Weak Spanners in Real Time. In <i>Algorithms — ESA’
    98</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-68530-8_14">https://doi.org/10.1007/3-540-68530-8_14</a>
  bibtex: '@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric
    Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={<a
    href="https://doi.org/10.1007/3-540-68530-8_14">10.1007/3-540-68530-8_14</a>},
    booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás
    and Ziegler, Martin}, year={1998} }'
  chicago: Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching
    in Walkthrough Animations with Weak Spanners in Real Time.” In <i>Algorithms —
    ESA’ 98</i>. Berlin, Heidelberg, 1998. <a href="https://doi.org/10.1007/3-540-68530-8_14">https://doi.org/10.1007/3-540-68530-8_14</a>.
  ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough
    Animations with Weak Spanners in Real Time,” in <i>Algorithms — ESA’ 98</i>, Berlin,
    Heidelberg, 1998.
  mla: Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with
    Weak Spanners in Real Time.” <i>Algorithms — ESA’ 98</i>, 1998, doi:<a href="https://doi.org/10.1007/3-540-68530-8_14">10.1007/3-540-68530-8_14</a>.
  short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin,
    Heidelberg, 1998.'
date_created: 2020-07-27T11:42:54Z
date_updated: 2022-01-06T06:53:11Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/3-540-68530-8_14
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-27T11:20:38Z
  date_updated: 2020-08-27T11:20:38Z
  file_id: '18442'
  file_name: hni-id-854.pdf
  file_size: 266070
  relation: main_file
  success: 1
file_date_updated: 2020-08-27T11:20:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
  isbn:
  - '9783540648482'
  - '9783540685302'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '17863'
abstract:
- lang: eng
  text: "New dynamic search data structures developed recently guarantee constant
    execution time per search and update, i.e., they fulfil the real-time requirements
    necessary for interactive walkthrough in large geometric scenes. Yet, superiority
    or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir
    prototypical implementation presented in this work uses common libraries on standard
    stations and thus represents a first strut to bridge this gap. Indeed our experimental
    results give an indication on the actual performance of these theoretical ideas
    on real machines and possible bottlenecks in future developments. By special algorithmic
    enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Tamas
  full_name: Lukovszki, Tamas
  last_name: Lukovszki
- first_name: 'Martin '
  full_name: 'Ziegler, Martin '
  last_name: Ziegler
citation:
  ama: 'Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough
    of Massive Models. In: <i>Algorithm Engineering, 2nd International Workshop, {WAE
    ’98}</i>. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142.'
  apa: 'Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). A Network Based Approach
    for Realtime Walkthrough of Massive Models. In <i>Algorithm Engineering, 2nd International
    Workshop, {WAE ’98}</i> (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.'
  bibtex: '@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A
    Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm
    Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut
    für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin
    }, year={1998}, pages={133--142} }'
  chicago: 'Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based
    Approach for Realtime Walkthrough of Massive Models.” In <i>Algorithm Engineering,
    2nd International Workshop, {WAE ’98}</i>, 133--142. Saarbrücken: Max-Planck-Institut
    für Informatik, 1998.'
  ieee: M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime
    Walkthrough of Massive Models,” in <i>Algorithm Engineering, 2nd International
    Workshop, {WAE ’98}</i>, 1998, pp. 133--142.
  mla: Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough
    of Massive Models.” <i>Algorithm Engineering, 2nd International Workshop, {WAE
    ’98}</i>, Max-Planck-Institut für Informatik, 1998, pp. 133--142.
  short: 'M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International
    Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp.
    133--142.'
date_created: 2020-08-12T12:50:56Z
date_updated: 2022-01-06T06:53:21Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-27T11:18:26Z
  date_updated: 2020-08-27T11:18:26Z
  file_id: '18440'
  file_name: hni-id-853.pdf
  file_size: 272549
  relation: main_file
  success: 1
file_date_updated: 2020-08-27T11:18:26Z
has_accepted_license: '1'
language:
- iso: eng
page: 133--142
place: Saarbrücken
publication: Algorithm Engineering, 2nd International Workshop, {WAE '98}
publisher: Max-Planck-Institut für Informatik
status: public
title: A Network Based Approach for Realtime Walkthrough of Massive Models
type: conference
user_id: '15415'
year: '1998'
...
---
_id: '18145'
abstract:
- lang: ger
  text: Preis für den Beitrag "Multimediale Entdeckungsreisen unserer Welt mit dem
    Internet"
- lang: eng
  text: Award for the Article "Multimedia-based Expedition of our World with the Internet"
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
citation:
  ama: Ziegler M, Fischer M, Lukovszki T. <i>Multimediale Entdeckungsreisen Unserer
    Welt Mit Dem Internet</i>.; 1998.
  apa: Ziegler, M., Fischer, M., &#38; Lukovszki, T. (1998). <i>Multimediale Entdeckungsreisen
    unserer Welt mit dem Internet</i>.
  bibtex: '@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen
    unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias
    and Lukovszki, Tamás}, year={1998} }'
  chicago: Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. <i>Multimediale
    Entdeckungsreisen Unserer Welt Mit Dem Internet</i>, 1998.
  ieee: M. Ziegler, M. Fischer, and T. Lukovszki, <i>Multimediale Entdeckungsreisen
    unserer Welt mit dem Internet</i>. 1998.
  mla: Ziegler, Martin, et al. <i>Multimediale Entdeckungsreisen Unserer Welt Mit
    Dem Internet</i>. 1998.
  short: M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer
    Welt Mit Dem Internet, 1998.
date_created: 2020-08-24T09:55:41Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
status: public
title: Multimediale Entdeckungsreisen unserer Welt mit dem Internet
type: report
user_id: '15415'
year: '1998'
...
---
_id: '18445'
author:
- first_name: Brigitte
  full_name: Oesterdiekhoff, Brigitte
  last_name: Oesterdiekhoff
citation:
  ama: Oesterdiekhoff B. <i>On Periodic Comparator Networks</i>. Universität Paderborn;
    1998.
  apa: Oesterdiekhoff, B. (1998). <i>On Periodic Comparator Networks</i>. Universität
    Paderborn.
  bibtex: '@book{Oesterdiekhoff_1998, place={Universität Paderborn}, title={On Periodic
    Comparator Networks}, author={Oesterdiekhoff, Brigitte}, year={1998} }'
  chicago: Oesterdiekhoff, Brigitte. <i>On Periodic Comparator Networks</i>. Universität
    Paderborn, 1998.
  ieee: B. Oesterdiekhoff, <i>On Periodic Comparator Networks</i>. Universität Paderborn,
    1998.
  mla: Oesterdiekhoff, Brigitte. <i>On Periodic Comparator Networks</i>. 1998.
  short: B. Oesterdiekhoff, On Periodic Comparator Networks, Universität Paderborn,
    1998.
date_created: 2020-08-27T11:42:12Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '63'
language:
- iso: eng
place: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On Periodic Comparator Networks
type: dissertation
user_id: '15415'
year: '1998'
...
---
_id: '2168'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: Scheideler C, Vöcking B. Universal Continuous Routing Strategies. <i>Theory
    Comput Syst</i>. 1998;31(4):425--449. doi:<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>
  apa: Scheideler, C., &#38; Vöcking, B. (1998). Universal Continuous Routing Strategies.
    <i>Theory Comput. Syst.</i>, <i>31</i>(4), 425--449. <a href="https://doi.org/10.1007/s002240000096">https://doi.org/10.1007/s002240000096</a>
  bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
    volume={31}, DOI={<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>},
    number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
    Vöcking, Berthold}, year={1998}, pages={425--449} }'
  chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
    Strategies.” <i>Theory Comput. Syst.</i> 31, no. 4 (1998): 425--449. <a href="https://doi.org/10.1007/s002240000096">https://doi.org/10.1007/s002240000096</a>.'
  ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” <i>Theory
    Comput. Syst.</i>, vol. 31, no. 4, pp. 425--449, 1998.
  mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
    Strategies.” <i>Theory Comput. Syst.</i>, vol. 31, no. 4, 1998, pp. 425--449,
    doi:<a href="https://doi.org/10.1007/s002240000096">10.1007/s002240000096</a>.
  short: C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
date_created: 2018-04-03T08:59:06Z
date_updated: 2022-01-06T06:55:10Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000096
intvolume: '        31'
issue: '4'
language:
- iso: eng
page: 425--449
publication: Theory Comput. Syst.
status: public
title: Universal Continuous Routing Strategies
type: journal_article
user_id: '14955'
volume: 31
year: '1998'
...
---
_id: '2169'
author:
- first_name: Micah
  full_name: Adler, Micah
  last_name: Adler
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Adler M, Scheideler C. Efficient Communication Strategies for Ad-Hoc Wireless
    Networks (Extended Abstract). In: <i>SPAA</i>. ; 1998:259--268.'
  apa: Adler, M., &#38; Scheideler, C. (1998). Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract). In <i>SPAA</i> (pp. 259--268).
  bibtex: '@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler,
    Micah and Scheideler, Christian}, year={1998}, pages={259--268} }'
  chicago: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract).” In <i>SPAA</i>, 259--268, 1998.
  ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
    Wireless Networks (Extended Abstract),” in <i>SPAA</i>, 1998, pp. 259--268.
  mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
    for Ad-Hoc Wireless Networks (Extended Abstract).” <i>SPAA</i>, 1998, pp. 259--268.
  short: 'M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.'
date_created: 2018-04-03T08:59:55Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:08:12Z
  date_updated: 2018-04-12T07:08:12Z
  file_id: '2285'
  file_name: SPAA98.pdf
  file_size: 492778
  relation: main_file
file_date_updated: 2018-04-12T07:08:12Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 259--268
publication: SPAA
status: public
title: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
type: conference
urn: '21699'
user_id: '14955'
year: '1998'
...
---
_id: '2170'
author:
- first_name: Uriel
  full_name: Feige, Uriel
  last_name: Feige
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended
    Abstract). In: <i>STOC</i>. ; 1998:624--633.'
  apa: Feige, U., &#38; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
    Scheduling (Extended Abstract). In <i>STOC</i> (pp. 624--633).
  bibtex: '@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic
    Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel
    and Scheideler, Christian}, year={1998}, pages={624--633} }'
  chicago: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
    Shop Scheduling (Extended Abstract).” In <i>STOC</i>, 624--633, 1998.
  ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
    (Extended Abstract),” in <i>STOC</i>, 1998, pp. 624--633.
  mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
    Scheduling (Extended Abstract).” <i>STOC</i>, 1998, pp. 624--633.
  short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
date_created: 2018-04-03T09:00:31Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-12T07:15:50Z
  date_updated: 2018-04-12T07:15:50Z
  file_id: '2286'
  file_name: STOC98.pdf
  file_size: 228487
  relation: main_file
file_date_updated: 2018-04-12T07:15:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 624--633
publication: STOC
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
type: conference
urn: '21705'
user_id: '14955'
year: '1998'
...
---
_id: '2185'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Scheideler C. <i>Universal Routing Strategies for Interconnection Networks</i>.
    Vol 1390.; 1998. doi:<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>
  apa: Scheideler, C. (1998). <i>Universal Routing Strategies for Interconnection
    Networks</i> (Vol. 1390). <a href="https://doi.org/10.1007/BFb0052928">https://doi.org/10.1007/BFb0052928</a>
  bibtex: '@book{Scheideler_1998, series={Lecture Notes in Computer Science}, title={Universal
    Routing Strategies for Interconnection Networks}, volume={1390}, DOI={<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>},
    author={Scheideler, Christian}, year={1998}, collection={Lecture Notes in Computer
    Science} }'
  chicago: Scheideler, Christian. <i>Universal Routing Strategies for Interconnection
    Networks</i>. Vol. 1390. Lecture Notes in Computer Science, 1998. <a href="https://doi.org/10.1007/BFb0052928">https://doi.org/10.1007/BFb0052928</a>.
  ieee: C. Scheideler, <i>Universal Routing Strategies for Interconnection Networks</i>,
    vol. 1390. 1998.
  mla: Scheideler, Christian. <i>Universal Routing Strategies for Interconnection
    Networks</i>. Vol. 1390, 1998, doi:<a href="https://doi.org/10.1007/BFb0052928">10.1007/BFb0052928</a>.
  short: C. Scheideler, Universal Routing Strategies for Interconnection Networks,
    1998.
date_created: 2018-04-03T09:38:18Z
date_updated: 2022-01-06T06:55:17Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/BFb0052928
intvolume: '      1390'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-540-69792-3
series_title: Lecture Notes in Computer Science
status: public
title: Universal Routing Strategies for Interconnection Networks
type: book
user_id: '14955'
volume: 1390
year: '1998'
...
---
_id: '16503'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Klaus
  full_name: Schröder, Klaus
  last_name: Schröder
- first_name: Frank
  full_name: Schwarze, Frank
  last_name: Schwarze
citation:
  ama: Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical
    crossbars. <i>Theoretical Computer Science</i>. 1998;196:181-200. doi:<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>
  apa: Meyer auf der Heide, F., Schröder, K., &#38; Schwarze, F. (1998). Routing on
    networks of optical crossbars. <i>Theoretical Computer Science</i>, <i>196</i>,
    181–200. <a href="https://doi.org/10.1016/s0304-3975(97)86791-6">https://doi.org/10.1016/s0304-3975(97)86791-6</a>
  bibtex: '@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on
    networks of optical crossbars}, volume={196}, DOI={<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>},
    journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm
    and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }'
  chicago: 'Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing
    on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i> 196 (1998):
    181–200. <a href="https://doi.org/10.1016/s0304-3975(97)86791-6">https://doi.org/10.1016/s0304-3975(97)86791-6</a>.'
  ieee: F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks
    of optical crossbars,” <i>Theoretical Computer Science</i>, vol. 196, pp. 181–200,
    1998.
  mla: Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.”
    <i>Theoretical Computer Science</i>, vol. 196, 1998, pp. 181–200, doi:<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>.
  short: F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science
    196 (1998) 181–200.
date_created: 2020-04-14T12:20:57Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(97)86791-6
intvolume: '       196'
language:
- iso: eng
page: 181-200
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Routing on networks of optical crossbars
type: journal_article
user_id: '15415'
volume: 196
year: '1998'
...