{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:55:34Z","timestamp":1759146934112,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a framework for online structure theory. Our approach\ngeneralises notions arising independently in several areas of computability\ntheory and complexity theory. We suggest a unifying approach using operators\nwhere we allow the input to be a countable object of an arbitrary complexity.\nWe give a new framework which (i) ties online algorithms with computable\nanalysis, (ii) shows how to use modifications of notions from computable\nanalysis, such as Weihrauch reducibility, to analyse finite but uniform\ncombinatorics, (iii) show how to finitize reverse mathematics to suggest a fine\nstructure of finite analogs of infinite combinatorial problems, and (iv) see\nhow similar ideas can be amalgamated from areas such as EX-learning, computable\nanalysis, distributed computing and the like. One of the key ideas is that\nonline algorithms can be viewed as a sub-area of computable analysis.\nConversely, we also get an enrichment of computable analysis from classical\nonline algorithms.<\/jats:p>","DOI":"10.46298\/lmcs-17(3:6)2021","type":"journal-article","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T19:45:20Z","timestamp":1627674320000},"source":"Crossref","is-referenced-by-count":6,"title":["Foundations of Online Structure Theory II: The Operator Approach"],"prefix":"10.46298","volume":"Volume 17, Issue 3","author":[{"given":"Rod","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Melnikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keng Meng","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2021,7,21]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8323\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8323\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:17:57Z","timestamp":1687292277000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-17(3:6)2021","relation":{"has-preprint":[{"id-type":"arxiv","id":"2007.07401v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2007.07401v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2007.07401v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2007.07401","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2007.07401","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2021,7,21]]},"article-number":"6641"}}