---
_id: '16497'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Mirosław
  full_name: Kutyłowski, Mirosław
  last_name: Kutyłowski
- first_name: Prabhakar
  full_name: Ragde, Prabhakar
  last_name: Ragde
citation:
  ama: 'Meyer auf der Heide F, Kutyłowski M, Ragde P. Complexity Theory and Algorithms.
    In: <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg; 2000. doi:<a
    href="https://doi.org/10.1007/3-540-44520-x_59">10.1007/3-540-44520-x_59</a>'
  apa: Meyer auf der Heide, F., Kutyłowski, M., &#38; Ragde, P. (2000). Complexity
    Theory and Algorithms. In <i>Euro-Par 2000 Parallel Processing</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-44520-x_59">https://doi.org/10.1007/3-540-44520-x_59</a>
  bibtex: '@inbook{Meyer auf der Heide_Kutyłowski_Ragde_2000, place={Berlin, Heidelberg},
    title={Complexity Theory and Algorithms}, DOI={<a href="https://doi.org/10.1007/3-540-44520-x_59">10.1007/3-540-44520-x_59</a>},
    booktitle={Euro-Par 2000 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
    and Kutyłowski, Mirosław and Ragde, Prabhakar}, year={2000} }'
  chicago: Meyer auf der Heide, Friedhelm, Mirosław Kutyłowski, and Prabhakar Ragde.
    “Complexity Theory and Algorithms.” In <i>Euro-Par 2000 Parallel Processing</i>.
    Berlin, Heidelberg, 2000. <a href="https://doi.org/10.1007/3-540-44520-x_59">https://doi.org/10.1007/3-540-44520-x_59</a>.
  ieee: F. Meyer auf der Heide, M. Kutyłowski, and P. Ragde, “Complexity Theory and
    Algorithms,” in <i>Euro-Par 2000 Parallel Processing</i>, Berlin, Heidelberg,
    2000.
  mla: Meyer auf der Heide, Friedhelm, et al. “Complexity Theory and Algorithms.”
    <i>Euro-Par 2000 Parallel Processing</i>, 2000, doi:<a href="https://doi.org/10.1007/3-540-44520-x_59">10.1007/3-540-44520-x_59</a>.
  short: 'F. Meyer auf der Heide, M. Kutyłowski, P. Ragde, in: Euro-Par 2000 Parallel
    Processing, Berlin, Heidelberg, 2000.'
date_created: 2020-04-09T13:30:45Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-44520-x_59
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par 2000 Parallel Processing
publication_identifier:
  isbn:
  - '9783540679561'
  - '9783540445203'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Complexity Theory and Algorithms
type: book_chapter
user_id: '15415'
year: '2000'
...
---
_id: '2435'
author:
- first_name: Jens
  full_name: Simon, Jens
  id: '15273'
  last_name: Simon
- first_name: Alexander
  full_name: Reinefeld, Alexander
  last_name: Reinefeld
- first_name: Oliver
  full_name: Heinz, Oliver
  last_name: Heinz
