{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:10:33Z","timestamp":1737375033642,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_23","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"290-301","source":"Crossref","is-referenced-by-count":4,"title":["Text Sparsification via Local Maxima"],"prefix":"10.1007","author":[{"given":"Pilu","family":"Crescenzi","sequence":"first","affiliation":[]},{"given":"Alberto Del","family":"Lungo","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"23_CR1","unstructured":"A. Alstrup, G. S. Brodal, and T. Rauhe. Pattern matching in dynamic texts. In Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, pages 819\u2013828, San Francisco, CA, 2000."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"S. Burkhardt, A. Crauser, H.P. Lenhof, P. Ferragina, E. Rivals, and M. Vingron. Q-gram based database searching using a suffix array (QUASAR). In Proceedings of the Annual International Conference on Computational Biology (RECOMB), 1999.","DOI":"10.1145\/299432.299460"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32\u201353, July 1986.","journal-title":"Information and Control"},{"key":"23_CR4","unstructured":"G. Cormode, M. Paterson, S.C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms, 2000."},{"key":"23_CR5","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979."},{"issue":"2","key":"23_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02522825","volume":"17","author":"K. Mehlhorn","year":"1997","unstructured":"K. Mehlhorn, R. Sundar, and C. Uhrig. Maintaining dynamic sequences under equality tests in polylogarithmic time. Algorithmica, 17(2):183\u2013198, February 1997.","journal-title":"Algorithmica"},{"key":"23_CR7","unstructured":"M. Nelson and J.-L. Gailly. The Data Compression Book. M&T Books, 1996."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"S.C. Sahinalp and U. Vishkin. Symmetry breaking for suffix tree construction (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 300\u2013309, Montr\u2019eal, Qu\u00e9bec, Canada, 23\u201325 May 1994.","DOI":"10.1145\/195058.195164"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"S.C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 320\u2013328. IEEE, 14\u201316 October 1996.","DOI":"10.1109\/SFCS.1996.548491"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/103085.103089","volume":"34","author":"G.K. Wallace","year":"1991","unstructured":"G.K. Wallace. The JPEG still picture compression standard. Communications of the ACM, 34(1):30\u201344, April 1991.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:30:00Z","timestamp":1737372600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}