{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:31Z","timestamp":1776210691197,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540240587","type":"print"},{"value":"9783540305385","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_3","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:40:30Z","timestamp":1268383230000},"page":"32-34","source":"Crossref","is-referenced-by-count":4,"title":["Streaming Algorithms for Geometric Problems"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Indyk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Agarwal, P., Har-Peled, S.: Maintaining approximate extent measures of moving points. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2001)"},{"key":"3_CR2","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measure of points. Journal of the ACM"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the Symposium on Theory of Computing, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bagchi, A., Chaudhary, A., Eppstein, D., Goodrich, M.T.: Deterministic sampling and range counting in geometric data streams. In: Proceedings of the ACM Symposium on Computational Geometry (2004)","DOI":"10.1145\/997817.997842"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proceedings of the Symposium on Theory of Computing (1997)","DOI":"10.1145\/258533.258657"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: Proceedings of the ACM Symposium on Computational Geometry (2004)","DOI":"10.1145\/997817.997843"},{"key":"3_CR7","unstructured":"Cormode, G., Muthukrishnan, S.: Radial histograms for spatial streams. DIMACS Tech Report (2003)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: Proceedings of the Symposium on Theory of Computing, pp. 30\u201339 (2003)","DOI":"10.1145\/780542.780548"},{"key":"3_CR9","unstructured":"Frahling, G., Indyk, P., Sohler, C.: Estimating the weight of euclidean minimum spanning trees in data streams (Manuscript 2004)"},{"key":"3_CR10","unstructured":"Feigenbaum, J., Kannan, S., Zhang, J.: Computing diameter in the streaming and sliding-window models. Yale University Technical Report YALEU\/DCS\/TR-1245 (2002)"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences\u00a031, 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR12","unstructured":"Guha, S., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering data streams. In: Proceedings of the Symposium on Theory of Computing (2001)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-medians and their applications. In: Proceedings of the Symposium on Theory of Computing (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. In: Proceedings of the ACM Symposium on Principles of Database Systems (2004)","DOI":"10.1145\/1055558.1055595"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Tutorial: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of the Symposium on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959878"},{"key":"3_CR16","unstructured":"Indyk, P.: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2003)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithms for dynamic geometric problems over data streams. In: Proceedings of the Symposium on Theory of Computing (2004)","DOI":"10.1145\/1007352.1007413"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 426\u2013431 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Paterson, M.S.: Selection and sorting with limited storage. TCS\u00a012 (1980)","DOI":"10.1016\/0304-3975(80)90061-4"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S., Strauss, M.: Maintenance of multidimensional histograms. In: Proceedings of the FSTTCS (2003)","DOI":"10.1007\/978-3-540-24597-1_30"},{"key":"3_CR21","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications (invited talk at soda 2003) (2003), Available at http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Suri, S., Toth, C., Zhou, Y.: Range counting over multidimensional data streams. In: Proceedings of the ACM Symposium on Computational Geometry (2004)","DOI":"10.1145\/997817.997844"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Thaper, N., Guha, S., Indyk, P., Koudas, N.: Dynamic multidimensional histograms. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD (2002)","DOI":"10.1145\/564691.564741"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:58:51Z","timestamp":1605743931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}