{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:51Z","timestamp":1750306791983,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,14]],"date-time":"2013-11-14T00:00:00Z","timestamp":1384387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,14]]},"DOI":"10.1145\/2526968.2526996","type":"proceedings-article","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T19:22:39Z","timestamp":1384543359000},"page":"201-202","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Why is big-O analysis hard?"],"prefix":"10.1145","author":[{"given":"Miranda","family":"Parker","sequence":"first","affiliation":[{"name":"Harvey Mudd College, Claremont, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colleen","family":"Lewis","sequence":"additional","affiliation":[{"name":"Harvey Mudd College, Claremont, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140124.1140161"},{"key":"e_1_3_2_1_2_1","unstructured":"Dasgupta S. Papadimitriou C. H. and Vazirani U. V. 2006. Algorithms. McGraw-Hill.   Dasgupta S. Papadimitriou C. H. and Vazirani U. V. 2006. Algorithms . McGraw-Hill."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151588.1151593"}],"event":{"name":"Koli Calling '13: 13th Koli Calling International Conference on Computing Education Research","sponsor":["Univ. Eastern Finland University of Eastern Finland","The University of Newcastle, Australia","Turku University Foundation","SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Koli Finland","acronym":"Koli Calling '13"},"container-title":["Proceedings of the 13th Koli Calling International Conference on Computing Education Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2526968.2526996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2526968.2526996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:27Z","timestamp":1750232067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2526968.2526996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,14]]},"references-count":3,"alternative-id":["10.1145\/2526968.2526996","10.1145\/2526968"],"URL":"https:\/\/doi.org\/10.1145\/2526968.2526996","relation":{},"subject":[],"published":{"date-parts":[[2013,11,14]]},"assertion":[{"value":"2013-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}