S. Muthukrishnan

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
255Yield optimization of display advertising with ad exchange. Santiago Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan. ACM Conference on Electronic Commerce 2011, 27-28. Web SearchBibTeXDownload
254Algorithms for distributed functional monitoring. Graham Cormode, S. Muthukrishnan, Ke Yi. ACM Transactions on Algorithms (7): 21 (2011). Cited by 12Web SearchBibTeXDownload
253Yield Optimization of Display Advertising with Ad Exchange. Santiago Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan. CoRR (abs/1102.2551) (2011). Web SearchBibTeXDownload
252Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection. Gianni Franceschini, Roberto Grossi, S. Muthukrishnan. CoRR (abs/1110.3381) (2011). Web SearchBibTeXDownload
251Node Classification in Social Networks. Smriti Bhagat, Graham Cormode, S. Muthukrishnan. CoRR (abs/1101.3291) (2011). Web SearchBibTeXDownload
250Private Decayed Sum Estimation under Continual Observation. Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft. CoRR (abs/1108.6123) (2011). Web SearchBibTeXDownload
249Theory of data stream computing: where to go. S. Muthukrishnan. PODS 2011, 317-319. Web SearchBibTeXDownload
248Pan-private algorithms via statistics on sketches. Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright. PODS 2011, 37-48. Web SearchBibTeXDownload
247Social Butterfly: Social Caches for Distributed Social Networks. Lu Han, Badri Nath, Liviu Iftode, S. Muthukrishnan. SocialCom/PASSAT 2011, 81-86. Web SearchBibTeXDownload
246Finding hierarchy in directed online social networks. Mangesh Gupte, Pravin Shankar, Jing Li, S. Muthukrishnan, Liviu Iftode. WWW 2011, 557-566. Web SearchBibTeXDownload
2010
245Auctions with intermediaries: extended abstract. Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai. ACM Conference on Electronic Commerce 2010, 23-32. Web SearchBibTeXDownload
244Periodicity testing with sublinear samples and space. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
243On distributing symmetric streaming computations. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. ACM Transactions on Algorithms (6) (2010). Cited by 6Web SearchBibTeXDownload
242Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. Algorithmica (58): 1022-1044 (2010). Cited by 13Web SearchBibTeXDownload
241Pan-private Algorithms: When Memory Does Not Help. Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright. CoRR (abs/1009.1544) (2010). Web SearchBibTeXDownload
240Stochastic Budget Optimization in Internet Advertising. Bhaskar DasGupta, S. Muthukrishnan. CoRR (abs/1001.2735) (2010). Web SearchBibTeXDownload
239Selective Call Out and Real Time Bidding. Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan. CoRR (abs/1002.3102) (2010). Web SearchBibTeXDownload
238Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions. Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan. CoRR (abs/1008.1616) (2010). Web SearchBibTeXDownload
237Thresholding random geometric graph properties motivated by ad hoc sensor networks. S. Muthukrishnan, Gopal Pandurangan. J. Comput. Syst. Sci. (76): 686-696 (2010). Web SearchBibTeXDownload
236Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav. LATIN 2010, 565-576. Web SearchBibTeXDownload
235Optimal sampling from distributed streams. Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang. PODS 2010, 77-86. Web SearchBibTeXDownload
234Data Management and Mining in Internet Ad Systems. S. Muthukrishnan. PVLDB (3): 1655-1656 (2010). Web SearchBibTeXDownload
233Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions. Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan. WINE 2010, 158-169. Web SearchBibTeXDownload
232Mining advertiser-specific user behavior using adfactors. Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan. WWW 2010, 31-40. Web SearchBibTeXDownload
231Monitoring algorithms for negative feedback systems. Mark Sandler, S. Muthukrishnan. WWW 2010, 871-880. Web SearchBibTeXDownload
2009
230Bidding on Configurations in Internet Ad Auctions. S. Muthukrishnan. COCOON 2009, 1-6. Cited by 3Web SearchBibTeXDownload
229Bid Optimization in Broad-Match Ad Auctions. Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav. CoRR (abs/0901.3754) (2009). Cited by 2Web SearchBibTeXDownload
228Optimal cache-aware suffix selection. Gianni Franceschini, Roberto Grossi, S. Muthukrishnan. CoRR (abs/0902.1737) (2009). Web SearchBibTeXDownload
227Online Stochastic Matching: Beating 1-1/e. Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan. CoRR (abs/0905.4100) (2009). Cited by 1Web SearchBibTeXDownload
226Quasi-Proportional Mechanisms: Prior-free Revenue Maximization. Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav. CoRR (abs/0909.5365) (2009). Web SearchBibTeXDownload
225Functionally Private Approximations of Negligibly-Biased Estimators. André Madeira, S. Muthukrishnan. FSTTCS 2009, 323-334. Web SearchBibTeXDownload
224Compressing and indexing labeled trees, with applications. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. J. ACM (57) (2009). Web SearchBibTeXDownload
223Pricing guidance in ad sale negotiations: the PrintAds example. Adam Isaac Juda, S. Muthukrishnan, Ashish Rastogi. KDD Workshop on Data Mining and Audience Intelligence for Advertising 2009, 61-68. Web SearchBibTeXDownload
222Stochastic Data Streams. S. Muthukrishnan. MFCS 2009, 55. Web SearchBibTeXDownload
221AdX: a model for ad exchanges. S. Muthukrishnan. SIGecom Exchanges (8): 9 (2009). Web SearchBibTeXDownload
220An online mechanism for ad slot reservations with cancellations. Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál. SODA 2009, 1265-1274. Cited by 6Web SearchBibTeXDownload
219Optimal Cache-Aware Suffix Selection. Gianni Franceschini, Roberto Grossi, S. Muthukrishnan. STACS 2009, 457-468. Web SearchBibTeXDownload
218Ad Exchanges: Research Issues. S. Muthukrishnan. WINE 2009, 1-12. Web SearchBibTeXDownload
217Online Ad Assignment with Free Disposal. Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál. WINE 2009, 374-385. Web SearchBibTeXDownload
216General auction mechanism for search advertising. Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál. WWW 2009, 241-250. Cited by 14Web SearchBibTeXDownload
215Bid optimization for broad match ad auctions. Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav. WWW 2009, 231-240. Web SearchBibTeXDownload
2008
214Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. ACM Trans. Database Syst. (33) (2008). Cited by 33Web SearchBibTeXDownload
213Algorithmic Methods for Sponsored Search Advertising. Jon Feldman, S. Muthukrishnan. CoRR (abs/0805.1759) (2008). Cited by 5Web SearchBibTeXDownload
212General Auction Mechanism for Search Advertising. Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál. CoRR (abs/0807.1297) (2008). Web SearchBibTeXDownload
211Online Ad Slotting With Cancellations. Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal. CoRR (abs/0805.1213) (2008). Cited by 5Web SearchBibTeXDownload
210Range Medians. Sariel Har-Peled, S. Muthukrishnan. ESA 2008, 503-514. Cited by 5Web SearchBibTeXDownload
209Theory of Sponsored Search Auctions. Gagan Aggarwal, S. Muthukrishnan. FOCS 2008, 7. Web SearchBibTeXDownload
208Internet Ad Auctions: Insights and Directions. S. Muthukrishnan. ICALP (1) 2008, 14-23. Cited by 4Web SearchBibTeXDownload
207Query-Aware Partitioning for Monitoring Massive Network Data Streams. Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck. ICDE 2008, 1528-1530. Cited by 5Web SearchBibTeXDownload
206On Signatures for Communication Graphs. Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua Wu. ICDE 2008, 189-198. Cited by 1Web SearchBibTeXDownload
205A Truthful Mechanism for Offline Ad Slot Scheduling. Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál. SAGT 2008, 182-193. Cited by 7Web SearchBibTeXDownload
204Relative-Error CUR Matrix Decompositions. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan. SIAM J. Matrix Analysis Applications (30): 844-881 (2008). Cited by 22Web SearchBibTeXDownload
203Theory research at Google. Gagan Aggarwal, Nir Ailon, Florin Constantin, Eyal Even-Dar, Jon Feldman, Gereon Frahling, Monika Rauch Henzinger, S. Muthukrishnan, Noam Nisan, Martin Pál, Mark Sandler, Anastasios Sidiropoulos. SIGACT News (39): 10-28 (2008). Cited by 3Web SearchBibTeXDownload
202Query-aware partitioning for monitoring massive network data streams. Theodore Johnson, S. Muthu Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck. SIGMOD Conference 2008, 1135-1146. Cited by 5Web SearchBibTeXDownload
201Data management projects at Google. Michael J. Cafarella, Edward Y. Chang, Rob Pike, Alon Y. Halevy, Wilson C. Hsieh, Alberto Lerner, Jayant Madhavan, S. Muthukrishnan. SIGMOD Record (37): 34-38 (2008). Cited by 8Web SearchBibTeXDownload
200Algorithms for distributed functional monitoring. Graham Cormode, S. Muthukrishnan, Ke Yi. SODA 2008, 1076-1085. Cited by 12Web SearchBibTeXDownload
199On distributing symmetric streaming computations. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. SODA 2008, 710-719. Cited by 6Web SearchBibTeXDownload
198Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. SSDBM 2008, 42-60. Web SearchBibTeXDownload
197The Magnus-Derek game. Zhivko Prodanov Nedev, S. Muthukrishnan. Theor. Comput. Sci. (393): 124-132 (2008). Cited by 4Web SearchBibTeXDownload
196Finding hierarchical heavy hitters in streaming data. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. TKDD (1) (2008). Cited by 6Web SearchBibTeXDownload
195Position Auctions with Bidder-Specific Minimum Prices. Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan. WINE 2008, 577-584. Web SearchBibTeXDownload
194Sponsored Search Auctions with Markovian Users. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal. WINE 2008, 621-628. Cited by 13Web SearchBibTeXDownload
2007
193Budget optimization in search-based advertising auctions. Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein. ACM Conference on Electronic Commerce 2007, 40-49. Cited by 26Web SearchBibTeXDownload
192A data structure for a sequence of string accesses in external memory. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan. ACM Transactions on Algorithms (3) (2007). Cited by 6Web SearchBibTeXDownload
191The string edit distance matching problem with moves. Graham Cormode, S. Muthukrishnan. ACM Transactions on Algorithms (3) (2007). Cited by 87Web SearchBibTeXDownload
190Relative-Error CUR Matrix Decompositions. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan. CoRR (abs/0708.3696) (2007). Cited by 22Web SearchBibTeXDownload
189Faster Least Squares Approximation. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, Tamás Sarlós. CoRR (abs/0710.1435) (2007). Cited by 14Web SearchBibTeXDownload
188Radix Sorting With No Extra Space. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu. CoRR (abs/0706.4107) (2007). Cited by 9Web SearchBibTeXDownload
187Stringology: Some Classic and Some Modern Problems. S. Muthukrishnan. CPM 2007, 2. Web SearchBibTeXDownload
186Radix Sorting with No Extra Space. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu. ESA 2007, 194-205. Web SearchBibTeXDownload
185Streaming Algorithms for Data in Motion. Michael Hoffmann, S. Muthukrishnan, Rajeev Raman. ESCAPE 2007, 294-304. Web SearchBibTeXDownload
184Oxypred: Prediction and Classification of Oxygen-Binding Proteins. S. Muthukrishnan, Aarti Garg, G. P. S. Raghava. Genomics, Proteomics & Bioinformatics (5): 250-252 (2007). Web SearchBibTeXDownload
183In-Place Suffix Sorting. Gianni Franceschini, S. Muthukrishnan. ICALP 2007, 533-545. Cited by 8Web SearchBibTeXDownload
182Conquering the Divide: Continuous Clustering of Distributed Data Streams. Graham Cormode, S. Muthukrishnan, Wei Zhuang. ICDE 2007, 1036-1045. Cited by 27Web SearchBibTeXDownload
181Monitoring Regular Expressions on Out-of-Order Streams. Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum. ICDE 2007, 1315-1319. Cited by 5Web SearchBibTeXDownload
180How to scalably and accurately skip past streams. Supratik Bhattacharyya, André Madeira, S. Muthukrishnan, Tao Ye. ICDE Workshops 2007, 654-663. Cited by 2Web SearchBibTeXDownload
179Query-Aware Sampling for Data Streams. Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck. ICDE Workshops 2007, 664-673. Cited by 1Web SearchBibTeXDownload
178Sequential Change Detection on Data Streams. S. Muthukrishnan, Eric van den Berg, Yihua Wu. ICDM Workshops 2007, 551-550. Cited by 4Web SearchBibTeXDownload
177DoWitcher: Effective Worm Detection and Containment in the Internet Core. Supranamaya Ranjan, Shaleen Shah, Antonio Nucci, Maurizio M. Munafň, Rene L. Cruz, S. Muthu Muthukrishnan. INFOCOM 2007, 2541-2545. Cited by 1Web SearchBibTeXDownload
176Estimating statistical aggregates on probabilistic data streams. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee. PODS 2007, 243-252. Cited by 33Web SearchBibTeXDownload
175Optimal suffix selection. Gianni Franceschini, S. Muthukrishnan. STOC 2007, 328-337. Cited by 2Web SearchBibTeXDownload
174Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. WINE 2007, 131-142. Cited by 13Web SearchBibTeXDownload
2006
173Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan. APPROX-RANDOM 2006, 316-326. Cited by 17Web SearchBibTeXDownload
172On the Complexity of Processing Massive, Unordered, Distributed Data. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. CoRR (abs/cs/0611108) (2006). Cited by 3Web SearchBibTeXDownload
171Budget Optimization in Search-Based Advertising Auctions. Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein. CoRR (abs/cs/0612052) (2006). Web SearchBibTeXDownload
170Estimating Aggregate Properties on Probabilistic Streams. Andrew McGregor, S. Muthukrishnan. CoRR (abs/cs/0612031) (2006). Cited by 1Web SearchBibTeXDownload
169Stochastic Models for Budget Optimization in Search-Based Advertising. S. Muthukrishnan, Martin Pál, Zoya Svitkina. CoRR (abs/cs/0612072) (2006). Cited by 13Web SearchBibTeXDownload
168Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan. ESA 2006, 304-314. Cited by 10Web SearchBibTeXDownload
167What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. Graham Cormode, S. Muthukrishnan, Wei Zhuang. ICDE 2006, 57. Cited by 26Web SearchBibTeXDownload
166Fractal Modeling of IP Network Traffic at Streaming Speeds. Flip Korn, S. Muthukrishnan, Yihua Wu. ICDE 2006, 155. Cited by 2Web SearchBibTeXDownload
165Space- and time-efficient deterministic algorithms for biased quantiles over data streams. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. PODS 2006, 263-272. Cited by 32Web SearchBibTeXDownload
164Modeling skew in data streams. Flip Korn, S. Muthukrishnan, Yihua Wu. SIGMOD Conference 2006, 181-192. Cited by 4Web SearchBibTeXDownload
163Combinatorial Algorithms for Compressed Sensing. Graham Cormode, S. Muthukrishnan. SIROCCO 2006, 280-294. Cited by 53Web SearchBibTeXDownload
162Sampling algorithms for l2 regression and applications. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan. SODA 2006, 1127-1136. Cited by 26Web SearchBibTeXDownload
161Estimating Entropy and Entropy Norm on Data Streams. Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan. STACS 2006, 196-205. Cited by 21Web SearchBibTeXDownload
160The Graham-Knowlton Problem Revisited. Navin Goyal, Sachin Lodha, S. Muthukrishnan. Theory Comput. Syst. (39): 399-412 (2006). Web SearchBibTeXDownload
159Bidding to the Top: VCG and Equilibria of Position-Based Auctions. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan. WAOA 2006, 15-28. Cited by 25Web SearchBibTeXDownload
158Compressing and searching XML data via two zips. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. WWW 2006, 751-760. Cited by 38Web SearchBibTeXDownload
2005
157What's hot and what's not: tracking most frequent items dynamically. Graham Cormode, S. Muthukrishnan. ACM Trans. Database Syst. (30): 249-278 (2005). Cited by 248Web SearchBibTeXDownload
156Streams, Security and Scalability. Theodore Johnson, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava. DBSec 2005, 1-15. Cited by 6Web SearchBibTeXDownload
155Efficient String Matching Algorithms for Combinatorial Universal Denoising. S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthukrishnan. DCC 2005, 153-162. Cited by 2Web SearchBibTeXDownload
154Workload-Optimal Histograms on Streams. S. Muthukrishnan, Martin Strauss, Xian Zheng. ESA 2005, 734-745. Cited by 6Web SearchBibTeXDownload
153Structuring labeled trees for optimal succinctness, and beyond. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan. FOCS 2005, 184-196. Cited by 60Web SearchBibTeXDownload
152Data Streams: Algorithms and Applications. S. Muthukrishnan. Foundations and Trends in Theoretical Computer Science (1) (2005). Cited by 482Web SearchBibTeXDownload
151Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. S. Muthukrishnan. FSTTCS 2005, 285-296. Cited by 22Web SearchBibTeXDownload
150Effective Computation of Biased Quantiles over Data Streams. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. ICDE 2005, 20-31. Cited by 20Web SearchBibTeXDownload
149MoDB: Database System for Synthesizing Human Motion. Timothy Edmunds, S. Muthukrishnan, Subarna Sadhukhan, Shinjiro Sueda. ICDE 2005, 1131-1132. Web SearchBibTeXDownload
148What's new: finding significant differences in network data streams. Graham Cormode, S. Muthukrishnan. IEEE/ACM Trans. Netw. (13): 1219-1232 (2005). Cited by 96Web SearchBibTeXDownload
147Domain-Driven Data Synopses for Dynamic Quantiles. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. IEEE Trans. Knowl. Data Eng. (17): 927-938 (2005). Cited by 6Web SearchBibTeXDownload
146Approximation algorithms for array partitioning problems. S. Muthukrishnan, Torsten Suel. J. Algorithms (54): 85-104 (2005). Cited by 15Web SearchBibTeXDownload
145An improved data stream summary: the count-min sketch and its applications. Graham Cormode, S. Muthukrishnan. J. Algorithms (55): 58-75 (2005). Cited by 244Web SearchBibTeXDownload
144Detecting malicious network traffic using inverse distributions of packet contents. Vijay Karamcheti, Davi Geiger, Zvi M. Kedem, S. Muthukrishnan. MineNet 2005, 165-170. Cited by 17Web SearchBibTeXDownload
143Parallel scheduling problems in next generation wireless networks. Luca Becchetti, Suhas N. Diggavi, Alberto Marchetti-Spaccamela, Alberto Marchetti-Spaccamela, Suhas N. Diggavi, Thyagarajan Nandagopal, Thyagarajan Nandagopal. Networks (45): 9-22 (2005). Cited by 7Web SearchBibTeXDownload
142Space efficient mining of multigraph streams. Graham Cormode, S. Muthukrishnan. PODS 2005, 271-282. Cited by 38Web SearchBibTeXDownload
141Editorial message: special track on data streams. Jesús S. Aguilar-Ruiz, Paul R. Cohen. SAC 2005, 553-554. Cited by 1Web SearchBibTeXDownload
140Summarizing and Mining Skewed Data Streams. Graham Cormode, S. Muthukrishnan. SDM 2005. Cited by 29Web SearchBibTeX
139Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles. Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, Rajeev Rastogi. SIGMOD Conference 2005, 25-36. Cited by 89Web SearchBibTeXDownload
138Sampling Algorithms in a Stream Operator. Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum. SIGMOD Conference 2005, 1-12. Cited by 44Web SearchBibTeXDownload
137The bin-covering technique for thresholding random geometric graph properties. S. Muthukrishnan, Gopal Pandurangan. SODA 2005, 989-998. Cited by 44Web SearchBibTeXDownload
136Improved range-summable random variable construction algorithms. A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss. SODA 2005, 840-849. Cited by 9Web SearchBibTeXDownload
135Substring compression problems. Graham Cormode, S. Muthukrishnan. SODA 2005, 321-330. Cited by 5Web SearchBibTeXDownload
13405291 Abstracts Collection -- Sublinear Algorithms. Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler. Sublinear Algorithms 2005. Web SearchBibTeXDownload
133A Heartbeat Mechanism and Its Application in Gigascope. Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck. VLDB 2005, 1079-1088. Cited by 25Web SearchBibTeXDownload
132Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. Graham Cormode, S. Muthukrishnan, Irina Rozenbaum. VLDB 2005, 25-36. Cited by 25Web SearchBibTeXDownload
2004
131Parallel two dimensional witness computation. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park. Inf. Comput. (188): 20-67 (2004). Cited by 4Web SearchBibTeXDownload
130What's New: Finding Significant Differences in Network Data Streams. Graham Cormode, S. Muthukrishnan. INFOCOM 2004. Web SearchBibTeXDownload
129Average stretch without migration. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan. J. Comput. Syst. Sci. (68): 80-95 (2004). Cited by 28Web SearchBibTeXDownload
128Approximation Algorithms for Average Stretch Scheduling. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman. J. Scheduling (7): 195-222 (2004). Cited by 11Web SearchBibTeXDownload
127Sublinear Methods for Detecting Periodic Trends in Data Streams. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. LATIN 2004, 16-28. Cited by 11Web SearchBibTeXDownload
126An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. Graham Cormode, S. Muthukrishnan. LATIN 2004, 29-38. Web SearchBibTeXDownload
125Online Scheduling to Minimize Average Stretch. S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke. SIAM J. Comput. (34): 433-452 (2004). Cited by 84Web SearchBibTeXDownload
124Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. SIGMOD Conference 2004, 155-166. Cited by 43Web SearchBibTeXDownload
123Holistic UDAFs at streaming speeds. Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava. SIGMOD Conference 2004, 35-46. Cited by 42Web SearchBibTeXDownload
122Mining Deviants in Time Series Data Streams. S. Muthukrishnan, Rahul Shah, Jeffrey Scott Vitter. SSDBM 2004, 41-50. Cited by 25Web SearchBibTeXDownload
121An efficient algorithm for sequence comparison with block reversals. S. Muthukrishnan, Süleyman Cenk Sahinalp. Theor. Comput. Sci. (321): 95-101 (2004). Cited by 2Web SearchBibTeXDownload
2003
120Estimating Dominance Norms of Multiple Data Streams. Graham Cormode, S. Muthukrishnan. ESA 2003, 148-160. Cited by 31Web SearchBibTeXDownload
119Comparing Sequences with Segment Rearrangements. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. FSTTCS 2003, 183-194. Cited by 17Web SearchBibTeXDownload
118Maintenance of Multidimensional Histograms. S. Muthukrishnan, Martin Strauss. FSTTCS 2003, 352-362. Cited by 11Web SearchBibTeXDownload
117Improved sparse approximation over quasiincoherent dictionaries. Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss. ICIP (1) 2003, 37-40. Cited by 27Web SearchBibTeX
116Comparing Data Streams Using Hamming Norms (How to Zero In). Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan. IEEE Trans. Knowl. Data Eng. (15): 529-540 (2003). Cited by 122Web SearchBibTeXDownload
115Efficient Approximation of Correlated Sums on Data Streams. Rohit Ananthakrishna, Abhinandan Das, Johannes Gehrke, Flip Korn, S. Muthukrishnan, Divesh Srivastava. IEEE Trans. Knowl. Data Eng. (15): 569-572 (2003). Cited by 18Web SearchBibTeXDownload
114One-Pass Wavelet Decompositions of Data Streams. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. IEEE Trans. Knowl. Data Eng. (15): 541-554 (2003). Cited by 70Web SearchBibTeXDownload
113Approximation algorithms for MAX-MIN tiling. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan. J. Algorithms (47): 122-134 (2003). Cited by 4Web SearchBibTeXDownload
112Two-dimensional substring indexing. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava. J. Comput. Syst. Sci. (66): 763-774 (2003). Cited by 22Web SearchBibTeXDownload
111Generalized substring selectivity estimation. Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan. J. Comput. Syst. Sci. (66): 98-132 (2003). Cited by 4Web SearchBibTeXDownload
110What's hot and what's not: tracking most frequent items dynamically. Graham Cormode, S. Muthukrishnan. PODS 2003, 296-306. Cited by 248Web SearchBibTeXDownload
109IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data. Flip Korn, S. Muthukrishnan, Yunyue Zhu. SIGMOD Conference 2003, 677. Cited by 3Web SearchBibTeXDownload
108Rangesum histograms. S. Muthukrishnan, Martin Strauss. SODA 2003, 233-242. Cited by 19Web SearchBibTeXDownload
107Data streams: algorithms and applications. S. Muthukrishnan. SODA 2003, 413-413. Web SearchBibTeXDownload
106Inferring tree topologies using flow tests. S. Muthukrishnan, Torsten Suel, Radek Vingralek. SODA 2003, 828-829. Cited by 3Web SearchBibTeXDownload
105Approximation of functions over redundant dictionaries using coherence. Anna C. Gilbert, S. Muthukrishnan, Martin Strauss. SODA 2003, 243-252. Cited by 87Web SearchBibTeXDownload
104Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases. Flip Korn, S. Muthukrishnan, Yunyue Zhu. VLDB 2003, 536-547. Cited by 12Web SearchBibTeXDownload
103Finding Hierarchical Heavy Hitters in Data Streams. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava. VLDB 2003, 464-475. Cited by 65Web SearchBibTeXDownload
2002
102Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
101Simple and Practical Sequence Nearest Neighbors with Block Operations. S. Muthukrishnan, Süleyman Cenk Sahinalp. CPM 2002, 262-278. Cited by 15Web SearchBibTeXDownload
100Estimating Rarity and Similarity over Data Stream Windows. Mayur Datar, S. Muthukrishnan. ESA 2002, 323-334. Cited by 56Web SearchBibTeXDownload
99Range Searching in Categorical Data: Colored Range Searching on Grid. Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan. ESA 2002, 17-28. Cited by 17Web SearchBibTeXDownload
98Static Optimality Theorem for External Memory String Access. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan. FOCS 2002, 219-227. Cited by 10Web SearchBibTeXDownload
97Histogramming Data Streams with Fast Per-Item Processing. Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss. ICALP 2002, 681-692. Cited by 55Web SearchBibTeXDownload
96Fast Mining of Massive Tabular Data via Approximate Distance Computations. Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan. ICDE 2002, 605-614. Cited by 24Web SearchBibTeXDownload
95An Adversarial Model for Distributed Dynamic Load Balancing. S. Muthukrishnan, Rajmohan Rajaraman. Journal of Interconnection Networks (3): 35-47 (2002). Cited by 22Web SearchBibTeXDownload
94An Improved Algorithm for Sequence Comparison with Block Reversals. S. Muthukrishnan, Süleyman Cenk Sahinalp. LATIN 2002, 319-325. Web SearchBibTeXDownload
93Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan. SIAM J. Discrete Math. (15): 252-267 (2002). Cited by 11Web SearchBibTeXDownload
92Mining database structure; or, how to build a data quality browser. Tamraparni Dasu, Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk. SIGMOD Conference 2002, 240-251. Cited by 89Web SearchBibTeXDownload
91Slice and dice: a simple, improved approximate tiling recipe. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan. SODA 2002, 455-464. Cited by 6Web SearchBibTeXDownload
90Improved algorithms for stretch scheduling. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman. SODA 2002, 762-771. Cited by 38Web SearchBibTeXDownload
89Efficient algorithms for document retrieval problems. S. Muthukrishnan. SODA 2002, 657-666. Cited by 66Web SearchBibTeXDownload
88Simple approximation algorithm for nonoverlapping local alignments. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan. SODA 2002, 677-678. Cited by 9Web SearchBibTeXDownload
87The string edit distance matching problem with moves. Graham Cormode, S. Muthukrishnan. SODA 2002, 667-676. Cited by 87Web SearchBibTeXDownload
86Parallel scheduling problems in next generation wireless networks. Luca Becchetti, Suhas N. Diggavi, Alberto Marchetti-Spaccamela, Alberto Marchetti-Spaccamela, Suhas N. Diggavi, Thyagarajan Nandagopal, Thyagarajan Nandagopal. SPAA 2002, 238-247. Cited by 7Web SearchBibTeXDownload
85Fast, small-space algorithms for approximate histogram maintenance. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. STOC 2002, 389-398. Cited by 204Web SearchBibTeXDownload
84Near-optimal sparse fourier representations via sampling. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss. STOC 2002, 152-161. Cited by 88Web SearchBibTeXDownload
83Comparing Data Streams Using Hamming Norms (How to Zero In). Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan. VLDB 2002, 335-345. Cited by 122Web SearchBibTeXDownload
82How to Summarize the Universe: Dynamic Maintenance of Quantiles. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. VLDB 2002, 454-465. Cited by 123Web SearchBibTeXDownload
81Reverse Nearest Neighbor Aggregates Over Data Streams. Flip Korn, S. Muthukrishnan, Divesh Srivastava. VLDB 2002, 814-825. Cited by 71Web SearchBibTeXDownload
2001
80Permutation Editing and Matching via Embeddings. Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp. ICALP 2001, 481-492. Cited by 11Web SearchBibTeXDownload
79Counting Twig Matches in a Tree. Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koudas, S. Muthukrishnan, Raymond T. Ng, Divesh Srivastava. ICDE 2001, 595-604. Cited by 117Web SearchBibTeXDownload
78Using q-grams in a DBMS for Approximate String Processing. Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Lauri Pietarinen, Divesh Srivastava. IEEE Data Eng. Bull. (24): 28-34 (2001). Cited by 61Web SearchBibTeXDownload
77Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami. J. Algorithms (41): 443-470 (2001). Cited by 29Web SearchBibTeXDownload
76Design issues in multimedia messaging for next generation wireless systems. Darin Nelson, S. Muthukrishnan. MobiDE 2001, 98-103. Cited by 3Web SearchBibTeXDownload
75Location based services in a wireless WAN using cellular digital packet data (CDPD). Rittwik Jana, Theodore Johnson, S. Muthukrishnan, Andrea Vitaletti. MobiDE 2001, 74-80. Cited by 15Web SearchBibTeXDownload
74Two-dimensional Substring Indexing. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava. PODS 2001. Web SearchBibTeXDownload
73Optimal and Approximate Computation of Summary Statistics for Range Aggregates. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. PODS 2001. Cited by 45Web SearchBibTeXDownload
72Improved approximation algorithms for rectangle tiling and packing. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami. SODA 2001, 427-436. Cited by 27Web SearchBibTeXDownload
71Internet packet filter management and rectangle geometry. David Eppstein, S. Muthukrishnan. SODA 2001, 827-835. Cited by 119Web SearchBibTeXDownload
70Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss. VLDB 2001, 79-88. Cited by 310Web SearchBibTeXDownload
69Approximate String Joins in a Database (Almost) for Free. Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava. VLDB 2001, 491-500. Cited by 247Web SearchBibTeXDownload
2000
68Internet Packet Filter Management and Rectangle Geometry. David Eppstein, S. Muthukrishnan. CoRR (cs.CG/0010018) (2000). Web SearchBibTeXDownload
67Quadtree-structured variable-size block-matching motion estimation with minimal error. Injong Rhee, Graham R. Martin, S. Muthukrishnan, Roger A. Packwood. IEEE Trans. Circuits Syst. Video Techn. (10): 42-50 (2000). Cited by 51Web SearchBibTeXDownload
66Tradeoffs for Packet Classification. Anja Feldmann, S. Muthukrishnan. INFOCOM 2000, 1193-1202. Cited by 261Web SearchBibTeXDownload
65Layered Multicast Recovery. Injong Rhee, Srinath R. Joshi, Minsuk Lee, S. Muthukrishnan, Volkan Ozdemir. INFOCOM 2000, 805-813. Cited by 25Web SearchBibTeXDownload
64Scalable, Low-Overhead Network Delay Estimation. Volkan Ozdemir, S. Muthukrishnan, Injong Rhee. INFOCOM 2000, 1343-1350. Cited by 14Web SearchBibTeXDownload
63On the sorting-complexity of suffix tree construction. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan. J. ACM (47): 987-1011 (2000). Cited by 96Web SearchBibTeXDownload
62Simple Optimal Parallel Multiple Pattern Matching. S. Muthukrishnan. J. Algorithms (34): 1-13 (2000). Web SearchBibTeXDownload
61Selectivity Estimation for Boolean Queries. Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan. PODS 2000, 216-225. Cited by 41Web SearchBibTeX
60Optimal Histograms for Hierarchical Range Queries. Nick Koudas, S. Muthukrishnan, Divesh Srivastava. PODS 2000, 196-204. Cited by 52Web SearchBibTeX
59Influence Sets Based on Reverse Nearest Neighbor Queries. Flip Korn, S. Muthukrishnan. SIGMOD Conference 2000, 201-212. Cited by 165Web SearchBibTeX
58Scheduling to minimize average stretch without migration. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan. SODA 2000, 548-557. Web SearchBibTeXDownload
57Engineering the compression of massive tables: an experimental approach. Adam L. Buchsbaum, Donald F. Caldwell, Kenneth Ward Church, Glenn S. Fowler, S. Muthukrishnan. SODA 2000, 175-184. Cited by 50Web SearchBibTeXDownload
56Minimizing maximum response time in scheduling broadcasts. Yair Bartal, S. Muthukrishnan. SODA 2000, 558-559. Cited by 43Web SearchBibTeXDownload
55On the temporal HZY compression scheme. Z. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv. SODA 2000, 185-186. Cited by 1Web SearchBibTeXDownload
54Approximate nearest neighbors and sequence comparison with block operations. S. Muthukrishnan, Süleyman Cenk Sahinalp. STOC 2000, 416-424. Cited by 67Web SearchBibTeXDownload
53Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. Piotr Indyk, Nick Koudas, S. Muthukrishnan. VLDB 2000, 363-372. Cited by 113Web SearchBibTeX
1999
52Online Scheduling to Minimize Average Stretch. S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke. FOCS 1999, 433-442. Cited by 84Web SearchBibTeXDownload
51On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. S. Muthukrishnan, Viswanath Poosala, Torsten Suel. ICDT 1999, 236-256. Cited by 93Web SearchBibTeXDownload
50Efficient Sequencing Tape-Resident Jobs. Sachin More, S. Muthukrishnan, Elizabeth A. M. Shriver. PODS 1999, 33-43. Cited by 7Web SearchBibTeX
49Tight Analyses of Two Local Load Balancing Algorithms. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman. SIAM J. Comput. (29): 29-64 (1999). Web SearchBibTeXDownload
48Compact Grid Layouts of Multi-Level Networks. S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp, Torsten Suel. STOC 1999, 455-463. Cited by 21Web SearchBibTeXDownload
47Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. Paolo Ferragina, S. Muthukrishnan, Mark de Berg. STOC 1999, 483-491. Cited by 20Web SearchBibTeXDownload
46Mining Deviants in a Time Series Database. H. V. Jagadish, Nick Koudas, S. Muthukrishnan. VLDB 1999, 102-113. Cited by 87Web SearchBibTeX
1998
45Augmenting Suffix Trees, with Applications. Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv. ESA 1998, 67-78. Cited by 14Web SearchBibTeXDownload
44Overcoming the Memory Bottleneck in Suffix Tree Construction. Martin Farach, Paolo Ferragina, S. Muthukrishnan. FOCS 1998, 174-185. Cited by 67Web SearchBibTeXDownload
43Randomization in Parallel Stringology. S. Muthukrishnan. IPPS/SPDP Workshops 1998, 361-362. Web SearchBibTeXDownload
42Scheduling On-Demand Broadcasts: New Metrics and Algorithms. Swarup Acharya, S. Muthukrishnan. MOBICOM 1998, 43-54. Cited by 211Web SearchBibTeXDownload
41Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. S. Muthukrishnan, Torsten Suel. RANDOM 1998, 369-384. Cited by 5Web SearchBibTeXDownload
40A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter. SIAM J. Comput. (27): 668-681 (1998). Cited by 10Web SearchBibTeXDownload
39On Approximating Rectangle Tiling and Packing. Sanjeev Khanna, S. Muthukrishnan, Mike Paterson. SODA 1998, 384-393. Cited by 65Web SearchBibTeXDownload
38Flow and Stretch Metrics for Scheduling Continuous Job Streams. Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan. SODA 1998, 270-279. Cited by 170Web SearchBibTeXDownload
37An Adversarial Model for Distributed Dynamic Load Balancing. S. Muthukrishnan, Rajmohan Rajaraman. SPAA 1998, 47-54. Cited by 22Web SearchBibTeXDownload
36Layout of the Batcher Bitonic Sorter (Extended Abstract). Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp. SPAA 1998, 172-181. Cited by 10Web SearchBibTeXDownload
35First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing. S. Muthukrishnan, Bhaskar Ghosh, Martin H. Schultz. Theory Comput. Syst. (31): 331-354 (1998). Cited by 78Web SearchBibTeXDownload
34Optimal Histograms with Quality Guarantees. H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Viswanath Poosala, Kenneth C. Sevcik, Torsten Suel. VLDB 1998, 275-286. Cited by 272Web SearchBibTeX
1997
33Detecting False Matches in String-Matching Algorithms. S. Muthukrishnan. Algorithmica (18): 512-520 (1997). Cited by 5Web SearchBibTeXDownload
32Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh. FSTTCS 1997, 37-53. Cited by 7Web SearchBibTeXDownload
31Efficient Array Partitioning. Sanjeev Khanna, S. Muthukrishnan, Steven Skiena. ICALP 1997, 616-626. Cited by 33Web SearchBibTeXDownload
30Algorithms for an FPGA switch module routing problem with application to global routing. Shashidhar Thakur, Yao-Wen Chang, Martin D. F. Wong, S. Muthukrishnan. IEEE Trans. on CAD of Integrated Circuits and Systems (16): 32-46 (1997). Cited by 18Web SearchBibTeXDownload
29Optimal Parallel Randomized Renaming. Martin Farach, S. Muthukrishnan. Inf. Process. Lett. (61): 7-10 (1997). Cited by 2Web SearchBibTeXDownload
28Engineering Diffusive Load Balancing Algorithms Using Experiments. Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam. IRREGULAR 1997, 111-122. Cited by 30Web SearchBibTeXDownload
27Hardness of Flip-Cut Problems from Optical Mapping. Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan. Journal of Computational Biology (4): 119-126 (1997). Web SearchBibTeX
26Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Sridhar Hannenhalli, Martin Farach, S. Muthukrishnan, Steven Skiena. Journal of Computational Biology (4): 275-296 (1997). Web SearchBibTeX
25Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. S. Muthukrishnan, Laxmi Parida. RECOMB 1997, 209-219. Web SearchBibTeXDownload
24Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model. Richa Agarwala, Serafim Batzoglou, Vlado Dancík, Scott E. Decatur, Martin Farach, Sridhar Hannenhalli, S. Muthukrishnan, Steven Skiena. RECOMB 1997, 1-2. Web SearchBibTeXDownload
1996
23Perfect Hashing for Strings: Formalization and Algorithms. Martin Farach, S. Muthukrishnan. CPM 1996, 130-140. Cited by 9Web SearchBibTeXDownload
22Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). Paolo Ferragina, S. Muthukrishnan. ESA 1996, 107-120. Cited by 21Web SearchBibTeXDownload
21Optimal Logarithmic Time Randomized Suffix Tree Construction. Martin Farach, S. Muthukrishnan. ICALP 1996, 550-561. Cited by 34Web SearchBibTeXDownload
20Dynamic Load Balancing by Random Matchings. Bhaskar Ghosh, S. Muthukrishnan. J. Comput. Syst. Sci. (53): 357-370 (1996). Web SearchBibTeXDownload
19Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). S. Muthukrishnan, Martin Müller. SODA 1996, 42-51. Cited by 19Web SearchBibTeXDownload
18Resource Scheduling for Parallel Database and Scientific Applications. Soumen Chakrabarti, S. Muthukrishnan. SPAA 1996, 329-335. Cited by 29Web SearchBibTeX
17First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract). Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz. SPAA 1996, 72-81. Web SearchBibTeX
1995
16New Results and Open Problems Related to Non-Standard Stringology. S. Muthukrishnan. CPM 1995, 298-317. Cited by 39Web SearchBibTeXDownload
15Computing Similarity between RNA Strings. Vineet Bafna, S. Muthukrishnan, R. Ravi. CPM 1995, 1-16. Cited by 89Web SearchBibTeXDownload
14String Matching Under a General Matching Relation. S. Muthukrishnan, H. Ramesh. Inf. Comput. (122): 140-148 (1995). Cited by 27Web SearchBibTeXDownload
13Optimal Parallel Dictionary Matching and Compression (Extended Abstract). Martin Farach, S. Muthukrishnan. SPAA 1995, 244-253. Cited by 20Web SearchBibTeXDownload
12Tight analyses of two local load balancing algorithms. Bhaskar Ghosh, Frank Thomson Leighton, Bruce M. Maggs, S. Muthukrishnan, C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa, Robert Endre Tarjan, David Zuckerman. STOC 1995, 548-558. Cited by 74Web SearchBibTeXDownload
1994
11Algorithms for a switch module routing problem. Shashidhar Thakur, D. F. Wong, S. Muthukrishnan. EURO-DAC 1994, 265-270. Cited by 3Web SearchBibTeXDownload
10Optimal Parallel Algorithms for Prefix Matching. Ramesh Hariharan, S. Muthukrishnan. ICALP 1994, 203-214. Cited by 7Web SearchBibTeXDownload
9Alphabet Dependence in Parameterized Matching. Amihood Amir, Martin Farach, S. Muthukrishnan. Inf. Process. Lett. (49): 111-115 (1994). Cited by 54Web SearchBibTeXDownload
8On Optimal Strategies for Searching in Presence of Errors. S. Muthukrishnan. SODA 1994, 680-689. Cited by 27Web SearchBibTeXDownload
7Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). Bhaskar Ghosh, S. Muthukrishnan. SPAA 1994, 226-235. Cited by 100Web SearchBibTeXDownload
6Non-standard stringology: algorithms and complexity. S. Muthukrishnan, Krishna V. Palem. STOC 1994, 770-779. Cited by 30Web SearchBibTeXDownload
1993
5Detecting False Matches in String Matching Algorithms. S. Muthukrishnan. CPM 1993, 164-178. Web SearchBibTeXDownload
4Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter. FOCS 1993, 248-258. Cited by 43Web SearchBibTeXDownload
3Highly Efficient Dictionary Matching in Parallel. S. Muthukrishnan, Krishna V. Palem. SPAA 1993, 69-78. Cited by 9Web SearchBibTeXDownload
1992
2String Matching Under a General Matching Relation. S. Muthukrishnan, H. Ramesh. FSTTCS 1992, 356-367. Cited by 27Web SearchBibTeXDownload
1984
1Refinements in energy economic modeling for policy purposes. Russell G. Thompson, John C. Stone, S. Muthukrishnan, A. N. Halter. Computers & OR (11): 67-90 (1984). Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - SIGMOD Program Committee - Retrieved 2009-11-21 - details
2. ^ ACM SIGMOD/PODS 2007 Conference - Retrieved 2010-12-11 - details
3. ^ Untitled Document - Retrieved 2011-06-30 - details
4. ^ ICDE 2005 Program Committee - Retrieved 2012-01-19 - details
5. ^ Dr. Bhaskar DasGupta's seminar - Retrieved 2009-11-20 - details
6. ^ Dr. Bhaskar DasGupta's seminar - Retrieved 2010-06-12 - details
7. ^ Computer Science Colloquium - NYU Computer Science Department - Retrieved 2011-04-23 - details
8. ^ Scheduled Talks: Fall 2005 - NYU Computer Science Department - Retrieved 2011-04-23 - details
9. ^ VLDB 2002 Conference Program - Retrieved 2012-01-20 - details
10. ^ VLDB2010 Spore : Program 16 Sept - Retrieved 2012-01-22 - details
11. ^ VLDB2010 Spore : Proceedings-Tutorials - Retrieved 2012-01-22 - details
12. ^ Untitled Document - Retrieved 2011-06-30 - details
13. ^ SIGMOD/PODS 2003 Conference - Retrieved 2011-03-19 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research