---
_id: '20367'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Heinz
  full_name: Wörn, Heinz
  last_name: Wörn
citation:
  ama: 'Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the
    Euclidean Steiner Tree Problem. In: <i>The Tenth International Conference on Simulation
    of Adaptive Behavior (SAB’08)</i>. Vol 5040. ; 2008:447--456. doi:<a href="https://doi.org/10.1007/978-3-540-69134-1_44">10.1007/978-3-540-69134-1_44</a>'
  apa: 'Hamann, H., &#38; Wörn, H. (2008). Aggregating Robots Compute: An Adaptive
    Heuristic for the Euclidean Steiner Tree Problem. In <i>The tenth International
    Conference on Simulation of Adaptive Behavior (SAB’08)</i> (Vol. 5040, pp. 447--456).
    <a href="https://doi.org/10.1007/978-3-540-69134-1_44">https://doi.org/10.1007/978-3-540-69134-1_44</a>'
  bibtex: '@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An
    Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={<a
    href="https://doi.org/10.1007/978-3-540-69134-1_44">10.1007/978-3-540-69134-1_44</a>},
    booktitle={The tenth International Conference on Simulation of Adaptive Behavior
    (SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456}
    }'
  chicago: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive
    Heuristic for the Euclidean Steiner Tree Problem.” In <i>The Tenth International
    Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 5040:447--456, 2008.
    <a href="https://doi.org/10.1007/978-3-540-69134-1_44">https://doi.org/10.1007/978-3-540-69134-1_44</a>.'
  ieee: 'H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic
    for the Euclidean Steiner Tree Problem,” in <i>The tenth International Conference
    on Simulation of Adaptive Behavior (SAB’08)</i>, 2008, vol. 5040, pp. 447--456.'
  mla: 'Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic
    for the Euclidean Steiner Tree Problem.” <i>The Tenth International Conference
    on Simulation of Adaptive Behavior (SAB’08)</i>, vol. 5040, 2008, pp. 447--456,
    doi:<a href="https://doi.org/10.1007/978-3-540-69134-1_44">10.1007/978-3-540-69134-1_44</a>.'
  short: 'H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation
    of Adaptive Behavior (SAB’08), 2008, pp. 447--456.'
date_created: 2020-11-16T13:55:39Z
date_updated: 2022-01-06T06:54:26Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-540-69134-1_44
intvolume: '      5040'
language:
- iso: eng
page: 447--456
publication: The tenth International Conference on Simulation of Adaptive Behavior
  (SAB'08)
publication_identifier:
  isbn:
  - '9783540691334'
  - '9783540691341'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner
  Tree Problem'
type: conference
user_id: '15415'
volume: 5040
year: '2008'
...
---
_id: '17978'
author:
- first_name: Katharina
  full_name: Lürwer-Brüggemeier, Katharina
  last_name: Lürwer-Brüggemeier
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic
    Primitives. In: <i>Unconventional Computing</i>. Berlin, Heidelberg; 2008. doi:<a
    href="https://doi.org/10.1007/978-3-540-85194-3_11">10.1007/978-3-540-85194-3_11</a>'
  apa: Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2008). On Faster Integer Calculations
    Using Non-arithmetic Primitives. In <i>Unconventional Computing</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/978-3-540-85194-3_11">https://doi.org/10.1007/978-3-540-85194-3_11</a>
  bibtex: '@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On
    Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={<a href="https://doi.org/10.1007/978-3-540-85194-3_11">10.1007/978-3-540-85194-3_11</a>},
    booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and
    Ziegler, Martin}, year={2008} }'
  chicago: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
    Using Non-Arithmetic Primitives.” In <i>Unconventional Computing</i>. Berlin,
    Heidelberg, 2008. <a href="https://doi.org/10.1007/978-3-540-85194-3_11">https://doi.org/10.1007/978-3-540-85194-3_11</a>.
  ieee: K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using
    Non-arithmetic Primitives,” in <i>Unconventional Computing</i>, Berlin, Heidelberg,
    2008.
  mla: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
    Using Non-Arithmetic Primitives.” <i>Unconventional Computing</i>, 2008, doi:<a
    href="https://doi.org/10.1007/978-3-540-85194-3_11">10.1007/978-3-540-85194-3_11</a>.
  short: 'K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin,
    Heidelberg, 2008.'
date_created: 2020-08-14T13:19:24Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-85194-3_11
language:
- iso: eng
place: Berlin, Heidelberg
publication: Unconventional Computing
publication_identifier:
  isbn:
  - '9783540851936'
  - '9783540851943'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: On Faster Integer Calculations Using Non-arithmetic Primitives
