{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592660"},{"type":"electronic","value":"9783030592677"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59267-7_2","type":"book-chapter","created":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T19:02:33Z","timestamp":1602442953000},"page":"13-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partial Sums on the Ultra-Wide Word\u00a0RAM"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1120-5154","authenticated-orcid":false,"given":"Philip","family":"Bille","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8322-4952","authenticated-orcid":false,"given":"Inge Li","family":"G\u00f8rtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik Rye","family":"Skjoldjensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s004530010077","volume":"30","author":"AM Ben-Amram","year":"2001","unstructured":"Ben-Amram, A.M., Galil, Z.: A generalization of a lower bound technique due to Fredman and Saks. Algorithmica 30(1), 34\u201366 (2001)","journal-title":"Algorithmica"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s00453-001-0079-6","volume":"32","author":"AM Ben-Amram","year":"2002","unstructured":"Ben-Amram, A.M., Galil, Z.: Lower bounds for dynamic data structures on algebraic RAMs. Algorithmica 32(3), 364\u2013395 (2002)","journal-title":"Algorithmica"},{"issue":"11","key":"2_CR3","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1007\/s00453-017-0380-7","volume":"80","author":"P Bille","year":"2018","unstructured":"Bille, P., et al.: Dynamic relative compression, dynamic partial sums, and substring concatenation. Algorithmica 80(11), 3207\u20133224 (2018). Announced at ISAAC 2016","journal-title":"Algorithmica"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-67428-5_8","volume-title":"String Processing and Information Retrieval","author":"P Bille","year":"2017","unstructured":"Bille, P., Christiansen, A.R., Prezza, N., Skjoldjensen, F.R.: Succinct partial sums and Fenwick trees. In: Fici, G., Sciortino, M., Venturini, R. (eds.) SPIRE 2017. LNCS, vol. 10508, pp. 91\u201396. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_8"},{"key":"2_CR5","unstructured":"Blelloch, G.E.: Prefix sums and their applications. In: Synthesis of Parallel Algorithms (1990)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Brodnik, A.: Searching in constant time and minimum space (Minimae res magni momenti sunt). Ph.D. thesis, University of Waterloo (1995)","DOI":"10.1007\/BFb0049398"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.jss.2004.09.002","volume":"78","author":"A Brodnik","year":"2005","unstructured":"Brodnik, A., Carlsson, S., Fredman, M.L., Karlsson, J., Munro, J.I.: Worst case constant time priority queue. J. Syst. Softw. 78(3), 249\u2013256 (2005)","journal-title":"J. Syst. Softw."},{"key":"2_CR8","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-0-387-34735-6_12","volume-title":"Fourth IFIP International Conference on Theoretical Computer Science- TCS 2006","author":"A Brodnik","year":"2006","unstructured":"Brodnik, A., Karlsson, J., Munro, J.I., Nilsson, A.: An O(1) solution to the prefix sum problem on a specialized memory architecture. In: Navarro, G., Bertossi, L., Kohayakawa, Y. (eds.) TCS 2006. IIFIP, vol. 209, pp. 103\u2013114. Springer, Boston, MA (2006). https:\/\/doi.org\/10.1007\/978-0-387-34735-6_12"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(81)90099-2","volume":"16","author":"WA Burkhard","year":"1981","unstructured":"Burkhard, W.A., Fredman, M.L., Kleitman, D.J.: Inherent complexity trade-offs for range query problems. Theor. Comput. Sci. 16(3), 279\u2013290 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Chen, E.Y.: Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection. In: Proceedings of the 25th SOCG, pp. 80\u201387 (2009)","DOI":"10.1145\/1542362.1542376"},{"issue":"5","key":"2_CR11","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1147\/rd.515.0559","volume":"51","author":"T Chen","year":"2007","unstructured":"Chen, T., Raghavan, R., Dale, J.N., Iwata, E.: Cell broadband engine architecture and its first implementation\u2014a performance view. IBM J. Res. Dev. 51(5), 559\u2013572 (2007)","journal-title":"IBM J. Res. Dev."},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-51542-9_5","volume-title":"Algorithms and Data Structures","author":"PF Dietz","year":"1989","unstructured":"Dietz, P.F.: Optimal algorithms for list indexing and subset rank. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1989. LNCS, vol. 382, pp. 39\u201346. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51542-9_5"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-319-17142-5_29","volume-title":"Theory and Applications of Models of Computation","author":"A Farzan","year":"2015","unstructured":"Farzan, A., L\u00f3pez-Ortiz, A., Nicholson, P.K., Salinger, A.: Algorithms in the ultra-wide word model. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 335\u2013346. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_29"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1002\/spe.4380240306","volume":"24","author":"PM Fenwick","year":"1994","unstructured":"Fenwick, P.M.: A new data structure for cumulative frequency tables. Softw. Pract. Exp. 24(3), 327\u2013336 (1994)","journal-title":"Softw. Pract. Exp."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-75520-3_19","volume-title":"Algorithms \u2013 ESA 2007","author":"G Franceschini","year":"2007","unstructured":"Franceschini, G., Muthukrishnan, S., P\u01cetra\u015fcu, M.: Radix sorting with no extra space. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 194\u2013205. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_19"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/256303.256309","volume":"44","author":"GS Frandsen","year":"1997","unstructured":"Frandsen, G.S., Miltersen, P.B., Skyum, S.: Dynamic word problems. J. ACM 44(2), 257\u2013271 (1997)","journal-title":"J. ACM"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. In: Proceedings of the 21st STOC, pp. 345\u2013354 (1989)","DOI":"10.1145\/73007.73040"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1145\/322276.322281","volume":"28","author":"ML Fredman","year":"1981","unstructured":"Fredman, M.L.: A lower bound on the complexity of orthogonal range queries. J. ACM 28(4), 696\u2013705 (1981)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/322290.322305","volume":"29","author":"ML Fredman","year":"1982","unstructured":"Fredman, M.L.: The complexity of maintaining an array and computing its partial sums. J. ACM 29(1), 250\u2013260 (1982)","journal-title":"J. ACM"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366\u2013398. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028575"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539795291598","volume":"28","author":"H Hampapuram","year":"1998","unstructured":"Hampapuram, H., Fredman, M.L.: Optimal biweighted binary trees and the complexity of maintaining partial sums. SIAM J. Comput. 28(1), 1\u20139 (1998)","journal-title":"SIAM J. Comput."},{"issue":"39","key":"2_CR22","doi-asserted-by":"publisher","first-page":"5176","DOI":"10.1016\/j.tcs.2011.05.023","volume":"412","author":"WK Hon","year":"2011","unstructured":"Hon, W.K., Sadakane, K., Sung, W.K.: Succinct data structures for searchable partial sums with optimal worst-case performance. Theor. Comput. Sci. 412(39), 5176\u20135186 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/S0097539701391592","volume":"32","author":"T Husfeldt","year":"2003","unstructured":"Husfeldt, T., Rauhe, T.: New lower bound techniques for dynamic partial sums and related problems. SIAM J. Comput. 32(3), 736\u2013753 (2003)","journal-title":"SIAM J. Comput."},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-61422-2_132","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"T Husfeldt","year":"1996","unstructured":"Husfeldt, T., Rauhe, T., Skyum, S.: Lower bounds for dynamic transitive closure, planar point location, and parentheses matching. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 198\u2013211. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_132"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pagh, R.: I\/O-efficient data structures for colored range and prefix reporting. In: Proceedings of the 23rd SODA, pp. 583\u2013592 (2012)","DOI":"10.1137\/1.9781611973099.49"},{"key":"2_CR27","unstructured":"Leben, R., Miletic, M., \u0160pegel, M., Trost, A., Brodnik, A., Karlsson, J.: Design of high performance memory module on PC100. In: Proceedings of the ECSC, pp. 75\u201378 (1999)"},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/MM.2008.31","volume":"28","author":"E Lindholm","year":"2008","unstructured":"Lindholm, E., Nickolls, J., Oberman, S., Montrym, J.: NVIDIA Tesla: a unified graphics and computing architecture. IEEE Micro 28(2), 39\u201355 (2008)","journal-title":"IEEE Micro"},{"key":"2_CR29","unstructured":"Miltersen, P.B.: Cell probe complexity-a survey. In: Proceedings of the 19th FSTTCS, p. 2 (1999)"},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"JI Munro","year":"1980","unstructured":"Munro, J.I., Suwanda, H.: Implicit data structures for fast search and update. J. Comput. Syst. Sci. 21(2), 236\u2013250 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1137\/S0097539705447256","volume":"35","author":"M P\u01cetra\u015fcu","year":"2006","unstructured":"P\u01cetra\u015fcu, M., Demaine, E.D.: Logarithmic lower bounds in the cell-probe model. SIAM J. Comput. 35(4), 932\u2013963 (2006). Announced at SODA 2004","journal-title":"SIAM J. Comput."},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-44634-6_39","volume-title":"Algorithms and Data Structures","author":"R Raman","year":"2001","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 426\u2013437. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44634-6_39"},{"key":"2_CR33","volume-title":"AVX-512 Instructions","author":"J Reinders","year":"2013","unstructured":"Reinders, J.: AVX-512 Instructions. Intel Corporation, Santa Clara (2013)"},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/18.144725","volume":"38","author":"BY Ryabko","year":"1992","unstructured":"Ryabko, B.Y.: A fast on-line adaptive code. IEEE Trans. Inf. Theory 38(4), 1400\u20131404 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J Salowe","year":"1987","unstructured":"Salowe, J., Steiger, W.: Simplified stable merging tasks. J. Algorithms 8(4), 557\u2013571 (1987)","journal-title":"J. Algorithms"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/MM.2017.35","volume":"37","author":"N Stephens","year":"2017","unstructured":"Stephens, N., et al.: The ARM scalable vector extension. IEEE Micro 37(2), 26\u201339 (2017)","journal-title":"IEEE Micro"},{"key":"2_CR37","doi-asserted-by":"publisher","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, 347\u2013348 (1964)","journal-title":"Commun. ACM"},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"AC Yao","year":"1985","unstructured":"Yao, A.C.: On the complexity of maintaining partial sums. SIAM J. Comput. 14(2), 277\u2013288 (1985)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59267-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:05:54Z","timestamp":1723752354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59267-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592660","9783030592677"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59267-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tamc2020.csu.edu.cn\/","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":"83","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":"37","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":"0","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":"45% - 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":"7","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}