{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:06:41Z","timestamp":1742976401733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_30","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"374-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sublinear-Time Reductions for\u00a0Big Data Computing"],"prefix":"10.1007","author":[{"given":"Xiangyu","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongjing","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"30_CR1","unstructured":"SSD ranking: the fastest solid state drives. https:\/\/www.gamingpcbuilder.com\/ssd-ranking-the-fastest-solid-state-drives\/. Accessed 4 Aug 2021"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Baswana, S., Chaudhury, S.R., Choudhary, K., Khan, S.: Dynamic DFS in undirected graphs: breaking the $$o(m)$$ barrier. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 730\u2013739. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch52"},{"key":"30_CR3","unstructured":"Bringmann, K.: Fine-grained complexity theory (tutorial). In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/inco.2001.3043","volume":"176","author":"M Cadoli","year":"2002","unstructured":"Cadoli, M., Donini, F.M., Liberatore, P., Schaerf, M.: Preprocessing of intractable problems. Inf. Comput. 176(2), 89\u2013120 (2002)","journal-title":"Inf. Comput."},{"key":"30_CR5","unstructured":"Chen, L., Duan, R., Wang, R., Zhang, H., Zhang, T.: An improved algorithm for incremental DFS tree in undirected graphs. In: Eppstein, D. (ed.) 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018. Volume 101 of LIPIcs, Malm\u00f6, Sweden, 18\u201320 June 2018, pp. 16:1\u201316:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"1\u20133","key":"30_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"SA Cook","year":"1985","unstructured":"Cook, S.A.: A taxonomy of problems with fast parallel algorithms. Inf. Control 64(1\u20133), 2\u201322 (1985)","journal-title":"Inf. Control"},{"key":"30_CR7","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24\u201327 June 1997, pp. 262\u2013273. IEEE Computer Society (1997)"},{"issue":"9","key":"30_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.14778\/2536360.2536368","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Geerts, F., Neven, F.: Making queries tractable on big data with preprocessing. Proc. VLDB Endow. 6(9), 685\u2013696 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tcs.2020.07.026","volume":"838","author":"X Gao","year":"2020","unstructured":"Gao, X., Li, J., Miao, D., Liu, X.: Recognizing the tractability in big data computing. Theor. Comput. Sci. 838, 195\u2013207 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Holdsworth, B., Woods, R.C.: Karnaugh maps and function simplification. In: Holdsworth, B., Woods, R.C. (eds.) Digital Logic Design, 4th edn, pp. 43\u201380. Newnes, Oxford (2002)","DOI":"10.1016\/B978-075064582-9\/50004-4"},{"key":"30_CR11","unstructured":"Rogers, H., Jr.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987). (Reprint from 1967)"},{"key":"30_CR12","unstructured":"Li, J.: Complexity, algorithms and quality of big data intensive computing. In: Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, Bali, Indonesia. Springer (2014)"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-31155-0_24","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"Y Nekrich","year":"2012","unstructured":"Nekrich, Y., Navarro, G.: Sorted range reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 271\u2013282. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_24"},{"key":"30_CR14","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"5","key":"30_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"JH Reif","year":"1985","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Inf. Process. Lett. 20(5), 229\u2013234 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"30_CR16","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/0215058","volume":"15","author":"JR Smith","year":"1986","unstructured":"Smith, J.R.: Parallel algorithms for depth-first searches I. Planar graphs. SIAM J. Comput. 15(3), 814\u2013830 (1986)","journal-title":"SIAM J. Comput."},{"key":"30_CR17","unstructured":"Williams, V.V.: Hardness of easy problems: basing hardness on popular conjectures such as the strong exponential time hypothesis (invited talk). In: Husfeldt, T., Kanj, I.A. (eds.) 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, Volume 43 of LIPIcs, Patras, Greece, 16\u201318 September 2015, pp. 17\u201329. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: On some fine-grained questions in algorithms and complexity. In: Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018, pp. 3447\u20133487. World Scientific (2018)","DOI":"10.1142\/9789813272880_0188"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10115-017-1092-7","volume":"56","author":"J Yang","year":"2017","unstructured":"Yang, J., Wang, H., Cao, Y.: Tractable queries on big data via preprocessing with logarithmic-size output. Knowl. Inf. Syst. 56(1), 141\u2013163 (2017). https:\/\/doi.org\/10.1007\/s10115-017-1092-7","journal-title":"Knowl. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T06:07:23Z","timestamp":1726294043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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.75","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)"}}]}}