[{"year":"2021","title":"Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns","status":"public","author":[{"full_name":"Müller, Michelle","last_name":"Müller","first_name":"Michelle","id":"50286"},{"id":"64464","last_name":"Seutter","first_name":"Janina","full_name":"Seutter, Janina"},{"id":"70858","full_name":"Müller, Stefanie Jutta Marianne","last_name":"Müller","first_name":"Stefanie Jutta Marianne"},{"full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis","id":"21117"}],"conference":{"name":"Proceedings of the 42nd International Conference on Information Systems (ICIS)"},"publication_status":"accepted","date_updated":"2022-01-06T06:56:54Z","_id":"25174","language":[{"iso":"eng"}],"user_id":"477","publication":"Proceedings of the 42nd International Conference on Information Systems (ICIS)","citation":{"bibtex":"@inproceedings{Müller_Seutter_Müller_Kundisch, title={Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns}, booktitle={Proceedings of the 42nd International Conference on Information Systems (ICIS)}, author={Müller, Michelle and Seutter, Janina and Müller, Stefanie Jutta Marianne and Kundisch, Dennis} }","chicago":"Müller, Michelle, Janina Seutter, Stefanie Jutta Marianne Müller, and Dennis Kundisch. “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns.” In <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>, n.d.","ama":"Müller M, Seutter J, Müller SJM, Kundisch D. Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns. In: <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>.","short":"M. Müller, J. Seutter, S.J.M. Müller, D. Kundisch, in: Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d.","ieee":"M. Müller, J. Seutter, S. J. M. Müller, and D. Kundisch, “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns,” presented at the Proceedings of the 42nd International Conference on Information Systems (ICIS).","mla":"Müller, Michelle, et al. “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns.” <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>.","apa":"Müller, M., Seutter, J., Müller, S. J. M., &#38; Kundisch, D. (n.d.). Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns. <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>. Proceedings of the 42nd International Conference on Information Systems (ICIS)."},"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"1","name":"SFB 901"}],"date_created":"2021-09-30T12:45:10Z","type":"conference","department":[{"_id":"276"}]},{"language":[{"iso":"eng"}],"_id":"25178","user_id":"477","author":[{"full_name":"Poniatowski, Martin","first_name":"Martin","last_name":"Poniatowski","id":"32441"},{"id":"64464","full_name":"Seutter, Janina","first_name":"Janina","last_name":"Seutter"},{"id":"21117","first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis"}],"conference":{"name":"Proceedings of the 42nd International Conference on Information Systems (ICIS)"},"title":"\"Timing is Everything\" — An Empirical Analysis of the Timing of Online Review Elicitation","year":"2021","status":"public","publication_status":"accepted","date_updated":"2022-01-06T06:56:54Z","date_created":"2021-09-30T12:48:07Z","department":[{"_id":"276"}],"type":"conference","citation":{"mla":"Poniatowski, Martin, et al. “‘Timing Is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation.” <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>.","apa":"Poniatowski, M., Seutter, J., &#38; Kundisch, D. (n.d.). “Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation. <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>. Proceedings of the 42nd International Conference on Information Systems (ICIS).","ieee":"M. Poniatowski, J. Seutter, and D. Kundisch, “‘Timing is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation,” presented at the Proceedings of the 42nd International Conference on Information Systems (ICIS).","short":"M. Poniatowski, J. Seutter, D. Kundisch, in: Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d.","ama":"Poniatowski M, Seutter J, Kundisch D. “Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation. In: <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>.","chicago":"Poniatowski, Martin, Janina Seutter, and Dennis Kundisch. “‘Timing Is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation.” In <i>Proceedings of the 42nd International Conference on Information Systems (ICIS)</i>, n.d.","bibtex":"@inproceedings{Poniatowski_Seutter_Kundisch, title={“Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation}, booktitle={Proceedings of the 42nd International Conference on Information Systems (ICIS)}, author={Poniatowski, Martin and Seutter, Janina and Kundisch, Dennis} }"},"publication":"Proceedings of the 42nd International Conference on Information Systems (ICIS)","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}]},{"date_updated":"2022-01-06T06:57:33Z","author":[{"last_name":"Everling","first_name":"Leon","full_name":"Everling, Leon"}],"title":"Selbststabilisierender Bakery Algorithmus für verteilte Systeme","status":"public","year":"2021","user_id":"15504","language":[{"iso":"eng"}],"_id":"27053","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"citation":{"mla":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>. 2021.","ama":"Everling L. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>.; 2021.","bibtex":"@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }","apa":"Everling, L. (2021). <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>.","ieee":"L. Everling, <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>. 2021.","chicago":"Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>, 2021.","short":"L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021."},"department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2021-11-02T10:13:51Z"},{"_id":"27072","language":[{"iso":"eng"}],"user_id":"15504","author":[{"full_name":"Adsul, Vaibhav","last_name":"Adsul","first_name":"Vaibhav"}],"year":"2021","title":"Peer-to-Peer Matching for Distributed Systems","status":"public","date_updated":"2022-01-06T06:57:33Z","date_created":"2021-11-03T06:12:47Z","department":[{"_id":"79"}],"type":"mastersthesis","citation":{"ieee":"V. Adsul, <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","apa":"Adsul, V. (2021). <i>Peer-to-Peer Matching for Distributed Systems</i>.","short":"V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021.","chicago":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>, 2021.","mla":"Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.","bibtex":"@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }","ama":"Adsul V. <i>Peer-to-Peer Matching for Distributed Systems</i>.; 2021."},"supervisor":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}]},{"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2021-01-26T13:58:14Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"ama":"Werthmann J. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.; 2021.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","mla":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","chicago":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>, 2021.","short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","apa":"Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.","ieee":"J. Werthmann, <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021."},"supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"user_id":"15504","_id":"21084","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:44Z","status":"public","title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","year":"2021","author":[{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}]},{"title":"Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter","status":"public","year":"2021","author":[{"full_name":"Mengshi, Ma","last_name":"Mengshi","first_name":"Ma"}],"date_updated":"2022-01-06T06:54:49Z","language":[{"iso":"eng"}],"_id":"21197","user_id":"15504","supervisor":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"citation":{"ama":"Mengshi M. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.; 2021.","bibtex":"@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }","mla":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021.","chicago":"Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>, 2021.","short":"M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.","apa":"Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>.","ieee":"M. Mengshi, <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter</i>. 2021."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"date_created":"2021-02-09T07:09:22Z","type":"bachelorsthesis","department":[{"_id":"79"}]},{"date_updated":"2022-01-06T06:55:03Z","conference":{"name":"Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021)","location":"Virtual Conference/Workshop"},"author":[{"first_name":"Dominik","last_name":"Gutt","full_name":"Gutt, Dominik"},{"id":"32456","last_name":"Neumann","first_name":"Jürgen","full_name":"Neumann, Jürgen"},{"last_name":"Jabr","first_name":"Wael","full_name":"Jabr, Wael"},{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"}],"title":"The Fate of the App: Economic Implications of Updating under Reputation Resetting","year":"2021","status":"public","user_id":"477","_id":"21525","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"ieee":"D. Gutt, J. Neumann, W. Jabr, and D. Kundisch, “The Fate of the App: Economic Implications of Updating under Reputation Resetting,” presented at the Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021), Virtual Conference/Workshop, 2021.","apa":"Gutt, D., Neumann, J., Jabr, W., &#38; Kundisch, D. (2021). The Fate of the App: Economic Implications of Updating under Reputation Resetting. Presented at the Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021), Virtual Conference/Workshop.","short":"D. Gutt, J. Neumann, W. Jabr, D. Kundisch, in: 2021.","chicago":"Gutt, Dominik, Jürgen Neumann, Wael Jabr, and Dennis Kundisch. “The Fate of the App: Economic Implications of Updating under Reputation Resetting,” 2021.","mla":"Gutt, Dominik, et al. <i>The Fate of the App: Economic Implications of Updating under Reputation Resetting</i>. 2021.","bibtex":"@inproceedings{Gutt_Neumann_Jabr_Kundisch_2021, title={The Fate of the App: Economic Implications of Updating under Reputation Resetting}, author={Gutt, Dominik and Neumann, Jürgen and Jabr, Wael and Kundisch, Dennis}, year={2021} }","ama":"Gutt D, Neumann J, Jabr W, Kundisch D. The Fate of the App: Economic Implications of Updating under Reputation Resetting. In: ; 2021."},"department":[{"_id":"276"}],"type":"conference","date_created":"2021-03-17T13:11:24Z"},{"department":[{"_id":"79"}],"type":"dissertation","date_created":"2021-04-15T08:23:52Z","file":[{"success":1,"content_type":"application/pdf","file_id":"21629","date_updated":"2021-04-15T08:21:15Z","relation":"main_file","access_level":"closed","file_size":2617069,"file_name":"Dissertation_Michael_Feldmann.pdf","date_created":"2021-04-15T08:21:15Z","creator":"mfeldma2"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"abstract":[{"lang":"eng","text":"This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.\r\nWe furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach of those protocols comes with unique properties that makes it interesting for certain distributed applications.\r\nGeneralized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.\r\n"}],"citation":{"ama":"Feldmann M. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>","bibtex":"@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>}, author={Feldmann, Michael}, year={2021} }","mla":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1113\">10.17619/UNIPB/1-1113</a>.","short":"M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.","chicago":"Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>.","apa":"Feldmann, M. (2021). <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1113\">https://doi.org/10.17619/UNIPB/1-1113</a>","ieee":"M. Feldmann, <i>Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks</i>. 2021."},"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"file_date_updated":"2021-04-15T08:21:15Z","user_id":"23538","doi":"10.17619/UNIPB/1-1113","ddc":["006"],"_id":"21628","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:55:08Z","author":[{"id":"23538","first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael"}],"year":"2021","title":"Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks","status":"public"},{"intvolume":"        65","date_updated":"2022-01-06T06:54:31Z","publication_status":"published","author":[{"id":"22704","full_name":"Feldkord, Björn","first_name":"Björn","last_name":"Feldkord"},{"id":"39241","orcid":"0000-0003-2014-4696","first_name":"Till","last_name":"Knollmann","full_name":"Knollmann, Till"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel","id":"41265"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Managing Multiple Mobile Resources","status":"public","year":"2021","volume":65,"doi":"10.1007/s00224-020-10023-8","user_id":"15415","language":[{"iso":"eng"}],"_id":"20683","page":"943–984","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"citation":{"mla":"Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i>, vol. 65, 2021, pp. 943–984, doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","bibtex":"@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }","ama":"Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>. 2021;65:943–984. doi:<a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>","ieee":"B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” <i>Theory of Computing Systems</i>, vol. 65, pp. 943–984, 2021, doi: <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">10.1007/s00224-020-10023-8</a>.","apa":"Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. <i>Theory of Computing Systems</i>, <i>65</i>, 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>","short":"B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984.","chicago":"Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” <i>Theory of Computing Systems</i> 65 (2021): 943–984. <a href=\"https://doi.org/10.1007/s00224-020-10023-8\">https://doi.org/10.1007/s00224-020-10023-8</a>."},"publication":"Theory of Computing Systems","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-12-08T08:40:10Z"},{"citation":{"ieee":"M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17.","apa":"Bienkowski, M., Feldkord, B., &#38; Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 14:1-14:17). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>","short":"M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.","chicago":"Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 14:1-14:17, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">https://doi.org/10.4230/LIPIcs.STACS.2021.14</a>.","mla":"Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2021, pp. 14:1-14:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>.","bibtex":"@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }","ama":"Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: <i>Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)</i>. ; 2021:14:1-14:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2021.14\">10.4230/LIPIcs.STACS.2021.14</a>"},"publication":"Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-12-21T13:46:16Z","department":[{"_id":"63"}],"type":"conference","author":[{"full_name":"Bienkowski, Marcin","first_name":"Marcin","last_name":"Bienkowski"},{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"},{"first_name":"Pawel","last_name":"Schmidt","full_name":"Schmidt, Pawel"}],"year":"2021","status":"public","title":"A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location","publication_status":"published","date_updated":"2022-01-06T06:54:40Z","_id":"20817","language":[{"iso":"eng"}],"page":"14:1 - 14:17","user_id":"22704","doi":"10.4230/LIPIcs.STACS.2021.14"},{"citation":{"bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual.","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>"},"file_date_updated":"2021-06-06T19:12:49Z","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"1","name":"SFB 901"}],"place":"New York","conference":{"end_date":"2021-07-30","location":"Virtual","name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2021-07-26"},"status":"public","has_accepted_license":"1","publisher":"ACM","_id":"22283","editor":[{"last_name":"Censor-Hillel","first_name":"Keren","full_name":"Censor-Hillel, Keren"}],"user_id":"477","ddc":["000"],"publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","abstract":[{"lang":"eng","text":"    We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n    We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n    If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n    Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n    We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n    \r\n    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n    Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n    For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n    Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$."}],"date_created":"2021-06-06T19:10:26Z","file":[{"creator":"thgoette","date_created":"2021-06-06T19:12:49Z","date_updated":"2021-06-06T19:12:49Z","relation":"main_file","file_size":590875,"access_level":"closed","file_name":"Wicked_Fast_Overlay_Construction(1).pdf","success":1,"content_type":"application/pdf","file_id":"22284"}],"department":[{"_id":"34"}],"type":"conference","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","last_name":"Götte","id":"34727"},{"id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal","first_name":"Kristian"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"50024","last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian"}],"title":"Time-Optimal Construction of Overlays","year":"2021","publication_status":"accepted","date_updated":"2022-01-06T06:55:30Z","language":[{"iso":"eng"}],"doi":"10.1145/3465084.3467932"},{"conference":{"name":"29th European Conference on Information Systems (ECIS)","location":"Virtual Conference/Workshop"},"author":[{"full_name":"Kutzner, K.","last_name":"Kutzner","first_name":"K."},{"last_name":"Stadtländer","first_name":"M.","full_name":"Stadtländer, M."},{"full_name":"Seutter, Janina","first_name":"Janina","last_name":"Seutter","id":"64464"},{"last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117"},{"last_name":"Knackstedt","first_name":"R.","full_name":"Knackstedt, R."}],"status":"public","year":"2021","title":"”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing","date_updated":"2022-01-06T06:55:13Z","_id":"21799","language":[{"iso":"eng"}],"user_id":"477","citation":{"mla":"Kutzner, K., et al. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021.","bibtex":"@inproceedings{Kutzner_Stadtländer_Seutter_Kundisch_Knackstedt_2021, title={”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing}, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, author={Kutzner, K. and Stadtländer, M. and Seutter, Janina and Kundisch, Dennis and Knackstedt, R.}, year={2021} }","ama":"Kutzner K, Stadtländer M, Seutter J, Kundisch D, Knackstedt R. ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. ; 2021.","ieee":"K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, and R. Knackstedt, “”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop, 2021.","apa":"Kutzner, K., Stadtländer, M., Seutter, J., Kundisch, D., &#38; Knackstedt, R. (2021). ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop.","short":"K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, R. Knackstedt, in: Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.","chicago":"Kutzner, K., M. Stadtländer, Janina Seutter, Dennis Kundisch, and R. Knackstedt. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, 2021."},"publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"}],"date_created":"2021-04-26T10:46:22Z","department":[{"_id":"276"}],"type":"conference"},{"type":"bachelorsthesis","date_created":"2021-09-17T13:12:20Z","place":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"bibtex":"@book{Ahmeckovic_2021, place={Universität Paderborn}, title={Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen}, author={Ahmeckovic, Emina}, year={2021} }","ama":"Ahmeckovic E. <i>Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen</i>.; 2021.","mla":"Ahmeckovic, Emina. <i>Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen</i>. 2021.","short":"E. Ahmeckovic, Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen, Universität Paderborn, 2021.","chicago":"Ahmeckovic, Emina. <i>Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen</i>. Universität Paderborn, 2021.","ieee":"E. Ahmeckovic, <i>Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen</i>. Universität Paderborn, 2021.","apa":"Ahmeckovic, E. (2021). <i>Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen</i>."},"supervisor":[{"full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch","id":"21117"}],"user_id":"16205","_id":"24671","language":[{"iso":"ger"}],"date_updated":"2022-07-14T13:05:11Z","status":"public","title":"Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen","year":"2021","author":[{"last_name":"Ahmeckovic","first_name":"Emina","full_name":"Ahmeckovic, Emina"}]},{"author":[{"full_name":"Funk, Daniel","first_name":"Daniel","last_name":"Funk"}],"title":"Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems","status":"public","year":"2021","date_updated":"2022-07-14T13:05:42Z","_id":"24576","language":[{"iso":"ger"}],"user_id":"16205","supervisor":[{"id":"21117","first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis"}],"citation":{"bibtex":"@book{Funk_2021, place={Universität Paderborn}, title={Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems}, author={Funk, Daniel}, year={2021} }","chicago":"Funk, Daniel. <i>Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems</i>. Universität Paderborn, 2021.","short":"D. Funk, Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems, Universität Paderborn, 2021.","ama":"Funk D. <i>Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems</i>.; 2021.","ieee":"D. Funk, <i>Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems</i>. Universität Paderborn, 2021.","apa":"Funk, D. (2021). <i>Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems</i>.","mla":"Funk, Daniel. <i>Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems</i>. 2021."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"place":"Universität Paderborn","date_created":"2021-09-17T06:53:50Z","type":"bachelorsthesis"},{"place":"Universität Paderborn","date_created":"2021-09-30T13:11:52Z","type":"bachelorsthesis","supervisor":[{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"citation":{"ieee":"T. Rümpker, <i>Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen</i>. Universität Paderborn, 2021.","apa":"Rümpker, T. (2021). <i>Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen</i>.","mla":"Rümpker, Till. <i>Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen</i>. 2021.","bibtex":"@book{Rümpker_2021, place={Universität Paderborn}, title={Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen}, author={Rümpker, Till}, year={2021} }","chicago":"Rümpker, Till. <i>Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen</i>. Universität Paderborn, 2021.","short":"T. Rümpker, Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen, Universität Paderborn, 2021.","ama":"Rümpker T. <i>Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen</i>.; 2021."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"25181","language":[{"iso":"ger"}],"user_id":"16205","title":"Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen","status":"public","year":"2021","author":[{"full_name":"Rümpker, Till","first_name":"Till","last_name":"Rümpker"}],"date_updated":"2022-07-14T13:04:56Z"},{"type":"bachelorsthesis","date_created":"2021-09-20T07:59:04Z","place":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"citation":{"chicago":"Roslan, Jan-Philipp. <i>Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen</i>. Universität Paderborn, 2021.","short":"J.-P. Roslan, Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen, Universität Paderborn, 2021.","ieee":"J.-P. Roslan, <i>Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen</i>. Universität Paderborn, 2021.","apa":"Roslan, J.-P. (2021). <i>Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen</i>.","bibtex":"@book{Roslan_2021, place={Universität Paderborn}, title={Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen}, author={Roslan, Jan-Philipp}, year={2021} }","ama":"Roslan J-P. <i>Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen</i>.; 2021.","mla":"Roslan, Jan-Philipp. <i>Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen</i>. 2021."},"supervisor":[{"id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis"}],"user_id":"16205","_id":"24685","language":[{"iso":"ger"}],"date_updated":"2022-07-14T13:05:25Z","title":"Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen","year":"2021","status":"public","author":[{"full_name":"Roslan, Jan-Philipp","first_name":"Jan-Philipp","last_name":"Roslan"}]},{"place":"Universität Paderborn","date_created":"2021-09-17T07:06:39Z","type":"bachelorsthesis","supervisor":[{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"citation":{"mla":"Speer, Laura. <i>Digitale Diskriminierung – Ein systematischer Literaturüberblick</i>. 2021.","bibtex":"@book{Speer_2021, place={Universität Paderborn}, title={Digitale Diskriminierung – Ein systematischer Literaturüberblick}, author={Speer, Laura}, year={2021} }","ama":"Speer L. <i>Digitale Diskriminierung – Ein systematischer Literaturüberblick</i>.; 2021.","ieee":"L. Speer, <i>Digitale Diskriminierung – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021.","apa":"Speer, L. (2021). <i>Digitale Diskriminierung – Ein systematischer Literaturüberblick</i>.","short":"L. Speer, Digitale Diskriminierung – Ein systematischer Literaturüberblick, Universität Paderborn, 2021.","chicago":"Speer, Laura. <i>Digitale Diskriminierung – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"24577","language":[{"iso":"ger"}],"user_id":"16205","status":"public","year":"2021","title":"Digitale Diskriminierung – Ein systematischer Literaturüberblick","author":[{"full_name":"Speer, Laura","first_name":"Laura","last_name":"Speer"}],"date_updated":"2022-07-14T13:05:51Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"citation":{"ieee":"L. Lender, <i>Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit</i>. Universität Paderborn, 2021.","mla":"Lender, Leonie. <i>Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit</i>. 2021.","apa":"Lender, L. (2021). <i>Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit</i>.","bibtex":"@book{Lender_2021, place={Universität Paderborn}, title={Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit}, author={Lender, Leonie}, year={2021} }","short":"L. Lender, Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit, Universität Paderborn, 2021.","ama":"Lender L. <i>Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit</i>.; 2021.","chicago":"Lender, Leonie. <i>Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit</i>. Universität Paderborn, 2021."},"supervisor":[{"full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis","id":"21117"}],"type":"bachelorsthesis","date_created":"2021-04-22T08:04:45Z","place":"Universität Paderborn","date_updated":"2022-07-14T13:07:22Z","author":[{"first_name":"Leonie","last_name":"Lender","full_name":"Lender, Leonie"}],"year":"2021","title":"Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit","status":"public","user_id":"16205","_id":"21713","language":[{"iso":"ger"}]},{"date_updated":"2022-07-14T13:07:38Z","author":[{"first_name":"Gergely","last_name":"Steierlein","full_name":"Steierlein, Gergely"}],"status":"public","title":"Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick","year":"2021","user_id":"16205","language":[{"iso":"ger"}],"_id":"21434","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"supervisor":[{"full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch","id":"21117"}],"citation":{"chicago":"Steierlein, Gergely. <i>Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021.","short":"G. Steierlein, Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick, Universität Paderborn, 2021.","apa":"Steierlein, G. (2021). <i>Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick</i>.","ieee":"G. Steierlein, <i>Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021.","ama":"Steierlein G. <i>Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick</i>.; 2021.","bibtex":"@book{Steierlein_2021, place={Universität Paderborn}, title={Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick}, author={Steierlein, Gergely}, year={2021} }","mla":"Steierlein, Gergely. <i>Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. 2021."},"type":"bachelorsthesis","place":"Universität Paderborn","date_created":"2021-03-10T09:09:41Z"},{"type":"bachelorsthesis","place":"Universität Paderborn","date_created":"2021-03-03T13:45:01Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"supervisor":[{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"}],"citation":{"mla":"Mai, Thanh Quynh. <i>Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. 2021.","apa":"Mai, T. Q. (2021). <i>Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick</i>.","ieee":"T. Q. Mai, <i>Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021.","short":"T.Q. Mai, Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick, Universität Paderborn, 2021.","ama":"Mai TQ. <i>Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick</i>.; 2021.","chicago":"Mai, Thanh Quynh. <i>Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2021.","bibtex":"@book{Mai_2021, place={Universität Paderborn}, title={Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick}, author={Mai, Thanh Quynh}, year={2021} }"},"user_id":"16205","language":[{"iso":"ger"}],"_id":"21365","date_updated":"2022-07-14T13:07:51Z","author":[{"last_name":"Mai","first_name":"Thanh Quynh","full_name":"Mai, Thanh Quynh"}],"title":"Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick","status":"public","year":"2021"}]