S. Muthukrishnan

9.5k total citations
115 papers, 4.1k citations indexed

About

S. Muthukrishnan is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, S. Muthukrishnan has authored 115 papers receiving a total of 4.1k indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Artificial Intelligence, 49 papers in Computer Networks and Communications and 26 papers in Computational Theory and Mathematics. Recurrent topics in S. Muthukrishnan's work include Algorithms and Data Compression (36 papers), Optimization and Search Problems (27 papers) and Data Management and Algorithms (14 papers). S. Muthukrishnan is often cited by papers focused on Algorithms and Data Compression (36 papers), Optimization and Search Problems (27 papers) and Data Management and Algorithms (14 papers). S. Muthukrishnan collaborates with scholars based in United States, Italy and United Kingdom. S. Muthukrishnan's co-authors include Petros Drineas, Michael W. Mahoney, Graham Cormode, Anna C. Gilbert, Jon Feldman, Vahab Mirrokni, Paolo Ferragina, Swarup Acharya, Michael Strauss and Martı́n Farach-Colton and has published in prestigious journals such as Management Science, Communications of the ACM and Journal of the ACM.

In The Last Decade

S. Muthukrishnan

109 papers receiving 3.8k citations

Peers

Countries citing papers authored by S. Muthukrishnan

Since Specialization

Citations

This map shows the geographic impact of S. Muthukrishnan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. Muthukrishnan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Muthukrishnan more than expected).

Fields of papers citing papers by S. Muthukrishnan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. Muthukrishnan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. Muthukrishnan. The network helps show where S. Muthukrishnan may publish in the future.

Co-authorship network of co-authors of S. Muthukrishnan

This figure shows the co-authorship network connecting the top 25 collaborators of S. Muthukrishnan. A scholar is included among the top collaborators of S. Muthukrishnan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. Muthukrishnan. S. Muthukrishnan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs 2017 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan	7
2	Joining user profiles across online social networks: from the perspective of an adversary 2016 ·Qiang Ma, Han Hee Song, S. Muthukrishnan, Antonio Nucci	2
3	Minimal Interaction Search: Multi-Way Search with Item Categories 2013 ·National Conference on Artificial Intelligence ·(unknown), Branislav Kveton, S. Muthukrishnan	5
4	Large-Scale Distributed Computation (NII Shonan Meeting 2012-1). 2012 ·Graham Cormode, S. Muthukrishnan, Ke Yi	1
5	An online mechanism for ad slot reservations with cancellations 2009 ·Symposium on Discrete Algorithms ·Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál	26
6	No blog is an Island - Analyzing connections across information networks 2007 ·Smriti Bhagat, (unknown), Graham Cormode, S. Muthukrishnan, (unknown)	9
7	The bin-covering technique for thresholding random geometric graph properties 2005 ·Symposium on Discrete Algorithms ·S. Muthukrishnan, Gopal Pandurangan	55
8	Substring compression problems 2005 ·Symposium on Discrete Algorithms ·Graham Cormode, S. Muthukrishnan	8
9	Summarizing and mining inverse distributions on data streams via dynamic inverse sampling 2005 ·Very Large Data Bases ·Graham Cormode, S. Muthukrishnan, (unknown)	49
10	Improved range-summable random variable construction algorithms 2005 ·Symposium on Discrete Algorithms ·A.R. Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Michael Strauss	10
11	Rangesum histograms 2003 ·Symposium on Discrete Algorithms ·S. Muthukrishnan, Martin J. Strauss	12
12	Approximation of functions over redundant dictionaries using coherence 2003 ·Symposium on Discrete Algorithms ·Anna C. Gilbert, S. Muthukrishnan, Martin J. Strauss	104
13	The string edit distance matching problem with moves 2002 ·Symposium on Discrete Algorithms ·Graham Cormode, S. Muthukrishnan	49
14	Efficient algorithms for document retrieval problems 2002 ·Symposium on Discrete Algorithms ·S. Muthukrishnan	94
15	Improved algorithms for stretch scheduling 2002 ·Symposium on Discrete Algorithms ·Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman	31
16	Minimizing maximum response time in scheduling broadcasts 2000 ·Symposium on Discrete Algorithms ·Yair Bartal, S. Muthukrishnan	34
17	Engineering the compression of massive tables: an experimental approach 2000 ·Symposium on Discrete Algorithms ·Adam L. Buchsbaum, (unknown), Kenneth Church, Glenn S. Fowler, S. Muthukrishnan	37
18	On the temporal HZY compression scheme 2000 ·Symposium on Discrete Algorithms ·(unknown), Yossi Matias, S. Muthukrishnan, S. Cenk Sahinalp, J. Ziv	0
19	Optimal Histograms with Quality Guarantees 1998 ·Very Large Data Bases ·H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Viswanath Poosala, Kenneth C. Sevcik, Torsten Suel	255
20	Towards constructing physical maps by optical mapping: an effective, simple, combinatorial approach 1997 ·S. Muthukrishnan, Laxmi Parida	7

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact