{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:45:14Z","timestamp":1743065114761,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_3","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"29-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming and\u00a0Query Once\u00a0Space Complexity of\u00a0Longest Increasing Subsequence"],"prefix":"10.1007","author":[{"given":"Xin","family":"Li","sequence":"first","affiliation":[]},{"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-48523-6_15","volume-title":"Automata, Languages and Programming","author":"AE Andreev","year":"1999","unstructured":"Andreev, A.E., Baskakov, J.L., Clementi, A.E.F., Rolim, J.D.P.: Small pseudo-random sets yield hard functions: new tight explicit lower bounds for branching programs. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 179\u2013189. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48523-6_15"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-27821-4_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N Ailon","year":"2004","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Estimating the distance to a monotone function. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 229\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27821-4_21"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/S0890-5401(03)00118-4","volume":"186","author":"F Ablayev","year":"2003","unstructured":"Ablayev, F., Karpinski, M.: A lower bound for integer multiplication on randomized ordered read-once branching programs. Inf. Comput. 186(1), 78\u201389 (2003)","journal-title":"Inf. Comput."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nosatzki, N.S., Sinha, S., Stein, C.: Estimating the longest increasing subsequence in nearly optimal time. In: FOCS 2022, pp. 708\u2013719 (2022)","DOI":"10.1109\/FOCS54457.2022.00073"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P.: A general sequential time-space tradeoff for finding unique elements. In: STOC, pp. 197\u2013203 (1989)","DOI":"10.1145\/73007.73026"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Comput. Complex. 3(1), 1\u201318 (1993)","DOI":"10.1007\/BF01200404"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bollig, B., Wegener, I.: A very simple function that requires exponential size read-once branching programs. Inf. Process. Lett. (1998)","DOI":"10.1016\/S0020-0190(98)00042-8"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bollig, B., Woelfel, P.: A read-once branching program lower bound of $$\\varOmega (2^{n\/4})$$ for integer multiplication using universal. In: STOC (2001)","DOI":"10.1145\/380752.380835"},{"key":"3_CR9","unstructured":"Cheng, K.: Streaming and small space approximation algorithms for edit distance and longest common subsequence. In: ICALP (2021)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0028795","volume-title":"Fundamentals of Computation Theory","author":"PE Dunne","year":"1985","unstructured":"Dunne, P.E.: Lower bounds on the complexity of 1-time only branching programs (preliminary version). In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 90\u201399. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0028795"},{"key":"3_CR11","unstructured":"Ergun, F., Jowhari, H.: On distance to monotonicity and longest increasing subsequence of a data stream. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 730\u2013736 (2008)"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(97)00041-0","volume":"62","author":"A G\u00e1l","year":"1997","unstructured":"G\u00e1l, A.: A simple function that requires exponential size read-once branching programs. Inf. Process. Lett. 62(1), 13\u201316 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"3_CR13","doi-asserted-by":"publisher","first-page":"3463","DOI":"10.1137\/090770801","volume":"39","author":"A G\u00e1l","year":"2010","unstructured":"G\u00e1l, A., Gopalan, P.: Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. SIAM J. Comput. 39(8), 3463\u20133479 (2010)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Janczewski, W.: Fully dynamic approximation of LIS in polylogarithmic time. In: STOC 2021. ACM (2021)","DOI":"10.1145\/3406325.3451137"},{"key":"3_CR15","unstructured":"Gopalan, P., Jayram, T.S., Krauthgamer, R., Kumar, R.: Estimating the sortedness of a data stream. In: SODA (2007)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Hammersley, J.: A few seedlings of research. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, pp. 345\u2013394 (1972)","DOI":"10.1525\/9780520325883-020"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.4086\/toc.2007.v003a011","volume":"3","author":"J H\u00e5stad","year":"2007","unstructured":"H\u00e5stad, J., Wigderson, A.: The randomized communication complexity of set disjointness. Theory Comput. 3(1), 211\u2013219 (2007)","journal-title":"Theory Comput."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B., Sun, X.: Efficient massively parallel methods for dynamic programming. In: STOC, pp. 798\u2013811. ACM (2017)","DOI":"10.1145\/3055399.3055460"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(88)90166-1","volume":"57","author":"S Jukna","year":"1988","unstructured":"Jukna, S.: Entropy of contact circuits and lower bounds on their complexity. Theor. Comput. Sci. 57, 113\u2013129 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"3_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(02)00643-6","volume":"297","author":"V Kabanets","year":"2003","unstructured":"Kabanets, V.: Almost k-wise independence and hard Boolean functions. Theor. Comput. Sci. 297(1\u20133), 281\u2013295 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Krause, M., Meinel, C., Waack, S.: Separating the eraser turing machine classes $$L_e$$, $$NL_e$$, $$coNL_e$$ and $$P_e$$. Theor. Comput. Sci. (1991)","DOI":"10.1016\/0304-3975(91)90021-S"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/s00224-018-09908-6","volume":"64","author":"M Kiyomi","year":"2020","unstructured":"Kiyomi, M., Ono, H., Otachi, Y., Schweitzer, P., Tarui, J.: Space-efficient algorithms for longest increasing subsequence. Theory Comput. Syst. 64(3), 522\u2013541 (2020)","journal-title":"Theory Comput. Syst."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Seddighin, S.: Improved dynamic algorithms for longest increasing subsequence. In: STOC, pp. 640\u2013653. ACM (2021)","DOI":"10.1145\/3406325.3451026"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more. arXiv:2303.06802 (2023)","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"3_CR25","unstructured":"Li, X., Zheng, Y.: Lower bounds and improved algorithms for asymmetric streaming edit distance and longest common subsequence. In: FSTTCS 2021. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"3_CR26","unstructured":"Li, X., Zhong, Y.: Explicit directional affine extractors and improved hardness for linear branching programs. arXiv:2304.11495 (2023)"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/1004036","volume":"4","author":"CL Mallows","year":"1962","unstructured":"Mallows, C.L.: Patience sorting. SIAM Rev. 4(2), 148\u2013149 (1962)","journal-title":"SIAM Rev."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Seddighin, S.: Dynamic algorithms for LIS and distance to monotonicity. In: STOC, pp. 671\u2013684. ACM (2020)","DOI":"10.1145\/3357713.3384240"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Seddighin, S.: Improved sublinear time algorithm for longest increasing subsequence. In: SODA (2021)","DOI":"10.1137\/1.9781611976465.115"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Naumovitz, T., Saks, M.: A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity. In: SODA, pp. 1252\u20131262. SIAM (2014)","DOI":"10.1137\/1.9781611973730.83"},{"key":"3_CR31","unstructured":"Newman, I., Varma, N.: New sublinear algorithms and lower bounds for LIS estimation. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (2021)"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On simultaneous resource bounds. In: SFCS 1979 (1979)","DOI":"10.1109\/SFCS.1979.29"},{"issue":"3","key":"3_CR33","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1137\/S0097539795290349","volume":"28","author":"S Ponzio","year":"1998","unstructured":"Ponzio, S.: A lower bound for integer multiplication with read-once branching programs. SIAM J. Comput. 28(3), 798\u2013815 (1998)","journal-title":"SIAM J. Comput."},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Communication complexity (for algorithm designers). CoRR, abs\/1509.06257 (2015)","DOI":"10.1561\/9781680831153"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Rubinstein, A., Seddighin, S., Song, Z., Sun, X.: Approximation algorithms for LCS and LIS with truly improved running times. In: FOCS 2019, Baltimore, Maryland, USA, pp. 1121\u20131145. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00071"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Saha, B.: Fast space-efficient approximations of language edit distance and RNA folding: an amnesic dynamic programming approach. In: FOCS (2017)","DOI":"10.1109\/FOCS.2017.35"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. (1970)","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Simon, J., Szegedy, M.: A new lower bound theorem for read-only-once branching programs and its applications. In: Advances in Computational Complexity Theory (1992)","DOI":"10.1090\/dimacs\/013\/11"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Saks, M., Seshadhri, C.: Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. In: SODA (2013)","DOI":"10.1137\/1.9781611973105.122"},{"issue":"2","key":"3_CR40","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1137\/130942152","volume":"46","author":"M Saks","year":"2017","unstructured":"Saks, M., Seshadhri, C.: Estimating the longest increasing sequence in polylogarithmic time. SIAM J. Comput. 46(2), 774\u2013823 (2017)","journal-title":"SIAM J. Comput."},{"key":"3_CR41","unstructured":"Sun, X., Woodruff, D.P.: The communication and streaming complexity of computing the longest common and increasing subsequences. In: SODA, pp. 336\u2013345 (2007)"},{"issue":"2","key":"3_CR42","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/42282.46161","volume":"35","author":"I Wegener","year":"1988","unstructured":"Wegener, I.: On the complexity of branching programs and decision trees for clique functions. J. ACM 35(2), 461\u2013471 (1988)","journal-title":"J. ACM"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/BFb0030340","volume-title":"Mathematical Foundations of Computer Science 1984","author":"S \u017d\u00e1k","year":"1984","unstructured":"\u017d\u00e1k, S.: An exponential lower bound for one-time-only branching programs. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 562\u2013566. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0030340"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T17:35:54Z","timestamp":1703698554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","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":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}