{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:33:50Z","timestamp":1774593230901,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030344993","type":"print"},{"value":"9783030345006","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34500-6_17","type":"book-chapter","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:10:58Z","timestamp":1574381458000},"page":"234-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5151-9908","authenticated-orcid":false,"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[]},{"given":"Artem","family":"Ilikaev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM (JACM) 51(4), 595\u2013605 (2004)","journal-title":"J. ACM (JACM)"},{"key":"17_CR2","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Landis, E.M.: An algorithm for organization of information. In: Doklady Akademii Nauk, vol. 146, pp. 263\u2013266. Russian Academy of Sciences (1962)"},{"key":"17_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-47534-9","volume-title":"Data Streams: Models and Algorithms","author":"CC Aggarwal","year":"2007","unstructured":"Aggarwal, C.C.: Data Streams: Models and Algorithms, vol. 31. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-0-387-47534-9"},{"key":"17_CR4","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. arXiv:1712.06349 (2017)"},{"key":"17_CR5","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, pp. 22\u201331 (2004)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539705447311","volume":"37","author":"A Ambainis","year":"2007","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210\u2013239 (2007)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2010.09.007","volume":"5","author":"L Becchetti","year":"2011","unstructured":"Becchetti, L., Chatzigiannakis, I., Giannakopoulos, Y.: Streaming techniques and data aggregation in networks of tiny artefacts. Comput. Sci. Rev. 5(1), 27\u201346 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"17_CR9","unstructured":"Black, P.E.: Dictionary of algorithms and data structures. Technical report, NIST (1998)"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1142\/S0129054115500239","volume":"26","author":"J Boyar","year":"2015","unstructured":"Boyar, J., Larsen, K.S., Maiti, A.: The frequent items problem in online streaming under various performance measures. Int. J. Found. Comput. Sci. 26(4), 413\u2013439 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4\u20135","key":"17_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"key":"17_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800191","volume-title":"Advanced data structures","author":"P Brass","year":"2008","unstructured":"Brass, P.: Advanced data structures, vol. 193. Cambridge University Press, Cambridge (2008)"},{"key":"17_CR13","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill, New York (2001)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.14778\/1454159.1454225","volume":"1","author":"G Cormode","year":"2008","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding frequent items in data streams. Proc. VLDB Endow. 1(2), 1530\u20131541 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"De La Briandais, R.: File searching using variable length keys. In: Western Joint Computer Conference, 3\u20135 March 1959, pp. 295\u2013298. ACM (1959)","DOI":"10.1145\/1457838.1457895"},{"key":"17_CR16","unstructured":"De Wolf, R.: Quantum computing and communication complexity (2001)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: A dichromatic framework for balanced trees. In: Proceedings of SFCS 1978, pp. 8\u201321. IEEE (1978)","DOI":"10.1109\/SFCS.1978.3"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-48224-5_29","volume-title":"Automata, Languages and Programming","author":"P H\u00f8yer","year":"2001","unstructured":"H\u00f8yer, P., Neerbek, J., Shi, Y.: Quantum complexities of ordered searching, sorting, and element distinctness. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 346\u2013357. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_29"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00453-002-0976-3","volume":"34","author":"P H\u00f8yer","year":"2002","unstructured":"H\u00f8yer, P., Neerbek, J., Shi, Y.: Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica 34(4), 429\u2013448 (2002)","journal-title":"Algorithmica"},{"key":"17_CR21","unstructured":"Jordan, S.: Bounded error quantum algorithms zoo. https:\/\/math.nist.gov\/quantum\/zoo"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-19955-5_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Kravchenko","year":"2019","unstructured":"Kravchenko, D., Khadiev, K., Serov, D.: On the quantum and classical complexity of solving subtraction games. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 228\u2013236. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_20"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-19311-9_13","volume-title":"Unconventional Computation and Natural Computation","author":"K Khadiev","year":"2019","unstructured":"Khadiev, K., Safina, L.: Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs. In: McQuillan, I., Seki, S. (eds.) UCNC 2019. LNCS, vol. 11493, pp. 150\u2013163. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19311-9_13"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Klauck, H.: Quantum time-space tradeoffs for sorting. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 69\u201376. ACM (2003)","DOI":"10.1145\/780542.780553"},{"key":"17_CR25","unstructured":"Knuth, D.: Searching and Sorting, The Art of Computer Programming, vol. 3 (1973)"},{"key":"17_CR26","unstructured":"Kothari, R.: An optimal quantum algorithm for the oracle identification problem. In: 31st International Symposium on Theoretical Aspects of Computer Science, p. 482 (2014)"},{"key":"17_CR27","unstructured":"Lin, C.Y.Y., Lin, H.H.: Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. In: 30th Conference on Computational Complexity (CCC 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"issue":"18","key":"17_CR28","first-page":"1","volume":"12","author":"CYY Lin","year":"2016","unstructured":"Lin, C.Y.Y., Lin, H.H.: Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. Theory Comput. 12(18), 1\u201335 (2016)","journal-title":"Theory Comput."},{"issue":"2","key":"17_CR29","doi-asserted-by":"publisher","first-page":"022307","DOI":"10.1103\/PhysRevA.64.022307","volume":"64","author":"GL Long","year":"2001","unstructured":"Long, G.L.: Grover algorithm with zero theoretical failure rate. Phys. Rev. A 64(2), 022307 (2001)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"17_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-015-0060-4","volume":"77","author":"A Montanaro","year":"2017","unstructured":"Montanaro, A.: Quantum pattern matching fast on average. Algorithmica 77(1), 16\u201339 (2017)","journal-title":"Algorithmica"},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/0400000002","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Found. Trends Theor. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"17_CR32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Odeh, A., Abdelfattah, E.: Quantum sort algorithm based on entanglement qubits $$\\{$$00, 11$$\\}$$. In: 2016 IEEE Long Island Systems, Applications and Technology Conference (LISAT), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/LISAT.2016.7494107"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Odeh, A., Elleithy, K., Almasri, M., Alajlan, A.: Sorting N elements using quantum entanglement sets. In: Third International Conference on Innovative Computing Technology (INTECH 2013), pp. 213\u2013216. IEEE (2013)","DOI":"10.1109\/INTECH.2013.6653693"},{"issue":"1","key":"17_CR35","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S1570-8667(03)00010-8","volume":"1","author":"H Ramesh","year":"2003","unstructured":"Ramesh, H., Vinay, V.: String matching in $$o (\\sqrt{n}+ \\sqrt{m})$$ quantum time. J. Discrete Algorithms 1(1), 103\u2013110 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"17_CR36","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232 - heapsort. Commun. ACM 7(6), 347\u2013349 (1964)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34500-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T00:10:15Z","timestamp":1612483815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34500-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030344993","9783030345006"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34500-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kingston, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tpnc2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}