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