Data streams: Algorithms and applications S Muthukrishnan Foundations and Trends® in Theoretical Computer Science 1 (2), 117-236, 2005 | 2082 | 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 | 2018 | 2005 |

Influence sets based on reverse nearest neighbor queries F Korn, S Muthukrishnan ACM Sigmod Record 29 (2), 201-212, 2000 | 764 | 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 | 693 | 2005 |

Optimal histograms with quality guarantees HV Jagadish, N Koudas, S Muthukrishnan, V Poosala, KC Sevcik, T Suel VLDB 98, 24-27, 1998 | 603 | 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 | 576 | 2001 |

Node classification in social networks S Bhagat, G Cormode, S Muthukrishnan Social network data analytics, 115-148, 2011 | 569 | 2011 |

Tradeoffs for packet classification A Feldman, S Muthukrishnan Proceedings IEEE INFOCOM 2000. Conference on computer communications …, 2000 | 486 | 2000 |

Sampling algorithms for *l*_{2} regression and applicationsP Drineas, MW Mahoney, S Muthukrishnan Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 369 | 2006 |

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 | 369 | 2002 |

Flow and Stretch Metrics for Scheduling Continuous Job Streams. MA Bender, S Chakrabarti, S Muthukrishnan SODA 98, 270-279, 1998 | 365 | 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 | 351 | 1998 |

The string edit distance matching problem with moves G Cormode, S Muthukrishnan ACM Transactions on Algorithms (TALG) 3 (1), 1-19, 2007 | 325 | 2007 |

What's new: Finding significant differences in network data streams G Cormode, S Muthukrishnan IEEE/ACM Transactions on Networking 13 (6), 1219-1232, 2005 | 316 | 2005 |

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 | 313 | 2004 |

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 | 298 | 2000 |

Improved time bounds for near-optimal sparse Fourier representations AC Gilbert, S Muthukrishnan, M Strauss Wavelets XI 5914, 398-412, 2005 | 293 | 2005 |

Efficient algorithms for document retrieval problems. S Muthukrishnan SODA 2, 657-666, 2002 | 280 | 2002 |

Reinforcement knowledge graph reasoning for explainable recommendation Y Xian, Z Fu, S Muthukrishnan, G De Melo, Y Zhang Proceedings of the 42nd international ACM SIGIR conference on research and …, 2019 | 270 | 2019 |

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 | 263 | 2000 |