type: book_chapter
user_id: '15415'
year: '2008'
...
---
_id: '24276'
abstract:
- lang: eng
  text: "We define a natural generalization of the prominent k-server problem, the
    k-resource problem. It occurs in metric spaces with some demands and resources
    given at its points. The demands may vary with time, but the total demand may
    never exceed k. The goal of an online algorithm is to satisfy demands by moving
    resources, while minimizing the cost for transporting resources. We give an asymptotically
    optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive
    deterministic one for the k-resource problem on uniform metric spaces consisting
    of n points. This extends known results for paging to the more general setting
    of k-resource.\r\nBasing on the results for uniform metric spaces, we develop
    a randomized algorithm solving the k-resource and the k-server problem on metric
    spaces which can be decomposed into components far away from each other. The algorithm
    achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra
    resources more than the optimal algorithm.\r\n"
author:
- first_name: Marcin
  full_name: Bienkowski, Marcin
  last_name: Bienkowski
- first_name: Jarosław
  full_name: Kutyłowski, Jarosław
  last_name: Kutyłowski
citation:
  ama: 'Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly
    Decomposable Metric Spaces. In: <i>Lecture Notes in Computer Science</i>. ; 2007.
    doi:<a href="https://doi.org/10.1007/978-3-540-73951-7_30">10.1007/978-3-540-73951-7_30</a>'
  apa: Bienkowski, M., &#38; Kutyłowski, J. (2007). The k-Resource Problem on Uniform
    and on Uniformly Decomposable Metric Spaces. <i>Lecture Notes in Computer Science</i>.
    <a href="https://doi.org/10.1007/978-3-540-73951-7_30">https://doi.org/10.1007/978-3-540-73951-7_30</a>
  bibtex: '@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg},
    title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric
    Spaces}, DOI={<a href="https://doi.org/10.1007/978-3-540-73951-7_30">10.1007/978-3-540-73951-7_30</a>},
    booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and
    Kutyłowski, Jarosław}, year={2007} }'
  chicago: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on
    Uniform and on Uniformly Decomposable Metric Spaces.” In <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg, 2007. <a href="https://doi.org/10.1007/978-3-540-73951-7_30">https://doi.org/10.1007/978-3-540-73951-7_30</a>.
  ieee: 'M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on
    Uniformly Decomposable Metric Spaces,” 2007, doi: <a href="https://doi.org/10.1007/978-3-540-73951-7_30">10.1007/978-3-540-73951-7_30</a>.'
  mla: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform
    and on Uniformly Decomposable Metric Spaces.” <i>Lecture Notes in Computer Science</i>,
    2007, doi:<a href="https://doi.org/10.1007/978-3-540-73951-7_30">10.1007/978-3-540-73951-7_30</a>.
  short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
    Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '3019'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
citation:
  ama: 'May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: <i>Advances
    in Cryptology — CRYPTO 2002</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2007:242-256. doi:<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>'
  apa: 'May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In
    <i>Advances in Cryptology — CRYPTO 2002</i> (pp. 242–256). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-45708-9_16">https://doi.org/10.1007/3-540-45708-9_16</a>'
  bibtex: '@inbook{May_2007, place={Berlin, Heidelberg}, title={Cryptanalysis of Unbalanced
    RSA with Small CRT-Exponent}, DOI={<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>},
    booktitle={Advances in Cryptology — CRYPTO 2002}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander}, year={2007}, pages={242–256} }'
  chicago: 'May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
    In <i>Advances in Cryptology — CRYPTO 2002</i>, 242–56. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-45708-9_16">https://doi.org/10.1007/3-540-45708-9_16</a>.'
  ieee: 'A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in <i>Advances
    in Cryptology — CRYPTO 2002</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2007, pp. 242–256.'
  mla: May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
    <i>Advances in Cryptology — CRYPTO 2002</i>, Springer Berlin Heidelberg, 2007,
    pp. 242–56, doi:<a href="https://doi.org/10.1007/3-540-45708-9_16">10.1007/3-540-45708-9_16</a>.
  short: 'A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2007, pp. 242–256.'
date_created: 2018-06-05T08:26:03Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45708-9_16
page: 242-256
place: Berlin, Heidelberg
publication: Advances in Cryptology — CRYPTO 2002
publication_identifier:
  isbn:
  - '9783540440505'
  - '9783540457084'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3020'
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. Low Secret Exponent RSA Revisited. In: <i>Lecture Notes in
    Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19.
    doi:<a href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>'
  apa: 'Blömer, J., &#38; May, A. (2007). Low Secret Exponent RSA Revisited. In <i>Lecture
    Notes in Computer Science</i> (pp. 4–19). Berlin, Heidelberg: Springer Berlin
    Heidelberg. <a href="https://doi.org/10.1007/3-540-44670-2_2">https://doi.org/10.1007/3-540-44670-2_2</a>'
  bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret
    Exponent RSA Revisited}, DOI={<a href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }'
  chicago: 'Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”
    In <i>Lecture Notes in Computer Science</i>, 4–19. Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-44670-2_2">https://doi.org/10.1007/3-540-44670-2_2</a>.'
  ieee: 'J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2007, pp. 4–19.'
  mla: Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” <i>Lecture
    Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:<a
    href="https://doi.org/10.1007/3-540-44670-2_2">10.1007/3-540-44670-2_2</a>.
  short: 'J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.'
date_created: 2018-06-05T08:26:29Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_2
page: 4-19
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540424888'
  - '9783540446705'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Low Secret Exponent RSA Revisited
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3021'
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. Key Revocation with Interval Cover Families. In: <i>Selected
    Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341.
    doi:<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>'
  apa: 'Blömer, J., &#38; May, A. (2007). Key Revocation with Interval Cover Families.
    In <i>Selected Areas in Cryptography</i> (pp. 325–341). Berlin, Heidelberg: Springer
    Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-45537-x_26">https://doi.org/10.1007/3-540-45537-x_26</a>'
  bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation
    with Interval Cover Families}, DOI={<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>},
    booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }'
  chicago: 'Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover
    Families.” In <i>Selected Areas in Cryptography</i>, 325–41. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-45537-x_26">https://doi.org/10.1007/3-540-45537-x_26</a>.'
  ieee: 'J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in <i>Selected
    Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007,
    pp. 325–341.'
  mla: Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”
    <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2007, pp. 325–41,
    doi:<a href="https://doi.org/10.1007/3-540-45537-x_26">10.1007/3-540-45537-x_26</a>.
  short: 'J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2007, pp. 325–341.'
date_created: 2018-06-05T08:26:50Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45537-x_26
page: 325-341
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
  isbn:
  - '9783540430667'
  - '9783540455370'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Key Revocation with Interval Cover Families
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3022'
author:
- first_name: Alexander
  full_name: May, Alexander
  last_name: May
- first_name: Joseph H.
  full_name: Silverman, Joseph H.
  last_name: Silverman
citation:
  ama: 'May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2007:110-125. doi:<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>'
  apa: 'May, A., &#38; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution
    Modular Lattices. In <i>Lecture Notes in Computer Science</i> (pp. 110–125). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-44670-2_10">https://doi.org/10.1007/3-540-44670-2_10</a>'
  bibtex: '@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension
    Reduction Methods for Convolution Modular Lattices}, DOI={<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125}
    }'
  chicago: 'May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods
    for Convolution Modular Lattices.” In <i>Lecture Notes in Computer Science</i>,
    110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-44670-2_10">https://doi.org/10.1007/3-540-44670-2_10</a>.'
  ieee: 'A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution
    Modular Lattices,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007, pp. 110–125.'
  mla: May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution
    Modular Lattices.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg,
    2007, pp. 110–25, doi:<a href="https://doi.org/10.1007/3-540-44670-2_10">10.1007/3-540-44670-2_10</a>.
  short: 'A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.'
date_created: 2018-06-05T08:27:10Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_10
page: 110-125
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540424888'
  - '9783540446705'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Dimension Reduction Methods for Convolution Modular Lattices
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3026'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational
    Numbers. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2007:151-162. doi:<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>'
  apa: 'Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots
    of Rational Numbers. In <i>Algorithms — ESA’ 98</i> (pp. 151–162). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-68530-8_13">https://doi.org/10.1007/3-540-68530-8_13</a>'
  bibtex: '@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic
    Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>},
    booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes}, year={2007}, pages={151–162} }'
  chicago: 'Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving
    Roots of Rational Numbers.” In <i>Algorithms — ESA’ 98</i>, 151–62. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-68530-8_13">https://doi.org/10.1007/3-540-68530-8_13</a>.'
  ieee: 'J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of
    Rational Numbers,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2007, pp. 151–162.'
  mla: Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots
    of Rational Numbers.” <i>Algorithms — ESA’ 98</i>, Springer Berlin Heidelberg,
    2007, pp. 151–62, doi:<a href="https://doi.org/10.1007/3-540-68530-8_13">10.1007/3-540-68530-8_13</a>.
  short: 'J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 2007, pp. 151–162.'
date_created: 2018-06-05T08:28:39Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-68530-8_13
page: 151-162
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
  isbn:
  - '9783540648482'
  - '9783540685302'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '18929'
author:
- first_name: Miroslaw
  full_name: Dynia, Miroslaw
  last_name: Dynia
- first_name: Miroslaw
  full_name: Korzeniowski, Miroslaw
  last_name: Korzeniowski
- first_name: Jarosław
  full_name: Kutyłowski, Jarosław
  last_name: Kutyłowski
citation:
  ama: 'Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum
    Spanning Trees in Dynamic Graphs. In: <i>Proc. of the 33rd International Conference
    on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>.
    Vol 4362. ; 2007:260--271. doi:<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>'
  apa: Dynia, M., Korzeniowski, M., &#38; Kutyłowski, J. (2007). Competitive Maintenance
    of Minimum Spanning Trees in Dynamic Graphs. In <i>Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>
    (Vol. 4362, pp. 260--271). <a href="https://doi.org/10.1007/978-3-540-69507-3_21">https://doi.org/10.1007/978-3-540-69507-3_21</a>
  bibtex: '@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance
    of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>},
    booktitle={Proc. of the 33rd International Conference on Current Trends in Theory
    and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski,
    Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }'
  chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive
    Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In <i>Proc. of the 33rd
    International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM’07)</i>, 4362:260--271, 2007. <a href="https://doi.org/10.1007/978-3-540-69507-3_21">https://doi.org/10.1007/978-3-540-69507-3_21</a>.
  ieee: M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of
    Minimum Spanning Trees in Dynamic Graphs,” in <i>Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>,
    2007, vol. 4362, pp. 260--271.
  mla: Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees
    in Dynamic Graphs.” <i>Proc. of the 33rd International Conference on Current Trends
    in Theory and Practice of Computer Science (SOFSEM’07)</i>, vol. 4362, 2007, pp.
    260--271, doi:<a href="https://doi.org/10.1007/978-3-540-69507-3_21">10.1007/978-3-540-69507-3_21</a>.
  short: 'M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
    2007, pp. 260--271.'
date_created: 2020-09-03T10:29:52Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69507-3_21
intvolume: '      4362'
language:
- iso: eng
page: 260--271
publication: Proc. of the 33rd International Conference on Current Trends in Theory
  and Practice of Computer Science (SOFSEM'07)
publication_identifier:
  isbn:
  - '9783540695066'
  - '9783540695073'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
type: conference
user_id: '15415'
volume: 4362
year: '2007'
...
---
_id: '17982'
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. (Short) Survey of Real Hypercomputation. In: <i>Lecture Notes in
    Computer Science</i>. Berlin, Heidelberg; 2007. doi:<a href="https://doi.org/10.1007/978-3-540-73001-9_86">10.1007/978-3-540-73001-9_86</a>'
  apa: Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-540-73001-9_86">https://doi.org/10.1007/978-3-540-73001-9_86</a>
  bibtex: '@inbook{Ziegler_2007, place={Berlin, Heidelberg}, title={(Short) Survey
    of Real Hypercomputation}, DOI={<a href="https://doi.org/10.1007/978-3-540-73001-9_86">10.1007/978-3-540-73001-9_86</a>},
    booktitle={Lecture Notes in Computer Science}, author={Ziegler, Martin}, year={2007}
    }'
  chicago: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” In <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href="https://doi.org/10.1007/978-3-540-73001-9_86">https://doi.org/10.1007/978-3-540-73001-9_86</a>.
  ieee: M. Ziegler, “(Short) Survey of Real Hypercomputation,” in <i>Lecture Notes
    in Computer Science</i>, Berlin, Heidelberg, 2007.
  mla: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” <i>Lecture Notes
    in Computer Science</i>, 2007, doi:<a href="https://doi.org/10.1007/978-3-540-73001-9_86">10.1007/978-3-540-73001-9_86</a>.
  short: 'M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:33:50Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73001-9_86
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540730002'
  - '9783540730019'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: (Short) Survey of Real Hypercomputation
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17983'
author:
- first_name: Klaus
  full_name: Meer, Klaus
  last_name: Meer
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Meer K, Ziegler M. Real Computational Universality: The Word Problem for a
    Class of Groups with Infinite Presentation. In: <i>Mathematical Foundations of
    Computer Science 2007</i>. Berlin, Heidelberg; 2007. doi:<a href="https://doi.org/10.1007/978-3-540-74456-6_64">10.1007/978-3-540-74456-6_64</a>'
  apa: 'Meer, K., &#38; Ziegler, M. (2007). Real Computational Universality: The Word
    Problem for a Class of Groups with Infinite Presentation. In <i>Mathematical Foundations
    of Computer Science 2007</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-540-74456-6_64">https://doi.org/10.1007/978-3-540-74456-6_64</a>'
  bibtex: '@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational
    Universality: The Word Problem for a Class of Groups with Infinite Presentation},
    DOI={<a href="https://doi.org/10.1007/978-3-540-74456-6_64">10.1007/978-3-540-74456-6_64</a>},
    booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus
    and Ziegler, Martin}, year={2007} }'
  chicago: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The
    Word Problem for a Class of Groups with Infinite Presentation.” In <i>Mathematical
    Foundations of Computer Science 2007</i>. Berlin, Heidelberg, 2007. <a href="https://doi.org/10.1007/978-3-540-74456-6_64">https://doi.org/10.1007/978-3-540-74456-6_64</a>.'
  ieee: 'K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem
    for a Class of Groups with Infinite Presentation,” in <i>Mathematical Foundations
    of Computer Science 2007</i>, Berlin, Heidelberg, 2007.'
  mla: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word
    Problem for a Class of Groups with Infinite Presentation.” <i>Mathematical Foundations
    of Computer Science 2007</i>, 2007, doi:<a href="https://doi.org/10.1007/978-3-540-74456-6_64">10.1007/978-3-540-74456-6_64</a>.'
  short: 'K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007,
    Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:35:56Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-74456-6_64
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2007
publication_identifier:
  isbn:
  - '9783540744559'
  - '9783540744566'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: 'Real Computational Universality: The Word Problem for a Class of Groups with
  Infinite Presentation'
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '16640'
author:
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
- first_name: Robert
  full_name: Preis, Robert
  last_name: Preis
citation:
  ama: 'Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular
    Graphs. In: <i>Mathematical Foundations of Computer Science 2001</i>. Berlin,
    Heidelberg; 2007. doi:<a href="https://doi.org/10.1007/3-540-44683-4_46">10.1007/3-540-44683-4_46</a>'
  apa: Monien, B., &#38; Preis, R. (2007). Upper Bounds on the Bisection Width of
    3- and 4-Regular Graphs. In <i>Mathematical Foundations of Computer Science 2001</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-44683-4_46">https://doi.org/10.1007/3-540-44683-4_46</a>
  bibtex: '@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds
    on the Bisection Width of 3- and 4-Regular Graphs}, DOI={<a href="https://doi.org/10.1007/3-540-44683-4_46">10.1007/3-540-44683-4_46</a>},
    booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien,
    Burkhard and Preis, Robert}, year={2007} }'
  chicago: Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width
    of 3- and 4-Regular Graphs.” In <i>Mathematical Foundations of Computer Science
    2001</i>. Berlin, Heidelberg, 2007. <a href="https://doi.org/10.1007/3-540-44683-4_46">https://doi.org/10.1007/3-540-44683-4_46</a>.
  ieee: B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular
    Graphs,” in <i>Mathematical Foundations of Computer Science 2001</i>, Berlin,
    Heidelberg, 2007.
  mla: Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of
    3- and 4-Regular Graphs.” <i>Mathematical Foundations of Computer Science 2001</i>,
    2007, doi:<a href="https://doi.org/10.1007/3-540-44683-4_46">10.1007/3-540-44683-4_46</a>.
  short: 'B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001,
    Berlin, Heidelberg, 2007.'
date_created: 2020-04-16T08:58:07Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '101'
doi: 10.1007/3-540-44683-4_46
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2001
publication_identifier:
  isbn:
  - '9783540424963'
  - '9783540446835'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
type: book_chapter
user_id: '15701'
year: '2007'
...
---
_id: '15144'
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. Evaluating XPath Queries on XML Data Streams. In:
    <i>Data Management. Data, Data Everywhere, 24th British National Conference on
    Databases, BNCOD 24</i>. Springer; 2007:101-113. doi:<a href="https://doi.org/10.1007/978-3-540-73390-4_10">10.1007/978-3-540-73390-4_10</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2007). Evaluating XPath Queries on XML Data
    Streams. In <i>Data Management. Data, Data Everywhere, 24th British National Conference
    on Databases, BNCOD 24</i> (pp. 101–113). Springer. <a href="https://doi.org/10.1007/978-3-540-73390-4_10">https://doi.org/10.1007/978-3-540-73390-4_10</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2007, title={Evaluating XPath Queries
    on XML Data Streams}, DOI={<a href="https://doi.org/10.1007/978-3-540-73390-4_10">10.1007/978-3-540-73390-4_10</a>},
    booktitle={Data Management. Data, Data Everywhere, 24th British National Conference
    on Databases, BNCOD 24}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz,
    Rita}, year={2007}, pages={101–113} }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML
    Data Streams.” In <i>Data Management. Data, Data Everywhere, 24th British National
    Conference on Databases, BNCOD 24</i>, 101–13. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-73390-4_10">https://doi.org/10.1007/978-3-540-73390-4_10</a>.
  ieee: S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,”
    in <i>Data Management. Data, Data Everywhere, 24th British National Conference
    on Databases, BNCOD 24</i>, 2007, pp. 101–113.
  mla: Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data
    Streams.” <i>Data Management. Data, Data Everywhere, 24th British National Conference
    on Databases, BNCOD 24</i>, Springer, 2007, pp. 101–13, doi:<a href="https://doi.org/10.1007/978-3-540-73390-4_10">10.1007/978-3-540-73390-4_10</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Data Management. Data, Data Everywhere, 24th
    British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–113.'
date_created: 2019-11-22T08:59:56Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
doi: 10.1007/978-3-540-73390-4_10
language:
- iso: eng
page: 101-113
publication: Data Management. Data, Data Everywhere, 24th British National Conference
  on Databases, BNCOD 24
publication_identifier:
  isbn:
  - '9783540733898'
  - '9783540733904'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Evaluating XPath Queries on XML Data Streams
type: conference
user_id: '14961'
year: '2007'
...
---
_id: '15146'
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. Data Management for Mobile Ajax Web 2.0 Applications.
    In: <i>Database and Expert Systems Applications, 18th International Conference,
    DEXA 2007</i>. Springer; 2007:424-433. doi:<a href="https://doi.org/10.1007/978-3-540-74469-6_42">10.1007/978-3-540-74469-6_42</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2007). Data Management for Mobile Ajax Web
    2.0 Applications. In <i>Database and Expert Systems Applications, 18th International
    Conference, DEXA 2007</i> (pp. 424–433). Springer. <a href="https://doi.org/10.1007/978-3-540-74469-6_42">https://doi.org/10.1007/978-3-540-74469-6_42</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2007, title={Data Management for Mobile
    Ajax Web 2.0 Applications}, DOI={<a href="https://doi.org/10.1007/978-3-540-74469-6_42">10.1007/978-3-540-74469-6_42</a>},
    booktitle={Database and Expert Systems Applications, 18th International Conference,
    DEXA 2007}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita},
    year={2007}, pages={424–433} }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax
    Web 2.0 Applications.” In <i>Database and Expert Systems Applications, 18th International
    Conference, DEXA 2007</i>, 424–33. Springer, 2007. <a href="https://doi.org/10.1007/978-3-540-74469-6_42">https://doi.org/10.1007/978-3-540-74469-6_42</a>.
  ieee: S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,”
    in <i>Database and Expert Systems Applications, 18th International Conference,
    DEXA 2007</i>, 2007, pp. 424–433.
  mla: Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web
    2.0 Applications.” <i>Database and Expert Systems Applications, 18th International
    Conference, DEXA 2007</i>, Springer, 2007, pp. 424–33, doi:<a href="https://doi.org/10.1007/978-3-540-74469-6_42">10.1007/978-3-540-74469-6_42</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications,
    18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433.'
date_created: 2019-11-22T09:06:45Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
doi: 10.1007/978-3-540-74469-6_42
language:
- iso: eng
page: 424-433
publication: Database and Expert Systems Applications, 18th International Conference,
  DEXA 2007
publication_identifier:
  isbn:
  - '9783540744672'
  - '9783540744696'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Data Management for Mobile Ajax Web 2.0 Applications
type: conference
user_id: '14961'
year: '2007'
...
---
_id: '19838'
author:
- first_name: Stefan
  full_name: Rührup, Stefan
  last_name: Rührup
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
citation:
  ama: 'Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: <i>Proc.
    of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>.
    ; 2006. doi:<a href="https://doi.org/10.1007/11940128_65">10.1007/11940128_65</a>'
  apa: Rührup, S., &#38; Schindelhauer, C. (2006). Online Multi-path Routing in a
    Maze. In <i>Proc. of the 17th International Symposium on Algorithms and Computation
    (ISAAC 2006)</i>. <a href="https://doi.org/10.1007/11940128_65">https://doi.org/10.1007/11940128_65</a>
  bibtex: '@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing
    in a Maze}, DOI={<a href="https://doi.org/10.1007/11940128_65">10.1007/11940128_65</a>},
    booktitle={Proc. of the 17th International Symposium on Algorithms and Computation
    (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006}
    }'
  chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing
    in a Maze.” In <i>Proc. of the 17th International Symposium on Algorithms and
    Computation (ISAAC 2006)</i>, 2006. <a href="https://doi.org/10.1007/11940128_65">https://doi.org/10.1007/11940128_65</a>.
  ieee: S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in
    <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC
    2006)</i>, 2006.
  mla: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in
    a Maze.” <i>Proc. of the 17th International Symposium on Algorithms and Computation
    (ISAAC 2006)</i>, 2006, doi:<a href="https://doi.org/10.1007/11940128_65">10.1007/11940128_65</a>.
  short: 'S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium
    on Algorithms and Computation (ISAAC 2006), 2006.'
date_created: 2020-10-01T11:51:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/11940128_65
language:
- iso: eng
publication: Proc. of the 17th International Symposium on Algorithms and Computation
  (ISAAC 2006)
publication_identifier:
  isbn:
  - '9783540496946'
  - '9783540496960'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Online Multi-path Routing in a Maze
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '24277'
abstract:
- lang: eng
  text: "We propose a dynamic, ad-hoc communication network consisting of mobile units
    that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a
    practical, low cost solution. Therefore we consider very simple wireless communication
    hardware, without collision detection, with very small bandwidth and a probabilistic
    model of link failure.\r\n\r\nWe provide a complete system architecture. For this
    purpose we design and analyze solutions for size approximation, leader election
    and broadcasting. Our algorithms are fine-tuned for fast operation in a practical
    setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur
    contribution is much different from the previous work, where either pure theoretical
    models with a pure theoretical analysis are provided or algorithms working in
    practical models are evaluated only through simulations."
author:
- first_name: Jarosław
  full_name: Kutyłowski, Jarosław
  last_name: Kutyłowski
- first_name: Filip
  full_name: Zagórski, Filip
  last_name: Zagórski
citation:
  ama: 'Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection.
    In: <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. ; 2006. doi:<a
    href="https://doi.org/10.1007/11611257_37">10.1007/11611257_37</a>'
  apa: 'Kutyłowski, J., &#38; Zagórski, F. (2006). Reliable Broadcasting Without Collision
    Detection. <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. <a href="https://doi.org/10.1007/11611257_37">https://doi.org/10.1007/11611257_37</a>'
  bibtex: '@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable
    Broadcasting Without Collision Detection}, DOI={<a href="https://doi.org/10.1007/11611257_37">10.1007/11611257_37</a>},
    booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski,
    Jarosław and Zagórski, Filip}, year={2006} }'
  chicago: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without
    Collision Detection.” In <i>SOFSEM 2006: Theory and Practice of Computer Science</i>.
    Berlin, Heidelberg, 2006. <a href="https://doi.org/10.1007/11611257_37">https://doi.org/10.1007/11611257_37</a>.'
  ieee: 'J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”
    2006, doi: <a href="https://doi.org/10.1007/11611257_37">10.1007/11611257_37</a>.'
  mla: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision
    Detection.” <i>SOFSEM 2006: Theory and Practice of Computer Science</i>, 2006,
    doi:<a href="https://doi.org/10.1007/11611257_37">10.1007/11611257_37</a>.'
  short: 'J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer
    Science, Berlin, Heidelberg, 2006.'
date_created: 2021-09-13T13:28:29Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/11611257_37
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2006: Theory and Practice of Computer Science'
publication_identifier:
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Reliable Broadcasting Without Collision Detection
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '3004'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: 'Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2006:106-120. doi:<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>'
  apa: 'Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES.
    In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_11">https://doi.org/10.1007/11889700_11</a>'
  bibtex: '@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based
    Collision Attacks on AES}, DOI={<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }'
  chicago: 'Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on
    AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_11">https://doi.org/10.1007/11889700_11</a>.'
  ieee: 'J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture
    Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2006, pp. 106–120.'
  mla: Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”
    <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp.
    106–20, doi:<a href="https://doi.org/10.1007/11889700_11">10.1007/11889700_11</a>.
  short: 'J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.'
date_created: 2018-06-05T08:14:42Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_11
page: 106-120
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Collision Attacks on AES
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3005'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Martin
  full_name: Otto, Martin
  last_name: Otto