citation:
  ama: 'Simon J, Reinefeld A, Heinz O. Large-Scale SCI Clusters in Practice: Architecture
    and Performance in SCI. In: Hellwagner H, Reinefeld A, eds. <i>SCI: Scalable Coherent
    Interface. Architecture and Software for High-Performance Compute Clusters</i>.
    Vol 1734. Lecture Notes in Computer Science (LNCS). Berlin / Heidelberg: Springer;
    1999:367-381. doi:<a href="https://doi.org/10.1007/10704208">10.1007/10704208</a>'
  apa: 'Simon, J., Reinefeld, A., &#38; Heinz, O. (1999). Large-Scale SCI Clusters
    in Practice: Architecture and Performance in SCI. In H. Hellwagner &#38; A. Reinefeld
    (Eds.), <i>SCI: Scalable Coherent Interface. Architecture and Software for High-Performance
    Compute Clusters</i> (Vol. 1734, pp. 367–381). Berlin / Heidelberg: Springer.
    <a href="https://doi.org/10.1007/10704208">https://doi.org/10.1007/10704208</a>'
  bibtex: '@inbook{Simon_Reinefeld_Heinz_1999, place={Berlin / Heidelberg}, series={Lecture
    Notes in Computer Science (LNCS)}, title={Large-Scale SCI Clusters in Practice:
    Architecture and Performance in SCI}, volume={1734}, DOI={<a href="https://doi.org/10.1007/10704208">10.1007/10704208</a>},
    booktitle={SCI: Scalable Coherent Interface. Architecture and Software for High-Performance
    Compute Clusters}, publisher={Springer}, author={Simon, Jens and Reinefeld, Alexander
    and Heinz, Oliver}, editor={Hellwagner, Hermann and Reinefeld, AlexanderEditors},
    year={1999}, pages={367–381}, collection={Lecture Notes in Computer Science (LNCS)}
    }'
  chicago: 'Simon, Jens, Alexander Reinefeld, and Oliver Heinz. “Large-Scale SCI Clusters
    in Practice: Architecture and Performance in SCI.” In <i>SCI: Scalable Coherent
    Interface. Architecture and Software for High-Performance Compute Clusters</i>,
    edited by Hermann Hellwagner and Alexander Reinefeld, 1734:367–81. Lecture Notes
    in Computer Science (LNCS). Berlin / Heidelberg: Springer, 1999. <a href="https://doi.org/10.1007/10704208">https://doi.org/10.1007/10704208</a>.'
  ieee: 'J. Simon, A. Reinefeld, and O. Heinz, “Large-Scale SCI Clusters in Practice:
    Architecture and Performance in SCI,” in <i>SCI: Scalable Coherent Interface.
    Architecture and Software for High-Performance Compute Clusters</i>, vol. 1734,
    H. Hellwagner and A. Reinefeld, Eds. Berlin / Heidelberg: Springer, 1999, pp.
    367–381.'
  mla: 'Simon, Jens, et al. “Large-Scale SCI Clusters in Practice: Architecture and
    Performance in SCI.” <i>SCI: Scalable Coherent Interface. Architecture and Software
    for High-Performance Compute Clusters</i>, edited by Hermann Hellwagner and Alexander
    Reinefeld, vol. 1734, Springer, 1999, pp. 367–81, doi:<a href="https://doi.org/10.1007/10704208">10.1007/10704208</a>.'
  short: 'J. Simon, A. Reinefeld, O. Heinz, in: H. Hellwagner, A. Reinefeld (Eds.),
    SCI: Scalable Coherent Interface. Architecture and Software for High-Performance
    Compute Clusters, Springer, Berlin / Heidelberg, 1999, pp. 367–381.'
date_created: 2018-04-17T16:03:28Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '27'
doi: 10.1007/10704208
editor:
- first_name: Hermann
  full_name: Hellwagner, Hermann
  last_name: Hellwagner
- first_name: Alexander
  full_name: Reinefeld, Alexander
  last_name: Reinefeld
intvolume: '      1734'
language:
- iso: eng
page: 367-381
place: Berlin / Heidelberg
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 'SCI: Scalable Coherent Interface. Architecture and Software for High-Performance
  Compute Clusters'
publication_identifier:
  isbn:
  - 978-3-540-47048-9
  - 978-3-540-66696-7
  issn:
  - 0302-9743
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: 'Large-Scale SCI Clusters in Practice: Architecture and Performance in SCI'
type: book_chapter
user_id: '15273'
volume: 1734
year: '1999'
...
---
_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: '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: '13608'
author:
- first_name: Michael
  full_name: Eisenring, Michael
  last_name: Eisenring
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Lothar
  full_name: Thiele, Lothar
  last_name: Thiele
