---
_id: '3012'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography
    – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a
    href="https://doi.org/10.1007/978-3-540-24632-9_1">10.1007/978-3-540-24632-9_1</a>'
  apa: 'Blömer, J., &#38; May, A. (2004). A Generalized Wiener Attack on RSA. In <i>Public
    Key Cryptography – PKC 2004</i> (pp. 1–13). Berlin, Heidelberg: Springer Berlin
    Heidelberg. <a href="https://doi.org/10.1007/978-3-540-24632-9_1">https://doi.org/10.1007/978-3-540-24632-9_1</a>'
  bibtex: '@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized
    Wiener Attack on RSA}, DOI={<a href="https://doi.org/10.1007/978-3-540-24632-9_1">10.1007/978-3-540-24632-9_1</a>},
    booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }'
  chicago: 'Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”
    In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-24632-9_1">https://doi.org/10.1007/978-3-540-24632-9_1</a>.'
  ieee: 'J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public
    Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2004, pp. 1–13.'
  mla: Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”
    <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp.
    1–13, doi:<a href="https://doi.org/10.1007/978-3-540-24632-9_1">10.1007/978-3-540-24632-9_1</a>.
  short: 'J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.'
date_created: 2018-06-05T08:20:59Z
date_updated: 2022-01-06T06:58:51Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-540-24632-9_1
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-06-05T08:21:31Z
  date_updated: 2018-06-05T08:21:31Z
  file_id: '3013'
  file_name: keys.pdf
  file_size: 198120
  relation: main_file
  success: 1
file_date_updated: 2018-06-05T08:21:31Z
has_accepted_license: '1'
page: 1-13
place: Berlin, Heidelberg
publication: Public Key Cryptography – PKC 2004
publication_identifier:
  isbn:
  - '9783540210184'
  - '9783540246329'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: A Generalized Wiener Attack on RSA
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3014'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'May A. Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q. In:
    <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2004:218-230. doi:<a href="https://doi.org/10.1007/978-3-540-24632-9_16">10.1007/978-3-540-24632-9_16</a>'
  apa: 'May, A. (2004). Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q.
    In <i>Public Key Cryptography – PKC 2004</i> (pp. 218–230). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-24632-9_16">https://doi.org/10.1007/978-3-540-24632-9_16</a>'
  bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Secret Exponent Attacks
    on RSA-type Schemes with Moduli N=p^{r}q}, DOI={<a href="https://doi.org/10.1007/978-3-540-24632-9_16">10.1007/978-3-540-24632-9_16</a>},
    booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander}, year={2004}, pages={218–230} }'
  chicago: 'May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli
    N=p^{r}q.” In <i>Public Key Cryptography – PKC 2004</i>, 218–30. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-24632-9_16">https://doi.org/10.1007/978-3-540-24632-9_16</a>.'
  ieee: 'A. May, “Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q,”
    in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin
    Heidelberg, 2004, pp. 218–230.'
  mla: May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^{r}q.”
    <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp.
    218–30, doi:<a href="https://doi.org/10.1007/978-3-540-24632-9_16">10.1007/978-3-540-24632-9_16</a>.
  short: 'A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2004, pp. 218–230.'
date_created: 2018-06-05T08:22:02Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-24632-9_16
page: 218-230
place: Berlin, Heidelberg
publication: Public Key Cryptography – PKC 2004
publication_identifier:
  isbn:
  - '9783540210184'
  - '9783540246329'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '3015'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent
    to Factoring. In: <i>Advances in Cryptology – CRYPTO 2004</i>. Berlin, Heidelberg:
    Springer Berlin Heidelberg; 2004:213-219. doi:<a href="https://doi.org/10.1007/978-3-540-28628-8_13">10.1007/978-3-540-28628-8_13</a>'
  apa: 'May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time
    Equivalent to Factoring. In <i>Advances in Cryptology – CRYPTO 2004</i> (pp. 213–219).
    Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-28628-8_13">https://doi.org/10.1007/978-3-540-28628-8_13</a>'
  bibtex: '@inbook{May_2004, place={Berlin, Heidelberg}, title={Computing the RSA
    Secret Key Is Deterministic Polynomial Time Equivalent to Factoring}, DOI={<a
    href="https://doi.org/10.1007/978-3-540-28628-8_13">10.1007/978-3-540-28628-8_13</a>},
    booktitle={Advances in Cryptology – CRYPTO 2004}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander}, year={2004}, pages={213–219} }'
  chicago: 'May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial
    Time Equivalent to Factoring.” In <i>Advances in Cryptology – CRYPTO 2004</i>,
    213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-28628-8_13">https://doi.org/10.1007/978-3-540-28628-8_13</a>.'
  ieee: 'A. May, “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent
    to Factoring,” in <i>Advances in Cryptology – CRYPTO 2004</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2004, pp. 213–219.'
  mla: May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time
    Equivalent to Factoring.” <i>Advances in Cryptology – CRYPTO 2004</i>, Springer
    Berlin Heidelberg, 2004, pp. 213–19, doi:<a href="https://doi.org/10.1007/978-3-540-28628-8_13">10.1007/978-3-540-28628-8_13</a>.
  short: 'A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2004, pp. 213–219.'
date_created: 2018-06-05T08:23:43Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-28628-8_13
page: 213-219
place: Berlin, Heidelberg
publication: Advances in Cryptology – CRYPTO 2004
publication_identifier:
  isbn:
  - '9783540226680'
  - '9783540286288'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to
  Factoring
