---
_id: '19724'
abstract:
- lang: eng
  text: We introduce a geometric multi-robot assignment problem. Robots positioned
    in a Euclidean space have to be assigned to treasures in such a way that their
    joint strength is sufficient to unearth a treasure with a given weight. The robots
    have a limited range and thus can only be assigned to treasures in their proximity.
    The objective is to unearth as many treasures as possible. We investigate the
    complexity of several variants of this problem and show whether they are in $\classP$
    or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor
    approximation algorithm using constant-factor resource augmentation for the two-dimensional
    setting with $\bigO(\log^*n)$ communication rounds.
author:
- first_name: Olaf
  full_name: Bonorden, Olaf
  last_name: Bonorden
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
- first_name: Peter
  full_name: Pietrzyk, Peter
  last_name: Pietrzyk
citation:
  ama: 'Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation
    of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless
    Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>'
  apa: 'Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity
    and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic
    Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer.
    <a href="https://doi.org/10.1007/978-3-642-05434-1_25">https://doi.org/10.1007/978-3-642-05434-1_25</a>'
  bibtex: '@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg},
    title={Complexity and Approximation of a Geometric Local Robot Assignment Problem},
    DOI={<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>},
    booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer},
    author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk,
    Peter}, year={2009}, pages={252–262} }'
  chicago: 'Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk.
    “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”
    In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg:
    Springer, 2009. <a href="https://doi.org/10.1007/978-3-642-05434-1_25">https://doi.org/10.1007/978-3-642-05434-1_25</a>.'
  ieee: 'O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation
    of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless
    Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.'
  mla: Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot
    Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer,
    2009, pp. 252–62, doi:<a href="https://doi.org/10.1007/978-3-642-05434-1_25">10.1007/978-3-642-05434-1_25</a>.
  short: 'O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects
    of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.'
date_created: 2020-09-28T10:25:34Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05434-1_25
language:
- iso: eng
page: 252-262
place: Berlin, Heidelberg
publication: Algorithmic Aspects of Wireless Sensor Networks
publication_identifier:
  isbn:
  - '9783642054334'
  - '9783642054341'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Complexity and Approximation of a Geometric Local Robot Assignment Problem
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '2920'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  last_name: Kakvi
citation:
  ama: 'Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:300-301. doi:<a
    href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>'
  apa: 'Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes
    in Computer Science</i> (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg.
    <a href="https://doi.org/10.1007/978-3-642-04052-8_43">https://doi.org/10.1007/978-3-642-04052-8_43</a>'
  bibtex: '@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning
    for Blackjack}, DOI={<a href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
    author={Kakvi, Saqib}, year={2009}, pages={300–301} }'
  chicago: 'Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes
    in Computer Science</i>, 300–301. Berlin, Heidelberg: Springer Berlin Heidelberg,
    2009. <a href="https://doi.org/10.1007/978-3-642-04052-8_43">https://doi.org/10.1007/978-3-642-04052-8_43</a>.'
  ieee: 'S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in
    Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp.
    300–301.'
  mla: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer
    Science</i>, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:<a href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>.
  short: 'S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2009, pp. 300–301.'
date_created: 2018-05-25T12:38:01Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
page: 300-301
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783642040511'
  - '9783642040528'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '3000'
author:
- first_name: Jonas
  full_name: Schrieb, Jonas
  last_name: Schrieb
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
- first_name: Daniel
  full_name: Wonisch, Daniel
  last_name: Wonisch
citation:
  ama: 'Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In:
    <i>FM 2009: Formal Methods</i>. Berlin, Heidelberg: Springer Berlin Heidelberg;
    2009:106-122. doi:<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>'
  apa: 'Schrieb, J., Wehrheim, H., &#38; Wonisch, D. (2009). Three-Valued Spotlight
    Abstractions. In <i>FM 2009: Formal Methods</i> (pp. 106–122). Berlin, Heidelberg:
    Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-05089-3_8">https://doi.org/10.1007/978-3-642-05089-3_8</a>'
  bibtex: '@inbook{Schrieb_Wehrheim_Wonisch_2009, place={Berlin, Heidelberg}, title={Three-Valued
    Spotlight Abstractions}, DOI={<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>},
    booktitle={FM 2009: Formal Methods}, publisher={Springer Berlin Heidelberg}, author={Schrieb,
    Jonas and Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={106–122} }'
  chicago: 'Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight
    Abstractions.” In <i>FM 2009: Formal Methods</i>, 106–22. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-05089-3_8">https://doi.org/10.1007/978-3-642-05089-3_8</a>.'
  ieee: 'J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,”
    in <i>FM 2009: Formal Methods</i>, Berlin, Heidelberg: Springer Berlin Heidelberg,
    2009, pp. 106–122.'
  mla: 'Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” <i>FM 2009:
    Formal Methods</i>, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:<a href="https://doi.org/10.1007/978-3-642-05089-3_8">10.1007/978-3-642-05089-3_8</a>.'
  short: 'J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer
    Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.'