citation:
  ama: 'Eisenring M, Platzner M, Thiele L. Communication Synthesis for Reconfigurable
    Embedded Systems. In: <i>Proceedings of the 9th International Workshop on Field
    Programmable Logic and Applications (FPL)</i>. Vol 1673. LCS. Springer; 1999:205-214.
    doi:<a href="https://doi.org/10.1007/978-3-540-48302-1_21">10.1007/978-3-540-48302-1_21</a>'
  apa: Eisenring, M., Platzner, M., &#38; Thiele, L. (1999). Communication Synthesis
    for Reconfigurable Embedded Systems. In <i>Proceedings of the 9th International
    Workshop on Field Programmable Logic and Applications (FPL)</i> (Vol. 1673, pp.
    205–214). Springer. <a href="https://doi.org/10.1007/978-3-540-48302-1_21">https://doi.org/10.1007/978-3-540-48302-1_21</a>
  bibtex: '@inproceedings{Eisenring_Platzner_Thiele_1999, series={LCS}, title={Communication
    Synthesis for Reconfigurable Embedded Systems}, volume={1673}, DOI={<a href="https://doi.org/10.1007/978-3-540-48302-1_21">10.1007/978-3-540-48302-1_21</a>},
    booktitle={Proceedings of the 9th International Workshop on Field Programmable
    Logic and Applications (FPL)}, publisher={Springer}, author={Eisenring, Michael
    and Platzner, Marco and Thiele, Lothar}, year={1999}, pages={205–214}, collection={LCS}
    }'
  chicago: Eisenring, Michael, Marco Platzner, and Lothar Thiele. “Communication Synthesis
    for Reconfigurable Embedded Systems.” In <i>Proceedings of the 9th International
    Workshop on Field Programmable Logic and Applications (FPL)</i>, 1673:205–14.
    LCS. Springer, 1999. <a href="https://doi.org/10.1007/978-3-540-48302-1_21">https://doi.org/10.1007/978-3-540-48302-1_21</a>.
  ieee: M. Eisenring, M. Platzner, and L. Thiele, “Communication Synthesis for Reconfigurable
    Embedded Systems,” in <i>Proceedings of the 9th International Workshop on Field
    Programmable Logic and Applications (FPL)</i>, 1999, vol. 1673, pp. 205–214.
  mla: Eisenring, Michael, et al. “Communication Synthesis for Reconfigurable Embedded
    Systems.” <i>Proceedings of the 9th International Workshop on Field Programmable
    Logic and Applications (FPL)</i>, vol. 1673, Springer, 1999, pp. 205–14, doi:<a
    href="https://doi.org/10.1007/978-3-540-48302-1_21">10.1007/978-3-540-48302-1_21</a>.
  short: 'M. Eisenring, M. Platzner, L. Thiele, in: Proceedings of the 9th International
    Workshop on Field Programmable Logic and Applications (FPL), Springer, 1999, pp.
    205–214.'
date_created: 2019-10-04T21:01:05Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1007/978-3-540-48302-1_21
extern: '1'
intvolume: '      1673'
language:
- iso: eng
page: 205-214
publication: Proceedings of the 9th International Workshop on Field Programmable Logic
  and Applications (FPL)
publication_identifier:
  isbn:
  - '9783540664574'
  - '9783540483021'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
series_title: LCS
status: public
title: Communication Synthesis for Reconfigurable Embedded Systems
type: conference
user_id: '398'
volume: 1673
year: '1999'
...
---
_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: '16562'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Gabriel Terán
  full_name: Martinez, Gabriel Terán
  last_name: Martinez
citation:
  ama: 'Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway
    and approximate minimum cut computation. In: <i>LATIN’98: Theoretical Informatics</i>.
    Berlin, Heidelberg; 1998. doi:<a href="https://doi.org/10.1007/bfb0054332">10.1007/bfb0054332</a>'
  apa: 'Meyer auf der Heide, F., &#38; Martinez, G. T. (1998). Communication-efficient
    parallel multiway and approximate minimum cut computation. In <i>LATIN’98: Theoretical
    Informatics</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/bfb0054332">https://doi.org/10.1007/bfb0054332</a>'
  bibtex: '@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg},
    title={Communication-efficient parallel multiway and approximate minimum cut computation},
    DOI={<a href="https://doi.org/10.1007/bfb0054332">10.1007/bfb0054332</a>}, booktitle={LATIN’98:
    Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez,
    Gabriel Terán}, year={1998} }'
  chicago: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
    Parallel Multiway and Approximate Minimum Cut Computation.” In <i>LATIN’98: Theoretical
    Informatics</i>. Berlin, Heidelberg, 1998. <a href="https://doi.org/10.1007/bfb0054332">https://doi.org/10.1007/bfb0054332</a>.'
  ieee: 'F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel
    multiway and approximate minimum cut computation,” in <i>LATIN’98: Theoretical
    Informatics</i>, Berlin, Heidelberg, 1998.'
  mla: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
    Parallel Multiway and Approximate Minimum Cut Computation.” <i>LATIN’98: Theoretical
    Informatics</i>, 1998, doi:<a href="https://doi.org/10.1007/bfb0054332">10.1007/bfb0054332</a>.'
  short: 'F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics,
    Berlin, Heidelberg, 1998.'
date_created: 2020-04-15T10:34:15Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0054332
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'LATIN''98: Theoretical Informatics'
publication_identifier:
  isbn:
  - '9783540642756'
  - '9783540697152'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Communication-efficient parallel multiway and approximate minimum cut computation
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '13606'
author:
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Giovanni
  full_name: De Micheli, Giovanni
  last_name: De Micheli