type: book_chapter
user_id: '25078'
year: '2004'
...
---
_id: '18778'
abstract:
- lang: eng
  text: Given a point set P in the d-dimensional unit hypercube, we give upper bounds
    on the maximal expected number of extreme points when each point is perturbed
    by small random noise chosen independently for each point from the same noise
    distribution &#916;. Our results are parametrized by the variance of the noise
    distribution. For large variance we essentially consider the average case for
    distribution &#916; while for variance 0 we consider the worst case. Hence our
    results give upper bounds on the number of extreme points where our input distributions
    range from average case to worst case.<br>Our main contribution is a rather general
    lemma that can be used to obtain upper bounds on the expected number of extreme
    points for a large class of noise distributions. We then apply this lemma to obtain
    explicit bounds for random noise coming from the Gaussian normal distribution
    of variance &#963;² and the uniform distribution in a hypercube of side length
    &epsilon. For these noise distributions we show upper bounds of O( (1/ &#963;
    )^d * log^3/2 * d - 1 n ) and O( ( (n log n) / &#949; )^d/(d+1) ), respectively.
    Besides its theoretical motivation our model is also motivated by the observation
    that in many applications of convex hull algorithms the input data is inherently
    noisy, e.g. when the data comes from physical measurement or imprecise arithmetic
    is used.
author:
- first_name: Valentina
  full_name: Damerow, Valentina
  last_name: Damerow
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Damerow V, Sohler C. Extreme Points Under Random Noise. In: <i>Proceedings
    of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin, Heidelberg;
    2004. doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>'
  apa: Damerow, V., &#38; Sohler, C. (2004). Extreme Points Under Random Noise. In
    <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>. Berlin,
    Heidelberg. <a href="https://doi.org/10.1007/978-3-540-30140-0_25">https://doi.org/10.1007/978-3-540-30140-0_25</a>
  bibtex: '@inproceedings{Damerow_Sohler_2004, place={Berlin, Heidelberg}, title={Extreme
    Points Under Random Noise}, DOI={<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>},
    booktitle={Proceedings of the 12th European Symposium on Algorithms (ESA’04)},
    author={Damerow, Valentina and Sohler, Christian}, year={2004} }'
  chicago: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random
    Noise.” In <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>.
    Berlin, Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-30140-0_25">https://doi.org/10.1007/978-3-540-30140-0_25</a>.
  ieee: V. Damerow and C. Sohler, “Extreme Points Under Random Noise,” in <i>Proceedings
    of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004.
  mla: Damerow, Valentina, and Christian Sohler. “Extreme Points Under Random Noise.”
    <i>Proceedings of the 12th European Symposium on Algorithms (ESA’04)</i>, 2004,
    doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_25">10.1007/978-3-540-30140-0_25</a>.
  short: 'V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on
    Algorithms (ESA’04), Berlin, Heidelberg, 2004.'
date_created: 2020-09-01T12:26:47Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_25
language:
- iso: eng
place: Berlin, Heidelberg
publication: Proceedings of the 12th European Symposium on Algorithms (ESA'04)
publication_identifier:
  isbn:
  - '9783540230250'
  - '9783540301400'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Extreme Points Under Random Noise
type: conference
user_id: '15415'
year: '2004'
...
---
_id: '18263'
abstract:
- lang: eng
  text: We generalize univariate multipoint evaluation of polynomials of degree n
    at sublinear amortized cost per point. More precisely, it is shown how to evaluate
    a bivariate polynomial p of maximum degree less than n, specified by its n^2 coefficients,
    simultaneously at n^2 given points using a total of O(n^2.667) arithmetic operations.
    In terms of the input size N being quadratic in n, this amounts to an amortized
    cost of O(N^0.334) per point.
author:
- first_name: Michael
  full_name: Nüsken, Michael
  last_name: Nüsken
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Nüsken M, Ziegler M. Fast Multipoint Evaluation of Bivariate Polynomials.
    In: <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>. Vol 3221. Berlin,
    Heidelberg: Springer; 2004:544-555. doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>'
  apa: 'Nüsken, M., &#38; Ziegler, M. (2004). Fast Multipoint Evaluation of Bivariate
    Polynomials. In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i> (Vol.
    3221, pp. 544–555). Berlin, Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-540-30140-0_49">https://doi.org/10.1007/978-3-540-30140-0_49</a>'
  bibtex: '@inproceedings{Nüsken_Ziegler_2004, place={Berlin, Heidelberg}, title={Fast
    Multipoint Evaluation of Bivariate Polynomials}, volume={3221}, DOI={<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>},
    booktitle={Proc. 12th Annual Symposium on Algorithms (ESA’04)}, publisher={Springer},
    author={Nüsken, Michael and Ziegler, Martin}, year={2004}, pages={544–555} }'
  chicago: 'Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate
    Polynomials.” In <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 3221:544–55.
    Berlin, Heidelberg: Springer, 2004. <a href="https://doi.org/10.1007/978-3-540-30140-0_49">https://doi.org/10.1007/978-3-540-30140-0_49</a>.'
  ieee: M. Nüsken and M. Ziegler, “Fast Multipoint Evaluation of Bivariate Polynomials,”
    in <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, 2004, vol. 3221,
    pp. 544–555.
  mla: Nüsken, Michael, and Martin Ziegler. “Fast Multipoint Evaluation of Bivariate
    Polynomials.” <i>Proc. 12th Annual Symposium on Algorithms (ESA’04)</i>, vol.
    3221, Springer, 2004, pp. 544–55, doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_49">10.1007/978-3-540-30140-0_49</a>.
  short: 'M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04),
    Springer, Berlin, Heidelberg, 2004, pp. 544–555.'
