[{"extern":"1","user_id":"25078","department":[{"_id":"558"}],"_id":"2920","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-04052-8_43","title":"Reinforcement Learning for Blackjack","author":[{"first_name":"Saqib","full_name":"Kakvi, Saqib","last_name":"Kakvi"}],"date_created":"2018-05-25T12:38:01Z","date_updated":"2022-01-06T06:58:47Z","publisher":"Springer Berlin Heidelberg","citation":{"ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer 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>.","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>","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>.","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} }","short":"S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 300–301.","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>"},"page":"300-301","place":"Berlin, Heidelberg","year":"2009","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]}},{"_id":"3000","user_id":"25078","department":[{"_id":"64"}],"status":"public","type":"book_chapter","publication":"FM 2009: Formal Methods","title":"Three-Valued Spotlight Abstractions","doi":"10.1007/978-3-642-05089-3_8","date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","author":[{"last_name":"Schrieb","full_name":"Schrieb, Jonas","first_name":"Jonas"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"date_created":"2018-06-05T08:09:11Z","year":"2009","place":"Berlin, Heidelberg","citation":{"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.","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>.","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>","short":"J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer Berlin Heidelberg, 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>.","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} }","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>"},"page":"106-122","publication_status":"published","publication_identifier":{"isbn":["9783642050886","9783642050893"],"issn":["0302-9743","1611-3349"]}},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"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>","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>","short":"P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","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} }","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>."},"year":"2009","place":"Berlin, Heidelberg","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"first_name":"Martin","last_name":"Hoefer","full_name":"Hoefer, Martin"},{"first_name":"Luciano","last_name":"Gualà","full_name":"Gualà, Luciano"},{"first_name":"Carmine","last_name":"Ventre","full_name":"Ventre, Carmine"}],"date_created":"2021-09-03T10:55:38Z","date_updated":"2022-01-06T06:55:59Z","doi":"10.1007/978-3-642-10841-9_6","title":"On Stackelberg Pricing with Computationally Bounded Consumers","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","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"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"23744","language":[{"iso":"eng"}]},{"_id":"1830","department":[{"_id":"75"}],"user_id":"15572","publication":"NETWORKING 2009","type":"book_chapter","status":"public","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:53:28Z","author":[{"full_name":"Biermann, Thorsten","last_name":"Biermann","first_name":"Thorsten"},{"first_name":"Arne","full_name":"Schwabe, Arne","last_name":"Schwabe"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2018-03-27T12:31:37Z","title":"Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE","doi":"10.1007/978-3-642-01399-7_69","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642013980","9783642013997"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2009","page":"883-894","citation":{"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.","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>.","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} }","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."}},{"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","extern":"1","language":[{"iso":"eng"}],"_id":"9616","user_id":"66268","department":[{"_id":"558"}],"year":"2009","place":"Berlin, Heidelberg","citation":{"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.","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>","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} }","short":"S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009."},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"title":"Reinforcement Learning for Blackjack","doi":"10.1007/978-3-642-04052-8_43","date_updated":"2022-01-06T07:04:17Z","date_created":"2019-05-06T09:54:39Z","author":[{"first_name":"Saqib","full_name":"Kakvi, Saqib","id":"66268","last_name":"Kakvi"}]},{"alternative_title":["32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings"],"language":[{"iso":"eng"}],"user_id":"238","department":[{"_id":"50"}],"_id":"61021","status":"public","editor":[{"first_name":"Bärbel","last_name":"Mertsching","full_name":"Mertsching, Bärbel"},{"first_name":"Marcus","full_name":"Hund, Marcus","id":"238","last_name":"Hund"},{"first_name":"Zaheer","last_name":"Aziz","full_name":"Aziz, Zaheer"}],"type":"conference_editor","doi":"10.1007/978-3-642-04617-9","conference":{"name":"KI 2009"},"title":"KI 2009: Advances in Artificial Intelligence","date_created":"2025-08-26T11:28:37Z","date_updated":"2025-08-26T13:59:56Z","publisher":"Springer Berlin Heidelberg","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>","ieee":"B. Mertsching, M. Hund, and Z. Aziz, Eds., <i>KI 2009: Advances in Artificial Intelligence</i>. Berlin, Heidelberg: Springer 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>.","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>","short":"B. Mertsching, M. Hund, Z. Aziz, eds., KI 2009: Advances in Artificial Intelligence, Springer Berlin Heidelberg, 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>.","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} }"},"place":"Berlin, Heidelberg","year":"2009","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642046162","9783642046179"]}},{"date_updated":"2022-01-06T06:54:10Z","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"date_created":"2020-09-25T09:45:40Z","title":"Uniform Budgets and the Envy-Free Pricing Problem","doi":"10.1007/978-3-540-70575-8_66","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540705741","9783540705758"]},"publication_status":"published","year":"2008","citation":{"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} }","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.","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.","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>.","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>"},"_id":"19686","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)","type":"conference","status":"public"},{"_id":"19003","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","type":"conference","status":"public","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"}],"date_created":"2020-09-04T10:04:49Z","title":"The Kinetic Facility Location Problem","doi":"10.1007/978-3-540-69903-3_34","publication_identifier":{"isbn":["9783540699002","9783540699033"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2008","page":"378-389","citation":{"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>.","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} }","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>","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>","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."}},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540691334","9783540691341"]},"publication_status":"published","intvolume":"      5040","page":"447--456","citation":{"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.","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>","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} }","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.","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>"},"year":"2008","volume":5040,"author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Heinz","full_name":"Wörn, Heinz","last_name":"Wörn"}],"date_created":"2020-11-16T13:55:39Z","date_updated":"2022-01-06T06:54:26Z","doi":"10.1007/978-3-540-69134-1_44","title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20367","language":[{"iso":"eng"}]},{"status":"public","type":"book_chapter","publication":"Unconventional Computing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17978","citation":{"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.","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>.","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>","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, 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>.","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} }","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>"},"place":"Berlin, Heidelberg","year":"2008","publication_status":"published","publication_identifier":{"isbn":["9783540851936","9783540851943"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-85194-3_11","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","date_created":"2020-08-14T13:19:24Z","author":[{"first_name":"Katharina","last_name":"Lürwer-Brüggemeier","full_name":"Lürwer-Brüggemeier, Katharina"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:24Z"},{"language":[{"iso":"eng"}],"_id":"24276","department":[{"_id":"63"}],"user_id":"15415","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"}],"status":"public","publication":"Lecture Notes in Computer Science","type":"conference","title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","doi":"10.1007/978-3-540-73951-7_30","date_updated":"2022-01-06T06:56:13Z","date_created":"2021-09-13T13:07:57Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski","first_name":"Jarosław"}],"year":"2007","place":"Berlin, Heidelberg","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>","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>.","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.","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>.","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} }","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_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T10:29:52Z","author":[{"full_name":"Dynia, Miroslaw","last_name":"Dynia","first_name":"Miroslaw"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"first_name":"Jarosław","full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski"}],"volume":4362,"title":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","doi":"10.1007/978-3-540-69507-3_21","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540695066","9783540695073"]},"year":"2007","citation":{"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.","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} }","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.","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>."},"page":"260--271","intvolume":"      4362","_id":"18929","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)","status":"public"},{"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} }","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.","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>","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.","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>"},"place":"Berlin, Heidelberg","year":"2007","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540730002","9783540730019"]},"doi":"10.1007/978-3-540-73001-9_86","title":"(Short) Survey of Real Hypercomputation","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-14T13:33:50Z","date_updated":"2022-01-06T06:53:24Z","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17982"},{"_id":"17983","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Mathematical Foundations of Computer Science 2007","status":"public","date_updated":"2022-01-06T06:53:24Z","author":[{"last_name":"Meer","full_name":"Meer, Klaus","first_name":"Klaus"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_created":"2020-08-14T13:35:56Z","title":"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation","doi":"10.1007/978-3-540-74456-6_64","publication_status":"published","publication_identifier":{"isbn":["9783540744559","9783540744566"],"issn":["0302-9743","1611-3349"]},"year":"2007","place":"Berlin, Heidelberg","citation":{"ama":"Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>","chicago":"Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” In <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">https://doi.org/10.1007/978-3-540-74456-6_64</a>.","ieee":"K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,” in <i>Mathematical Foundations of Computer Science 2007</i>, Berlin, Heidelberg, 2007.","short":"K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.","mla":"Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” <i>Mathematical Foundations of Computer Science 2007</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>.","bibtex":"@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>}, booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus and Ziegler, Martin}, year={2007} }","apa":"Meer, K., &#38; Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">https://doi.org/10.1007/978-3-540-74456-6_64</a>"}},{"status":"public","type":"conference","publication":"Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24","language":[{"iso":"eng"}],"_id":"15144","user_id":"14961","department":[{"_id":"69"}],"year":"2007","citation":{"short":"S. Böttcher, R. Steinmetz, in: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–113.","mla":"Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.” <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, Springer, 2007, pp. 101–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>.","bibtex":"@inproceedings{Böttcher_Steinmetz_2007, title={Evaluating XPath Queries on XML Data Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>}, booktitle={Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2007}, pages={101–113} }","apa":"Böttcher, S., &#38; Steinmetz, R. (2007). Evaluating XPath Queries on XML Data Streams. In <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i> (pp. 101–113). Springer. <a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">https://doi.org/10.1007/978-3-540-73390-4_10</a>","ama":"Böttcher S, Steinmetz R. Evaluating XPath Queries on XML Data Streams. In: <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>. Springer; 2007:101-113. doi:<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>","ieee":"S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,” in <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, 2007, pp. 101–113.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.” In <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, 101–13. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">https://doi.org/10.1007/978-3-540-73390-4_10</a>."},"page":"101-113","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540733898","9783540733904"]},"title":"Evaluating XPath Queries on XML Data Streams","doi":"10.1007/978-3-540-73390-4_10","publisher":"Springer","date_updated":"2022-01-06T06:52:16Z","date_created":"2019-11-22T08:59:56Z","author":[{"last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"id":"14961","full_name":"Steinmetz, Rita","last_name":"Steinmetz","first_name":"Rita"}]},{"status":"public","publication":"Database and Expert Systems Applications, 18th International Conference, DEXA 2007","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"69"}],"user_id":"14961","_id":"15146","page":"424-433","citation":{"apa":"Böttcher, S., &#38; Steinmetz, R. (2007). Data Management for Mobile Ajax Web 2.0 Applications. In <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i> (pp. 424–433). Springer. <a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">https://doi.org/10.1007/978-3-540-74469-6_42</a>","mla":"Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.” <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, Springer, 2007, pp. 424–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>.","bibtex":"@inproceedings{Böttcher_Steinmetz_2007, title={Data Management for Mobile Ajax Web 2.0 Applications}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>}, booktitle={Database and Expert Systems Applications, 18th International Conference, DEXA 2007}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2007}, pages={424–433} }","short":"S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433.","ama":"Böttcher S, Steinmetz R. Data Management for Mobile Ajax Web 2.0 Applications. In: <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>. Springer; 2007:424-433. doi:<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.” In <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, 424–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">https://doi.org/10.1007/978-3-540-74469-6_42</a>.","ieee":"S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,” in <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, 2007, pp. 424–433."},"year":"2007","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540744672","9783540744696"]},"publication_status":"published","doi":"10.1007/978-3-540-74469-6_42","title":"Data Management for Mobile Ajax Web 2.0 Applications","author":[{"last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan","first_name":"Stefan"},{"last_name":"Steinmetz","id":"14961","full_name":"Steinmetz, Rita","first_name":"Rita"}],"date_created":"2019-11-22T09:06:45Z","date_updated":"2022-01-06T06:52:16Z","publisher":"Springer"},{"_id":"19838","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)","type":"conference","status":"public","date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T11:51:15Z","author":[{"last_name":"Rührup","full_name":"Rührup, Stefan","first_name":"Stefan"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"title":"Online Multi-path Routing in a Maze","doi":"10.1007/11940128_65","publication_identifier":{"isbn":["9783540496946","9783540496960"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2006","citation":{"ama":"Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>.","ieee":"S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006.","short":"S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.","bibtex":"@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }","mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>.","apa":"Rührup, S., &#38; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>"}},{"status":"public","abstract":[{"text":"We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.\r\n\r\nWe provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.","lang":"eng"}],"type":"conference","publication":"SOFSEM 2006: Theory and Practice of Computer Science","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"24277","citation":{"apa":"Kutyłowski, J., &#38; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>","short":"J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.","mla":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” <i>SOFSEM 2006: Theory and Practice of Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","bibtex":"@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }","chicago":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>.","ieee":"J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: <a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","ama":"Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>"},"year":"2006","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"doi":"10.1007/11611257_37","title":"Reliable Broadcasting Without Collision Detection","author":[{"first_name":"Jarosław","last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław"},{"last_name":"Zagórski","full_name":"Zagórski, Filip","first_name":"Filip"}],"date_created":"2021-09-13T13:28:29Z","date_updated":"2022-01-06T06:56:13Z"},{"title":"Fault Based Collision Attacks on AES","doi":"10.1007/11889700_11","date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:14:42Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"year":"2006","place":"Berlin, Heidelberg","citation":{"ama":"Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>","chicago":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>.","ieee":"J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.","bibtex":"@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based Collision Attacks on AES}, DOI={<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","mla":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>.","apa":"Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES. In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>"},"page":"106-120","publication_status":"published","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"_id":"3004","user_id":"25078","department":[{"_id":"64"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"date_created":"2018-06-05T08:15:48Z","title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","doi":"10.1007/11889700_2","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2006","page":"13-23","citation":{"ama":"Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>","ieee":"J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.","chicago":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>.","apa":"Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>","short":"J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.","mla":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>.","bibtex":"@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }"},"_id":"3005","department":[{"_id":"64"}],"user_id":"25078","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public"}]