citation:
  ama: 'Platzner M, De Micheli G. Acceleration of satisfiability algorithms by reconfigurable
    hardware. In: <i>Proceedings of the 8th International Workshop on Field Programmable
    Logic and Applications (FPL) </i>. LNCS. Berlin, Heidelberg: Springer ; 1998:69-78.
    doi:<a href="https://doi.org/10.1007/bfb0055234">10.1007/bfb0055234</a>'
  apa: 'Platzner, M., &#38; De Micheli, G. (1998). Acceleration of satisfiability
    algorithms by reconfigurable hardware. In <i>Proceedings of the 8th International
    Workshop on Field Programmable Logic and Applications (FPL) </i> (pp. 69–78).
    Berlin, Heidelberg: Springer . <a href="https://doi.org/10.1007/bfb0055234">https://doi.org/10.1007/bfb0055234</a>'
  bibtex: '@inproceedings{Platzner_De Micheli_1998, place={Berlin, Heidelberg}, series={LNCS},
    title={Acceleration of satisfiability algorithms by reconfigurable hardware},
    DOI={<a href="https://doi.org/10.1007/bfb0055234">10.1007/bfb0055234</a>}, booktitle={Proceedings
    of the 8th International Workshop on Field Programmable Logic and Applications
    (FPL) }, publisher={Springer }, author={Platzner, Marco and De Micheli, Giovanni},
    year={1998}, pages={69–78}, collection={LNCS} }'
  chicago: 'Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability
    Algorithms by Reconfigurable Hardware.” In <i>Proceedings of the 8th International
    Workshop on Field Programmable Logic and Applications (FPL) </i>, 69–78. LNCS.
    Berlin, Heidelberg: Springer , 1998. <a href="https://doi.org/10.1007/bfb0055234">https://doi.org/10.1007/bfb0055234</a>.'
  ieee: M. Platzner and G. De Micheli, “Acceleration of satisfiability algorithms
    by reconfigurable hardware,” in <i>Proceedings of the 8th International Workshop
    on Field Programmable Logic and Applications (FPL) </i>, 1998, pp. 69–78.
  mla: Platzner, Marco, and Giovanni De Micheli. “Acceleration of Satisfiability Algorithms
    by Reconfigurable Hardware.” <i>Proceedings of the 8th International Workshop
    on Field Programmable Logic and Applications (FPL) </i>, Springer , 1998, pp.
    69–78, doi:<a href="https://doi.org/10.1007/bfb0055234">10.1007/bfb0055234</a>.
  short: 'M. Platzner, G. De Micheli, in: Proceedings of the 8th International Workshop
    on Field Programmable Logic and Applications (FPL) , Springer , Berlin, Heidelberg,
    1998, pp. 69–78.'
date_created: 2019-10-04T20:46:34Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1007/bfb0055234
extern: '1'
language:
- iso: eng
page: 69-78
place: Berlin, Heidelberg
publication: 'Proceedings of the 8th International Workshop on Field Programmable
  Logic and Applications (FPL) '
publication_identifier:
  isbn:
  - '9783540649489'
  - '9783540680666'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: 'Springer '
series_title: LNCS
status: public
title: Acceleration of satisfiability algorithms by reconfigurable hardware
type: conference
user_id: '398'
year: '1998'
...
---
_id: '19869'
abstract:
- lang: eng
  text: Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning
    tree of $G$ of maximum degree bounded by $dT$. It is well known that for each
    $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning
    tree is NP-complete. In this paper we investigate this problem when additionally
    connectivity and maximum degree of the graph are given. A complete characterization
    of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$
    is provided. Our first result is that given a biconnected graph of maximum degree
    $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of
    higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning
    tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand,
    we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$
    has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge
    3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$
    has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian
    path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$.
    This extends the well known result for $k=3$ and fully characterizes the case
    $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected
    planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG
    > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$.
    On the other hand, we show how to find in polynomial (linear or almost linear)
    time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Willy-Bernhard
  full_name: Strothmann, Willy-Bernhard
  last_name: Strothmann
citation:
  ama: 'Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: <i>Proceedings
    of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>. ; 1997. doi:<a
    href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>'
  apa: Czumaj, A., &#38; Strothmann, W.-B. (1997). Bounded degree spanning trees.
    <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>.
    <a href="https://doi.org/10.1007/3-540-63397-9_9">https://doi.org/10.1007/3-540-63397-9_9</a>
  bibtex: '@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees},
    DOI={<a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>},
    booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)},
    author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }'
  chicago: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning
    Trees.” In <i>Proceedings of the Fifth Annual European Symposium on Algorithms
    (ESA’97)</i>, 1997. <a href="https://doi.org/10.1007/3-540-63397-9_9">https://doi.org/10.1007/3-540-63397-9_9</a>.
  ieee: 'A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi:
    <a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>.'
  mla: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”
    <i>Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)</i>,
    1997, doi:<a href="https://doi.org/10.1007/3-540-63397-9_9">10.1007/3-540-63397-9_9</a>.
  short: 'A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European
    Symposium on Algorithms (ESA’97), 1997.'
