{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:55Z","timestamp":1770921415336,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_17","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:24Z","timestamp":1770918804000},"page":"231-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sublinear Work Parallel Quantum Algorithms for\u00a0Computational Geometry"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2480-9253","authenticated-orcid":false,"given":"Shion","family":"Fukuzawa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael","family":"Goodrich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0642-9436","authenticated-orcid":false,"given":"Sandy","family":"Irani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Berkman, O., Schieber, B., Vishkin, U.: A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geometry Appl. 06(02), 231\u2013241 (1996). https:\/\/doi.org\/10.1142\/S0218195996000162","DOI":"10.1142\/S0218195996000162"},{"key":"17_CR2","unstructured":"Burchard, P.: Lower bounds for parallel quantum counting (2019). https:\/\/arxiv.org\/abs\/1910.04555"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., Cacciapuoti, A.S.: Distributed quantum computing: a survey. Comput. Netw. 254, 110672 (2024). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1389128624005048, https:\/\/doi.org\/10.1016\/j.comnet.2024.110672","DOI":"10.1016\/j.comnet.2024.110672"},{"key":"17_CR4","unstructured":"Carolan, J., Gilani, A.S., Vempati, M.: Quantum advantage and lower bounds in parallel query complexity (2025). https:\/\/arxiv.org\/abs\/2410.02665"},{"key":"17_CR5","unstructured":"Chan, T.M., Snoeyink, J., Yap, C.-K.: Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three. In: 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 282\u2013291 (1995)"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Cleve, R.,\u00a0Watrous, J.: Fast parallel circuits for the quantum fourier transform. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 526\u2013536 (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892140","DOI":"10.1109\/SFCS.2000.892140"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, 3rd edn. (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"key":"17_CR8","unstructured":"Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum (1999). http:\/\/arxiv.org\/abs\/quant-ph\/9607014"},{"key":"17_CR9","unstructured":"Fukuzawa, S., Goodrich, M.T., Irani, S.: Quantum combine and conquer and its applications to sublinear quantum convex hull and maxima set construction. In: 41th International Symposium on Computational Geometry (SoCG 2025) (2025)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ghouse, M.R., Goodrich, M.T.: In-place techniques for parallel convex hull algorithms. In: 3rd ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 192\u2013203 (1991)","DOI":"10.1145\/113379.113397"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Girish, U., Sinha, M., Tal, A., Wu, K.: The power of adaptivity in quantum query algorithms. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pp. 1488\u20131497, New York, NY, USA (2024). Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3618260.3649621","DOI":"10.1145\/3618260.3649621"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Constructing the convex hull of a partially sorted set of points. Comput. Geometry 2(5), 267\u2013278 (1993). https:\/\/www.sciencedirect.com\/science\/article\/pii\/092577219390023Y, https:\/\/doi.org\/10.1016\/0925-7721(93)90023-Y","DOI":"10.1016\/0925-7721(93)90023-Y"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Hayashi, T.,\u00a0Nakano, K.,\u00a0Olarlu, S.: An $$O((\\log \\log n)^2)$$ time algorithm to compute the convex hull of sorted points on reconfigurable meshes. IEEE Trans. Parallel Distrib. Syst. 9(12), 1167\u20131179 (1998). https:\/\/doi.org\/10.1109\/71.737694","DOI":"10.1109\/71.737694"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., Neerbek, J., Shi, Y.: Quantum complexities of ordered searching, sorting, and element distinctness, pp. 346\u2013357. Springer, Heidelberg (2001). http:\/\/dx.doi.org\/10.1007\/3-540-48224-5_29","DOI":"10.1007\/3-540-48224-5_29"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00453-016-0206-z","volume":"79","author":"S Jeffery","year":"2016","unstructured":"Jeffery, S., Magniez, F., de Wolf, R.: Optimal parallel quantum query algorithms. Algorithmica 79(2), 509\u2013529 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0206-z","journal-title":"Algorithmica"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Kirkpatrick, D.G., Seidel, R.: Output-size sensitive algorithms for finding maximal vectors. In: O\u2019Rourke, J. (ed.) Proceedings of the First Annual Symposium on Computational Geometry, Baltimore, Maryland, USA, 5-7 June 1985, pp. 89\u201396. ACM, 1985. https:\/\/doi.org\/10.1145\/323233.323246","DOI":"10.1145\/323233.323246"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Koiran, P., Landes, J., Portier, N., Yao, P.: Adversary lower bounds for nonadaptive quantum algorithms. J. Comput. Syst. Sci. 76(5), 347\u2013355 (2010). Workshop on Logic, Language, Information and Computation. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000009000968, https:\/\/doi.org\/10.1016\/j.jcss.2009.10.007","DOI":"10.1016\/j.jcss.2009.10.007"},{"key":"17_CR18","unstructured":"Margolus, N.: Parallel quantum computation. Complexity, Entropy Phys. Inf. Santa Fe Inst. Stud. Sci. Complexity 8, 273\u2013287 (1990)"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Moore, C., Nilsson, M.: Parallel quantum computation and quantum codes. SIAM J. Comput. 31(3), 799\u2013815 (2001). https:\/\/doi.org\/10.1137\/S0097539799355053","DOI":"10.1137\/S0097539799355053"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Nakagawa, M., Man, D., Ito, Y., Nakano, K.: A simple parallel convex hulls algorithm for sorted points and the performance evaluation on the multicore processors. In: 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 506\u2013511 (2009). https:\/\/doi.org\/10.1109\/PDCAT.2009.56","DOI":"10.1109\/PDCAT.2009.56"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Nakano, K.: Computation of the convex hull for sorted points on a reconfigurable mesh. Parallel Algorithms Appl. 8(3-4), 243\u2013250 (1996). https:\/\/doi.org\/10.1080\/10637199608915555","DOI":"10.1080\/10637199608915555"},{"key":"17_CR22","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edn. (2010)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/978-3-540-28629-5_65","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation. In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 827\u2013838. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28629-5_65"},{"key":"17_CR24","unstructured":"O\u2019Rourke, J.: Computational Geometry in C. Cambridge University Press (1998)"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer (2012). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"17_CR26","unstructured":"Regev, O.: An efficient quantum factoring algorithm. arXiv:2308.06572 (2024)"},{"issue":"2","key":"17_CR27","first-page":"129","volume":"8","author":"K Sadakane","year":"2002","unstructured":"Sadakane, K., Sugawara, N., Tokuyama, T.: Quantum computation in computational geometry. Interdiscip. Inf. Sci. 8(2), 129\u2013136 (2002)","journal-title":"Interdiscip. Inf. Sci."},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Seidel, R.: Linear programming and convex hulls made easy. In: 6th Symposium on Computational Geometry (SoCG), pp. 211\u2013215 (1990)","DOI":"10.1145\/98524.98570"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999). https:\/\/doi.org\/10.1137\/S0036144598347011","DOI":"10.1137\/S0036144598347011"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"van Dam, W.: Quantum oracle interrogation: getting all information for almost half the price. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp. 362\u2013367 (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743486","DOI":"10.1109\/SFCS.1998.743486"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Wang, C., Zhou, R.G.: A quantum search algorithm of two-dimensional convex hull. Commun. Theor. Phys. 73(11), 115102 (2021). https:\/\/doi.org\/10.1088\/1572-9494\/ac1da0","DOI":"10.1088\/1572-9494\/ac1da0"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal.: Phys. Rev. A 60, 2746\u20132751 (1999). https:\/\/doi.org\/10.1103\/PhysRevA.60.2746","DOI":"10.1103\/PhysRevA.60.2746"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:28Z","timestamp":1770918808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}