{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:01:36Z","timestamp":1760148096887,"version":"build-2065373602"},"reference-count":4,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T00:00:00Z","timestamp":1680134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This is a Special Issue of the open-access journal Algorithms consisting of surveys in theoretical computer science [...]<\/jats:p>","DOI":"10.3390\/a16040188","type":"journal-article","created":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T01:37:02Z","timestamp":1680226622000},"page":"188","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue)"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6859-8932","authenticated-orcid":false,"given":"Jesper","family":"Jansson","sequence":"first","affiliation":[{"name":"Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Farag\u00f3, A. (2021). A Meeting Point of Probability, Graphs, and Algorithms: The Lov\u00e1sz Local Lemma and Related Results\u2014A Survey. Algorithms, 14.","DOI":"10.3390\/a14120355"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Cappelle, M.R., Foulds, L.R., and Longo, H.J. (2022). Searching Monotone Arrays: A Survey. Algorithms, 15.","DOI":"10.3390\/a15010010"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Tapia-Fern\u00e1ndez, S., Garc\u00eda-Garc\u00eda, D., and Garc\u00eda-Hernandez, P. (2022). Key Concepts, Weakness and Benchmark on Hash Table Data Structures. Algorithms, 15.","DOI":"10.3390\/a15030100"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Jacob, A., Majumdar, D., and Raman, V. (2023). Expansion Lemma\u2014Variations and Applications to Polynomial-Time Preprocessing. Algorithms, 16.","DOI":"10.3390\/a16030144"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/188\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:07:12Z","timestamp":1760123232000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,30]]},"references-count":4,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["a16040188"],"URL":"https:\/\/doi.org\/10.3390\/a16040188","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,3,30]]}}}