date_created: 2020-10-05T07:13:42Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_9
language:
- iso: eng
publication: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)
publication_identifier:
  isbn:
  - '9783540633976'
  - '9783540695363'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Bounded degree spanning trees
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '3029'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. Denesting by bounded degree radicals. In: <i>Algorithms — ESA ’97</i>.
    Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>'
  apa: 'Blömer, J. (1997). Denesting by bounded degree radicals. In <i>Algorithms
    — ESA ’97</i> (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. <a
    href="https://doi.org/10.1007/3-540-63397-9_5">https://doi.org/10.1007/3-540-63397-9_5</a>'
  bibtex: '@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded
    degree radicals}, DOI={<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>},
    booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes}, year={1997}, pages={53–63} }'
  chicago: 'Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In <i>Algorithms
    — ESA ’97</i>, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. <a
    href="https://doi.org/10.1007/3-540-63397-9_5">https://doi.org/10.1007/3-540-63397-9_5</a>.'
  ieee: 'J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA
    ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.'
  mla: Blömer, Johannes. “Denesting by Bounded Degree Radicals.” <i>Algorithms — ESA
    ’97</i>, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:<a href="https://doi.org/10.1007/3-540-63397-9_5">10.1007/3-540-63397-9_5</a>.
  short: 'J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 1997, pp. 53–63.'
date_created: 2018-06-05T08:30:40Z
date_updated: 2022-01-06T06:58:52Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/3-540-63397-9_5
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-06-05T08:31:35Z
  date_updated: 2018-06-05T08:31:35Z
  file_id: '3030'
  file_name: DenestingByBoundedDegreeRevised.pdf
  file_size: 1656133
  relation: main_file
  success: 1
file_date_updated: 2018-06-05T08:31:35Z
has_accepted_license: '1'
page: 53-63
place: Berlin, Heidelberg
publication: Algorithms — ESA '97
publication_identifier:
  isbn:
  - '9783540633976'
  - '9783540695363'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Denesting by bounded degree radicals
type: book_chapter
user_id: '25078'
year: '1997'
...
---
_id: '16569'
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. Static and dynamic data management in networks.
    In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href="https://doi.org/10.1007/bfb0002716">10.1007/bfb0002716</a>'
  apa: Meyer auf der Heide, F., &#38; Vöcking, B. (1997). Static and dynamic data
    management in networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/bfb0002716">https://doi.org/10.1007/bfb0002716</a>
  bibtex: '@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static
    and dynamic data management in networks}, DOI={<a href="https://doi.org/10.1007/bfb0002716">10.1007/bfb0002716</a>},
    booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
    and Vöcking, Berthold}, year={1997} }'
  chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic
    Data Management in Networks.” In <i>Euro-Par’97 Parallel Processing</i>. Berlin,
    Heidelberg, 1997. <a href="https://doi.org/10.1007/bfb0002716">https://doi.org/10.1007/bfb0002716</a>.
  ieee: F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management
    in networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.
  mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data
    Management in Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a
    href="https://doi.org/10.1007/bfb0002716">10.1007/bfb0002716</a>.
  short: 'F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing,
    Berlin, Heidelberg, 1997.'
date_created: 2020-04-15T11:47:28Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0002716
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
  isbn:
  - '9783540634409'
  - '9783540695493'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Static and dynamic data management in networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16605'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching.
    In: <i>Solving Irregularly Structured Problems in Parallel</i>. Berlin, Heidelberg;
    1997. doi:<a href="https://doi.org/10.1007/3-540-63138-0_21">10.1007/3-540-63138-0_21</a>'
  apa: Bäumker, A., &#38; Meyer auf der Heide, F. (1997). Communication efficient
    parallel searching. In <i>Solving Irregularly Structured Problems in Parallel</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-63138-0_21">https://doi.org/10.1007/3-540-63138-0_21</a>
  bibtex: '@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication
    efficient parallel searching}, DOI={<a href="https://doi.org/10.1007/3-540-63138-0_21">10.1007/3-540-63138-0_21</a>},
    booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker,
    Armin and Meyer auf der Heide, Friedhelm}, year={1997} }'
  chicago: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
    Parallel Searching.” In <i>Solving Irregularly Structured Problems in Parallel</i>.
    Berlin, Heidelberg, 1997. <a href="https://doi.org/10.1007/3-540-63138-0_21">https://doi.org/10.1007/3-540-63138-0_21</a>.
  ieee: A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,”
    in <i>Solving Irregularly Structured Problems in Parallel</i>, Berlin, Heidelberg,
    1997.
  mla: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
    Parallel Searching.” <i>Solving Irregularly Structured Problems in Parallel</i>,
    1997, doi:<a href="https://doi.org/10.1007/3-540-63138-0_21">10.1007/3-540-63138-0_21</a>.
  short: 'A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems
    in Parallel, Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T06:22:32Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1007/3-540-63138-0_21
