| Data streams: Algorithms and applications S Muthukrishnan Now Publishers Inc, 2005 | 1944 | 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 | 1655 | 2005 |
| Approximate string joins in a database (almost) for free L Gravano, PG Ipeirotis, HV Jagadish, N Koudas, S Muthukrishnan, ... VLDB 1, 491-500, 2001 | 773 | 2001 |
| Influence sets based on reverse nearest neighbor queries F Korn, S Muthukrishnan ACM Sigmod Record 29 (2), 201-212, 2000 | 713 | 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 | 658 | 2005 |
| Optimal histograms with quality guarantees HV Jagadish, N Koudas, S Muthukrishnan, V Poosala, KC Sevcik, T Suel VLDB 98, 24-27, 1998 | 565 | 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 | 562 | 2001 |
| Tradeoffs for packet classification A Feldman, S Muthukrishnan Proceedings IEEE INFOCOM 2000. Conference on computer communications …, 2000 | 461 | 2000 |
| Relative-error CUR matrix decompositions P Drineas, MW Mahoney, S Muthukrishnan SIAM Journal on Matrix Analysis and Applications 30 (2), 844-881, 2008 | 449 | 2008 |
| Node classification in social networks S Bhagat, G Cormode, S Muthukrishnan Social network data analytics, 115-148, 2011 | 406 | 2011 |
| Faster least squares approximation P Drineas, MW Mahoney, S Muthukrishnan, T Sarlós Numerische mathematik 117 (2), 219-249, 2011 | 385 | 2011 |
| Fast, small-space algorithms for approximate histogram maintenance AC Gilbert, S Guha, P Indyk, Y Kotidis, S Muthukrishnan, MJ Strauss Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 354 | 2002 |
| Flow and Stretch Metrics for Scheduling Continuous Job Streams. MA Bender, S Chakrabarti, S Muthukrishnan SODA 98, 270-279, 1998 | 349 | 1998 |
| 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 | 347 | 2002 |
| Scheduling on-demand broadcasts: New metrics and algorithms S Acharya, S Muthukrishnan Proceedings of the 4th annual ACM/IEEE international conference on Mobile …, 1998 | 341 | 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 | 298 | 2006 |
| The string edit distance matching problem with moves G Cormode, S Muthukrishnan ACM Transactions on Algorithms (TALG) 3 (1), 1-19, 2007 | 297 | 2007 |
| Online stochastic matching: Beating 1-1/e J Feldman, A Mehta, V Mirrokni, S Muthukrishnan 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 117-126, 2009 | 295 | 2009 |
| What's new: Finding significant differences in network data streams G Cormode, S Muthukrishnan IEEE/ACM Transactions on Networking 13 (6), 1219-1232, 2005 | 289 | 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 | 276 | 2000 |
