[{"title":"The relevance of financial versus non-financial information for the valuation of venture capital-backed firms","related_material":{"link":[{"url":"http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1449740","relation":"earlier_version"}]},"publication_status":"published","department":[{"_id":"275"}],"doi":"10.1080/09638180.2012.741051","date_updated":"2022-01-06T07:01:43Z","language":[{"iso":"eng"}],"user_id":"46447","extern":"1","article_type":"original","abstract":[{"lang":"eng","text":"This study examines the relevance of financial and non-financial information for the valuation of venture capital (VC) investments. Based on a hand-collected data set on venture-backed start-ups in Germany, we investigate the internal due diligence documents of over 200 investment rounds. We document that balance sheet and income statement items capture as much economic content as verifiable non-financial information (e.g. team experience or the number of patents) while controlling for several deal characteristics (e.g. industry, investment round, or yearly VC fund inflows). In addition, we show that valuations based on accounting and non-accounting information yield a level of valuation accuracy that is comparable to that of publicly traded firms. Further analyses show that the industry-specific total asset multiples outperform the popular revenue multiples but lead to significantly less accurate results than those obtained from the more comprehensive valuation models. Overall, our findings might inform researchers and standard-setters of the usefulness of accounting information for investment companies and provide additional evidence to gauge the overall valuation accuracy in VC settings."}],"jel":["G24","G32","M41"],"volume":22,"status":"public","date_created":"2018-10-31T11:27:42Z","author":[{"first_name":"Sönke","full_name":"Sievers, Sönke","last_name":"Sievers","id":"46447"},{"last_name":"Mokwa","full_name":"Mokwa, Christopher F","first_name":"Christopher F"},{"first_name":"Georg","full_name":"Keienburg, Georg","last_name":"Keienburg"}],"publisher":"Taylor \\& Francis","quality_controlled":"1","keyword":["value relevance","equity valuation","venture capital","human capital","start-ups"],"publication":"European Accounting Review (VHB-JOURQUAL 3 Ranking A)","issue":"3","_id":"5191","intvolume":" 22","year":"2013","type":"journal_article","citation":{"mla":"Sievers, Sönke, et al. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, Taylor \\& Francis, 2013, pp. 467–511, doi:10.1080/09638180.2012.741051.","bibtex":"@article{Sievers_Mokwa_Keienburg_2013, title={The relevance of financial versus non-financial information for the valuation of venture capital-backed firms}, volume={22}, DOI={10.1080/09638180.2012.741051}, number={3}, journal={European Accounting Review (VHB-JOURQUAL 3 Ranking A)}, publisher={Taylor \\& Francis}, author={Sievers, Sönke and Mokwa, Christopher F and Keienburg, Georg}, year={2013}, pages={467–511} }","chicago":"Sievers, Sönke, Christopher F Mokwa, and Georg Keienburg. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22, no. 3 (2013): 467–511. https://doi.org/10.1080/09638180.2012.741051.","apa":"Sievers, S., Mokwa, C. F., & Keienburg, G. (2013). The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A), 22(3), 467–511. https://doi.org/10.1080/09638180.2012.741051","ama":"Sievers S, Mokwa CF, Keienburg G. The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A). 2013;22(3):467-511. doi:10.1080/09638180.2012.741051","ieee":"S. Sievers, C. F. Mokwa, and G. Keienburg, “The relevance of financial versus non-financial information for the valuation of venture capital-backed firms,” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, pp. 467–511, 2013.","short":"S. Sievers, C.F. Mokwa, G. Keienburg, European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22 (2013) 467–511."},"page":"467-511","main_file_link":[{"url":"http://www.tandfonline.com/doi/full/10.1080/09638180.2012.741051"}]},{"language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/s11573-013-0684-2","date_updated":"2022-01-06T07:01:43Z","publication_status":"published","department":[{"_id":"275"}],"title":"Valuing high technology growth firms","citation":{"apa":"Klobucnik, J., & Sievers, S. (2013). Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), 83(9), 947–984. https://doi.org/10.1007/s11573-013-0684-2","ama":"Klobucnik J, Sievers S. Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B). 2013;83(9):947-984. doi:https://doi.org/10.1007/s11573-013-0684-2","chicago":"Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83, no. 9 (2013): 947–84. https://doi.org/10.1007/s11573-013-0684-2.","bibtex":"@article{Klobucnik_Sievers_2013, title={Valuing high technology growth firms}, volume={83}, DOI={https://doi.org/10.1007/s11573-013-0684-2}, number={9}, journal={Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)}, publisher={Springer}, author={Klobucnik, Jan and Sievers, Sönke}, year={2013}, pages={947–984} }","mla":"Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, Springer, 2013, pp. 947–84, doi:https://doi.org/10.1007/s11573-013-0684-2.","short":"J. Klobucnik, S. Sievers, Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83 (2013) 947–984.","ieee":"J. Klobucnik and S. Sievers, “Valuing high technology growth firms,” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, pp. 947–984, 2013."},"type":"journal_article","year":"2013","page":"947-984","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s11573-013-0684-2"}],"issue":"9","_id":"5192","intvolume":" 83","jel":["G11","G12","G17","G33"],"volume":83,"status":"public","date_created":"2018-10-31T11:31:56Z","publisher":"Springer","author":[{"last_name":"Klobucnik","first_name":"Jan","full_name":"Klobucnik, Jan"},{"last_name":"Sievers","id":"46447","first_name":"Sönke","full_name":"Sievers, Sönke"}],"quality_controlled":"1","keyword":["Schwartz-Moon model","Market mispricing","Empirical test","Company valuation","Trading strategy"],"publication":"Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)","user_id":"46447","extern":"1","article_type":"original","abstract":[{"lang":"eng","text":"For the valuation of fast growing innovative firms Schwartz and Moon (Financ Anal J 56:62–75, 2000), (Financ Rev 36:7–26, 2001) develop a fundamental valuation model where key parameters follow stochastic processes. While prior research shows promising potential for this model, it has never been tested on a large scale dataset. Thus, guided by economic theory, this paper is the first to design a large-scale applicable implementation on around 30,000 technology firm quarter observations from 1992 to 2009 for the US to assess this model. Evaluating the feasibility and performance of the Schwartz-Moon model reveals that it is comparably accurate to the traditional sales multiple with key advantages in valuing small and non-listed firms. Most importantly, however, the model is able to indicate severe market over- or undervaluation from a fundamental perspective. We demonstrate that a trading strategy based on our implementation has significant investment value. Consequently, the model seems suitable for detecting misvaluations as the dot-com bubble."}]},{"_id":"520","year":"2013","citation":{"short":"P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","ieee":"P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.","ama":"Wette P, Karl H. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733","apa":"Wette, P., & Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52). https://doi.org/10.1109/INFCOMW.2013.6970733","chicago":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733.","bibtex":"@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }","mla":"Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733."},"type":"conference","page":"51-52","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/6970733/"}],"ddc":["040"],"user_id":"15504","abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:42:33Z","author":[{"first_name":"Philip","full_name":"Wette, Philip","last_name":"Wette"},{"first_name":"Holger","full_name":"Karl, Holger","last_name":"Karl","id":"126"}],"publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","file_date_updated":"2018-03-15T10:38:04Z","file":[{"date_updated":"2018-03-15T10:38:04Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":131502,"creator":"florida","file_id":"1298","access_level":"closed","date_created":"2018-03-15T10:38:04Z","file_name":"520-wetteinfocom2013.pdf"}],"doi":"10.1109/INFCOMW.2013.6970733","date_updated":"2022-01-06T07:01:43Z","title":"Incorporating feedback from application layer into routing and wavelength assignment algorithms","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}]},{"main_file_link":[{"url":"https://www.boersen-zeitung.de/index.php?li=1&artid=2013018054&titel=Die-erfolgreiche-Bindung-des-Sparers-an-die-Bank"}],"type":"newspaper_article","year":"2013","citation":{"ieee":"S. Sievers, T. Schlüter, and T. Hartmann-Wendels, “Die erfolgreiche Bindung des Sparers an die Bank,” Börsen-Zeitung, 2013.","short":"S. Sievers, T. Schlüter, T. Hartmann-Wendels, Börsen-Zeitung (2013).","mla":"Sievers, Sönke, et al. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013.","bibtex":"@article{Sievers_Schlüter_Hartmann-Wendels_2013, title={Die erfolgreiche Bindung des Sparers an die Bank}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Schlüter, Tobias and Hartmann-Wendels, Thomas}, year={2013} }","apa":"Sievers, S., Schlüter, T., & Hartmann-Wendels, T. (2013). Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung.","ama":"Sievers S, Schlüter T, Hartmann-Wendels T. Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. 2013.","chicago":"Sievers, Sönke, Tobias Schlüter, and Thomas Hartmann-Wendels. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013."},"language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:43Z","_id":"5201","publication_date":"2013-01-10","department":[{"_id":"275"}],"publication":"Börsen-Zeitung","author":[{"last_name":"Sievers","id":"46447","first_name":"Sönke","full_name":"Sievers, Sönke"},{"last_name":"Schlüter","full_name":"Schlüter, Tobias","first_name":"Tobias"},{"last_name":"Hartmann-Wendels","full_name":"Hartmann-Wendels, Thomas","first_name":"Thomas"}],"publication_status":"published","date_created":"2018-10-31T12:29:38Z","status":"public","title":"Die erfolgreiche Bindung des Sparers an die Bank","user_id":"46447"},{"user_id":"46447","title":"Wie Banken Kostenvorteile weitergeben","publication":"Börsen-Zeitung","department":[{"_id":"275"}],"author":[{"last_name":"Sievers","id":"46447","first_name":"Sönke","full_name":"Sievers, Sönke"},{"last_name":"Hartmann-Wendels","full_name":"Hartmann-Wendels, Thomas","first_name":"Thomas"},{"last_name":"Busch","first_name":"Ramona","full_name":"Busch, Ramona"},{"first_name":"Tobias","full_name":"Schlüter, Tobias","last_name":"Schlüter"}],"date_created":"2018-10-31T12:32:09Z","status":"public","volume":6,"publication_status":"published","intvolume":" 6","_id":"5202","date_updated":"2022-01-06T07:01:43Z","publication_date":"2013-01-10","main_file_link":[{"url":"https://www.boersen-zeitung.de/index.php?li=1&artid=2013006066"}],"language":[{"iso":"ger"}],"page":"6","citation":{"bibtex":"@article{Sievers_Hartmann-Wendels_Busch_Schlüter_2013, title={Wie Banken Kostenvorteile weitergeben}, volume={6}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}, year={2013} }","mla":"Sievers, Sönke, et al. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, vol. 6, 2013.","ama":"Sievers S, Hartmann-Wendels T, Busch R, Schlüter T. Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. 2013.","apa":"Sievers, S., Hartmann-Wendels, T., Busch, R., & Schlüter, T. (2013). Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung.","chicago":"Sievers, Sönke, Thomas Hartmann-Wendels, Ramona Busch, and Tobias Schlüter. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, 2013.","ieee":"S. Sievers, T. Hartmann-Wendels, R. Busch, and T. Schlüter, “Wie Banken Kostenvorteile weitergeben,” Börsen-Zeitung, vol. 6, 2013.","short":"S. Sievers, T. Hartmann-Wendels, R. Busch, T. Schlüter, Börsen-Zeitung 6 (2013)."},"year":"2013","type":"newspaper_article"},{"type":"mastersthesis","year":"2013","citation":{"bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }","mla":"Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","ama":"Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn; 2013.","apa":"Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn.","chicago":"Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","ieee":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:46Z","_id":"521","publisher":"Universität Paderborn","author":[{"first_name":"Heinrich","full_name":"Riebler, Heinrich","last_name":"Riebler","id":"8961"}],"department":[{"_id":"27"},{"_id":"518"}],"keyword":["coldboot"],"status":"public","date_created":"2017-10-17T12:42:34Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs","user_id":"477"},{"citation":{"mla":"Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","bibtex":"@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }","ama":"Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn; 2013.","apa":"Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn.","chicago":"Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","ieee":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.","short":"M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013."},"type":"mastersthesis","year":"2013","supervisor":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:01:47Z","_id":"522","author":[{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"}],"publisher":"Universität Paderborn","department":[{"_id":"79"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Teilprojekt A"},{"name":"SFB 901 - Subprojekt A1","_id":"5"}],"date_created":"2017-10-17T12:42:34Z","title":"HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths","user_id":"14052"},{"issue":"16-17","_id":"523","intvolume":" 161","page":"2563-2586","type":"journal_article","year":"2013","citation":{"short":"M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586.","ieee":"M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” Discrete Applied Mathematics, vol. 161, no. 16–17, pp. 2563–2586, 2013.","apa":"Mavronicolas, M., Monien, B., & Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? Discrete Applied Mathematics, 161(16–17), 2563–2586. https://doi.org/10.1016/j.dam.2013.05.022","ama":"Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? Discrete Applied Mathematics. 2013;161(16-17):2563-2586. doi:10.1016/j.dam.2013.05.022","chicago":"Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics 161, no. 16–17 (2013): 2563–86. https://doi.org/10.1016/j.dam.2013.05.022.","bibtex":"@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={10.1016/j.dam.2013.05.022}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }","mla":"Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:10.1016/j.dam.2013.05.022."},"user_id":"42447","ddc":["040"],"abstract":[{"text":"In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist.","lang":"eng"}],"date_created":"2017-10-17T12:42:34Z","has_accepted_license":"1","status":"public","volume":161,"file":[{"access_level":"closed","file_name":"523-MMP13.pdf","date_created":"2018-03-15T10:37:35Z","content_type":"application/pdf","date_updated":"2018-03-15T10:37:35Z","success":1,"relation":"main_file","file_size":1127543,"file_id":"1297","creator":"florida"}],"publication":"Discrete Applied Mathematics","file_date_updated":"2018-03-15T10:37:35Z","publisher":"Elsevier","author":[{"first_name":"Marios","full_name":"Mavronicolas, Marios","last_name":"Mavronicolas"},{"first_name":"Burkhard","full_name":"Monien, Burkhard","last_name":"Monien"},{"last_name":"Papadopoulou Lesta","first_name":"Vicky","full_name":"Papadopoulou Lesta, Vicky"}],"doi":"10.1016/j.dam.2013.05.022","date_updated":"2022-01-06T07:01:47Z","language":[{"iso":"eng"}],"title":"How many attackers can selfish defenders catch?","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"file":[{"date_updated":"2018-03-15T10:37:07Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":534906,"file_id":"1296","creator":"florida","access_level":"closed","file_name":"524-paper_01.pdf","date_created":"2018-03-15T10:37:07Z"}],"file_date_updated":"2018-03-15T10:37:07Z","publisher":"arXiv","author":[{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Swirkot","full_name":"Swirkot, Kamil","first_name":"Kamil"}],"date_created":"2017-10-17T12:42:34Z","has_accepted_license":"1","status":"public","abstract":[{"text":"We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.","lang":"eng"}],"user_id":"15415","ddc":["040"],"citation":{"ieee":"F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013.","short":"F. Meyer auf der Heide, K. Swirkot, (2013).","mla":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013.","bibtex":"@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }","chicago":"Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013.","apa":"Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv.","ama":"Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013."},"year":"2013","type":"preprint","_id":"524","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"external_id":{"arxiv":["1311.7229"]},"title":"Hierarchies in Local Distributed Decision","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:48Z"},{"date_updated":"2022-01-06T07:01:48Z","_id":"525","citation":{"chicago":"Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013.","ama":"Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn; 2013.","apa":"Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn.","mla":"Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013.","bibtex":"@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }","short":"T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013.","ieee":"T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn, 2013."},"type":"bachelorsthesis","year":"2013","user_id":"15504","title":"Haptics - Hadoop performance testing in concurrent job scenarios","author":[{"full_name":"Niklas Vinkemeier, Tim","first_name":"Tim","last_name":"Niklas Vinkemeier"}],"publisher":"Universität Paderborn","department":[{"_id":"75"}],"status":"public","date_created":"2017-10-17T12:42:34Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}]},{"_id":"526","date_updated":"2022-01-06T07:01:48Z","year":"2013","citation":{"ieee":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013.","short":"A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität Paderborn, 2013.","bibtex":"@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013} }","mla":"Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013.","chicago":"Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013.","ama":"Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn; 2013.","apa":"Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges. Universität Paderborn."},"type":"mastersthesis","title":"Greedy Network Creation With Heavy And Light Edges","user_id":"15504","author":[{"id":"13536","last_name":"Mäcker","full_name":"Mäcker, Alexander","first_name":"Alexander"}],"publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:35Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"76"}],"title":"Fuzzy Service Matching in On-The-Fly Computing","language":[{"iso":"eng"}],"doi":"10.1145/2491411.2492405","date_updated":"2022-01-06T07:01:48Z","date_created":"2017-10-17T12:42:35Z","has_accepted_license":"1","status":"public","file":[{"file_id":"1295","creator":"florida","file_size":730490,"relation":"main_file","success":1,"date_updated":"2018-03-15T10:36:38Z","content_type":"application/pdf","date_created":"2018-03-15T10:36:38Z","file_name":"527-p715-platenius.pdf","access_level":"closed"}],"publication":"Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)","file_date_updated":"2018-03-15T10:36:38Z","author":[{"first_name":"Marie","full_name":"Christin Platenius, Marie","last_name":"Christin Platenius"}],"user_id":"477","ddc":["040"],"abstract":[{"text":"In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. ","lang":"eng"}],"page":" 715-718 ","year":"2013","type":"conference","citation":{"short":"M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718.","ieee":"M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718.","chicago":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” In Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 715–18, 2013. https://doi.org/10.1145/2491411.2492405.","apa":"Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing. In Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE) (pp. 715–718). https://doi.org/10.1145/2491411.2492405","ama":"Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE). ; 2013:715-718. doi:10.1145/2491411.2492405","mla":"Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–18, doi:10.1145/2491411.2492405.","bibtex":"@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in On-The-Fly Computing}, DOI={10.1145/2491411.2492405}, booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}, author={Christin Platenius, Marie}, year={2013}, pages={715–718} }"},"_id":"527"},{"abstract":[{"text":"Mechatronic systems reconfigure the structure of their software architecture, e.g., to avoid hazardous situations or to optimize operational conditions like minimizing their energy consumption. As software architectures are typically build on components, reconfiguration actions need to respect the component structure. This structure should be hierarchical to enable encapsulated components. While many reconfiguration approaches for embedded real-time systems allow the use of hierarchically embedded components, i.e., horizontal composition, none of them offers a modeling and verification solution to take hierarchical composition, i.e., encapsulation, into account. In this paper, we present an extension to our existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations. The two main extensions are (a) an adapted variant of the two-phase commit protocol to initiate reconfigurations which maintain component encapsulation and (b) a timed model checking verification approach for instances of our model. We illustrate our approach on a case study in the area of smart railway systems by showing two different use cases of our approach and the verification of their safety properties.","lang":"eng"}],"ddc":["040"],"title":"Executing Reconfigurations in Hierarchical Component Architectures","user_id":"15504","file_date_updated":"2018-03-15T10:35:39Z","publication":"Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)","author":[{"full_name":"Heinzemann, Christian","first_name":"Christian","last_name":"Heinzemann"},{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"}],"file":[{"date_updated":"2018-03-15T10:35:39Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":541849,"creator":"florida","file_id":"1293","access_level":"closed","date_created":"2018-03-15T10:35:39Z","file_name":"529-p3-heinzemann.pdf"}],"date_created":"2017-10-17T12:42:35Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","has_accepted_license":"1","_id":"529","date_updated":"2022-01-06T07:01:49Z","doi":"10.1145/2465449.2465452","page":"3-12","type":"conference","year":"2013","citation":{"ieee":"C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component Architectures,” in Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.","short":"C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.","mla":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12, doi:10.1145/2465449.2465452.","bibtex":"@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations in Hierarchical Component Architectures}, DOI={10.1145/2465449.2465452}, booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen}, year={2013}, pages={3–12} }","chicago":"Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 3–12, 2013. https://doi.org/10.1145/2465449.2465452.","apa":"Heinzemann, C., & Becker, S. (2013). Executing Reconfigurations in Hierarchical Component Architectures. In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE) (pp. 3–12). https://doi.org/10.1145/2465449.2465452","ama":"Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component Architectures. In: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE). ; 2013:3-12. doi:10.1145/2465449.2465452"}},{"date_updated":"2022-01-06T07:01:49Z","_id":"530","year":"2013","type":"bachelorsthesis","citation":{"bibtex":"@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013} }","mla":"Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013.","chicago":"Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013.","ama":"Buse D. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn; 2013.","apa":"Buse, D. (2013). Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn.","ieee":"D. Buse, Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn, 2013.","short":"D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität Paderborn, 2013."},"user_id":"15504","title":"Entwurf kooperativer Verhaltensweisen heterogener Roboter","publisher":"Universität Paderborn","author":[{"full_name":"Buse, Dominik","first_name":"Dominik","last_name":"Buse"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:42:35Z","status":"public"},{"date_created":"2017-10-17T12:42:35Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","author":[{"first_name":"Sascha","full_name":"Lutters, Sascha","last_name":"Lutters"}],"publisher":"Universität Paderborn","user_id":"477","title":"Entwurf eines datenschutzgerechten Reputationssystems","language":[{"iso":"ger"}],"citation":{"bibtex":"@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }","mla":"Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013.","ama":"Lutters S. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn; 2013.","apa":"Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn.","chicago":"Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013.","ieee":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013.","short":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013."},"year":"2013","type":"mastersthesis","_id":"531","date_updated":"2022-01-06T07:01:49Z"},{"type":"bachelorsthesis","year":"2013","citation":{"chicago":"Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.","apa":"Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn.","ama":"Hilleckes H. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn; 2013.","mla":"Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.","bibtex":"@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }","short":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.","ieee":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"_id":"532","date_updated":"2022-01-06T07:01:49Z","publisher":"Universität Paderborn","author":[{"last_name":"Hilleckes","full_name":"Hilleckes, Hendrik","first_name":"Hendrik"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:36Z","title":"Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme","user_id":"477"},{"_id":"533","date_updated":"2022-01-06T07:01:49Z","citation":{"ieee":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013.","short":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung, Universität Paderborn, 2013.","mla":"Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013.","bibtex":"@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard}, year={2013} }","ama":"Borkowski R. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn; 2013.","apa":"Borkowski, R. (2013). Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn.","chicago":"Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013."},"year":"2013","type":"bachelorsthesis","language":[{"iso":"ger"}],"title":"Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung","user_id":"477","publisher":"Universität Paderborn","author":[{"full_name":"Borkowski, Richard","first_name":"Richard","last_name":"Borkowski"}],"date_created":"2017-10-17T12:42:36Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public"},{"year":"2013","type":"mastersthesis","citation":{"short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","ieee":"S. Satya, Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn, 2013.","chicago":"Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013.","apa":"Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn.","ama":"Satya S. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn; 2013.","mla":"Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }"},"date_updated":"2022-01-06T07:01:50Z","_id":"534","publisher":"Universität Paderborn","author":[{"last_name":"Satya","first_name":"Suhas","full_name":"Satya, Suhas"}],"department":[{"_id":"75"}],"status":"public","date_created":"2017-10-17T12:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"15504","title":"Emulating Wavelength Division Multiplexing using Openflow"},{"_id":"535","date_updated":"2022-01-06T07:01:50Z","type":"mastersthesis","citation":{"ieee":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013.","short":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität Paderborn, 2013.","mla":"Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013.","bibtex":"@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }","ama":"Reineke M. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn; 2013.","apa":"Reineke, M. (2013). Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn.","chicago":"Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013."},"year":"2013","language":[{"iso":"ger"}],"title":"Effizienzsteigerung durch gewichtete Produktbewertungen","user_id":"477","date_created":"2017-10-17T12:42:36Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","author":[{"first_name":"Max","full_name":"Reineke, Max","last_name":"Reineke"}],"publisher":"Universität Paderborn"},{"status":"public","date_created":"2017-10-17T12:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"author":[{"last_name":"Stroh-Maraun","id":"13264","first_name":"Nadja","full_name":"Stroh-Maraun, Nadja"}],"publisher":"Universität Paderborn","department":[{"_id":"205"}],"title":"Dynamic One-to-One Matching: Theory and a Job Market Application","user_id":"13264","citation":{"short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.","ieee":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.","chicago":"Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.","ama":"Stroh-Maraun N. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn; 2013.","apa":"Stroh-Maraun, N. (2013). Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn.","bibtex":"@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }","mla":"Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013."},"type":"mastersthesis","year":"2013","_id":"536","date_updated":"2022-01-06T07:01:50Z"}]