language:
- iso: eng
place: Berlin, Heidelberg
publication: Solving Irregularly Structured Problems in Parallel
publication_identifier:
  isbn:
  - '9783540631385'
  - '9783540691570'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Communication efficient parallel searching
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16687'
author:
- first_name: Efstratios
  full_name: Karaivazoglou, Efstratios
  last_name: Karaivazoglou
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks.
    In: <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg; 1997. doi:<a href="https://doi.org/10.1007/bfb0002741">10.1007/bfb0002741</a>'
  apa: Karaivazoglou, E., &#38; Meyer auf der Heide, F. (1997). Routing on asyncronous
    processor networks. In <i>Euro-Par’97 Parallel Processing</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/bfb0002741">https://doi.org/10.1007/bfb0002741</a>
  bibtex: '@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg},
    title={Routing on asyncronous processor networks}, DOI={<a href="https://doi.org/10.1007/bfb0002741">10.1007/bfb0002741</a>},
    booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios
    and Meyer auf der Heide, Friedhelm}, year={1997} }'
  chicago: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing
    on Asyncronous Processor Networks.” In <i>Euro-Par’97 Parallel Processing</i>.
    Berlin, Heidelberg, 1997. <a href="https://doi.org/10.1007/bfb0002741">https://doi.org/10.1007/bfb0002741</a>.
  ieee: E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor
    networks,” in <i>Euro-Par’97 Parallel Processing</i>, Berlin, Heidelberg, 1997.
  mla: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous
    Processor Networks.” <i>Euro-Par’97 Parallel Processing</i>, 1997, doi:<a href="https://doi.org/10.1007/bfb0002741">10.1007/bfb0002741</a>.
  short: 'E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing,
    Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:41:06Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bfb0002741
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
  isbn:
  - '9783540634409'
  - '9783540695493'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Routing on asyncronous processor networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16568'
abstract:
- lang: eng
  text: "We present a data structure problem which describes the requirements of a
    simple variant of fully dynamic walk-through animation: We assume the scene to
    consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily
    large and has to be stored in secondary memory (discs) with relatively slow access.
    We allow a visitor to walk in the scene, and a modeler to update the scene by
    insertions and deletions of balls. We focus on the realtime requirement of animation
    systems: For some t (specified by the computation power of (the rendering hardware
    of) the graphic workstation) the data structure has to guarantee that the balls
    within distance t of the current visitor's position are presented to the rendering
    hardware, 20 times per second. Insertions and deletions should also be available
    to the visitor with small delay, independent of the size of the scene. We present
    a data structure that fulfills the above task in realtime. Its runtime is output-sensitive,
    i.e. linear in a quantity close to the output size of the query. We further present
    (preliminary) experimental results indicating that our structure is efficient
    in practice.\r\n"
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Willy-Bernhard
  full_name: Strothmann, Willy-Bernhard
  last_name: Strothmann
citation:
  ama: 'Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures
    for realtime management of large geometric scenes. In: <i>5th Annual European
    Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science.
    Springer; 1997:157-170. doi:<a href="https://doi.org/10.1007/3-540-63397-9_13">10.1007/3-540-63397-9_13</a>'
  apa: Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic
    data structures for realtime management of large geometric scenes. <i>5th Annual
    European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href="https://doi.org/10.1007/3-540-63397-9_13">https://doi.org/10.1007/3-540-63397-9_13</a>
  bibtex: '@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin,
    Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures
    for realtime management of large geometric scenes}, volume={1284}, DOI={<a href="https://doi.org/10.1007/3-540-63397-9_13">10.1007/3-540-63397-9_13</a>},
    booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer},
    author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard},
    year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }'
  chicago: 'Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann.
    “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In
    <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture
    Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href="https://doi.org/10.1007/3-540-63397-9_13">https://doi.org/10.1007/3-540-63397-9_13</a>.'
  ieee: 'M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures
    for realtime management of large geometric scenes,” in <i>5th Annual European
    Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href="https://doi.org/10.1007/3-540-63397-9_13">10.1007/3-540-63397-9_13</a>.'
  mla: Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management
    of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA
    ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href="https://doi.org/10.1007/3-540-63397-9_13">10.1007/3-540-63397-9_13</a>.
  short: 'M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European
    Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.'