citation:
  ama: 'Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2006:13-23. doi:<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>'
  apa: 'Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm
    Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_2">https://doi.org/10.1007/11889700_2</a>'
  bibtex: '@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack
    on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }'
  chicago: 'Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA
    Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_2">https://doi.org/10.1007/11889700_2</a>.'
  ieee: 'J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,”
    in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin
    Heidelberg, 2006, pp. 13–23.'
  mla: Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm
    Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg,
    2006, pp. 13–23, doi:<a href="https://doi.org/10.1007/11889700_2">10.1007/11889700_2</a>.
  short: 'J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.'
date_created: 2018-06-05T08:15:48Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_2
page: 13-23
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3007'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Martin
  full_name: Otto, Martin
  last_name: Otto
- first_name: Jean-Pierre
  full_name: Seifert, Jean-Pierre
  last_name: Seifert
citation:
  ama: 'Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve
    Cryptosystems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg:
    Springer Berlin Heidelberg; 2006:36-52. doi:<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>'
  apa: 'Blömer, J., Otto, M., &#38; Seifert, J.-P. (2006). Sign Change Fault Attacks
    on Elliptic Curve Cryptosystems. In <i>Lecture Notes in Computer Science</i> (pp.
    36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/11889700_4">https://doi.org/10.1007/11889700_4</a>'
  bibtex: '@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign
    Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006},
    pages={36–52} }'
  chicago: 'Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault
    Attacks on Elliptic Curve Cryptosystems.” In <i>Lecture Notes in Computer Science</i>,
    36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href="https://doi.org/10.1007/11889700_4">https://doi.org/10.1007/11889700_4</a>.'
  ieee: 'J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic
    Curve Cryptosystems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2006, pp. 36–52.'
  mla: Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”
    <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp.
    36–52, doi:<a href="https://doi.org/10.1007/11889700_4">10.1007/11889700_4</a>.
  short: 'J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science,
    Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.'
date_created: 2018-06-05T08:17:12Z
date_updated: 2022-01-06T06:58:50Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/11889700_4
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-06-05T08:18:56Z
  date_updated: 2018-06-05T08:18:56Z
  file_id: '3009'
  file_name: SignChangeFaultAttacksOnECC.pdf
  file_size: 259146
  relation: main_file
  success: 1
file_date_updated: 2018-06-05T08:18:56Z
has_accepted_license: '1'
page: 36-52
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540462507'
  - '9783540462514'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Sign Change Fault Attacks on Elliptic Curve Cryptosystems
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '18926'
author:
- first_name: Miroslaw
  full_name: Dynia, Miroslaw
  last_name: Dynia
- first_name: Miroslaw
  full_name: Korzeniowski, Miroslaw
  last_name: Korzeniowski
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
citation:
  ama: 'Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration.
    In: <i>Architecture of Computing Systems - ARCS</i>. ; 2006:341--351. doi:<a href="https://doi.org/10.1007/11682127_24">10.1007/11682127_24</a>'
  apa: Dynia, M., Korzeniowski, M., &#38; Schindelhauer, C. (2006). Power-Aware Collective
    Tree Exploration. In <i>Architecture of Computing Systems - ARCS</i> (pp. 341--351).
    <a href="https://doi.org/10.1007/11682127_24">https://doi.org/10.1007/11682127_24</a>
  bibtex: '@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware
    Collective Tree Exploration}, DOI={<a href="https://doi.org/10.1007/11682127_24">10.1007/11682127_24</a>},
    number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia,
    Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006},
    pages={341--351} }'
  chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware
    Collective Tree Exploration.” In <i>Architecture of Computing Systems - ARCS</i>,
    341--351, 2006. <a href="https://doi.org/10.1007/11682127_24">https://doi.org/10.1007/11682127_24</a>.
  ieee: M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree
    Exploration,” in <i>Architecture of Computing Systems - ARCS</i>, 2006, no. 3894,
    pp. 341--351.
  mla: Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” <i>Architecture
    of Computing Systems - ARCS</i>, no. 3894, 2006, pp. 341--351, doi:<a href="https://doi.org/10.1007/11682127_24">10.1007/11682127_24</a>.
  short: 'M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing
    Systems - ARCS, 2006, pp. 341--351.'
date_created: 2020-09-03T10:13:56Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/11682127_24
issue: '3894'
language:
- iso: eng
page: 341--351
publication: Architecture of Computing Systems - ARCS
publication_identifier:
  isbn:
  - '9783540327653'
  - '9783540327660'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Power-Aware Collective Tree Exploration
type: conference
user_id: '15415'
year: '2006'
...