date_created: 2018-06-05T08:09:11Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-05089-3_8
page: 106-122
place: Berlin, Heidelberg
publication: 'FM 2009: Formal Methods'
publication_identifier:
  isbn:
  - '9783642050886'
  - '9783642050893'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Three-Valued Spotlight Abstractions
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '23744'
abstract:
- lang: eng
  text: "In a Stackelberg pricing game a leader aims to set prices on a subset of
    a given collection of items, such as to maximize her revenue from a follower purchasing
    a feasible subset of the items. We focus on the case of computationally bounded
    followers who cannot optimize exactly over the range of all feasible subsets,
    but apply some publicly known algorithm to determine the set of items to purchase.
    This corresponds to general multi-dimensional pricing assuming that consumers
    cannot optimize over the full domain of their valuation functions but still aim
    to act rationally to the best of their ability.\r\n\r\nWe consider two versions
    of this novel type of Stackelberg pricing games. Assuming that items are weighted
    objects and the follower seeks to purchase a min-cost selection of objects of
    some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate
    algorithm, we show how an extension of the known single-price algorithm can be
    used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s
    revenue maximization problem based on so-called near-uniform price assignments.
    We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case
    that items are subsets of some ground set which the follower seeks to cover (the
    Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform
    price assignments fail to yield a good approximation guarantee. However, in the
    special case of elements with frequency 2 (the Vertex-Cover problem) it turns
    out that exact revenue maximization can be done in polynomial-time. This stands
    in sharp contrast to the fact that revenue maximization becomes APX-hard already
    for elements with frequency 3."
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
- first_name: Martin
  full_name: Hoefer, Martin
  last_name: Hoefer
- first_name: Luciano
  full_name: Gualà, Luciano
  last_name: Gualà
- first_name: Carmine
  full_name: Ventre, Carmine
  last_name: Ventre
citation:
  ama: 'Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally
    Bounded Consumers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg;
    2009. doi:<a href="https://doi.org/10.1007/978-3-642-10841-9_6">10.1007/978-3-642-10841-9_6</a>'
  apa: Briest, P., Hoefer, M., Gualà, L., &#38; Ventre, C. (2009). On Stackelberg
    Pricing with Computationally Bounded Consumers. In <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-10841-9_6">https://doi.org/10.1007/978-3-642-10841-9_6</a>
  bibtex: '@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On
    Stackelberg Pricing with Computationally Bounded Consumers}, DOI={<a href="https://doi.org/10.1007/978-3-642-10841-9_6">10.1007/978-3-642-10841-9_6</a>},
    booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer,
    Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }'
  chicago: Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On
    Stackelberg Pricing with Computationally Bounded Consumers.” In <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-10841-9_6">https://doi.org/10.1007/978-3-642-10841-9_6</a>.
  ieee: P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with
    Computationally Bounded Consumers,” in <i>Lecture Notes in Computer Science</i>,
    Berlin, Heidelberg, 2009.
  mla: Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded
    Consumers.” <i>Lecture Notes in Computer Science</i>, 2009, doi:<a href="https://doi.org/10.1007/978-3-642-10841-9_6">10.1007/978-3-642-10841-9_6</a>.
  short: 'P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 2009.'