date_created: 2020-04-15T11:44:36Z
date_updated: 2026-02-23T16:05:33Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_13
intvolume: '      1284'
language:
- iso: eng
page: 157-170
place: Berlin, Heidelberg
publication: 5th Annual European Symposium on Algorithms (ESA '97)
publication_identifier:
  isbn:
  - '9783540633976'
  - '9783540695363'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Dynamic data structures for realtime management of large geometric scenes
type: conference
user_id: '14972'
volume: 1284
year: '1997'
...
---
_id: '19816'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
citation:
  ama: 'Kleine Büning H, Lettmann T. Learning a representation for optimizable formulas.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996. doi:<a
    href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>'
  apa: Kleine Büning, H., &#38; Lettmann, T. (1996). Learning a representation for
    optimizable formulas. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-61863-5_33">https://doi.org/10.1007/3-540-61863-5_33</a>
  bibtex: '@inbook{Kleine Büning_Lettmann_1996, place={Berlin, Heidelberg}, title={Learning
    a representation for optimizable formulas}, DOI={<a href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>},
    booktitle={Lecture Notes in Computer Science}, author={Kleine Büning, Hans and
    Lettmann, Theodor}, year={1996} }'
  chicago: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for
    Optimizable Formulas.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    1996. <a href="https://doi.org/10.1007/3-540-61863-5_33">https://doi.org/10.1007/3-540-61863-5_33</a>.
  ieee: H. Kleine Büning and T. Lettmann, “Learning a representation for optimizable
    formulas,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996.
  mla: Kleine Büning, Hans, and Theodor Lettmann. “Learning a Representation for Optimizable
    Formulas.” <i>Lecture Notes in Computer Science</i>, 1996, doi:<a href="https://doi.org/10.1007/3-540-61863-5_33">10.1007/3-540-61863-5_33</a>.
  short: 'H. Kleine Büning, T. Lettmann, in: Lecture Notes in Computer Science, Berlin,
    Heidelberg, 1996.'
date_created: 2020-10-01T08:15:08Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1007/3-540-61863-5_33
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540618638'
  - '9783540707196'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Learning a representation for optimizable formulas
type: book_chapter
user_id: '315'
year: '1996'
...
---
_id: '17564'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
- first_name: Wolfgang
  full_name: Dittrich, Wolfgang
  last_name: Dittrich
- 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: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel
    algorithms: Priority queue operations and selection for the BSP* Model. In: <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>'
  apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996).
    Realistic parallel algorithms: Priority queue operations and selection for the
    BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/bfb0024725">https://doi.org/10.1007/bfb0024725</a>'
  bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin,
    Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and
    selection for the BSP* Model}, DOI={<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>},
    booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
    Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376}
    }'
  chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and
    Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection
    for the BSP* Model.” In <i>Lecture Notes in Computer Science</i>, 369–76. Berlin,
    Heidelberg, 1996. <a href="https://doi.org/10.1007/bfb0024725">https://doi.org/10.1007/bfb0024725</a>.'
  ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic
    parallel algorithms: Priority queue operations and selection for the BSP* Model,”
    in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.'
  mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations
    and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996,
    pp. 369–76, doi:<a href="https://doi.org/10.1007/bfb0024725">10.1007/bfb0024725</a>.'
  short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture
    Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
date_created: 2020-08-03T13:11:02Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
doi: 10.1007/bfb0024725
language:
- iso: eng
page: 369-376
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540616276'
  - '9783540706366'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Realistic parallel algorithms: Priority queue operations and selection for
  the BSP* Model'
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '16702'
citation:
  ama: Meyer auf der Heide F, Monien B, eds. <i>Automata, Languages and Programming,
    23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg; 1996. doi:<a href="https://doi.org/10.1007/3-540-61440-0">10.1007/3-540-61440-0</a>
  apa: Meyer auf der Heide, F., &#38; Monien, B. (Eds.). (1996). <i>Automata, Languages
    and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-61440-0">https://doi.org/10.1007/3-540-61440-0</a>
  bibtex: '@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata,
    Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={<a href="https://doi.org/10.1007/3-540-61440-0">10.1007/3-540-61440-0</a>},
    year={1996} }'
  chicago: Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. <i>Automata,
    Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin,
    Heidelberg, 1996. <a href="https://doi.org/10.1007/3-540-61440-0">https://doi.org/10.1007/3-540-61440-0</a>.
  ieee: F. Meyer auf der Heide and B. Monien, Eds., <i>Automata, Languages and Programming,
    23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996.
  mla: Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. <i>Automata,
    Languages and Programming, 23rd International Colloquium, ICALP96</i>. 1996, doi:<a
    href="https://doi.org/10.1007/3-540-61440-0">10.1007/3-540-61440-0</a>.
  short: F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming,
    23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
