{"type":"mastersthesis","department":[{"_id":"79"}],"date_created":"2017-10-17T12:42:45Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012.","chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn.","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012."},"user_id":"477","publisher":"Universität Paderborn","_id":"582","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:42Z","status":"public","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","year":"2012","author":[{"id":"11319","full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","last_name":"Strothmann"}]}