[{"status":"public","page":"252-262","_id":"19724","publisher":"Springer","user_id":"15415","citation":{"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} }","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>","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>.","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>.","short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","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.","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>"},"place":"Berlin, Heidelberg","year":"2009","title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642054334","9783642054341"]},"publication_status":"published","date_updated":"2022-01-06T06:54:10Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-05434-1_25","publication":"Algorithmic Aspects of Wireless Sensor Networks","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."}],"date_created":"2020-09-28T10:25:34Z","type":"book_chapter","department":[{"_id":"63"}]},{"department":[{"_id":"558"}],"type":"book_chapter","date_created":"2018-05-25T12:38:01Z","place":"Berlin, Heidelberg","extern":"1","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>","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} }","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.","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>.","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>","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301."},"publication":"Lecture Notes in Computer Science","user_id":"25078","doi":"10.1007/978-3-642-04052-8_43","publisher":"Springer Berlin Heidelberg","_id":"2920","page":"300-301","publication_status":"published","date_updated":"2022-01-06T06:58:47Z","author":[{"full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"year":"2009","title":"Reinforcement Learning for Blackjack","status":"public"},{"date_created":"2018-06-05T08:09:11Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"64"}],"publication":"FM 2009: Formal Methods","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>","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} }","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.","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>.","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>","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."},"page":"106-122","publisher":"Springer Berlin Heidelberg","_id":"3000","user_id":"25078","doi":"10.1007/978-3-642-05089-3_8","status":"public","year":"2009","title":"Three-Valued Spotlight Abstractions","author":[{"last_name":"Schrieb","first_name":"Jonas","full_name":"Schrieb, Jonas"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"publication_identifier":{"isbn":["9783642050886","9783642050893"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:58:50Z"},{"date_created":"2021-09-03T10:55:38Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","citation":{"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} }","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>","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.","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.","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>"},"publication":"Lecture Notes in Computer Science","abstract":[{"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.","lang":"eng"}],"_id":"23744","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-642-10841-9_6","author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"full_name":"Hoefer, Martin","last_name":"Hoefer","first_name":"Martin"},{"last_name":"Gualà","first_name":"Luciano","full_name":"Gualà, Luciano"},{"full_name":"Ventre, Carmine","first_name":"Carmine","last_name":"Ventre"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","year":"2009","title":"On Stackelberg Pricing with Computationally Bounded Consumers","publication_status":"published","date_updated":"2022-01-06T06:55:59Z"},{"publication":"NETWORKING 2009","citation":{"short":"T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 883–894.","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>","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>.","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} }","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>","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>.","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."},"place":"Berlin, Heidelberg","date_created":"2018-03-27T12:31:37Z","type":"book_chapter","department":[{"_id":"75"}],"title":"Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE","status":"public","year":"2009","publication_identifier":{"isbn":["9783642013980","9783642013997"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Biermann","first_name":"Thorsten","full_name":"Biermann, Thorsten"},{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"}],"date_updated":"2022-01-06T06:53:28Z","publication_status":"published","page":"883-894","publisher":"Springer Berlin Heidelberg","_id":"1830","doi":"10.1007/978-3-642-01399-7_69","user_id":"15572"},{"date_created":"2019-05-06T09:54:39Z","place":"Berlin, Heidelberg","department":[{"_id":"558"}],"type":"book_chapter","citation":{"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>.","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} }","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>","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2009.","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>","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>.","short":"S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009."},"publication":"Lecture Notes in Computer Science","extern":"1","language":[{"iso":"eng"}],"_id":"9616","user_id":"66268","doi":"10.1007/978-3-642-04052-8_43","author":[{"id":"66268","full_name":"Kakvi, Saqib","first_name":"Saqib","last_name":"Kakvi"}],"publication_identifier":{"isbn":["9783642040511","9783642040528"],"issn":["0302-9743","1611-3349"]},"status":"public","year":"2009","title":"Reinforcement Learning for Blackjack","publication_status":"published","date_updated":"2022-01-06T07:04:17Z"},{"year":"2009","status":"public","title":"KI 2009: Advances in Artificial Intelligence","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642046162","9783642046179"]},"conference":{"name":"KI 2009"},"publication_status":"published","date_updated":"2025-08-26T13:59:56Z","publisher":"Springer Berlin Heidelberg","_id":"61021","language":[{"iso":"eng"}],"user_id":"238","doi":"10.1007/978-3-642-04617-9","editor":[{"first_name":"Bärbel","last_name":"Mertsching","full_name":"Mertsching, Bärbel"},{"id":"238","last_name":"Hund","first_name":"Marcus","full_name":"Hund, Marcus"},{"full_name":"Aziz, Zaheer","first_name":"Zaheer","last_name":"Aziz"}],"alternative_title":["32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings"],"citation":{"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>","ieee":"B. Mertsching, M. Hund, and Z. Aziz, Eds., <i>KI 2009: Advances in Artificial Intelligence</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.","short":"B. Mertsching, M. Hund, Z. Aziz, eds., KI 2009: Advances in Artificial Intelligence, Springer Berlin Heidelberg, Berlin, Heidelberg, 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>.","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>.","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>","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} }"},"date_created":"2025-08-26T11:28:37Z","place":"Berlin, Heidelberg","type":"conference_editor","department":[{"_id":"50"}]},{"date_created":"2026-07-17T11:17:37Z","place":"Berlin, Heidelberg","type":"conference","department":[{"_id":"50"}],"publication":"KI 2009: Advances in Artificial Intelligence","citation":{"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>.","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>","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} }","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>","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>.","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>.","short":"M. Hund, B. Mertsching, in: KI 2009: Advances in Artificial Intelligence, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009."},"publisher":"Springer Berlin Heidelberg","_id":"66535","language":[{"iso":"eng"}],"user_id":"238","doi":"10.1007/978-3-642-04617-9_13","year":"2009","title":"Occlusion as a Monocular Depth Cue Derived from Illusory Contour Perception","status":"public","publication_identifier":{"isbn":["9783642046162","9783642046179"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Hund","first_name":"Marcus","full_name":"Hund, Marcus","id":"238"},{"last_name":"Mertsching","first_name":"Bärbel","full_name":"Mertsching, Bärbel"}],"conference":{"location":"Paderborn","name":"KI 2009"},"publication_status":"published","date_updated":"2026-07-17T11:20:28Z"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-25T09:45:40Z","citation":{"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} }","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>","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>.","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>.","short":"P. Briest, in: Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.","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.","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>"},"publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","doi":"10.1007/978-3-540-70575-8_66","user_id":"15415","language":[{"iso":"eng"}],"_id":"19686","date_updated":"2022-01-06T06:54:10Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540705741","9783540705758"]},"author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"status":"public","title":"Uniform Budgets and the Envy-Free Pricing Problem","year":"2008"},{"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","title":"The Kinetic Facility Location Problem","year":"2008","status":"public","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"},{"first_name":"Christiane","last_name":"Lammersen","full_name":"Lammersen, Christiane"}],"publication_identifier":{"isbn":["9783540699002","9783540699033"],"issn":["0302-9743","1611-3349"]},"user_id":"15415","doi":"10.1007/978-3-540-69903-3_34","page":"378-389","_id":"19003","language":[{"iso":"eng"}],"publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","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>","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} }","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>.","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>.","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","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>","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."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-04T10:04:49Z"},{"date_created":"2020-11-16T13:55:39Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","citation":{"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} }","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>","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.","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.","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>"},"publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","_id":"20367","language":[{"iso":"eng"}],"page":"447--456","volume":5040,"user_id":"15415","doi":"10.1007/978-3-540-69134-1_44","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540691334","9783540691341"]},"author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Wörn","first_name":"Heinz","full_name":"Wörn, Heinz"}],"title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","status":"public","year":"2008","intvolume":"      5040","publication_status":"published","date_updated":"2022-01-06T06:54:26Z"},{"date_created":"2020-08-14T13:19:24Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Unconventional Computing","citation":{"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>.","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","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>","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.","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>","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} }","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>."},"language":[{"iso":"eng"}],"_id":"17978","user_id":"15415","doi":"10.1007/978-3-540-85194-3_11","status":"public","year":"2008","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","author":[{"full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier","first_name":"Katharina"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540851936","9783540851943"]},"publication_status":"published","date_updated":"2022-01-06T06:53:24Z"},{"publication_identifier":{"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"last_name":"Kutyłowski","first_name":"Jarosław","full_name":"Kutyłowski, Jarosław"}],"status":"public","title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","year":"2007","publication_status":"published","date_updated":"2022-01-06T06:56:13Z","language":[{"iso":"eng"}],"_id":"24276","user_id":"15415","doi":"10.1007/978-3-540-73951-7_30","citation":{"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} }","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>","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>.","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>.","short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","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>.","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>"},"publication":"Lecture Notes in Computer Science","abstract":[{"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","lang":"eng"}],"date_created":"2021-09-13T13:07:57Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"conference"},{"type":"book_chapter","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:26:03Z","publication":"Advances in Cryptology — CRYPTO 2002","citation":{"short":"A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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.","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} }","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>","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>."},"doi":"10.1007/3-540-45708-9_16","user_id":"25078","page":"242-256","publisher":"Springer Berlin Heidelberg","_id":"3019","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","status":"public","title":"Cryptanalysis of Unbalanced RSA with Small CRT-Exponent","year":"2007","author":[{"full_name":"May, Alexander","first_name":"Alexander","last_name":"May"}],"publication_identifier":{"isbn":["9783540440505","9783540457084"],"issn":["0302-9743"]}},{"title":"Low Secret Exponent RSA Revisited","year":"2007","status":"public","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"May, Alexander","last_name":"May","first_name":"Alexander"}],"date_updated":"2022-01-06T06:58:51Z","publication_status":"published","page":"4-19","_id":"3020","publisher":"Springer Berlin Heidelberg","doi":"10.1007/3-540-44670-2_2","user_id":"25078","publication":"Lecture Notes in Computer Science","citation":{"short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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.","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} }","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>","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>."},"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:26:29Z","type":"book_chapter","department":[{"_id":"64"}]},{"title":"Key Revocation with Interval Cover Families","status":"public","year":"2007","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"publication_identifier":{"isbn":["9783540430667","9783540455370"],"issn":["0302-9743"]},"publication_status":"published","date_updated":"2022-01-06T06:58:51Z","page":"325-341","publisher":"Springer Berlin Heidelberg","_id":"3021","user_id":"25078","doi":"10.1007/3-540-45537-x_26","publication":"Selected Areas in Cryptography","citation":{"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.","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>","short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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>.","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>.","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} }","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>"},"date_created":"2018-06-05T08:26:50Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"64"}]},{"doi":"10.1007/3-540-44670-2_10","user_id":"25078","page":"110-125","publisher":"Springer Berlin Heidelberg","_id":"3022","date_updated":"2022-01-06T06:58:51Z","publication_status":"published","title":"Dimension Reduction Methods for Convolution Modular Lattices","year":"2007","status":"public","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"author":[{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"},{"full_name":"Silverman, Joseph H.","last_name":"Silverman","first_name":"Joseph H."}],"type":"book_chapter","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:27:10Z","publication":"Lecture Notes in Computer Science","citation":{"short":"A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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.","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} }","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>","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>."}},{"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-05T08:28:39Z","place":"Berlin, Heidelberg","publication":"Algorithms — ESA’ 98","citation":{"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.","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>","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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>.","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>.","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} }","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>"},"user_id":"25078","doi":"10.1007/3-540-68530-8_13","page":"151-162","publisher":"Springer Berlin Heidelberg","_id":"3026","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","status":"public","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","year":"2007","publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}]},{"intvolume":"      4362","date_updated":"2022-01-06T06:53:54Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540695066","9783540695073"]},"author":[{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"},{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"},{"last_name":"Kutyłowski","first_name":"Jarosław","full_name":"Kutyłowski, Jarosław"}],"status":"public","title":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","year":"2007","volume":4362,"doi":"10.1007/978-3-540-69507-3_21","user_id":"15415","_id":"18929","language":[{"iso":"eng"}],"page":"260--271","citation":{"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>","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.","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.","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>.","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>.","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>","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} }"},"publication":"Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T10:29:52Z"},{"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540730002","9783540730019"]},"title":"(Short) Survey of Real Hypercomputation","year":"2007","status":"public","doi":"10.1007/978-3-540-73001-9_86","user_id":"15415","language":[{"iso":"eng"}],"_id":"17982","citation":{"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} }","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>","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>.","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>.","short":"M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","ieee":"M. Ziegler, “(Short) Survey of Real Hypercomputation,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2007.","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>"},"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-08-14T13:33:50Z"}]