date_created: 2020-08-25T11:25:11Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_49
intvolume: '      3221'
language:
- iso: eng
page: 544-555
place: Berlin, Heidelberg
publication: Proc. 12th Annual Symposium on Algorithms (ESA'04)
publication_identifier:
  isbn:
  - '9783540230250'
  - '9783540301400'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Fast Multipoint Evaluation of Bivariate Polynomials
type: conference
user_id: '15415'
volume: 3221
year: '2004'
...
---
_id: '18279'
abstract:
- lang: eng
  text: 'For $c in REAL$, a $c$-spanner is a subgraph of a complete Euclidean graph
    satisfying that between any two vertices there exists a path of weighted length
    at most $c$ times their geometric distance. Based on this property to approximate
    a complete weighted graph, sparse spanners have found many applications, e.g.,
    in FPTAS, geometric searching, and radio networks. For geometric searching, it
    turned out to suffice whether the radius rather than the length of some path between
    any two vertices is bounded relatively to their geometric distance; this is the
    defining property of weak spanners. Finally regarding radio network applications,
    a power spanner accounts for the total energy afforded for a wireless transmission
    with the requirement that the sum of the squares of the lengths of some path between
    any two planar vertices must be bounded relatively to the square of their geometric
    distance (or higher powers up to 6 or even 8).<br><br>While it is known that any
    $c$-spanner is also both a weak $C_1$-spanner and a $C_2$-power spanner (for appropriate
    $C_1,C_2$ depending only on $c$ but not on the graph under consideration), we
    show that the converse fails: There exists a family of $c_1$-power spanners that
    are no weak $C$-spanners and also a family of weak $c_2$-spanners that are no
    $C$-spanners for any fixed $C$ (and thus no uniform spanners, either). However
    the deepest result of the present work reveals that, surprisingly, any weak spanner
    is also a uniform power spanner. We further generalize the latter notion by considering
    $(c,delta)$-power spanners where the sum of the $delta$-th powers of the lengths
    has to be bounded; so $(cdot,2)$-power spanners coincide with the usual power
    spanners and $(cdot,1)$-power spanners are classical spanners. Interestingly,
    these $(cdot,delta)$-power spanners form a strict hierarchy where the above results
    still hold for any $deltageq2$; some even hold for $delta>1$ while counterexamples
    reveal others to fail for $delta<2$. In fact we show that in general every self-similar
    curve of fractal dimension $d>delta$ is no $(C,delta)$-power spanner for any fixed
    $C$. '
author:
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Klaus
  full_name: Volbert, Klaus
  last_name: Volbert
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Schindelhauer C, Volbert K, Ziegler M. Spanners, Weak Spanners, and Power
    Spanners for Wireless Networks. In: <i>Proc. of 15th Annual International Symposium
    on Algorithms and Computation (ISAAC’04)</i>. Vol 3341. Berlin, Heidelberg: Springer
    ; 2004:805-821. doi:<a href="https://doi.org/10.1007/978-3-540-30551-4_69">10.1007/978-3-540-30551-4_69</a>'
  apa: 'Schindelhauer, C., Volbert, K., &#38; Ziegler, M. (2004). Spanners, Weak Spanners,
    and Power Spanners for Wireless Networks. In <i>Proc. of 15th Annual International
    Symposium on Algorithms and Computation (ISAAC’04)</i> (Vol. 3341, pp. 805–821).
    Berlin, Heidelberg: Springer . <a href="https://doi.org/10.1007/978-3-540-30551-4_69">https://doi.org/10.1007/978-3-540-30551-4_69</a>'
  bibtex: '@inproceedings{Schindelhauer_Volbert_Ziegler_2004, place={Berlin, Heidelberg},
    title={Spanners, Weak Spanners, and Power Spanners for Wireless Networks}, volume={3341},
    DOI={<a href="https://doi.org/10.1007/978-3-540-30551-4_69">10.1007/978-3-540-30551-4_69</a>},
    booktitle={Proc. of 15th Annual International Symposium on Algorithms and Computation
    (ISAAC’04)}, publisher={Springer }, author={Schindelhauer, Christian and Volbert,
    Klaus and Ziegler, Martin}, year={2004}, pages={805–821} }'
  chicago: 'Schindelhauer, Christian, Klaus Volbert, and Martin Ziegler. “Spanners,
    Weak Spanners, and Power Spanners for Wireless Networks.” In <i>Proc. of 15th
    Annual International Symposium on Algorithms and Computation (ISAAC’04)</i>, 3341:805–21.
    Berlin, Heidelberg: Springer , 2004. <a href="https://doi.org/10.1007/978-3-540-30551-4_69">https://doi.org/10.1007/978-3-540-30551-4_69</a>.'
  ieee: C. Schindelhauer, K. Volbert, and M. Ziegler, “Spanners, Weak Spanners, and
    Power Spanners for Wireless Networks,” in <i>Proc. of 15th Annual International
    Symposium on Algorithms and Computation (ISAAC’04)</i>, 2004, vol. 3341, pp. 805–821.
  mla: Schindelhauer, Christian, et al. “Spanners, Weak Spanners, and Power Spanners
    for Wireless Networks.” <i>Proc. of 15th Annual International Symposium on Algorithms
    and Computation (ISAAC’04)</i>, vol. 3341, Springer , 2004, pp. 805–21, doi:<a
    href="https://doi.org/10.1007/978-3-540-30551-4_69">10.1007/978-3-540-30551-4_69</a>.
  short: 'C. Schindelhauer, K. Volbert, M. Ziegler, in: Proc. of 15th Annual International
    Symposium on Algorithms and Computation (ISAAC’04), Springer , Berlin, Heidelberg,
    2004, pp. 805–821.'
