[{"doi":"10.1007/978-3-642-04052-8_43","title":"Reinforcement Learning for Blackjack","date_created":"2018-05-25T12:38:01Z","author":[{"full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"}],"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>.","short":"S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 300–301.","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} }","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","year":"2009","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"extern":"1","user_id":"25078","department":[{"_id":"558"}],"_id":"2920","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"status":"public","publication":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","type":"book_chapter","language":[{"iso":"eng"}],"_id":"2995","department":[{"_id":"64"}],"user_id":"25078","year":"2009","place":"Philadelphia, PA","page":"1088-1097","citation":{"ieee":"M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.","chicago":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>.","ama":"Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences. In: <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097. doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>","apa":"Ackermann, M. R., &#38; Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611973068.118\">https://doi.org/10.1137/1.9781611973068.118</a>","short":"M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.","bibtex":"@inbook{Ackermann_Blömer_2009, place={Philadelphia, PA}, title={Coresets and Approximate Clustering for Bregman Divergences}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>}, booktitle={Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher={Society for Industrial and Applied Mathematics}, author={Ackermann, Marcel R. and Blömer, Johannes}, year={2009}, pages={1088–1097} }","mla":"Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:<a href=\"https://doi.org/10.1137/1.9781611973068.118\">10.1137/1.9781611973068.118</a>."},"publication_identifier":{"isbn":["9780898716801","9781611973068"]},"publication_status":"published","title":"Coresets and Approximate Clustering for Bregman Divergences","doi":"10.1137/1.9781611973068.118","date_updated":"2022-01-06T06:58:50Z","publisher":"Society for Industrial and Applied Mathematics","date_created":"2018-06-05T08:05:17Z","author":[{"first_name":"Marcel R.","full_name":"Ackermann, Marcel R.","last_name":"Ackermann"},{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}]},{"_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":[{"first_name":"Jonas","full_name":"Schrieb, Jonas","last_name":"Schrieb"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"},{"first_name":"Daniel","full_name":"Wonisch, Daniel","last_name":"Wonisch"}],"date_created":"2018-06-05T08:09:11Z","year":"2009","place":"Berlin, Heidelberg","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>","chicago":"Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight Abstractions.” In <i>FM 2009: Formal Methods</i>, 106–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05089-3_8\">https://doi.org/10.1007/978-3-642-05089-3_8</a>.","ieee":"J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in <i>FM 2009: Formal Methods</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.","short":"J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.","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>.","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":{"issn":["0302-9743","1611-3349"],"isbn":["9783642050886","9783642050893"]}},{"_id":"3142","department":[{"_id":"558"}],"user_id":"38235","extern":"1","publication":"Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings","type":"conference","status":"public","date_updated":"2022-01-06T06:58:58Z","date_created":"2018-06-07T09:30:18Z","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"first_name":"Jörg","last_name":"Schwenk","full_name":"Schwenk, Jörg"}],"title":"On the Analysis of Cryptographic Assumptions in the Generic Ring Model","doi":"10.1007/978-3-642-10366-7_24","year":"2009","page":"399--416","citation":{"bibtex":"@inproceedings{Jager_Schwenk_2009, title={On the Analysis of Cryptographic Assumptions in the Generic Ring Model}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-10366-7_24\">10.1007/978-3-642-10366-7_24</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings}, author={Jager, Tibor and Schwenk, Jörg}, year={2009}, pages={399--416} }","mla":"Jager, Tibor, and Jörg Schwenk. “On the Analysis of Cryptographic Assumptions in the Generic Ring Model.” <i>Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings</i>, 2009, pp. 399--416, doi:<a href=\"https://doi.org/10.1007/978-3-642-10366-7_24\">10.1007/978-3-642-10366-7_24</a>.","short":"T. Jager, J. Schwenk, in: Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings, 2009, pp. 399--416.","apa":"Jager, T., &#38; Schwenk, J. (2009). On the Analysis of Cryptographic Assumptions in the Generic Ring Model. In <i>Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings</i> (pp. 399--416). <a href=\"https://doi.org/10.1007/978-3-642-10366-7_24\">https://doi.org/10.1007/978-3-642-10366-7_24</a>","chicago":"Jager, Tibor, and Jörg Schwenk. “On the Analysis of Cryptographic Assumptions in the Generic Ring Model.” In <i>Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings</i>, 399--416, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10366-7_24\">https://doi.org/10.1007/978-3-642-10366-7_24</a>.","ieee":"T. Jager and J. Schwenk, “On the Analysis of Cryptographic Assumptions in the Generic Ring Model,” in <i>Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings</i>, 2009, pp. 399--416.","ama":"Jager T, Schwenk J. On the Analysis of Cryptographic Assumptions in the Generic Ring Model. In: <i>Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings</i>. ; 2009:399--416. doi:<a href=\"https://doi.org/10.1007/978-3-642-10366-7_24\">10.1007/978-3-642-10366-7_24</a>"}},{"type":"dissertation","status":"public","department":[{"_id":"76"}],"user_id":"5786","_id":"20937","language":[{"iso":"eng"}],"citation":{"ama":"Meyer M. <i>Musterbasiertes Re-Engineering von Softwaresystemen</i>. Universitaetsbibliothek Paderborn; 2009.","chicago":"Meyer, Matthias. <i>Musterbasiertes Re-Engineering von Softwaresystemen</i>. Universitaetsbibliothek Paderborn, 2009.","ieee":"M. Meyer, <i>Musterbasiertes Re-Engineering von Softwaresystemen</i>. Universitaetsbibliothek Paderborn, 2009.","apa":"Meyer, M. (2009). <i>Musterbasiertes Re-Engineering von Softwaresystemen</i>. Universitaetsbibliothek Paderborn.","bibtex":"@book{Meyer_2009, title={Musterbasiertes Re-Engineering von Softwaresystemen}, publisher={Universitaetsbibliothek Paderborn}, author={Meyer, Matthias}, year={2009} }","mla":"Meyer, Matthias. <i>Musterbasiertes Re-Engineering von Softwaresystemen</i>. Universitaetsbibliothek Paderborn, 2009.","short":"M. Meyer, Musterbasiertes Re-Engineering von Softwaresystemen, Universitaetsbibliothek Paderborn, 2009."},"year":"2009","date_created":"2021-01-13T10:02:36Z","author":[{"first_name":"Matthias","full_name":"Meyer, Matthias","last_name":"Meyer"}],"date_updated":"2022-01-06T06:54:41Z","publisher":"Universitaetsbibliothek Paderborn","main_file_link":[{"url":"http://ubdok.uni-paderborn.de/servlets/DocumentServlet?id=11678"}],"title":"Musterbasiertes Re-Engineering von Softwaresystemen"},{"year":"2009","intvolume":"         4","citation":{"ama":"Meyer auf der Heide F, Rammig F-J. Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>. 2009;04.","ieee":"F. Meyer auf der Heide and F.-J. Rammig, “Self-Organisation and Self-Optimization,” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009.","chicago":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i> 04 (2009).","apa":"Meyer auf der Heide, F., &#38; Rammig, F.-J. (2009). Self-Organisation and Self-Optimization. <i>Public Service Review: Science and Technology</i>, <i>04</i>.","bibtex":"@article{Meyer auf der Heide_Rammig_2009, title={Self-Organisation and Self-Optimization}, volume={04}, journal={Public Service Review: Science and Technology}, author={Meyer auf der Heide, Friedhelm and Rammig, Franz-Josef}, year={2009} }","short":"F. Meyer auf der Heide, F.-J. Rammig, Public Service Review: Science and Technology 04 (2009).","mla":"Meyer auf der Heide, Friedhelm, and Franz-Josef Rammig. “Self-Organisation and Self-Optimization.” <i>Public Service Review: Science and Technology</i>, vol. 04, 2009."},"date_updated":"2022-01-06T06:53:12Z","volume":"04","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Franz-Josef","last_name":"Rammig","full_name":"Rammig, Franz-Josef"}],"date_created":"2020-07-29T13:51:54Z","title":"Self-Organisation and Self-Optimization","publication":"Public Service Review: Science and Technology","type":"journal_article","status":"public","_id":"17453","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"user_id":"15415","department":[{"_id":"63"}],"_id":"19031","language":[{"iso":"eng"}],"type":"journal_article","publication":"it - Information Technology","status":"public","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"}],"date_created":"2020-09-04T12:05:57Z","volume":51,"date_updated":"2022-01-06T06:53:57Z","doi":"10.1524/itit.2009.0524","title":"Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)","issue":"1","publication_status":"published","publication_identifier":{"issn":["1611-2776"]},"citation":{"apa":"Briest, P. (2009). Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). <i>It - Information Technology</i>, <i>51</i>(1), 62–65. <a href=\"https://doi.org/10.1524/itit.2009.0524\">https://doi.org/10.1524/itit.2009.0524</a>","mla":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” <i>It - Information Technology</i>, vol. 51, no. 1, 2009, pp. 62–65, doi:<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>.","bibtex":"@article{Briest_2009, title={Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems)}, volume={51}, DOI={<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>}, number={1}, journal={it - Information Technology}, author={Briest, Patrick}, year={2009}, pages={62–65} }","short":"P. Briest, It - Information Technology 51 (2009) 62–65.","ama":"Briest P. Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems). <i>it - Information Technology</i>. 2009;51(1):62-65. doi:<a href=\"https://doi.org/10.1524/itit.2009.0524\">10.1524/itit.2009.0524</a>","chicago":"Briest, Patrick. “Algorithmische Und Komplexitätstheoretische Aspekte Kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems).” <i>It - Information Technology</i> 51, no. 1 (2009): 62–65. <a href=\"https://doi.org/10.1524/itit.2009.0524\">https://doi.org/10.1524/itit.2009.0524</a>.","ieee":"P. Briest, “Algorithmische und komplexitätstheoretische Aspekte kombinatorischer Preisoptimierung (Computational Aspects of Combinatorial Pricing Problems),” <i>it - Information Technology</i>, vol. 51, no. 1, pp. 62–65, 2009."},"page":"62-65","intvolume":"        51","year":"2009"},{"_id":"1925","department":[{"_id":"79"}],"user_id":"15504","publication":"Theory Comput. Syst.","type":"journal_article","status":"public","date_updated":"2022-01-06T06:54:00Z","author":[{"first_name":"Robert","last_name":"D. Kleinberg","full_name":"D. Kleinberg, Robert"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T09:01:30Z","title":"Foreword","doi":"10.1007/s00224-009-9202-x","issue":"2","year":"2009","page":"187","citation":{"bibtex":"@article{D. Kleinberg_Scheideler_2009, title={Foreword}, DOI={<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>}, number={2}, journal={Theory Comput. Syst.}, author={D. Kleinberg, Robert and Scheideler, Christian}, year={2009}, pages={187} }","short":"R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.","mla":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” <i>Theory Comput. Syst.</i>, no. 2, 2009, p. 187, doi:<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>.","apa":"D. Kleinberg, R., &#38; Scheideler, C. (2009). Foreword. <i>Theory Comput. Syst.</i>, (2), 187. <a href=\"https://doi.org/10.1007/s00224-009-9202-x\">https://doi.org/10.1007/s00224-009-9202-x</a>","ama":"D. Kleinberg R, Scheideler C. Foreword. <i>Theory Comput Syst</i>. 2009;(2):187. doi:<a href=\"https://doi.org/10.1007/s00224-009-9202-x\">10.1007/s00224-009-9202-x</a>","chicago":"D. Kleinberg, Robert, and Christian Scheideler. “Foreword.” <i>Theory Comput. Syst.</i>, no. 2 (2009): 187. <a href=\"https://doi.org/10.1007/s00224-009-9202-x\">https://doi.org/10.1007/s00224-009-9202-x</a>.","ieee":"R. D. Kleinberg and C. Scheideler, “Foreword,” <i>Theory Comput. Syst.</i>, no. 2, p. 187, 2009."}},{"citation":{"chicago":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>Theory Comput. Syst.</i>, no. 2 (2009): 234--260. <a href=\"https://doi.org/10.1007/s00224-008-9099-9\">https://doi.org/10.1007/s00224-008-9099-9</a>.","ieee":"B. Awerbuch and C. Scheideler, “Towards a Scalable and Robust DHT,” <i>Theory Comput. Syst.</i>, no. 2, pp. 234--260, 2009.","ama":"Awerbuch B, Scheideler C. Towards a Scalable and Robust DHT. <i>Theory Comput Syst</i>. 2009;(2):234--260. doi:<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>","apa":"Awerbuch, B., &#38; Scheideler, C. (2009). Towards a Scalable and Robust DHT. <i>Theory Comput. Syst.</i>, (2), 234--260. <a href=\"https://doi.org/10.1007/s00224-008-9099-9\">https://doi.org/10.1007/s00224-008-9099-9</a>","short":"B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.","bibtex":"@article{Awerbuch_Scheideler_2009, title={Towards a Scalable and Robust DHT}, DOI={<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>}, number={2}, journal={Theory Comput. Syst.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={234--260} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” <i>Theory Comput. Syst.</i>, no. 2, 2009, pp. 234--260, doi:<a href=\"https://doi.org/10.1007/s00224-008-9099-9\">10.1007/s00224-008-9099-9</a>."},"page":"234--260","year":"2009","issue":"2","doi":"10.1007/s00224-008-9099-9","title":"Towards a Scalable and Robust DHT","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-03-29T09:08:11Z","date_updated":"2022-01-06T06:54:00Z","status":"public","type":"journal_article","publication":"Theory Comput. Syst.","user_id":"15504","department":[{"_id":"79"}],"_id":"1927"},{"_id":"1928","department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"Theor. Comput. Sci.","type":"journal_article","title":"Robust random number generation for peer-to-peer systems","doi":"10.1016/j.tcs.2008.10.003","date_updated":"2022-01-06T06:54:01Z","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2018-03-29T09:08:12Z","year":"2009","page":"453--466","citation":{"ama":"Awerbuch B, Scheideler C. Robust random number generation for peer-to-peer systems. <i>Theor Comput Sci</i>. 2009;(6-7):453--466. doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>","ieee":"B. Awerbuch and C. Scheideler, “Robust random number generation for peer-to-peer systems,” <i>Theor. Comput. Sci.</i>, no. 6–7, pp. 453--466, 2009.","chicago":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>Theor. Comput. Sci.</i>, no. 6–7 (2009): 453--466. <a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">https://doi.org/10.1016/j.tcs.2008.10.003</a>.","apa":"Awerbuch, B., &#38; Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. <i>Theor. Comput. Sci.</i>, (6–7), 453--466. <a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">https://doi.org/10.1016/j.tcs.2008.10.003</a>","short":"B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.","bibtex":"@article{Awerbuch_Scheideler_2009, title={Robust random number generation for peer-to-peer systems}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>}, number={6–7}, journal={Theor. Comput. Sci.}, author={Awerbuch, Baruch and Scheideler, Christian}, year={2009}, pages={453--466} }","mla":"Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” <i>Theor. Comput. Sci.</i>, no. 6–7, 2009, pp. 453--466, doi:<a href=\"https://doi.org/10.1016/j.tcs.2008.10.003\">10.1016/j.tcs.2008.10.003</a>."},"issue":"6-7"},{"_id":"1929","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","status":"public","publication":"Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II","type":"conference","title":"A Distributed and Oblivious Heap","doi":"10.1007/978-3-642-02930-1_47","date_updated":"2022-01-06T06:54:01Z","publisher":"Springer","volume":5556,"author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"}],"date_created":"2018-03-29T09:08:14Z","year":"2009","page":"571--582","intvolume":"      5556","citation":{"chicago":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” In <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, 5556:571--582. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">https://doi.org/10.1007/978-3-642-02930-1_47</a>.","ieee":"C. Scheideler and S. Schmid, “A Distributed and Oblivious Heap,” in <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, 2009, vol. 5556, pp. 571--582.","ama":"Scheideler C, Schmid S. A Distributed and Oblivious Heap. In: <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>. Vol 5556. Lecture Notes in Computer Science. Springer; 2009:571--582. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>","bibtex":"@inproceedings{Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Distributed and Oblivious Heap}, volume={5556}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>}, booktitle={Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II}, publisher={Springer}, author={Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={571--582}, collection={Lecture Notes in Computer Science} }","mla":"Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.” <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i>, vol. 5556, Springer, 2009, pp. 571--582, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">10.1007/978-3-642-02930-1_47</a>.","short":"C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.","apa":"Scheideler, C., &#38; Schmid, S. (2009). A Distributed and Oblivious Heap. In <i>Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II</i> (Vol. 5556, pp. 571--582). Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_47\">https://doi.org/10.1007/978-3-642-02930-1_47</a>"},"publication_identifier":{"isbn":["978-3-642-02929-5"]}},{"year":"2009","publisher":"Springer","date_created":"2018-03-29T09:12:59Z","title":"A Self-stabilizing and Local Delaunay Graph Construction","publication":"Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-04-13T10:05:53Z","creator":"florida","date_updated":"2018-04-13T10:05:53Z","file_name":"isaac09.pdf","access_level":"open_access","file_id":"2342","file_size":139275}],"ddc":["040"],"has_accepted_license":"1","intvolume":"      5878","page":"771--780","citation":{"ieee":"R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “A Self-stabilizing and Local Delaunay Graph Construction,” in <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, 2009, vol. 5878, pp. 771--780.","chicago":"Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.” In <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">https://doi.org/10.1007/978-3-642-10631-6_78</a>.","ama":"Jacob R, Ritscher S, Scheideler C, Schmid S. A Self-stabilizing and Local Delaunay Graph Construction. In: <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>. Vol 5878. Lecture Notes in Computer Science. Springer; 2009:771--780. doi:<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>","mla":"Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.” <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i>, vol. 5878, Springer, 2009, pp. 771--780, doi:<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>.","short":"R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.","bibtex":"@inproceedings{Jacob_Ritscher_Scheideler_Schmid_2009, series={Lecture Notes in Computer Science}, title={A Self-stabilizing and Local Delaunay Graph Construction}, volume={5878}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">10.1007/978-3-642-10631-6_78</a>}, booktitle={Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings}, publisher={Springer}, author={Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={771--780}, collection={Lecture Notes in Computer Science} }","apa":"Jacob, R., Ritscher, S., Scheideler, C., &#38; Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In <i>Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings</i> (Vol. 5878, pp. 771--780). Springer. <a href=\"https://doi.org/10.1007/978-3-642-10631-6_78\">https://doi.org/10.1007/978-3-642-10631-6_78</a>"},"date_updated":"2022-01-06T06:54:02Z","oa":"1","volume":5878,"author":[{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"first_name":"Stephan","full_name":"Ritscher, Stephan","last_name":"Ritscher"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"doi":"10.1007/978-3-642-10631-6_78","type":"conference","urn":"19304","status":"public","_id":"1930","department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","file_date_updated":"2018-04-13T10:05:53Z"},{"year":"2009","citation":{"ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140.","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 131--140, 2009. <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>. ; 2009:131--140. doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i> (pp. 131--140). <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140, doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>.","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140."},"page":"131--140","publication_identifier":{"isbn":["978-1-60558-396-9"]},"title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","doi":"10.1145/1582716.1582741","date_updated":"2022-01-06T06:54:02Z","date_created":"2018-03-29T09:16:22Z","author":[{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"status":"public","type":"conference","publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","_id":"1932","user_id":"15504","department":[{"_id":"79"}]},{"_id":"1933","user_id":"15504","department":[{"_id":"79"}],"type":"conference","publication":"SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009","status":"public","date_updated":"2022-01-06T06:54:02Z","author":[{"last_name":"Baumgart","full_name":"Baumgart, Matthias","first_name":"Matthias"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_created":"2018-03-29T09:18:06Z","title":"A DoS-resilient information system for dynamic data management","doi":"10.1145/1583991.1584064","publication_identifier":{"isbn":["978-1-60558-606-9"]},"year":"2009","citation":{"mla":"Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.” <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 2009, pp. 300--309, doi:<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>.","bibtex":"@inproceedings{Baumgart_Scheideler_Schmid_2009, title={A DoS-resilient information system for dynamic data management}, DOI={<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>}, booktitle={SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009}, author={Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan}, year={2009}, pages={300--309} }","short":"M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.","apa":"Baumgart, M., Scheideler, C., &#38; Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i> (pp. 300--309). <a href=\"https://doi.org/10.1145/1583991.1584064\">https://doi.org/10.1145/1583991.1584064</a>","ama":"Baumgart M, Scheideler C, Schmid S. A DoS-resilient information system for dynamic data management. In: <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>. ; 2009:300--309. doi:<a href=\"https://doi.org/10.1145/1583991.1584064\">10.1145/1583991.1584064</a>","ieee":"M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 2009, pp. 300--309.","chicago":"Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.” In <i>SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009</i>, 300--309, 2009. <a href=\"https://doi.org/10.1145/1583991.1584064\">https://doi.org/10.1145/1583991.1584064</a>."},"page":"300--309"},{"date_created":"2018-03-29T09:19:17Z","author":[{"full_name":"Gall, Dominik","last_name":"Gall","first_name":"Dominik"},{"full_name":"Jacob, Riko","last_name":"Jacob","first_name":"Riko"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Täubig","full_name":"Täubig, Hanjo","first_name":"Hanjo"}],"volume":5873,"publisher":"Springer","date_updated":"2022-01-06T06:54:02Z","doi":"10.1007/978-3-642-05118-0_58","title":"Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization","publication_identifier":{"isbn":["978-3-642-05117-3"]},"citation":{"bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, series={Lecture Notes in Computer Science}, title={Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization}, volume={5873}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={781--782}, collection={Lecture Notes in Computer Science} }","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.","mla":"Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, vol. 5873, Springer, 2009, pp. 781--782, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>.","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i> (Vol. 5873, pp. 781--782). Springer. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">https://doi.org/10.1007/978-3-642-05118-0_58</a>","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In: <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>. Vol 5873. Lecture Notes in Computer Science. Springer; 2009:781--782. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">10.1007/978-3-642-05118-0_58</a>","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.” In <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, 5873:781--782. Lecture Notes in Computer Science. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_58\">https://doi.org/10.1007/978-3-642-05118-0_58</a>.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in <i>Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings</i>, 2009, vol. 5873, pp. 781--782."},"page":"781--782","intvolume":"      5873","year":"2009","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}],"_id":"1934","type":"conference","publication":"Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings","status":"public"},{"status":"public","publication":"Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009","type":"conference","_id":"1935","department":[{"_id":"79"}],"user_id":"15504","series_title":"Dagstuhl Seminar Proceedings","year":"2009","intvolume":"      9371","citation":{"apa":"Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i> (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>","short":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.","bibtex":"@inproceedings{Doerr_Ann Goldberg_Minder_Sauerwald_Scheideler_2009, series={Dagstuhl Seminar Proceedings}, title={Stabilizing Consensus with the Power of Two Choices}, volume={09371}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, booktitle={Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany}, author={Doerr, Benjamin and Ann Goldberg, Leslie and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2009}, collection={Dagstuhl Seminar Proceedings} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>.","ama":"Doerr B, Ann Goldberg L, Minder L, Sauerwald T, Scheideler C. Stabilizing Consensus with the Power of Two Choices. In: <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>. Vol 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany; 2009. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>","ieee":"B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, 2009, vol. 09371.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009</i>, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>."},"title":"Stabilizing Consensus with the Power of Two Choices","doi":"10.1145/1989493.1989516","date_updated":"2022-01-06T06:54:02Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany","volume":"09371","date_created":"2018-03-29T09:20:44Z","author":[{"first_name":"Benjamin","full_name":"Doerr, Benjamin","last_name":"Doerr"},{"full_name":"Ann Goldberg, Leslie","last_name":"Ann Goldberg","first_name":"Leslie"},{"first_name":"Lorenz","last_name":"Minder","full_name":"Minder, Lorenz"},{"first_name":"Thomas","full_name":"Sauerwald, Thomas","last_name":"Sauerwald"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}]},{"citation":{"apa":"Woehrle, M., Plessl, C., &#38; Thiele, L. (2009). <i>Rupeas: Ruby Powered Event Analysis DSL</i>. Computer Engineering and Networks Lab, ETH Zurich.","short":"M. Woehrle, C. Plessl, L. Thiele, Rupeas: Ruby Powered Event Analysis DSL, Computer Engineering and Networks Lab, ETH Zurich, 2009.","mla":"Woehrle, Matthias, et al. <i>Rupeas: Ruby Powered Event Analysis DSL</i>. 2009.","bibtex":"@book{Woehrle_Plessl_Thiele_2009, place={Computer Engineering and Networks Lab, ETH Zurich}, title={Rupeas: Ruby Powered Event Analysis DSL}, author={Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}, year={2009} }","ama":"Woehrle M, Plessl C, Thiele L. <i>Rupeas: Ruby Powered Event Analysis DSL</i>. Computer Engineering and Networks Lab, ETH Zurich; 2009.","ieee":"M. Woehrle, C. Plessl, and L. Thiele, <i>Rupeas: Ruby Powered Event Analysis DSL</i>. Computer Engineering and Networks Lab, ETH Zurich, 2009.","chicago":"Woehrle, Matthias, Christian Plessl, and Lothar Thiele. <i>Rupeas: Ruby Powered Event Analysis DSL</i>. Computer Engineering and Networks Lab, ETH Zurich, 2009."},"place":"Computer Engineering and Networks Lab, ETH Zurich","year":"2009","title":"Rupeas: Ruby Powered Event Analysis DSL","date_created":"2018-04-16T15:09:19Z","author":[{"last_name":"Woehrle","full_name":"Woehrle, Matthias","first_name":"Matthias"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"},{"first_name":"Lothar","last_name":"Thiele","full_name":"Thiele, Lothar"}],"date_updated":"2022-01-06T06:55:56Z","status":"public","abstract":[{"text":"Wireless Sensor Networks (WSNs) are unique embedded computation systems for distributed sensing of a dispersed phenomenon. While being a strongly concurrent distributed system, its embedded aspects with severe resource limitations and the wireless communication requires a fusion of technologies and methodologies from very different fields. As WSNs are deployed in remote locations for long-term unattended operation, assurance of correct functioning of the system is of prime concern. Thus, the design and development of WSNs requires specialized tools to allow for testing and debugging the system. To this end, we present a framework for analyzing and checking WSNs based on collected events during system operation. It allows for abstracting from the event trace by means of behavioral queries and uses assertions for checking the accordance of an execution to its specification. The framework is independent from WSN test platforms, applications and logging semantics and thus generally applicable for analyzing event logs of WSN test executions. ","lang":"eng"}],"report_number":"TIK-Report 290","type":"report","extern":"1","language":[{"iso":"eng"}],"keyword":["Rupeas","DSL","WSN","testing"],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"16153","_id":"2353"},{"year":"2009","place":"Berlin, Heidelberg","citation":{"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>.","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>","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."},"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"On Stackelberg Pricing with Computationally Bounded Consumers","doi":"10.1007/978-3-642-10841-9_6","date_updated":"2022-01-06T06:55:59Z","date_created":"2021-09-03T10:55:38Z","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"first_name":"Martin","last_name":"Hoefer","full_name":"Hoefer, Martin"},{"first_name":"Luciano","full_name":"Gualà, Luciano","last_name":"Gualà"},{"first_name":"Carmine","last_name":"Ventre","full_name":"Ventre, Carmine"}],"abstract":[{"lang":"eng","text":"In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability.\r\n\r\nWe consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3."}],"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"_id":"23744","department":[{"_id":"63"}],"user_id":"15415"},{"year":"2009","citation":{"ama":"Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI; 2009.","chicago":"Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts for Model Verification and Validation during Simulation Runtime.” In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI, 2009.","ieee":"C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in <i>European Simulation and Modelling Conference (ESM 2009)</i>, 2009.","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","mla":"Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” <i>European Simulation and Modelling Conference (ESM 2009)</i>, EUROSIS-ETI, 2009.","bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model Verification and Validation during Simulation Runtime}, booktitle={European Simulation and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }","apa":"Laroque, C., Fischer, M., &#38; Dangelmaier, W. (2009). Concepts for Model Verification and Validation during Simulation Runtime. In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI."},"date_updated":"2022-01-06T06:53:26Z","publisher":"EUROSIS-ETI","date_created":"2020-08-24T07:28:23Z","author":[{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"}],"title":"Concepts for Model Verification and Validation during Simulation Runtime","type":"conference","publication":"European Simulation and Modelling Conference (ESM 2009)","abstract":[{"lang":"eng","text":"Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task."}],"status":"public","_id":"18138","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"department":[{"_id":"75"}],"user_id":"15572","_id":"1828","status":"public","publication":"2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops","type":"conference","doi":"10.1109/sahcnw.2009.5172938","title":"Improving Network Coded Cooperation by Soft Information","author":[{"full_name":"Volkhausen, Tobias","last_name":"Volkhausen","first_name":"Tobias"},{"first_name":"Dereje H.","full_name":"Woldegebreal, Dereje H.","last_name":"Woldegebreal"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"date_created":"2018-03-27T12:25:03Z","date_updated":"2022-01-06T06:53:28Z","publisher":"IEEE","citation":{"ieee":"T. Volkhausen, D. H. Woldegebreal, and H. Karl, “Improving Network Coded Cooperation by Soft Information,” in <i>2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops</i>, 2009.","chicago":"Volkhausen, Tobias, Dereje H. Woldegebreal, and Holger Karl. “Improving Network Coded Cooperation by Soft Information.” In <i>2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops</i>. IEEE, 2009. <a href=\"https://doi.org/10.1109/sahcnw.2009.5172938\">https://doi.org/10.1109/sahcnw.2009.5172938</a>.","ama":"Volkhausen T, Woldegebreal DH, Karl H. Improving Network Coded Cooperation by Soft Information. In: <i>2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops</i>. IEEE; 2009. doi:<a href=\"https://doi.org/10.1109/sahcnw.2009.5172938\">10.1109/sahcnw.2009.5172938</a>","apa":"Volkhausen, T., Woldegebreal, D. H., &#38; Karl, H. (2009). Improving Network Coded Cooperation by Soft Information. In <i>2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops</i>. IEEE. <a href=\"https://doi.org/10.1109/sahcnw.2009.5172938\">https://doi.org/10.1109/sahcnw.2009.5172938</a>","short":"T. Volkhausen, D.H. Woldegebreal, H. Karl, in: 2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops, IEEE, 2009.","mla":"Volkhausen, Tobias, et al. “Improving Network Coded Cooperation by Soft Information.” <i>2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops</i>, IEEE, 2009, doi:<a href=\"https://doi.org/10.1109/sahcnw.2009.5172938\">10.1109/sahcnw.2009.5172938</a>.","bibtex":"@inproceedings{Volkhausen_Woldegebreal_Karl_2009, title={Improving Network Coded Cooperation by Soft Information}, DOI={<a href=\"https://doi.org/10.1109/sahcnw.2009.5172938\">10.1109/sahcnw.2009.5172938</a>}, booktitle={2009 6th IEEE Annual Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Workshops}, publisher={IEEE}, author={Volkhausen, Tobias and Woldegebreal, Dereje H. and Karl, Holger}, year={2009} }"},"year":"2009","publication_identifier":{"isbn":["9781424439386"]},"publication_status":"published"}]