From post

Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming.

, и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 704-715. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Constant-Factor Approximation Algorithm for the k-Median Problem., , , и . J. Comput. Syst. Sci., 65 (1): 129-149 (2002)Streaming and sublinear approximation of entropy and information distances., , и . SODA, стр. 733-742. ACM Press, (2006)Approximation algorithms for facility location problems.. Stanford University, USA, (2000)Analyzing graph structure via linear measurements., , и . SODA, стр. 459-467. SIAM, (2012)CURE: An Efficient Clustering Algorithm for Large Databases., , и . SIGMOD Conference, стр. 73-84. ACM Press, (1998)Connected facility location problems., и . Network Design: Connectivity and Facilities Location, том 40 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 179-190. DIMACS/AMS, (1997)Improved algorithms for the data placement problem., и . SODA, стр. 106-107. ACM/SIAM, (2002)Capacitated vertex covering with applications., , , и . SODA, стр. 858-865. ACM/SIAM, (2002)Greedy Strikes Back: Improved Facility Location Algorithms., и . SODA, стр. 649-657. ACM/SIAM, (1998)Approximation algorithms for wavelet transform coding of data streams, и . CoRR, (2006)