date_created: 2020-08-25T12:30:19Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30551-4_69
intvolume: '      3341'
language:
- iso: eng
page: 805-821
place: Berlin, Heidelberg
publication: Proc. of 15th Annual International Symposium on Algorithms and Computation
  (ISAAC'04)
publication_identifier:
  isbn:
  - '9783540241317'
  - '9783540305514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: 'Springer '
status: public
title: Spanners, Weak Spanners, and Power Spanners for Wireless Networks
type: conference
user_id: '15415'
volume: 3341
year: '2004'
...
---
_id: '16474'
abstract:
- lang: eng
  text: "Given n distinct points p1, p2, ... , pn in the plane, the map labeling\r\nproblem
    with four squares is to place n axis-parallel equi-sized squares Q1, ... ,Qn\r\nof
    maximum possible size such that pi is a corner of Qi and no two squares overlap.\r\nThis
    problem is NP-hard and no algorithm with approximation ratio better\r\nthan 1/2
    exists unless P = NP [10].\r\nIn this paper, we consider a scenario where we want
    to visualize the information\r\ngathered by smart dust, i.e. by a large set of
    simple devices, each consisting of\r\na sensor and a sender that can gather sensor
    data and send it to a central station.\r\nOur task is to label (the positions
    of) these sensors in a way described by the\r\nlabeling problem above. Since these
    devices are not positioned accurately (for\r\nexample, they might be dropped from
    an airplane), this gives rise to consider the\r\nmap labeling problem under the
    assumption, that the positions of the points are\r\nnot fixed precisely, but perturbed
    by random noise. In other words, we consider\r\nthe smoothed complexity of the
    map labeling problem. We present an algorithm\r\nthat, under such an assumption
    and Gaussian random noise with sufficiently large\r\nvariance, has linear smoothed
    complexity."
author:
- first_name: Vikas
  full_name: Bansal, Vikas
  last_name: Bansal
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Bansal V, Meyer auf der Heide F, Sohler C. Labeling Smart Dust. In: <i>12th
    Annual European Symposium on Algorithms (ESA 2004)</i>. Vol 3221. Lecture Notes
    in Computer Science. Berlin, Heidelberg; 2004. doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_9">10.1007/978-3-540-30140-0_9</a>'
  apa: Bansal, V., Meyer auf der Heide, F., &#38; Sohler, C. (2004). Labeling Smart
    Dust. In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i> (Vol.
    3221). Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-540-30140-0_9">https://doi.org/10.1007/978-3-540-30140-0_9</a>
  bibtex: '@inproceedings{Bansal_Meyer auf der Heide_Sohler_2004, place={Berlin, Heidelberg},
    series={Lecture Notes in Computer Science}, title={Labeling Smart Dust}, volume={3221},
    DOI={<a href="https://doi.org/10.1007/978-3-540-30140-0_9">10.1007/978-3-540-30140-0_9</a>},
    booktitle={12th Annual European Symposium on Algorithms (ESA 2004)}, author={Bansal,
    Vikas and Meyer auf der Heide, Friedhelm and Sohler, Christian}, year={2004},
    collection={Lecture Notes in Computer Science} }'
  chicago: Bansal, Vikas, Friedhelm Meyer auf der Heide, and Christian Sohler. “Labeling
    Smart Dust.” In <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>,
    Vol. 3221. Lecture Notes in Computer Science. Berlin, Heidelberg, 2004. <a href="https://doi.org/10.1007/978-3-540-30140-0_9">https://doi.org/10.1007/978-3-540-30140-0_9</a>.
  ieee: V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in
    <i>12th Annual European Symposium on Algorithms (ESA 2004)</i>, 2004, vol. 3221.
  mla: Bansal, Vikas, et al. “Labeling Smart Dust.” <i>12th Annual European Symposium
    on Algorithms (ESA 2004)</i>, vol. 3221, 2004, doi:<a href="https://doi.org/10.1007/978-3-540-30140-0_9">10.1007/978-3-540-30140-0_9</a>.
  short: 'V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium
    on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.'
date_created: 2020-04-08T11:07:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-540-30140-0_9
intvolume: '      3221'
language:
- iso: eng
place: Berlin, Heidelberg
publication: 12th Annual European Symposium on Algorithms (ESA 2004)
publication_identifier:
  isbn:
  - '9783540230250'
  - '9783540301400'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Labeling Smart Dust
