{"has_accepted_license":"1","type":"conference","urn":"21146","date_created":"2018-04-03T05:25:16Z","date_updated":"2022-01-06T06:54:47Z","file":[{"relation":"main_file","content_type":"application/pdf","date_updated":"2018-04-13T08:45:41Z","date_created":"2018-04-13T08:45:41Z","file_id":"2325","file_name":"KS-ISPAN-05-TransData.pdf","access_level":"open_access","creator":"florida","file_size":110389}],"department":[{"_id":"79"}],"oa":"1","author":[{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"status":"public","user_id":"15504","publication":"ISPAN","file_date_updated":"2018-04-13T08:45:41Z","ddc":["040"],"page":"182--187","year":"2005","citation":{"mla":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.","ieee":"M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.","bibtex":"@inproceedings{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182--187} }","ama":"Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.","short":"M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.","chicago":"Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN, 182--187, 2005.","apa":"Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187)."},"title":"Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment","_id":"2114"}