{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T04:10:01Z","timestamp":1730261401836,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,22]]},"DOI":"10.1109\/idt59031.2023.10194445","type":"proceedings-article","created":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T18:03:52Z","timestamp":1690913032000},"page":"257-266","source":"Crossref","is-referenced-by-count":0,"title":["Advanced Priority Queues in the OPTICS Clustering Algorithm"],"prefix":"10.1109","author":[{"given":"Pavol","family":"Galcik","sequence":"first","affiliation":[{"name":"University of Zilina,Faculty of Management Science and Informatics,Zilina,Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Mrena","sequence":"additional","affiliation":[{"name":"University of Zilina,Faculty of Management Science and Informatics,Zilina,Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucia","family":"Piatrikova","sequence":"additional","affiliation":[{"name":"University of Zilina,Faculty of Management Science and Informatics,Zilina,Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Stankevich","sequence":"additional","affiliation":[{"name":"Scientific Centre for Aerospace Research of the Earth,NAS of Ukraine,Kiev,Ukraine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02802549"},{"volume-title":"Operating System Concepts","year":"2012","author":"Silberschatz","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304187"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1117\/1.JRS.14.038503"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118625651"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1201\/9781420037586"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-815906-4.00005-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tr.2016.2578948"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1108\/IJQRM-06-2016-0081"},{"issue":"6","key":"ref11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232: Heapsort","volume":"7","author":"Williams","year":"1964","journal-title":"Commun ACM"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359478"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/bf01840439"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0215004"},{"key":"ref17","first-page":"52","article-title":"Worst-case Efficient Priority Queues","volume-title":"Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, in SODA 96","author":"Brodal","year":"1996"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214082"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60220-8_70"},{"volume-title":"Introduction to Algorithms, Third Edition","year":"2009","author":"Cormen","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/dt.2019.8813457"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90001-0"},{"volume-title":"Linear lists and priority queues as balanced binary trees \/","year":"1980","author":"Crane","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"ref25","first-page":"226","article-title":"A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, in KDD96","author":"Ester"},{"volume-title":"Data Structures 1.81.0","year":"2023","key":"ref26"},{"volume-title":"MichalMrena\/idril: C++ data structures library","year":"2023","key":"ref27"},{"volume-title":"Household Electric Power Consumption | Kaggle","year":"2023","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973198.7"}],"event":{"name":"2023 International Conference on Information and Digital Technologies (IDT)","start":{"date-parts":[[2023,6,20]]},"location":"Zilina, Slovakia","end":{"date-parts":[[2023,6,22]]}},"container-title":["2023 International Conference on Information and Digital Technologies (IDT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10194346\/10194394\/10194445.pdf?arnumber=10194445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T22:43:22Z","timestamp":1710369802000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10194445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,22]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/idt59031.2023.10194445","relation":{},"subject":[],"published":{"date-parts":[[2023,6,22]]}}}