type: conference
user_id: '15415'
volume: 3221
year: '2004'
...
---
_id: '13618'
author:
- first_name: Herbert
  full_name: Walder, Herbert
  last_name: Walder
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Walder H, Platzner M. A Runtime Environment for Reconfigurable Hardware Operating
    Systems. In: <i>Proceedings of the 14th International Conference on Field Programmable
    Logic and Applications (FPL)</i>. Berlin, Heidelberg: Springer; 2004:831-835.
    doi:<a href="https://doi.org/10.1007/978-3-540-30117-2_84">10.1007/978-3-540-30117-2_84</a>'
  apa: 'Walder, H., &#38; Platzner, M. (2004). A Runtime Environment for Reconfigurable
    Hardware Operating Systems. In <i>Proceedings of the 14th International Conference
    on Field Programmable Logic and Applications (FPL)</i> (pp. 831–835). Berlin,
    Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-540-30117-2_84">https://doi.org/10.1007/978-3-540-30117-2_84</a>'
  bibtex: '@inproceedings{Walder_Platzner_2004, place={Berlin, Heidelberg}, title={A
    Runtime Environment for Reconfigurable Hardware Operating Systems}, DOI={<a href="https://doi.org/10.1007/978-3-540-30117-2_84">10.1007/978-3-540-30117-2_84</a>},
    booktitle={Proceedings of the 14th International Conference on Field Programmable
    Logic and Applications (FPL)}, publisher={Springer}, author={Walder, Herbert and
    Platzner, Marco}, year={2004}, pages={831–835} }'
  chicago: 'Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable
    Hardware Operating Systems.” In <i>Proceedings of the 14th International Conference
    on Field Programmable Logic and Applications (FPL)</i>, 831–35. Berlin, Heidelberg:
    Springer, 2004. <a href="https://doi.org/10.1007/978-3-540-30117-2_84">https://doi.org/10.1007/978-3-540-30117-2_84</a>.'
  ieee: H. Walder and M. Platzner, “A Runtime Environment for Reconfigurable Hardware
    Operating Systems,” in <i>Proceedings of the 14th International Conference on
    Field Programmable Logic and Applications (FPL)</i>, 2004, pp. 831–835.
  mla: Walder, Herbert, and Marco Platzner. “A Runtime Environment for Reconfigurable
    Hardware Operating Systems.” <i>Proceedings of the 14th International Conference
    on Field Programmable Logic and Applications (FPL)</i>, Springer, 2004, pp. 831–35,
    doi:<a href="https://doi.org/10.1007/978-3-540-30117-2_84">10.1007/978-3-540-30117-2_84</a>.
  short: 'H. Walder, M. Platzner, in: Proceedings of the 14th International Conference
    on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg,
    2004, pp. 831–835.'
date_created: 2019-10-04T21:28:56Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1007/978-3-540-30117-2_84
extern: '1'
language:
- iso: eng
page: 831-835
place: Berlin, Heidelberg
publication: Proceedings of the 14th International Conference on Field Programmable
  Logic and Applications (FPL)
publication_identifier:
  isbn:
  - '9783540229896'
  - '9783540301172'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: A Runtime Environment for Reconfigurable Hardware Operating Systems
type: conference
user_id: '398'
year: '2004'
...
---
_id: '19785'
author:
- first_name: Kay A.
  full_name: Salzwedel, Kay A.
  last_name: Salzwedel
citation:
  ama: Salzwedel KA. Algorithmic Approaches for Storage Networks. <i>Algorithms for
    Memory Hierarchies</i>. 2003;2625. doi:<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>
  apa: Salzwedel, K. A. (2003). Algorithmic Approaches for Storage Networks. <i>Algorithms
    for Memory Hierarchies</i>, <i>2625</i>. <a href="https://doi.org/10.1007/3-540-36574-5_12">https://doi.org/10.1007/3-540-36574-5_12</a>
  bibtex: '@article{Salzwedel_2003, title={Algorithmic Approaches for Storage Networks},
    volume={2625}, DOI={<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>},
    journal={Algorithms for Memory Hierarchies}, author={Salzwedel, Kay A.}, year={2003}
    }'
  chicago: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms
    for Memory Hierarchies</i> 2625 (2003). <a href="https://doi.org/10.1007/3-540-36574-5_12">https://doi.org/10.1007/3-540-36574-5_12</a>.
  ieee: K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” <i>Algorithms
    for Memory Hierarchies</i>, vol. 2625, 2003.
  mla: Salzwedel, Kay A. “Algorithmic Approaches for Storage Networks.” <i>Algorithms
    for Memory Hierarchies</i>, vol. 2625, 2003, doi:<a href="https://doi.org/10.1007/3-540-36574-5_12">10.1007/3-540-36574-5_12</a>.
  short: K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).
date_created: 2020-09-30T10:27:11Z
date_updated: 2022-01-06T06:54:12Z
department:
- _id: '63'
doi: 10.1007/3-540-36574-5_12
intvolume: '      2625'
language:
- iso: eng
publication: Algorithms for Memory Hierarchies
publication_identifier:
  isbn:
  - '9783540008835'
  - '9783540365747'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Algorithmic Approaches for Storage Networks
type: journal_article
user_id: '15415'
volume: 2625
year: '2003'
...
---
_id: '3016'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: <i>Advances
    in Cryptology - CRYPTO 2003</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2003:27-43. doi:<a href="https://doi.org/10.1007/978-3-540-45146-4_2">10.1007/978-3-540-45146-4_2</a>'
  apa: 'Blömer, J., &#38; May, A. (2003). New Partial Key Exposure Attacks on RSA.
    In <i>Advances in Cryptology - CRYPTO 2003</i> (pp. 27–43). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-45146-4_2">https://doi.org/10.1007/978-3-540-45146-4_2</a>'
  bibtex: '@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial
    Key Exposure Attacks on RSA}, DOI={<a href="https://doi.org/10.1007/978-3-540-45146-4_2">10.1007/978-3-540-45146-4_2</a>},
    booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }'
  chicago: 'Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks
    on RSA.” In <i>Advances in Cryptology - CRYPTO 2003</i>, 27–43. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-45146-4_2">https://doi.org/10.1007/978-3-540-45146-4_2</a>.'
  ieee: 'J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in <i>Advances
    in Cryptology - CRYPTO 2003</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2003, pp. 27–43.'
  mla: Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”
    <i>Advances in Cryptology - CRYPTO 2003</i>, Springer Berlin Heidelberg, 2003,
    pp. 27–43, doi:<a href="https://doi.org/10.1007/978-3-540-45146-4_2">10.1007/978-3-540-45146-4_2</a>.
  short: 'J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.'
date_created: 2018-06-05T08:24:11Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-45146-4_2
page: 27-43
place: Berlin, Heidelberg
publication: Advances in Cryptology - CRYPTO 2003
publication_identifier:
  isbn:
  - '9783540406747'
  - '9783540451464'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: New Partial Key Exposure Attacks on RSA
