Data streams: Algorithms and applications S Muthukrishnan Foundations and Trends® in Theoretical Computer Science 1 (2), 117-236, 2005 | 2053 | 2005 |
An improved data stream summary: the count-min sketch and its applications G Cormode, S Muthukrishnan Journal of Algorithms 55 (1), 58-75, 2005 | 1921 | 2005 |
Influence sets based on reverse nearest neighbor queries F Korn, S Muthukrishnan ACM Sigmod Record 29 (2), 201-212, 2000 | 756 | 2000 |
What's hot and what's not: tracking most frequent items dynamically G Cormode, S Muthukrishnan ACM Transactions on Database Systems (TODS) 30 (1), 249-278, 2005 | 684 | 2005 |
Optimal histograms with quality guarantees HV Jagadish, N Koudas, S Muthukrishnan, V Poosala, KC Sevcik, T Suel VLDB 98, 24-27, 1998 | 596 | 1998 |
Surfing wavelets on streams: One-pass summaries for approximate aggregate queries AC Gilbert, Y Kotidis, S Muthukrishnan, M Strauss Vldb 1, 79-88, 2001 | 574 | 2001 |
Node classification in social networks S Bhagat, G Cormode, S Muthukrishnan Social network data analytics, 115-148, 2011 | 537 | 2011 |
Tradeoffs for packet classification A Feldman, S Muthukrishnan Proceedings IEEE INFOCOM 2000. Conference on computer communications …, 2000 | 476 | 2000 |
Near-optimal sparse Fourier representations via sampling AC Gilbert, S Guha, P Indyk, S Muthukrishnan, M Strauss Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 365 | 2002 |
Flow and Stretch Metrics for Scheduling Continuous Job Streams. MA Bender, S Chakrabarti, S Muthukrishnan SODA 98, 270-279, 1998 | 360 | 1998 |
Scheduling on-demand broadcasts: New metrics and algorithms S Acharya, S Muthukrishnan Proceedings of the 4th annual ACM/IEEE international conference on Mobile …, 1998 | 350 | 1998 |
Sampling algorithms for l2 regression and applications P Drineas, MW Mahoney, S Muthukrishnan Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 346 | 2006 |
The string edit distance matching problem with moves G Cormode, S Muthukrishnan ACM Transactions on Algorithms (TALG) 3 (1), 1-19, 2007 | 323 | 2007 |
An improved data stream summary: The count-min sketch and its applications G Cormode, S Muthukrishnan latin american symposium on theoretical informatics, 29-38, 2004 | 307 | 2004 |
What's new: Finding significant differences in network data streams G Cormode, S Muthukrishnan IEEE/ACM Transactions on Networking 13 (6), 1219-1232, 2005 | 306 | 2005 |
Identifying representative trends in massive time series data sets using sketches P Indyk, N Koudas, S Muthukrishnan 26th International Conference on Very Large Data Bases, VLDB 2000, 363-372, 2000 | 294 | 2000 |
Improved time bounds for near-optimal sparse Fourier representations AC Gilbert, S Muthukrishnan, M Strauss Wavelets XI 5914, 398-412, 2005 | 290 | 2005 |
Efficient algorithms for document retrieval problems. S Muthukrishnan SODA 2, 657-666, 2002 | 277 | 2002 |
On the sorting-complexity of suffix tree construction M Farach-Colton, P Ferragina, S Muthukrishnan Journal of the ACM (JACM) 47 (6), 987-1011, 2000 | 257 | 2000 |
Combinatorial algorithms for compressed sensing G Cormode, S Muthukrishnan International colloquium on structural information and communication …, 2006 | 255 | 2006 |