{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:09:59Z","timestamp":1742980199836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030148119"},{"type":"electronic","value":"9783030148126"}],"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-14812-6_39","type":"book-chapter","created":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:44:24Z","timestamp":1554853464000},"page":"635-646","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Space Lower Bounds for Graph Stream Problems"],"prefix":"10.1007","author":[{"given":"Paritosh","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"key":"39_CR1","unstructured":"Chakrabarti, A.: Data Stream Algorithms, Lecture Notes, Fall 2011, October 2014"},{"issue":"3","key":"39_CR2","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/s00453-016-0138-7","volume":"76","author":"V Guruswami","year":"2016","unstructured":"Guruswami, V., Onak, K.: Superlinear lower bounds for multipass graph processing. Algorithmica 76(3), 654\u2013683 (2016). https:\/\/doi.org\/10.1007\/s00453-016-0138-7","journal-title":"Algorithmica"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014). https:\/\/doi.org\/10.1145\/2627692.2627694","journal-title":"SIGMOD Rec."},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211\u2013219 (1993). https:\/\/doi.org\/10.1137\/0222016","journal-title":"SIAM J. Comput."},{"issue":"3\u20134","key":"39_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1561\/0400000076","volume":"11","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden, T.: Communication complexity for algorithm designers. Found. Trends Theor. Comput. Sci. 11(3\u20134), 217\u2013404 (2016). https:\/\/doi.org\/10.1561\/0400000076","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2010.10.017","volume":"111","author":"M Zelke","year":"2011","unstructured":"Zelke, M.: Intractability of min- and max-cut in streaming graphs. Inf. Process. Lett. 111(3), 145\u2013150 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2010.10.017","journal-title":"Inf. Process. Lett."}],"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-14812-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:11:28Z","timestamp":1709824288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14812-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030148119","9783030148126"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14812-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 March 2019","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":"Kitakyushu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"13 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2019","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":"tamc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}