type: book_chapter
user_id: '25078'
year: '2003'
...
---
_id: '3018'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jean-Pierre
  full_name: Seifert, Jean-Pierre
  last_name: Seifert
citation:
  ama: 'Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption
    Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer
    Berlin Heidelberg; 2003:162-181. doi:<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>'
  apa: 'Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the
    Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181).
    Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-45126-6_12">https://doi.org/10.1007/978-3-540-45126-6_12</a>'
  bibtex: '@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based
    Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>},
    booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }'
  chicago: 'Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis
    of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>,
    162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-45126-6_12">https://doi.org/10.1007/978-3-540-45126-6_12</a>.'
  ieee: 'J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption
    Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2003, pp. 162–181.'
  mla: Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the
    Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin
    Heidelberg, 2003, pp. 162–81, doi:<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>.
  short: 'J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2003, pp. 162–181.'
date_created: 2018-06-05T08:25:18Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-45126-6_12
page: 162-181
place: Berlin, Heidelberg
publication: Financial Cryptography
publication_identifier:
  isbn:
  - '9783540406631'
  - '9783540451266'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
type: book_chapter
user_id: '25078'
year: '2003'
...
---
_id: '18196'
abstract:
- lang: eng
  text: Fast algorithms for arithmetic on real or complex polynomials are well-known
    and have proven to be not only asymptotically efficient but also very practical.
    Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of
    degree up to N or multi-evaluate one at N points simultaneously within quasi-linear
    time O(N polylog N). An extension to (and in fact the mere definition of) polynomials
    over fields R and C to the SKEW-field H of quaternions is promising but still
    missing. The present work proposes three approaches which in the commutative case
    coincide but for H turn out to differ, each one satisfying some desirable properties
    while lacking others. For each notion, we devise algorithms for according arithmetic;
    these are quasi-optimal in that their running times match lower complexity bounds
    up to polylogarithmic factors.
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>.
    Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715.
    doi:<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>'
  apa: Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In
    <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>
    (pp. 705–715). <a href="https://doi.org/10.1007/978-3-540-24587-2_72">https://doi.org/10.1007/978-3-540-24587-2_72</a>
  bibtex: '@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science,
    vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion
    Polynomials}, DOI={<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>},
    booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation
    (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture
    Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }'
  chicago: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”
    In <i>Proc. 14th Annual International Symposium on Algorithms and Computation
    (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer,
    Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-24587-2_72">https://doi.org/10.1007/978-3-540-24587-2_72</a>.
  ieee: M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>,
    2003, pp. 705–715.
  mla: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>,
    2003, pp. 705–15, doi:<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>.
  short: 'M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms
    and Computation (ISAAC’03), 2003, pp. 705–715.'
date_created: 2020-08-24T14:18:19Z
date_updated: 2022-01-06T06:53:27Z
department:
- _id: '63'
doi: 10.1007/978-3-540-24587-2_72
language:
- iso: eng
page: 705-715
publication: Proc. 14th Annual International Symposium on Algorithms and Computation
  (ISAAC'03)
publication_identifier:
  isbn:
  - '9783540206958'
  - '9783540245872'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg
status: public
title: Quasi-optimal Arithmetic for Quaternion Polynomials
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18258'
abstract:
- lang: eng
  text: Multi-evaluation of the Coulomb potential induced by N particles is a central
    part of N-body simulations. In 3D, known subquadratic time algorithms return approximations
    up to given ABSOLUTE precision. By combining data structures from Computational
    Geometry with fast polynomial arithmetic, the present work obtains approximations
    of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack
    J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in
    Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg:
    Springer; 2003. doi:<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>'
  apa: 'Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F.
    Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.),
    <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer.
    <a href="https://doi.org/10.1007/978-3-540-45078-8_13">https://doi.org/10.1007/978-3-540-45078-8_13</a>'
  bibtex: '@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes
    in Computer Science}, title={Fast Relative Approximation of Potential Fields},
    volume={2748}, DOI={<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler,
    Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data
    Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer
    Science} }'
  chicago: 'Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In
    <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid,
    and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer
    Science. Berlin, Heidelberg: Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-45078-8_13">https://doi.org/10.1007/978-3-540-45078-8_13</a>.'
  ieee: 'M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture
    Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms
    and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.'
  mla: Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture
    Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer,
    2003, doi:<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>.
  short: 'M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures.
    WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg,
    2003.'
corporate_editor:
- Algorithms and Data Structures. WADS 2003
date_created: 2020-08-25T10:15:14Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-45078-8_13
editor:
- first_name: F.
  full_name: Dehne, F.
  last_name: Dehne
- first_name: JR.
  full_name: Sack, JR.
  last_name: Sack
- first_name: M.
  full_name: Smid, M.
  last_name: Smid
intvolume: '      2748'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540405450'
  - '9783540450788'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Fast Relative Approximation of Potential Fields
type: book_chapter
user_id: '15415'
volume: 2748
year: '2003'
...
---
_id: '16543'
author:
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Robert
  full_name: Preis, Robert
  last_name: Preis