date_created: 2021-09-03T10:55:38Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1007/978-3-642-10841-9_6
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: On Stackelberg Pricing with Computationally Bounded Consumers
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '1830'
author:
- first_name: Thorsten
  full_name: Biermann, Thorsten
  last_name: Biermann
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Biermann T, Schwabe A, Karl H. Creating Butterflies in the Core – A Network
    Coding Extension for MPLS/RSVP-TE. In: <i>NETWORKING 2009</i>. Berlin, Heidelberg:
    Springer Berlin Heidelberg; 2009:883-894. doi:<a href="https://doi.org/10.1007/978-3-642-01399-7_69">10.1007/978-3-642-01399-7_69</a>'
  apa: 'Biermann, T., Schwabe, A., &#38; Karl, H. (2009). Creating Butterflies in
    the Core – A Network Coding Extension for MPLS/RSVP-TE. In <i>NETWORKING 2009</i>
    (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-01399-7_69">https://doi.org/10.1007/978-3-642-01399-7_69</a>'
  bibtex: '@inbook{Biermann_Schwabe_Karl_2009, place={Berlin, Heidelberg}, title={Creating
    Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}, DOI={<a
    href="https://doi.org/10.1007/978-3-642-01399-7_69">10.1007/978-3-642-01399-7_69</a>},
    booktitle={NETWORKING 2009}, publisher={Springer Berlin Heidelberg}, author={Biermann,
    Thorsten and Schwabe, Arne and Karl, Holger}, year={2009}, pages={883–894} }'
  chicago: 'Biermann, Thorsten, Arne Schwabe, and Holger Karl. “Creating Butterflies
    in the Core – A Network Coding Extension for MPLS/RSVP-TE.” In <i>NETWORKING 2009</i>,
    883–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-01399-7_69">https://doi.org/10.1007/978-3-642-01399-7_69</a>.'
  ieee: 'T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core –
    A Network Coding Extension for MPLS/RSVP-TE,” in <i>NETWORKING 2009</i>, Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.'
  mla: Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding
    Extension for MPLS/RSVP-TE.” <i>NETWORKING 2009</i>, Springer Berlin Heidelberg,
    2009, pp. 883–94, doi:<a href="https://doi.org/10.1007/978-3-642-01399-7_69">10.1007/978-3-642-01399-7_69</a>.
  short: 'T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2009, pp. 883–894.'
date_created: 2018-03-27T12:31:37Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '75'
doi: 10.1007/978-3-642-01399-7_69
page: 883-894
place: Berlin, Heidelberg
publication: NETWORKING 2009
publication_identifier:
  isbn:
  - '9783642013980'
  - '9783642013997'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE
type: book_chapter
user_id: '15572'
year: '2009'
...
---
_id: '9616'
author:
- first_name: Saqib
  full_name: Kakvi, Saqib
  id: '66268'
  last_name: Kakvi
citation:
  ama: 'Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer
    Science</i>. Berlin, Heidelberg; 2009. doi:<a href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>'
  apa: Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-04052-8_43">https://doi.org/10.1007/978-3-642-04052-8_43</a>
  bibtex: '@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning
    for Blackjack}, DOI={<a href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>},
    booktitle={Lecture Notes in Computer Science}, author={Kakvi, Saqib}, year={2009}
    }'
  chicago: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-04052-8_43">https://doi.org/10.1007/978-3-642-04052-8_43</a>.
  ieee: S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer
    Science</i>, Berlin, Heidelberg, 2009.
  mla: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer
    Science</i>, 2009, doi:<a href="https://doi.org/10.1007/978-3-642-04052-8_43">10.1007/978-3-642-04052-8_43</a>.
  short: 'S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.'
date_created: 2019-05-06T09:54:39Z
date_updated: 2022-01-06T07:04:17Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783642040511'
  - '9783642040528'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '66268'
year: '2009'
...
---
_id: '61021'
alternative_title:
- 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009.
  Proceedings
citation:
  ama: 'Mertsching B, Hund M, Aziz Z, eds. <i>KI 2009: Advances in Artificial Intelligence</i>.
    Springer Berlin Heidelberg; 2009. doi:<a href="https://doi.org/10.1007/978-3-642-04617-9">10.1007/978-3-642-04617-9</a>'
  apa: 'Mertsching, B., Hund, M., &#38; Aziz, Z. (Eds.). (2009). <i>KI 2009: Advances
    in Artificial Intelligence</i>. Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-04617-9">https://doi.org/10.1007/978-3-642-04617-9</a>'
  bibtex: '@book{Mertsching_Hund_Aziz_2009, place={Berlin, Heidelberg}, title={KI
    2009: Advances in Artificial Intelligence}, DOI={<a href="https://doi.org/10.1007/978-3-642-04617-9">10.1007/978-3-642-04617-9</a>},
    publisher={Springer Berlin Heidelberg}, year={2009} }'
  chicago: 'Mertsching, Bärbel, Marcus Hund, and Zaheer Aziz, eds. <i>KI 2009: Advances
    in Artificial Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg,
    2009. <a href="https://doi.org/10.1007/978-3-642-04617-9">https://doi.org/10.1007/978-3-642-04617-9</a>.'
  ieee: 'B. Mertsching, M. Hund, and Z. Aziz, Eds., <i>KI 2009: Advances in Artificial
    Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.'
  mla: 'Mertsching, Bärbel, et al., editors. <i>KI 2009: Advances in Artificial Intelligence</i>.
    Springer Berlin Heidelberg, 2009, doi:<a href="https://doi.org/10.1007/978-3-642-04617-9">10.1007/978-3-642-04617-9</a>.'
  short: 'B. Mertsching, M. Hund, Z. Aziz, eds., KI 2009: Advances in Artificial Intelligence,
    Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.'
