World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
82
Citations
23287
World Ranking
977
National Ranking
525

Overview

s muthukrishnan is affiliated with Rutgers, The State University of New Jersey in the United States. Their research contributions span several subfields within computer science, particularly focusing on areas related to artificial intelligence, computer networks and communications, analytical chemistry, industrial and manufacturing engineering, and control and systems engineering.

The scientist has published work across a range of topics including:

  • Caching and Content Delivery
  • Internet Traffic Analysis and Secure E-voting
  • Network Traffic and Congestion Control
  • Spectroscopy and Chemometric Analyses
  • Water Quality Monitoring and Analysis
  • Advanced Algorithms and Applications
  • Advanced Graph Neural Networks

Recent publications provide insight into the interdisciplinary nature of their work. These include:

  • "Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions," 2021, published in IEEE Transactions on Network and Service Management
  • "Neural-Symbolic Reasoning over Knowledge Graph for Multi-stage Explainable Recommendation," 2020, published in arXiv (Cornell University)
  • "Partial Least Squares Discriminant Analysis-Based Decision Support System for Porous Ceramic Matrix-Based Burner," 2025, published in Heat Transfer
  • "Fine-Tuning of Pattern net Artificial Neural Network for Classification Based Design of Porous Ceramic Matrix Based Burners: A Comparison of Mean Squared Error and Sum Absolute Error as Performance Function Under Different Hidden Neurons," 2025, published in Heat Transfer

The venues in which s muthukrishnan has published frequently include:

  • Heat Transfer
  • IEEE Transactions on Network and Service Management
  • arXiv (Cornell University)

Collaborations form a notable part of their research activities. Frequent co-authors include:

  • Vijay Kumar Mishra
  • Sumanta Chaudhuri
  • Ori Rottenstreich
  • Pedro Reviriego
  • Ely Porat

Best Publications

  • An improved data stream summary: the count-min sketch and its applications

    Graham Cormode;S. Muthukrishnan

  • Data streams: algorithms and applications

    Unknown

  • What's hot and what's not: tracking most frequent items dynamically

    Graham Cormode;S. Muthukrishnan

  • Influence sets based on reverse nearest neighbor queries

    Flip Korn;S. Muthukrishnan

  • Faster least squares approximation

    Petros Drineas;Michael W. Mahoney;S. Muthukrishnan;Tamás Sarlós

  • What's hot and what's not: tracking most frequent items dynamically

    Unknown

  • Near-optimal sparse fourier representations via sampling

    A. C. Gilbert;S. Guha;P. Indyk;S. Muthukrishnan

  • Fast, small-space algorithms for approximate histogram maintenance

    Anna C. Gilbert;Sudipto Guha;Piotr Indyk;Yannis Kotidis

  • Flow and stretch metrics for scheduling continuous job streams

    Michael A. Bender;Soumen Chakrabarti;S. Muthukrishnan

  • An improved data stream summary: The count-min sketch and its applications

    Graham Cormode;S. Muthukrishnan

  • The string edit distance matching problem with moves

    Graham Cormode;S. Muthukrishnan

  • Efficient algorithms for document retrieval problems

    S. Muthukrishnan

  • Mining database structure; or, how to build a data quality browser

    Tamraparni Dasu;Theodore Johnson;S. Muthukrishnan;Vladislav Shkapenyuk

  • Improved time bounds for near-optimal sparse Fourier representations

    A. C. Gilbert;S. Muthukrishnan;M. Strauss

  • On the sorting-complexity of suffix tree construction

    Martin Farach-Colton;Paolo Ferragina;S. Muthukrishnan

  • Internet packet filter management and rectangle geometry

    David Eppstein;S. Muthukrishnan

  • Estimating statistical aggregates on probabilistic data streams

    T. S. Jayram;Andrew McGregor;S. Muthukrishnan;Erik Vee

  • Holistic aggregates in a networked world: distributed tracking of approximate quantiles

    Graham Cormode;Minos Garofalakis;S. Muthukrishnan;Rajeev Rastogi

  • Scheduling on-demand broadcasts: new metrics and algorithms

    Unknown

  • Approximation of functions over redundant dictionaries using coherence

    Anna C. Gilbert;S. Muthukrishnan;Martin J. Strauss

  • Combinatorial algorithms for compressed sensing

    Graham Cormode;S. Muthukrishnan

  • Finding hierarchical heavy hitters in data streams

    Graham Cormode;Flip Korn;S. Muthukrishnan;Divesh Srivastava

  • Sampling algorithms for l 2 regression and applications

    Petros Drineas;Michael W. Mahoney;S. Muthukrishnan

Frequent Co-Authors

Graham Cormode
Graham Cormode University of Warwick
Jon Feldman
Jon Feldman Google (United States)
Martin J. Strauss
Martin J. Strauss University of Michigan–Ann Arbor
Flip Korn
Flip Korn Google (United States)
Divesh Srivastava
Divesh Srivastava AT&T (United States)
Anna C. Gilbert
Anna C. Gilbert Yale University
Paolo Ferragina
Paolo Ferragina University of Pisa
Bhaskar DasGupta
Bhaskar DasGupta University of Illinois at Chicago
Rajmohan Rajaraman
Rajmohan Rajaraman Northeastern University
Nick Koudas
Nick Koudas University of Toronto

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online study options is a practical way to advance your career in computer science or related fields. Many universities offer 1 year associate degree programs online, allowing you to complete foundational coursework quickly and affordably. These programs are ideal if you're looking to build job-ready skills or start your academic journey with flexibility.

For students mindful of tuition costs, consider searching for the most affordable online colleges. Affordability can greatly reduce student debt, making it easier to start your career after graduation. Additionally, not everyone has a perfect academic record. Some institutions offer online graduate programs that accept 2.0 gpa, opening doors for more students to earn advanced qualifications.

Beyond computer science, interdisciplinary pathways can be rewarding too. If you're interested in sustainability or technology's impact on the environment, you might wonder what jobs can you get with an environmental science degree. Exploring related fields can expand your career options and help you build a unique professional profile.

Best Scientists Citing s muthukrishnan

Trending Scientists

Recently Published Articles