Shanmugavelayutham Muthukrishnan
#126,165
Most Influential Person Now
Shanmugavelayutham Muthukrishnan's AcademicInfluence.com Rankings
Shanmugavelayutham Muthukrishnancomputer-science Degrees
Computer Science
#5308
World Rank
#5607
Historical Rank
Data Mining
#99
World Rank
#99
Historical Rank
Database
#2465
World Rank
#2582
Historical Rank
Download Badge
Computer Science
Shanmugavelayutham Muthukrishnan's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Shanmugavelayutham Muthukrishnan Influential?
(Suggest an Edit or Addition)Shanmugavelayutham Muthukrishnan's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- An improved data stream summary: the count-min sketch and its applications (2004) (2036)
- Data streams: algorithms and applications (2005) (1823)
- Approximate String Joins in a Database (Almost) for Free (2001) (643)
- Influence sets based on reverse nearest neighbor queries (2000) (575)
- Optimal Histograms with Quality Guarantees (1998) (470)
- Node Classification in Social Networks (2011) (468)
- Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries (2001) (464)
- Relative-Error CUR Matrix Decompositions (2007) (450)
- Faster least squares approximation (2007) (435)
- What's hot and what's not: tracking most frequent items dynamically (2003) (358)
- Sampling algorithms for l2 regression and applications (2006) (333)
- Online Stochastic Matching: Beating 1-1/e (2009) (331)
- Fast, small-space algorithms for approximate histogram maintenance (2002) (303)
- Near-optimal sparse fourier representations via sampling (2002) (290)
- Flow and stretch metrics for scheduling continuous job streams (1998) (279)
- Reinforcement Knowledge Graph Reasoning for Explainable Recommendation (2019) (276)
- What's hot and what's not: tracking most frequent items dynamically (2003) (272)
- Identifying Representative Trends in Massive Time Series Data Sets Using Sketches (2000) (269)
- Scheduling on-demand broadcasts: new metrics and algorithms (1998) (264)
- What's new: finding significant differences in network data streams (2004) (260)
- Efficient algorithms for document retrieval problems (2002) (255)
- On the sorting-complexity of suffix tree construction (2000) (224)
- Holistic aggregates in a networked world: distributed tracking of approximate quantiles (2005) (218)
- Combinatorial Algorithms for Compressed Sensing (2006) (217)
- The string edit distance matching problem with moves (2002) (216)
- Mining database structure; or, how to build a data quality browser (2002) (211)
- Finding Hierarchical Heavy Hitters in Data Streams (2003) (202)
- Approximation of functions over redundant dictionaries using coherence (2003) (195)
- On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications (1999) (194)
- How to Summarize the Universe: Dynamic Maintenance of Quantiles (2002) (190)
- Algorithms for distributed functional monitoring (2008) (181)
- First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (1996) (175)
- Internet packet filter management and rectangle geometry (2000) (174)
- Online Ad Assignment with Free Disposal (2009) (173)
- Budget optimization in search-based advertising auctions (2006) (173)
- Comparing Data Streams Using Hamming Norms (How to Zero In) (2002) (168)
- Space efficient mining of multigraph streams (2005) (154)
- Sponsored Search Auctions with Markovian Users (2008) (150)
- Compressing and indexing labeled trees, with applications (2009) (149)
- Yield optimization of display advertising with ad exchange (2011) (146)
- Counting twig matches in a tree (2001) (140)
- One-Pass Wavelet Decompositions of Data Streams (2003) (137)
- Summarizing and Mining Skewed Data Streams (2005) (130)
- Using q-grams in a DBMS for Approximate String Processing (2001) (129)
- General auction mechanism for search advertising (2008) (128)
- Conquering the Divide: Continuous Clustering of Distributed Data Streams (2007) (128)
- Online scheduling to minimize average stretch (1999) (127)
- Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data (2004) (123)
- Holistic UDAFs at streaming speeds (2004) (119)
- Mining Deviants in a Time Series Database (1999) (118)
- Structuring labeled trees for optimal succinctness, and beyond (2005) (118)
- Estimating Rarity and Similarity over Data Stream Windows (2002) (114)
- Alphabet Dependence in Parameterized Matching (1994) (110)
- On distributing symmetric streaming computations (2008) (107)
- Approximate nearest neighbors and sequence comparison with block operations (2000) (106)
- QuickSAND: Quick Summary and Analysis of Network Data (2001) (104)
- Reverse Nearest Neighbor Aggregates Over Data Streams (2002) (104)
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods (2006) (98)
- Tight analyses of two local load balancing algorithms (1995) (97)
- The bin-covering technique for thresholding random geometric graph properties (2005) (95)
- Finding hierarchical heavy hitters in streaming data (2008) (89)
- Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling (2005) (87)
- Dynamic Load Balancing by Random Matchings (1996) (87)
- Group testing problems with sequences in experimental molecular biology (1997) (86)
- Sampling algorithms in a stream operator (2005) (84)
- Estimating statistical aggregates on probabilistic data streams (2008) (84)
- Estimating Entropy and Entropy Norm on Data Streams (2006) (83)
- Optimal sampling from distributed streams (2010) (82)
- A Heartbeat Mechanism and Its Application in Gigascope (2005) (80)
- Space- and time-efficient deterministic algorithms for biased quantiles over data streams (2006) (79)
- Stochastic Models for Budget Optimization in Search-Based Advertising (2006) (79)
- Compressing and searching XML data via two zips (2006) (78)
- Pan-private algorithms via statistics on sketches (2011) (77)
- Overcoming the memory bottleneck in suffix tree construction (1998) (75)
- What’s Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams (2006) (73)
- An online mechanism for ad slot reservations with cancellations (2009) (70)
- Improved sparse approximation over quasiincoherent dictionaries (2003) (68)
- Selectively estimation for Boolean queries (2000) (68)
- Private decayed predicate sums on streams (2013) (67)
- Bidding to the Top: VCG and Equilibria of Position-Based Auctions (2006) (66)
- Histogramming Data Streams with Fast Per-Item Processing (2002) (65)
- Optimal and approximate computation of summary statistics for range aggregates (2001) (64)
- Optimal private halfspace counting via discrepancy (2012) (64)
- Minimizing maximum response time in scheduling broadcasts (2000) (60)
- The string edit distance matching problem with moves (2007) (60)
- Engineering the compression of massive tables: an experimental approach (2000) (60)
- Optimal histograms for hierarchical range queries (extended abstract) (2000) (60)
- Continuous sampling from distributed streams (2012) (59)
- New Results and Open Problems Related to Non-Standard Stringology (1995) (59)
- CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation (2020) (58)
- Improved algorithms for stretch scheduling (2002) (58)
- Chapter 30 – Comparing Data Streams Using Hamming Norms (How to Zero In) (2002) (57)
- Estimating statistical aggregates on probabilistic data streams (2007) (56)
- Mining deviants in time series data streams (2004) (55)
- Adaptive Submodular Maximization in Bandit Setting (2013) (54)
- Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles (2001) (54)
- Auctions with intermediaries: extended abstract (2010) (53)
- Perfect Hashing for Strings: Formalization and Algorithms (1996) (53)
- Sequential Change Detection on Data Streams (2007) (53)
- Bid optimization for broad match ad auctions (2009) (52)
- Estimating Dominance Norms of Multiple Data Streams (2003) (51)
- Effective computation of biased quantiles over data streams (2005) (50)
- A Truthful Mechanism for Offline Ad Slot Scheduling (2008) (49)
- Augmenting Suffix Trees, with Applications (1998) (48)
- Improved approximation algorithms for rectangle tiling and packing (2001) (45)
- Selective Call Out and Real Time Bidding (2010) (45)
- Budget Feasible Mechanisms for Experimental Design (2013) (45)
- Offline Evaluation of Ranking Policies with Click Models (2018) (45)
- Doubleclick Ad Exchange Auction (2012) (44)
- Towards an Algorithmic Theory of Compressed Sensing (2005) (44)
- Optimal Logarithmic Time Randomized Suffix Tree Construction (1996) (43)
- Optimal histograms for hierarchical range queries (2000) (43)
- Mining advertiser-specific user behavior using adfactors (2010) (42)
- AQUA: System and Techniques for Approximate Query Answering (1998) (42)
- Query-Aware Partitioning for Monitoring Massive Network Data Streams (2008) (42)
- Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. (1997) (41)
- Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) (1994) (39)
- Engineering Diffusive Load Balancing Algorithms Using Experiments (1997) (38)
- The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs (2016) (37)
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods (2006) (37)
- Scheduling to minimize average stretch without migration (2000) (37)
- Algorithmic Methods for Sponsored Search Advertising (2008) (37)
- First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract) (1996) (36)
- Approximation algorithms for array partitioning problems (2005) (36)
- Two-dimensional substring indexing (2001) (35)
- Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases (2003) (35)
- Efficient Approximation of Correlated Sums on Data Streams (2003) (35)
- Approximation Algorithms for Average Stretch Scheduling (2004) (35)
- Permutation Editing and Matching via Embeddings (2001) (34)
- Dynamic load balancing on parallel and distributed networks by random matchings (1994) (34)
- Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions (2010) (34)
- Resource scheduling for parallel database and scientific applications (1996) (34)
- Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses (2005) (33)
- Monitoring Regular Expressions on Out-of-Order Streams (2007) (32)
- Position Auctions with Bidder-Specific Minimum Prices (2008) (32)
- Budget Optimization for Online Campaigns with Positive Carryover Effects (2012) (32)
- Multi-method dispatching: a geometric approach with applications to string matching problems (1999) (32)
- Fast mining of massive tabular data via approximate distance computations (2002) (32)
- 40 years of suffix trees (2016) (31)
- An adversarial model for distributed dynamic load balancing (1998) (30)
- Comparing Sequences with Segment Rearrangements (2003) (30)
- Substring compression problems (2005) (29)
- Approximating Data with the Count-Min Sketch (2012) (29)
- OPEN PROBLEMS IN DATA STREAMS AND RELATED TOPICS IITK WORKSHOP ON ALGORITHMS FOR DATA STREAMS ’06 (2007) (29)
- Time and space efficient method-lookup for object-oriented programs (1996) (27)
- Modeling skew in data streams (2006) (27)
- Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract) (1996) (26)
- Stochastic Low-Rank Bandits (2017) (26)
- Optimal parallel dictionary matching and compression (1995) (24)
- Rangesum histograms (2003) (24)
- Simple and Practical Sequence Nearest Neighbors with Block Operations (2002) (23)
- Maintenance of Multidimensional Histograms (2003) (22)
- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization (2009) (22)
- EX3: Explainable Attribute-aware Item-set Recommendations (2021) (22)
- Some Algorithmic Problems and Results in Compressed Sensing (2006) (22)
- How to scalably and accurately skip past streams (2007) (21)
- No Blog is an Island - Analyzing Connections Across Information Networks (2007) (20)
- Sublinear Methods for Detecting Periodic Trends in Data Streams (2004) (20)
- Location based services in a wireless WAN using cellular digital packet data (CDPD) (2001) (20)
- Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms (2002) (19)
- Stochastic Models for Budget Optimization in Search-Based Advertising (2007) (19)
- Large-Scale Optimistic Adaptive Submodularity (2014) (19)
- Improved range-summable random variable construction algorithms (2005) (19)
- Compact grid layouts of multi-level networks (1999) (19)
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (2012) (18)
- Towards constructing physical maps by optical mapping: an effective, simple, combinatorial approach (1997) (18)
- Stochastic Budget Optimization in Internet Advertising (2010) (18)
- Online Ad Slotting With Cancellations (2008) (17)
- Optimal parallel dictionary matching and compression (extended abstract) (1995) (17)
- Simple approximation algorithm for nonoverlapping local alignments (2002) (17)
- On the Complexity of Processing Massive, Unordered, Distributed Data (2006) (17)
- Parallel scheduling problems in next generation wireless networks (2002) (17)
- Slice and dice (2002) (16)
- Streams, Security and Scalability (2005) (15)
- Static optimality theorem for external memory string access (2002) (15)
- Workload-Optimal Histograms on Streams (2005) (15)
- Group testing problems in experimental molecular biology (1995) (15)
- Data Stream Algorithms (2005) (14)
- Testable Bounded Degree Graph Properties Are Random Order Streamable (2017) (14)
- Neural-Symbolic Reasoning over Knowledge Graph for Multi-stage Explainable Recommendation (2020) (14)
- Private Decayed Sum Estimation under Continual Observation (2011) (13)
- Slice and dice: a simple, improved approximate tiling recipe (2002) (13)
- Socializing the h-index (2012) (13)
- Thresholding random geometric graph properties motivated by ad hoc sensor networks (2010) (13)
- Domain-driven data synopses for dynamic quantiles (2005) (12)
- Approximating Data with the Count-Min Data Structure (2011) (12)
- Theory of data stream computing: where to go (2011) (11)
- Generalized substring selectivity estimation (2003) (10)
- A data structure for a sequence of string accesses in external memory (2007) (10)
- Approximation algorithms for MAX-MIN tiling (2003) (10)
- Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach (1997) (10)
- On Signatures for Communication Graphs (2008) (10)
- Theory research at Google (2008) (10)
- An Improved Algorithm for Sequence Comparison with Block Reversals (2002) (9)
- Theory of Sponsored Search Auctions (2008) (9)
- Targeting algorithms for online social advertising markets (2016) (9)
- Hardness of Flip-Cut Problems from Optical Mapping (1997) (8)
- Query-Aware Sampling for Data Streams (2007) (8)
- Minimal Interaction Search: Multi-Way Search with Item Categories (2013) (8)
- People like us: mining scholarly data for comparable researchers (2014) (8)
- The Architecture of a Software Library for String Processing (1997) (8)
- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow (1998) (8)
- NEW COMPUTATIONAL ASPECTS OF DISCREPANCY THEORY (2014) (8)
- Combinatorial Pattern Matching: 15th Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings (Lecture Notes in Computer Science) (2004) (7)
- Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors (2008) (7)
- Graphical Model Sketch (2016) (7)
- Layout of the batcher bitonic sorter (extended abstract) (1998) (7)
- Nearly Optimal Private Convolution (2013) (7)
- Pan-private Algorithms: When Memory Does Not Help (2010) (7)
- Layout of the Batcher Bitonic Sorter (1998) (7)
- Forty Years of Text Indexing (2013) (6)
- Scienceography: The Study of How Science Is Written (2012) (6)
- Efficiently sequencing tape-resident jobs (1999) (6)
- Average stretch without migration (2004) (6)
- Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract) (1996) (6)
- Theoretical Computer Science: Special Issue on the Burrows-Wheeler Transform (2007) (5)
- A hybrid approach to content based image retrieval using visual features and textual queries (2011) (5)
- Functionally Private Approximations of Negligibly-Biased Estimators (2009) (5)
- LHP: an end-to-end reliable transport protocol over wireless data networks (2003) (5)
- Group recommendations via multi-armed bandits (2012) (5)
- Compact Grid Layouts of Some Multi-Level Networks (1999) (5)
- Periodicity testing with sublinear samples and space (2010) (5)
- What's new: finding significant differences in network data streams (2004) (5)
- An efficient algorithm for sequence comparison with block reversals (2004) (5)
- EXACTA: Explainable Column Annotation (2021) (5)
- Scheduling to Minimize Average Stretch (1999) (4)
- Finding Subcube Heavy Hitters in Analytics Data Streams (2017) (4)
- Waterfall Bandits: Learning to Sell Ads Online (2019) (4)
- Revenue-Maximizing Stable Pricing in Online Labor Markets (2017) (4)
- Arbitrage-free Pricing in User-based Markets (2018) (4)
- The Shapley Value in Knapsack Budgeted Games (2014) (4)
- A Consensus-Focused Group Recommender System (2013) (4)
- Modeling collaboration in academia: a game theoretic approach (2014) (3)
- Large-Scale Distributed Computation (NII Shonan Meeting 2012-1) (2012) (3)
- Self-adjusting Data Structures for External Memory String Access (2001) (3)
- Approximate Histogram and Wavelet Summaries of Streaming Data (2016) (3)
- On the temporal HZY compression scheme (2000) (3)
- How Much is Your Attention Worth?: Analysis of Prices in LinkedIn Advertising Network - Short talk (2017) (3)
- First author advantage: citation labeling in research (2013) (2)
- Exact Expected Case Analyses of a Simple Heuristic for Compressed Array Storage (1998) (2)
- A Time and Space Efficient Algorithm for Contextual Linear Bandits (2012) (2)
- Streaming techniques for statistical modeling (2007) (2)
- Optimal Parallel Randomized Renaming (1997) (2)
- Sublinear Algorithms, 17.07. - 22.07.2005 (2006) (2)
- Inferring tree topologies using flow tests (2003) (2)
- How to Increase the Acceptance Ratios of Top Conferences ? (2004) (2)
- IPSOFACTO: a visual correlation tool for aggregate network traffic data (2003) (2)
- Design issues in multimedia messaging for next generation wireless systems (2001) (2)
- Offline Optimization for Online Ad Allocation [ Extended (2009) (2)
- TCP Compression Filter (1999) (1)
- Faster Schedules for Diiusive Load Balancing via Over{relaxation (*****draft. Do Not Distribute*****) (1995) (1)
- TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING (1999) (1)
- Editorial message: special track on data streams (2004) (1)
- Streaming Algorithms for Measuring H-Impact (2017) (1)
- Downlink Scheduling for Multirate Wireless Networks (2005) (1)
- Eecient Dynamic Method-lookup for Object Oriented Languages ? (1996) (1)
- How to ( accurately ) skip past streams (2006) (1)
- Data management and mining in internet ad systems (2010) (1)
- Fractal Modeling of IP Network Traffic at Streaming Speeds (2006) (1)
- So what is a streaming algorithm ? (2009) (0)
- Finding Subcube Heavy Hitters in Data Streams (2017) (0)
- On rectangular partitionings of two-dimensional data: Algorithms, complexity and applications (1999) (0)
- Market Approach to Social Ads: The MyLikes Example and Related Problems (2013) (0)
- Approximation algorithms forMAX-MIN tiling ✩ (2003) (0)
- Scalable and robust stream processing (2007) (0)
- 05291 Abstracts Collection Sublinear Algorithms Dagstuhl Seminar (2006) (0)
- Filtering techniques for data streams (2007) (0)
- VAMPIRE ATTACKS: PROTOCOL ROUTING INFRASTRUCTURE IN WIRELESS SENSOR NETWORKS (2014) (0)
- On 2-Tuple String Matching (2000) (0)
- 05291 Abstracts Collection -- Sublinear Algorithms (2005) (0)
- 08341 Executive Summary - Sublinear Algorithms (2008) (0)
- Offline Ad Slot Scheduling (2010) (0)
- Foreword (2007) (0)
- Procede et dispositif de confirmation automatique assistes par un reseau de l'execution d'un service de message court (2001) (0)
- Ad allocation with secondary metrics (2016) (0)
- Preface (2006) (0)
- Analyses of Cardinal Auctions (2012) (0)
- Studying the source code of scientific research (2013) (0)
- Large-Scale Distributed Computation (2012) (0)
- Hardness of flip-cut problems from optical mapping [DNA molecules application] (1997) (0)
- Delivery of a short message (2001) (0)
- 08341 Abstracts Collection - Sublinear Algorithms (2008) (0)
- Stringology: Some Classic and Some Modern Problems (2007) (0)
- Sublinear Algorithms Dagstuhl Seminar (2008) (0)
- Estimating Aggregate Properties on Probabilistic Streams (2006) (0)
- An Efficient Low Power Sparse Clustered Network By Using Reordered Overlapped Content Addressable Memory (2016) (0)
- DIMACS Technical Report 2005-25 September 2005 Towards an Algorithmic Theory of Compressed Sensing by Graham Cormode 1 Bell Labs (2005) (0)
- Masking and labeling problems in social network data management (2011) (0)
- Techniques and Applications for ApproximatingString Distances { Rough Draft ( April 11 2000 ) (2007) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Shanmugavelayutham Muthukrishnan?
Shanmugavelayutham Muthukrishnan is affiliated with the following schools:
