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