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