conference:
  name: KI 2009
date_created: 2025-08-26T11:28:37Z
date_updated: 2025-08-26T13:59:56Z
department:
- _id: '50'
doi: 10.1007/978-3-642-04617-9
editor:
- first_name: Bärbel
  full_name: Mertsching, Bärbel
  last_name: Mertsching
- first_name: Marcus
  full_name: Hund, Marcus
  id: '238'
  last_name: Hund
- first_name: Zaheer
  full_name: Aziz, Zaheer
  last_name: Aziz
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783642046162'
  - '9783642046179'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: 'KI 2009: Advances in Artificial Intelligence'
type: conference_editor
user_id: '238'
year: '2009'
...
---
_id: '66535'
author:
- first_name: Marcus
  full_name: Hund, Marcus
  id: '238'
  last_name: Hund
- first_name: Bärbel
  full_name: Mertsching, Bärbel
  last_name: Mertsching
citation:
  ama: 'Hund M, Mertsching B. Occlusion as a Monocular Depth Cue Derived from Illusory
    Contour Perception. In: <i>KI 2009: Advances in Artificial Intelligence</i>. Springer
    Berlin Heidelberg; 2009. doi:<a href="https://doi.org/10.1007/978-3-642-04617-9_13">10.1007/978-3-642-04617-9_13</a>'
  apa: 'Hund, M., &#38; Mertsching, B. (2009). Occlusion as a Monocular Depth Cue
    Derived from Illusory Contour Perception. <i>KI 2009: Advances in Artificial Intelligence</i>.
    KI 2009, Paderborn. <a href="https://doi.org/10.1007/978-3-642-04617-9_13">https://doi.org/10.1007/978-3-642-04617-9_13</a>'
  bibtex: '@inproceedings{Hund_Mertsching_2009, place={Berlin, Heidelberg}, title={Occlusion
    as a Monocular Depth Cue Derived from Illusory Contour Perception}, DOI={<a href="https://doi.org/10.1007/978-3-642-04617-9_13">10.1007/978-3-642-04617-9_13</a>},
    booktitle={KI 2009: Advances in Artificial Intelligence}, publisher={Springer
    Berlin Heidelberg}, author={Hund, Marcus and Mertsching, Bärbel}, year={2009}
    }'
  chicago: 'Hund, Marcus, and Bärbel Mertsching. “Occlusion as a Monocular Depth Cue
    Derived from Illusory Contour Perception.” In <i>KI 2009: Advances in Artificial
    Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href="https://doi.org/10.1007/978-3-642-04617-9_13">https://doi.org/10.1007/978-3-642-04617-9_13</a>.'
  ieee: 'M. Hund and B. Mertsching, “Occlusion as a Monocular Depth Cue Derived from
    Illusory Contour Perception,” presented at the KI 2009, Paderborn, 2009, doi:
    <a href="https://doi.org/10.1007/978-3-642-04617-9_13">10.1007/978-3-642-04617-9_13</a>.'
  mla: 'Hund, Marcus, and Bärbel Mertsching. “Occlusion as a Monocular Depth Cue Derived
    from Illusory Contour Perception.” <i>KI 2009: Advances in Artificial Intelligence</i>,
    Springer Berlin Heidelberg, 2009, doi:<a href="https://doi.org/10.1007/978-3-642-04617-9_13">10.1007/978-3-642-04617-9_13</a>.'
  short: 'M. Hund, B. Mertsching, in: KI 2009: Advances in Artificial Intelligence,
    Springer Berlin Heidelberg, Berlin, Heidelberg, 2009.'
conference:
  location: Paderborn
  name: KI 2009
