{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:36Z","timestamp":1750220856141,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T00:00:00Z","timestamp":1574294400000},"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":[[2019,11,21]]},"DOI":"10.1145\/3364510.3364530","type":"proceedings-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T13:35:33Z","timestamp":1575898533000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["BiGO"],"prefix":"10.1145","author":[{"given":"Tapani","family":"Toivonen","sequence":"first","affiliation":[{"name":"School of Computing, University of Eastern Finland, Joensuu, Finland"}]},{"given":"Solomon","family":"Oyelere","sequence":"additional","affiliation":[{"name":"School of Computing, University of Eastern Finland, Joensuu, Finland"}]}],"member":"320","published-online":{"date-parts":[[2019,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"e_1_3_2_1_2_1","unstructured":"T. Wolfgang 1997. Languages automata and logic Handbook of formal languages. Springer Berlin Heidelberg.  T. Wolfgang 1997. Languages automata and logic Handbook of formal languages. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"D. Whitfield and M. Hellman 1976. New directions in cryptography IEEE transactions on Information Theory 22(6) 644--654.  D. Whitfield and M. Hellman 1976. New directions in cryptography IEEE transactions on Information Theory 22(6) 644--654.","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008328.1008329"},{"volume-title":"Frontiers in Education Conference., IEEE, 1. DOI: 10","year":"2001","author":"Chen T.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25984-8_27"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129771"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/774833.774846"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.25126\/jitecs.20183140"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157136.2157147"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.21512\/comtech.v8i1.3783"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2839509.2844635"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M.A Matin S.S.M Oliullah M.M.A Polash (2018). Implementation of a Customizable Algorithm Visualization Tool for E-Learning. ACM. DOI: https:\/\/doi.org\/10.1145\/3291078.3291104.  M.A Matin S.S.M Oliullah M.M.A Polash (2018). Implementation of a Customizable Algorithm Visualization Tool for E-Learning. ACM. DOI: https:\/\/doi.org\/10.1145\/3291078.3291104.","DOI":"10.1145\/3291078.3291104"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SAMI.2016.7422999"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2015.2490673"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Sundblad Yngve. \"The Ackermann function a theoretical computational and formula manipulative study.\" BIT Numerical Mathematics 11.1 (1971): 107--119.  Sundblad Yngve. \"The Ackermann function a theoretical computational and formula manipulative study.\" BIT Numerical Mathematics 11.1 (1971): 107--119.","DOI":"10.1007\/BF01935330"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Schnorr Claus-Peter and Martin Euchner. \"Lattice basis reduction: Improved practical algorithms and solving subset sum problems.\" Mathematical programming 66.1-3 (1994): 181--199.  Schnorr Claus-Peter and Martin Euchner. \"Lattice basis reduction: Improved practical algorithms and solving subset sum problems.\" Mathematical programming 66.1-3 (1994): 181--199.","DOI":"10.1007\/BF01581144"},{"volume-title":"IEEE Press","year":"2001","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Zhang Da-Qian Kang Zhang and Jiannong Cao. \"A context-sensitive graph grammar formalism for the specification of visual languages.\" The Computer Journal 44.3 (2001): 186--200.  Zhang Da-Qian Kang Zhang and Jiannong Cao. \"A context-sensitive graph grammar formalism for the specification of visual languages.\" The Computer Journal 44.3 (2001): 186--200.","DOI":"10.1093\/comjnl\/44.3.186"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Roura Salvador. \"Improved master theorems for divide-and-conquer recurrences.\" Journal of the ACM (JACM) 48.2 (2001): 170--205.  Roura Salvador. \"Improved master theorems for divide-and-conquer recurrences.\" Journal of the ACM (JACM) 48.2 (2001): 170--205.","DOI":"10.1145\/375827.375837"},{"key":"e_1_3_2_1_21_1","unstructured":"https:\/\/electronis.org. Accessed 12-08-2019  https:\/\/electronis.org. Accessed 12-08-2019"},{"volume-title":"IEEE","year":"2015","author":"Radovici Alexandra","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","unstructured":"Barbeau Sean J. etal \"System and method for spatial point-of-interest generation and automated trip segmentation using location data.\" U.S. Patent No. 8 843 315. 23 Sep. 2014.  Barbeau Sean J. et al. \"System and method for spatial point-of-interest generation and automated trip segmentation using location data.\" U.S. Patent No. 8 843 315. 23 Sep. 2014."}],"event":{"name":"Koli Calling '19: 19th Koli Calling International Conference on Computing Education Research","sponsor":["University of Helsinki","Univ. Eastern Finland University of Eastern Finland","The University of Adelaide, Australia","SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Koli Finland","acronym":"Koli Calling '19"},"container-title":["Proceedings of the 19th Koli Calling International Conference on Computing Education Research"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364510.3364530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3364510.3364530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:23Z","timestamp":1750202603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3364510.3364530"}},"subtitle":["A Toolset to Support CS Students to Learn to Analyze Time Complexities of Algorithms"],"short-title":[],"issued":{"date-parts":[[2019,11,21]]},"references-count":23,"alternative-id":["10.1145\/3364510.3364530","10.1145\/3364510"],"URL":"https:\/\/doi.org\/10.1145\/3364510.3364530","relation":{},"subject":[],"published":{"date-parts":[[2019,11,21]]},"assertion":[{"value":"2019-11-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}