{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:42:54Z","timestamp":1761129774307},"reference-count":0,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2020f198","type":"proceedings-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T07:36:11Z","timestamp":1601969771000},"page":"453-460","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of asymptotic time complexity of an assumption-free alternative to the log-rank test"],"prefix":"10.15439","volume":"21","author":[{"given":"Lubom\u00edr","family":"\u0160t\u011bp\u00e1nek","sequence":"first","affiliation":[]},{"given":"Filip","family":"Habarta","sequence":"additional","affiliation":[]},{"given":"Ivana","family":"Mal\u00e1","sequence":"additional","affiliation":[]},{"given":"Lubo\u0161","family":"Marek","sequence":"additional","affiliation":[]}],"member":"6175","published-online":{"date-parts":[[2020,9,26]]},"event":{"name":"2020 Federated Conference on Computer Science and Information Systems","start":{"date-parts":[[2020,9,6]]},"end":{"date-parts":[[2020,9,9]]},"acronym":"FedCSIS 2020"},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 2020 Federated Conference on Computer Science and Information Systems"],"original-title":[],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T16:10:09Z","timestamp":1725034209000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_21\/drp\/198.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,26]]},"references-count":0,"URL":"https:\/\/doi.org\/10.15439\/2020f198","relation":{},"ISSN":["2300-5963"],"issn-type":[{"type":"print","value":"2300-5963"}],"subject":[],"published":{"date-parts":[[2020,9,26]]}}}