date_created: 2026-07-17T11:17:37Z
date_updated: 2026-07-17T11:20:28Z
department:
- _id: '50'
doi: 10.1007/978-3-642-04617-9_13
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'KI 2009: Advances in Artificial Intelligence'
publication_identifier:
  isbn:
  - '9783642046162'
  - '9783642046179'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Occlusion as a Monocular Depth Cue Derived from Illusory Contour Perception
type: conference
user_id: '238'
year: '2009'
...
---
_id: '19686'
author:
- first_name: Patrick
  full_name: Briest, Patrick
  last_name: Briest
citation:
  ama: 'Briest P. Uniform Budgets and the Envy-Free Pricing Problem. In: <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>.
    ; 2008. doi:<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>'
  apa: Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>.
    <a href="https://doi.org/10.1007/978-3-540-70575-8_66">https://doi.org/10.1007/978-3-540-70575-8_66</a>
  bibtex: '@inproceedings{Briest_2008, title={Uniform Budgets and the Envy-Free Pricing
    Problem}, DOI={<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>},
    booktitle={Proceedings of the 35th InternationalColloquium on Automata, Languages
    and Programming (ICALP)}, author={Briest, Patrick}, year={2008} }'
  chicago: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” In
    <i>Proceedings of the 35th InternationalColloquium on Automata, Languages and
    Programming (ICALP)</i>, 2008. <a href="https://doi.org/10.1007/978-3-540-70575-8_66">https://doi.org/10.1007/978-3-540-70575-8_66</a>.
  ieee: P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>,
    2008.
  mla: Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.” <i>Proceedings
    of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)</i>,
    2008, doi:<a href="https://doi.org/10.1007/978-3-540-70575-8_66">10.1007/978-3-540-70575-8_66</a>.
  short: 'P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata,
    Languages and Programming (ICALP), 2008.'
date_created: 2020-09-25T09:45:40Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-540-70575-8_66
language:
- iso: eng
publication: Proceedings of the 35th InternationalColloquium on Automata, Languages
  and Programming (ICALP)
publication_identifier:
  isbn:
  - '9783540705741'
  - '9783540705758'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Uniform Budgets and the Envy-Free Pricing Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_id: '19003'
author:
- first_name: Bastian
  full_name: Degener, Bastian
  last_name: Degener
- first_name: Joachim
  full_name: Gehweiler, Joachim
  last_name: Gehweiler
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
citation:
  ama: 'Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem.
    In: <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>.
    ; 2008:378-389. doi:<a href="https://doi.org/10.1007/978-3-540-69903-3_34">10.1007/978-3-540-69903-3_34</a>'
  apa: Degener, B., Gehweiler, J., &#38; Lammersen, C. (2008). The Kinetic Facility
    Location Problem. In <i>Proceedings of the 11th Scandinavian Workshop on Algorithm
    Theory (SWAT)</i> (pp. 378–389). <a href="https://doi.org/10.1007/978-3-540-69903-3_34">https://doi.org/10.1007/978-3-540-69903-3_34</a>
  bibtex: '@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility
    Location Problem}, DOI={<a href="https://doi.org/10.1007/978-3-540-69903-3_34">10.1007/978-3-540-69903-3_34</a>},
    booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)},
    author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008},
    pages={378–389} }'
  chicago: Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic
    Facility Location Problem.” In <i>Proceedings of the 11th Scandinavian Workshop
    on Algorithm Theory (SWAT)</i>, 378–89, 2008. <a href="https://doi.org/10.1007/978-3-540-69903-3_34">https://doi.org/10.1007/978-3-540-69903-3_34</a>.
  ieee: B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location
    Problem,” in <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory
    (SWAT)</i>, 2008, pp. 378–389.
  mla: Degener, Bastian, et al. “The Kinetic Facility Location Problem.” <i>Proceedings
    of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 2008, pp. 378–89,
    doi:<a href="https://doi.org/10.1007/978-3-540-69903-3_34">10.1007/978-3-540-69903-3_34</a>.
  short: 'B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian
    Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.'
date_created: 2020-09-04T10:04:49Z
date_updated: 2022-01-06T06:53:57Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69903-3_34
language:
- iso: eng
page: 378-389
publication: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)
publication_identifier:
  isbn:
  - '9783540699002'
  - '9783540699033'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: The Kinetic Facility Location Problem
type: conference
user_id: '15415'
year: '2008'
...
---
_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'
...