date_created: 2020-04-16T13:25:51Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-61440-0
editor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783540614401'
  - '9783540685807'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 23rd International Colloquium, ICALP96
type: book_editor
user_id: '15415'
year: '1996'
...
---
_id: '16703'
author:
- first_name: Petra
  full_name: Berenbrink, Petra
  last_name: Berenbrink
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Volker
  full_name: Stemann, Volker
  last_name: Stemann
citation:
  ama: 'Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory
    simulations. In: <i>STACS 96</i>. Berlin, Heidelberg; 1996. doi:<a href="https://doi.org/10.1007/3-540-60922-9_16">10.1007/3-540-60922-9_16</a>'
  apa: Berenbrink, P., Meyer auf der Heide, F., &#38; Stemann, V. (1996). Fault-tolerant
    shared memory simulations. In <i>STACS 96</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60922-9_16">https://doi.org/10.1007/3-540-60922-9_16</a>
  bibtex: '@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg},
    title={Fault-tolerant shared memory simulations}, DOI={<a href="https://doi.org/10.1007/3-540-60922-9_16">10.1007/3-540-60922-9_16</a>},
    booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm
    and Stemann, Volker}, year={1996} }'
  chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant
    Shared Memory Simulations.” In <i>STACS 96</i>. Berlin, Heidelberg, 1996. <a href="https://doi.org/10.1007/3-540-60922-9_16">https://doi.org/10.1007/3-540-60922-9_16</a>.
  ieee: P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared
    memory simulations,” in <i>STACS 96</i>, Berlin, Heidelberg, 1996.
  mla: Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” <i>STACS
    96</i>, 1996, doi:<a href="https://doi.org/10.1007/3-540-60922-9_16">10.1007/3-540-60922-9_16</a>.
  short: 'P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin,
    Heidelberg, 1996.'
date_created: 2020-04-16T13:32:22Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60922-9_16
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 96
publication_identifier:
  isbn:
  - '9783540609223'
  - '9783540497233'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Fault-tolerant shared memory simulations
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '16704'
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. A packet routing protocol for arbitrary
    networks. In: <i>STACS 95</i>. Berlin, Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-59042-0_81">10.1007/3-540-59042-0_81</a>'
  apa: Meyer auf der Heide, F., &#38; Vöcking, B. (1995). A packet routing protocol
    for arbitrary networks. In <i>STACS 95</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-59042-0_81">https://doi.org/10.1007/3-540-59042-0_81</a>
  bibtex: '@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A
    packet routing protocol for arbitrary networks}, DOI={<a href="https://doi.org/10.1007/3-540-59042-0_81">10.1007/3-540-59042-0_81</a>},
    booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold},
    year={1995} }'
  chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing
    Protocol for Arbitrary Networks.” In <i>STACS 95</i>. Berlin, Heidelberg, 1995.
    <a href="https://doi.org/10.1007/3-540-59042-0_81">https://doi.org/10.1007/3-540-59042-0_81</a>.
  ieee: F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary
    networks,” in <i>STACS 95</i>, Berlin, Heidelberg, 1995.
  mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol
    for Arbitrary Networks.” <i>STACS 95</i>, 1995, doi:<a href="https://doi.org/10.1007/3-540-59042-0_81">10.1007/3-540-59042-0_81</a>.
  short: 'F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:36:32Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-59042-0_81
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 95
publication_identifier:
  isbn:
  - '9783540590422'
  - '9783540491750'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: A packet routing protocol for arbitrary networks
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16705'
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Volker
  full_name: Stemann, Volker
  last_name: Stemann
citation:
  ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with
    triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg; 1995. doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>'
  apa: Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory
    simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>
  bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
    title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>},
    booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer
    auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }'
  chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared
    Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_133">https://doi.org/10.1007/3-540-60313-1_133</a>.
  ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
    with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin,
    Heidelberg, 1995.
  mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
    <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href="https://doi.org/10.1007/3-540-60313-1_133">10.1007/3-540-60313-1_133</a>.
  short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:40:52Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_133
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540603139'
  - '9783540449133'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Shared memory simulations with triple-logarithmic delay
type: book_chapter
user_id: '15415'
year: '1995'
...