citation:
  ama: 'Dellnitz M, Preis R. Congestion and Almost Invariant Sets in Dynamical Systems.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a
    href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>'
  apa: Dellnitz, M., &#38; Preis, R. (2003). Congestion and Almost Invariant Sets
    in Dynamical Systems. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-45084-x_8">https://doi.org/10.1007/3-540-45084-x_8</a>
  bibtex: '@inbook{Dellnitz_Preis_2003, place={Berlin, Heidelberg}, title={Congestion
    and Almost Invariant Sets in Dynamical Systems}, DOI={<a href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>},
    booktitle={Lecture Notes in Computer Science}, author={Dellnitz, Michael and Preis,
    Robert}, year={2003} }'
  chicago: Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets
    in Dynamical Systems.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    2003. <a href="https://doi.org/10.1007/3-540-45084-x_8">https://doi.org/10.1007/3-540-45084-x_8</a>.
  ieee: M. Dellnitz and R. Preis, “Congestion and Almost Invariant Sets in Dynamical
    Systems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003.
  mla: Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets
    in Dynamical Systems.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a
    href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>.
  short: 'M. Dellnitz, R. Preis, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
    2003.'
date_created: 2020-04-15T08:50:07Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1007/3-540-45084-x_8
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540405542'
  - '9783540450849'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Congestion and Almost Invariant Sets in Dynamical Systems
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '16664'
author:
- first_name: Oliver
  full_name: Schütze, Oliver
  last_name: Schütze
citation:
  ama: 'Schütze O. A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg;
    2003. doi:<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>'
  apa: Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-36970-8_36">https://doi.org/10.1007/3-540-36970-8_36</a>
  bibtex: '@inbook{Schütze_2003, place={Berlin, Heidelberg}, title={A New Data Structure
    for the Nondominance Problem in Multi-objective Optimization}, DOI={<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>},
    booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver}, year={2003}
    }'
  chicago: Schütze, Oliver. “A New Data Structure for the Nondominance Problem in
    Multi-Objective Optimization.” In <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg, 2003. <a href="https://doi.org/10.1007/3-540-36970-8_36">https://doi.org/10.1007/3-540-36970-8_36</a>.
  ieee: O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg,
    2003.
  mla: Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective
    Optimization.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>.
  short: 'O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.'
date_created: 2020-04-16T09:57:05Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '101'
doi: 10.1007/3-540-36970-8_36
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540018698'
  - '9783540369707'
  issn:
  - 0302-9743
publication_status: published
status: public
title: A New Data Structure for the Nondominance Problem in Multi-objective Optimization
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '16665'
author:
- first_name: Oliver
  full_name: Schütze, Oliver
  last_name: Schütze
- first_name: Sanaz
  full_name: Mostaghim, Sanaz
  last_name: Mostaghim
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Jürgen
  full_name: Teich, Jürgen
  last_name: Teich
citation:
  ama: 'Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel
    Evolutionary Subdivision Techniques. In: <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg; 2003. doi:<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>'
  apa: Schütze, O., Mostaghim, S., Dellnitz, M., &#38; Teich, J. (2003). Covering
    Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-36970-8_9">https://doi.org/10.1007/3-540-36970-8_9</a>
  bibtex: '@inbook{Schütze_Mostaghim_Dellnitz_Teich_2003, place={Berlin, Heidelberg},
    title={Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques},
    DOI={<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>},
    booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver and Mostaghim,
    Sanaz and Dellnitz, Michael and Teich, Jürgen}, year={2003} }'
  chicago: Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering
    Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/3-540-36970-8_9">https://doi.org/10.1007/3-540-36970-8_9</a>.
  ieee: O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets
    by Multilevel Evolutionary Subdivision Techniques,” in <i>Lecture Notes in Computer
    Science</i>, Berlin, Heidelberg, 2003.
  mla: Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision
    Techniques.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>.
  short: 'O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 2003.'
date_created: 2020-04-16T09:58:10Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '101'
doi: 10.1007/3-540-36970-8_9
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540018698'
  - '9783540369707'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '15077'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Steinmetz, Rita
  id: '14961'
  last_name: Steinmetz
citation:
  ama: 'Böttcher S, Steinmetz R. Testing Containment of XPath Expressions in Order
    to Reduce the Data Transfer to Mobile Clients. In: <i>Advances in Databases and
    Information Systems, 7th East European Conference, ADBIS 2003</i>. Springer; 2003:400-410.
    doi:<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2003). Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients. In <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i> (pp. 400–410).
    Springer. <a href="https://doi.org/10.1007/978-3-540-39403-7_30">https://doi.org/10.1007/978-3-540-39403-7_30</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2003, title={Testing Containment of XPath
    Expressions in Order to Reduce the Data Transfer to Mobile Clients}, DOI={<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>},
    booktitle={Advances in Databases and Information Systems, 7th East European Conference,
    ADBIS 2003}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita},
    year={2003}, pages={400–410} }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients.” In <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, 400–410.
    Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-39403-7_30">https://doi.org/10.1007/978-3-540-39403-7_30</a>.
  ieee: S. Böttcher and R. Steinmetz, “Testing Containment of XPath Expressions in
    Order to Reduce the Data Transfer to Mobile Clients,” in <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, 2003, pp.
    400–410.
  mla: Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients.” <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, Springer,
    2003, pp. 400–10, doi:<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Advances in Databases and Information Systems,
    7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–410.'
date_created: 2019-11-21T14:33:56Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-540-39403-7_30
language:
- iso: eng
page: 400-410
publication: Advances in Databases and Information Systems, 7th East European Conference,
  ADBIS 2003
publication_identifier:
  isbn:
  - '9783540200475'
  - '9783540394037'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Testing Containment of XPath Expressions in Order to Reduce the Data Transfer
  to Mobile Clients
type: conference
user_id: '14961'
year: '2003'
...
---
_id: '15078'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Steinmetz, Rita
  id: '14961'
  last_name: Steinmetz
