{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:17:45Z","timestamp":1762017465218},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540205456"},{"type":"electronic","value":"9783540400318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40031-8_19","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:50Z","timestamp":1283727830000},"page":"280-291","source":"Crossref","is-referenced-by-count":18,"title":["ORTS: A Hack-Free RTS Game Environment"],"prefix":"10.1007","author":[{"given":"Michael","family":"Buro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Buro, M.: ORTS project (2002), http:\/\/www.cs.ualberta.ca\/~mburo"},{"key":"19_CR2","unstructured":"Bettner, P., Terrano, M.: 1500 archers on a 28.8: Network programming in Age of Empires and beyond. Gamasutra (2001), http:\/\/www.gamasutra.com\/features\/20010322\/terrano_01.htm"},{"key":"19_CR3","unstructured":"Pritchard, M.: How to hurt the hackers: The scoop on Internet cheating and how you can combat it. Gamasutra (2000), http:\/\/www.gamasutra.com\/features\/20000724\/pritchard_01.htm"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, J., Lin, M., Manocha, D., Ponamgi, K.: I-Collide: An interactive and exact collision detection system for large-scaled environments. In: ACM International 3D Graphics Conference, pp. 189\u2013196 (1995)","DOI":"10.1145\/199404.199437"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. McCreight","year":"1985","unstructured":"McCreight, E.: Priority search trees. SIAM Journal on Computing\u00a014, 257\u2013276 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023, 337\u2013342 (1977), Implemented for instance in zlib http:\/\/www.gzip.org\/zlib","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40031-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T21:15:27Z","timestamp":1559596527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40031-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205456","9783540400318"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40031-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}