citation:
  ama: 'Böttcher S, Steinmetz R. A DTD Graph Based XPath Query Subsumption Test. In:
    <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>. Berlin, Heidelberg; 2003:85-99. doi:<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption
    Test. In <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i> (pp. 85–99). Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-540-39429-7_6">https://doi.org/10.1007/978-3-540-39429-7_6</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2003, place={Berlin, Heidelberg}, title={A
    DTD Graph Based XPath Query Subsumption Test}, DOI={<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>},
    booktitle={Database and XML Technologies, First International XML Database Symposium,
    XSym 2003}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2003}, pages={85–99}
    }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption
    Test.” In <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 85–99. Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-39429-7_6">https://doi.org/10.1007/978-3-540-39429-7_6</a>.
  ieee: S. Böttcher and R. Steinmetz, “A DTD Graph Based XPath Query Subsumption Test,”
    in <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 2003, pp. 85–99.
  mla: Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption
    Test.” <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 2003, pp. 85–99, doi:<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Database and XML Technologies, First International
    XML Database Symposium, XSym 2003, Berlin, Heidelberg, 2003, pp. 85–99.'
date_created: 2019-11-21T14:39:48Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-540-39429-7_6
language:
- iso: eng
page: 85-99
place: Berlin, Heidelberg
publication: Database and XML Technologies, First International XML Database Symposium,
  XSym 2003
publication_identifier:
  isbn:
  - '9783540200550'
  - '9783540394297'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: A DTD Graph Based XPath Query Subsumption Test
type: conference
user_id: '14961'
year: '2003'
...
---
_id: '13615'
author:
- first_name: Christoph
  full_name: Steiger, Christoph
  last_name: Steiger
- first_name: Herbert
  full_name: Walder, Herbert
  last_name: Walder
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Steiger C, Walder H, Platzner M. Heuristics for Online Scheduling Real-Time
    Tasks to Partially Reconfigurable Devices. In: <i>Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL)</i>. Berlin, Heidelberg:
    Springer; 2003:575-584. doi:<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>'
  apa: 'Steiger, C., Walder, H., &#38; Platzner, M. (2003). Heuristics for Online
    Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In <i>Proceedings
    of the 13th International Conference on Field Programmable Logic and Applications
    (FPL)</i> (pp. 575–584). Berlin, Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-540-45234-8_56">https://doi.org/10.1007/978-3-540-45234-8_56</a>'
  bibtex: '@inproceedings{Steiger_Walder_Platzner_2003, place={Berlin, Heidelberg},
    title={Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable
    Devices}, DOI={<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>},
    booktitle={Proceedings of the 13th International Conference on Field Programmable
    Logic and Applications (FPL)}, publisher={Springer}, author={Steiger, Christoph
    and Walder, Herbert and Platzner, Marco}, year={2003}, pages={575–584} }'
  chicago: 'Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for
    Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” In <i>Proceedings
    of the 13th International Conference on Field Programmable Logic and Applications
    (FPL)</i>, 575–84. Berlin, Heidelberg: Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-45234-8_56">https://doi.org/10.1007/978-3-540-45234-8_56</a>.'
  ieee: C. Steiger, H. Walder, and M. Platzner, “Heuristics for Online Scheduling
    Real-Time Tasks to Partially Reconfigurable Devices,” in <i>Proceedings of the
    13th International Conference on Field Programmable Logic and Applications (FPL)</i>,
    2003, pp. 575–584.
  mla: Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks
    to Partially Reconfigurable Devices.” <i>Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL)</i>, Springer, 2003,
    pp. 575–84, doi:<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>.
  short: 'C. Steiger, H. Walder, M. Platzner, in: Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin,
    Heidelberg, 2003, pp. 575–584.'
date_created: 2019-10-04T21:20:41Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1007/978-3-540-45234-8_56
extern: '1'
language:
- iso: eng
page: 575-584
place: Berlin, Heidelberg
publication: Proceedings of the 13th International Conference on Field Programmable
  Logic and Applications (FPL)
publication_identifier:
  isbn:
  - '9783540408222'
  - '9783540452348'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable
  Devices
type: conference
user_id: '398'
year: '2003'
...
---
_id: '19850'
author:
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
    Graphs Is Asymptotically Optimal. In: <i>Proc. Workshop on Graph-Theoretic Concepts
    in Computer Science (WG)</i>. Berlin, Heidelberg; 2002:413-420. doi:<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>'
  apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations
    on Circulant Graphs Is Asymptotically Optimal. In <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i> (pp. 413–420). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-36379-3_36">https://doi.org/10.1007/3-540-36379-3_36</a>
  bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing
    Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
    DOI={<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>},
    booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
    author={Wanka, Rolf}, year={2002}, pages={413–420} }'
  chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations
    on Circulant Graphs Is Asymptotically Optimal.” In <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i>, 413–20. Berlin, Heidelberg, 2002. <a href="https://doi.org/10.1007/3-540-36379-3_36">https://doi.org/10.1007/3-540-36379-3_36</a>.
  ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
    Graphs Is Asymptotically Optimal,” in <i>Proc. Workshop on Graph-Theoretic Concepts
    in Computer Science (WG)</i>, 2002, pp. 413–420.
  mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on
    Circulant Graphs Is Asymptotically Optimal.” <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i>, 2002, pp. 413–20, doi:<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>.
  short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science
    (WG), Berlin, Heidelberg, 2002, pp. 413–420.'
date_created: 2020-10-02T11:16:31Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/3-540-36379-3_36
language:
- iso: eng
page: 413-420
place: Berlin, Heidelberg
publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)
publication_identifier:
  isbn:
  - '9783540003311'
  - '9783540363798'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs
  Is Asymptotically Optimal
type: conference
user_id: '15415'
year: '2002'
...