Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Muthukrishnan 0001
S. Muthu Muthukrishnan – Shan Muthu Muthukrishnan
Person information
- affiliation: Rutgers University, Department of Computer Science, Piscataway, NJ, USA
- affiliation: Google Inc., New York, NY, USA
- affiliation: DIMACS, Piscataway, NJ, USA
- affiliation: AT&T Shannon Laboratories, Florham Park, NJ, USA
- affiliation: Bell Laboratories, Murray Hill, NJ, USA
- affiliation: University of Warwick, Department of Computer Science, UK
- affiliation (PhD): New York University, Courant Institute of Mathematical Sciences, NY, USA
Other persons with the same name
- S. Muthukrishnan — disambiguation page
- S. Muthukrishnan 0002 — Aloy Labs, Bangalore, India
- S. Muthukrishnan 0003 — Texas Instruments, Inc., Houston, TX, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j69]Ori Rottenstreich
, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions. IEEE Trans. Netw. Serv. Manag. 18(3): 3662-3676 (2021)- [c227]Yikun Xian, Handong Zhao, Tak Yeon Lee, Sungchul Kim, Ryan A. Rossi, Zuohui Fu, Gerard de Melo, S. Muthukrishnan:
EXACTA: Explainable Column Annotation. KDD 2021: 3775-3785 - [c226]Yikun Xian, Tong Zhao, Jin Li, Jim Chan, Andrey Kan, Jun Ma, Xin Luna Dong, Christos Faloutsos, George Karypis, S. Muthukrishnan, Yongfeng Zhang:
EX3: Explainable Attribute-aware Item-set Recommendations. RecSys 2021: 484-494 - 2020
- [c225]Yikun Xian, Zuohui Fu, Handong Zhao, Yingqiang Ge, Xu Chen, Qiaoying Huang, Shijie Geng, Zhou Qin, Gerard de Melo, S. Muthukrishnan, Yongfeng Zhang:
CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation. CIKM 2020: 1645-1654 - [c224]Rob Harrison, Shir Landau Feibish, Arpit Gupta, Ross Teixeira, S. Muthukrishnan, Jennifer Rexford:
Carpe Elephants: Seize the Global Heavy Hitters. SPIN@SIGCOMM 2020: 15-21 - [c223]Ori Rottenstreich, Pedro Reviriego, Ely Porat, S. Muthukrishnan:
Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone. SOSR 2020: 135-145 - [i57]Yikun Xian, Zuohui Fu, Qiaoying Huang, S. Muthukrishnan, Yongfeng Zhang:
Neural-Symbolic Reasoning over Knowledge Graph for Multi-stage Explainable Recommendation. CoRR abs/2007.13207 (2020) - [i56]Yikun Xian, Zuohui Fu, Handong Zhao, Yingqiang Ge, Xu Chen, Qiaoying Huang, Shijie Geng, Zhou Qin, Gerard de Melo, S. Muthukrishnan, Yongfeng Zhang:
CAFE: Coarse-to-Fine Neural Symbolic Reasoning for Explainable Recommendation. CoRR abs/2010.15620 (2020)
2010 – 2019
- 2019
- [c222]Yikun Xian, Zuohui Fu, S. Muthukrishnan, Gerard de Melo, Yongfeng Zhang:
Reinforcement Knowledge Graph Reasoning for Explainable Recommendation. SIGIR 2019: 285-294 - [i55]Branislav Kveton, Saied Mahdian, S. Muthukrishnan, Zheng Wen, Yikun Xian:
Waterfall Bandits: Learning to Sell Ads Online. CoRR abs/1904.09404 (2019) - [i54]Yikun Xian, Zuohui Fu, S. Muthukrishnan, Gerard de Melo, Yongfeng Zhang:
Reinforcement Knowledge Graph Reasoning for Explainable Recommendation. CoRR abs/1906.05237 (2019) - 2018
- [c221]Chaolun Xia, S. Muthukrishnan:
Arbitrage-free Pricing in User-based Markets. AAMAS 2018: 327-335 - [c220]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. KDD 2018: 1685-1694 - [c219]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu, Yikun Xian:
Finding Subcube Heavy Hitters in Analytics Data Streams. WWW 2018: 1705-1714 - [i53]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. CoRR abs/1804.10488 (2018) - 2017
- [c218]Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan:
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. ESA 2017: 29:1-29:15 - [c217]Chaolun Xia, S. Muthukrishnan:
Revenue-Maximizing Stable Pricing in Online Labor Markets. HCOMP 2017: 216-225 - [c216]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. ICALP 2017: 131:1-131:14 - [c215]Priya Govindan, Morteza Monemizadeh, S. Muthukrishnan:
Streaming Algorithms for Measuring H-Impact. PODS 2017: 337-346 - [c214]Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, Jennifer Rexford:
Heavy-Hitter Detection Entirely in the Data Plane. SOSR 2017: 164-176 - [i52]Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler:
Testable Bounded Degree Graph Properties Are Random Order Streamable. CoRR abs/1707.07334 (2017) - [i51]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu:
Finding Subcube Heavy Hitters in Data Streams. CoRR abs/1708.05159 (2017) - [i50]Branislav Kveton, Csaba Szepesvári, Anup Rao, Zheng Wen, Yasin Abbasi-Yadkori, S. Muthukrishnan:
Stochastic Low-Rank Bandits. CoRR abs/1712.04644 (2017) - 2016
- [j68]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
40 years of suffix trees. Commun. ACM 59(4): 66-73 (2016) - [j67]Chaolun Xia, Saikat Guha, S. Muthukrishnan:
How Much is Your Attention Worth?: Analysis of Prices in LinkedIn Advertising Network - Short talk. SIGMETRICS Perform. Evaluation Rev. 44(3): 38 (2016) - [c213]Qiang Ma, Han Hee Song, S. Muthukrishnan, Antonio Nucci:
Joining user profiles across online social networks: From the perspective of an adversary. ASONAM 2016: 178-185 - [c212]Chaolun Xia, Saikat Guha, S. Muthukrishnan:
Targeting algorithms for online social advertising markets. ASONAM 2016: 485-492 - [c211]Aaron Cahn, Scott Alfeld, Paul Barford, S. Muthukrishnan:
What's in the community cookie jar? ASONAM 2016: 567-570 - [c210]Qiang Ma, S. Muthukrishnan, William Simpson:
App2Vec: Vector modeling of mobile apps and applications. ASONAM 2016: 599-606 - [c209]Darja Krushevskaja, William Simpson, S. Muthukrishnan:
Ad allocation with secondary metrics. IEEE BigData 2016: 1202-1211 - [c208]Aman Gupta, S. Muthukrishnan, Smita Wadhwa:
Optimizing callout in unified ad markets. IEEE BigData 2016: 1315-1321 - [c207]Branislav Kveton, Hung Bui, Mohammad Ghavamzadeh, Georgios Theocharous, S. Muthukrishnan, Siqi Sun:
Graphical Model Sketch. ECML/PKDD (1) 2016: 81-97 - [c206]Aaron Cahn, Scott Alfeld, Paul Barford, S. Muthukrishnan:
An Empirical Study of Web Cookies. WWW 2016: 891-901 - [p2]S. Muthukrishnan, Martin Strauss:
Approximate Histogram and Wavelet Summaries of Streaming Data. Data Stream Management 2016: 263-281 - [i49]Branislav Kveton, Hung Bui, Mohammad Ghavamzadeh, Georgios Theocharous, S. Muthukrishnan, Siqi Sun:
Graphical Model Sketch. CoRR abs/1602.03105 (2016) - [i48]Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan:
The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. CoRR abs/1608.03118 (2016) - [i47]Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, Jennifer Rexford:
Smoking Out the Heavy-Hitter Flows with HashPipe. CoRR abs/1611.04825 (2016) - 2015
- [j66]Mangesh Gupte, Darja Krushevskaja, S. Muthukrishnan:
Analyses of Cardinal Auctions. Algorithmica 71(4): 889-903 (2015) - 2014
- [j65]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. Manag. Sci. 60(12): 2886-2907 (2014) - [j64]Swati Rallapalli, Qiang Ma, Han Hee Song, Mario Baldi, S. Muthukrishnan, Lili Qiu:
Modeling the value of information granularity in targeted advertising. SIGMETRICS Perform. Evaluation Rev. 41(4): 42-45 (2014) - [c205]Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Large-Scale Optimistic Adaptive Submodularity. AAAI 2014: 1816-1823 - [c204]S. Muthukrishnan:
The Sublinear Approach to Big Data Problems. COMAD 2014: 3 - [c203]Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan:
Budget Feasible Mechanisms for Experimental Design. LATIN 2014: 719-730 - [c202]Smriti Bhagat, Anthony Kim, S. Muthukrishnan, Udi Weinsberg:
The Shapley Value in Knapsack Budgeted Games. WINE 2014: 106-119 - [c201]Paul Barford, Igor Canadi, Darja Krushevskaja, Qiang Ma, S. Muthukrishnan:
Adscape: harvesting and analyzing online display ads. WWW 2014: 597-608 - [c200]Qiang Ma, S. Muthukrishnan, Brian Thompson, Graham Cormode:
Modeling collaboration in academia: a game theoretic approach. WWW (Companion Volume) 2014: 1177-1182 - [c199]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
People like us: mining scholarly data for comparable researchers. WWW (Companion Volume) 2014: 1227-1232 - [i46]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
People Like Us: Mining Scholarly Data for Comparable Researchers. CoRR abs/1403.2941 (2014) - [i45]Paul Barford, Igor Canadi, Darja Krushevskaja, Qiang Ma, S. Muthukrishnan:
Adscape: Harvesting and Analyzing Online Display Ads. CoRR abs/1407.0788 (2014) - [i44]Qiang Ma, S. Muthukrishnan, Mark Sandler:
Frugal Streaming for Estimating Quantiles: One (or two) memory suffices. CoRR abs/1407.1121 (2014) - [i43]Graham Cormode, Qiang Ma, S. Muthukrishnan, Brian Thompson:
Modeling Collaboration in Academia: A Game Theoretic Approach. CoRR abs/1407.2220 (2014) - [i42]Smriti Bhagat, Anthony Kim, S. Muthukrishnan, Udi Weinsberg:
The Shapley Value in Knapsack Budgeted Games. CoRR abs/1409.5200 (2014) - 2013
- [j63]Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. Algorithmica 65(3): 634-661 (2013) - [j62]Graham Cormode, Qiang Ma, S. Muthukrishnan, Brian Thompson:
Socializing the h-index. J. Informetrics 7(3): 718-721 (2013) - [c198]Qiang Ma, S. Muthukrishnan, Mark Sandler:
Frugal Streaming for Estimating Quantiles. Space-Efficient Data Structures, Streams, and Algorithms 2013: 77-96 - [c197]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
First author advantage: citation labeling in research. CompSci@CIKM 2013: 13-18 - [c196]Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan:
Forty Years of Text Indexing. CPM 2013: 1-10 - [c195]Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov:
Nearly Optimal Private Convolution. ESA 2013: 445-456 - [c194]Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private decayed predicate sums on streams. ICDT 2013: 284-295 - [c193]Darja Krushevskaja, S. Muthukrishnan:
Market Approach to Social Ads: The MyLikes Example and Related Problems. ISAAC 2013: 1-10 - [c192]Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Adaptive Submodular Maximization in Bandit Setting. NIPS 2013: 2697-2705 - [c191]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
A Time and Space Efficient Algorithm for Contextual Linear Bandits. ECML/PKDD (1) 2013: 257-272 - [e4]S. Muthu Muthukrishnan, Amr El Abbadi, Balachander Krishnamurthy:
Conference on Online Social Networks, COSN'13, Boston, MA, USA, October 7-8, 2013. ACM 2013, ISBN 978-1-4503-2084-9 [contents] - [i41]Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov:
Nearly Optimal Private Convolution. CoRR abs/1301.6447 (2013) - [i40]Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan:
Budget Feasible Mechanisms for Experimental Design. CoRR abs/1302.5724 (2013) - [i39]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
First Author Advantage: Citation Labeling in Research. CoRR abs/1310.1968 (2013) - [i38]Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
A Consensus-Focused Group Recommender System. CoRR abs/1312.7076 (2013) - 2012
- [j61]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Continuous sampling from distributed streams. J. ACM 59(2): 10:1-10:25 (2012) - [j60]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
Studying the source code of scientific research. SIGKDD Explor. 14(2): 59-62 (2012) - [j59]Graham Cormode, S. Muthu Muthukrishnan:
Approximating Data with the Count-Min Sketch. IEEE Softw. 29(1): 64-69 (2012) - [c190]Graham Cormode, S. Muthukrishnan, Jinyun Yan:
Scienceography: The Study of How Science Is Written. FUN 2012: 379-391 - [c189]Michael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung:
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions. ICALP (1) 2012: 738-749 - [c188]Lu Han, Magdalena Punceva, Badri Nath, S. Muthukrishnan, Liviu Iftode:
SocialCDN: Caching techniques for distributed social networks. P2P 2012: 191-202 - [c187]S. Muthukrishnan, Aleksandar Nikolov:
Optimal private halfspace counting via discrepancy. STOC 2012: 1285-1292 - [c186]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan:
Budget Optimization for Online Campaigns with Positive Carryover Effects. WINE 2012: 86-99 - [c185]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
Group recommendations via multi-armed bandits. WWW (Companion Volume) 2012: 463-464 - [i37]Graham Cormode, S. Muthukrishnan, Jinyun Yun:
Scienceography: the study of how science is written. CoRR abs/1202.2638 (2012) - [i36]S. Muthukrishnan, Aleksandar Nikolov:
Optimal Private Halfspace Counting via Discrepancy. CoRR abs/1203.5453 (2012) - [i35]Yishay Mansour, S. Muthukrishnan, Noam Nisan:
Doubleclick Ad Exchange Auction. CoRR abs/1204.0535 (2012) - [i34]Mangesh Gupte, Darja Krushevskaja, S. Muthukrishnan:
Analyses of Cardinal Auctions. CoRR abs/1205.2740 (2012) - [i33]José Bento, Stratis Ioannidis, S. Muthukrishnan, Jinyun Yan:
A Time and Space Efficient Algorithm for Contextual Linear Bandits. CoRR abs/1207.3024 (2012) - [i32]Graham Cormode, Qiang Ma, S. Muthukrishnan, Brian Thompson:
Socializing the h-index. CoRR abs/1211.7133 (2012) - [i31]Graham Cormode, S. Muthukrishnan, Ke Yi:
Large-Scale Distributed Computation (NII Shonan Meeting 2012-1). NII Shonan Meet. Rep. 2012 (2012) - 2011
- [j58]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, Tamás Sarlós:
Faster least squares approximation. Numerische Mathematik 117(2): 219-249 (2011) - [j57]Graham Cormode, S. Muthukrishnan, Ke Yi:
Algorithms for distributed functional monitoring. ACM Trans. Algorithms 7(2): 21:1-21:20 (2011) - [c184]Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright:
Pan-private algorithms via statistics on sketches. PODS 2011: 37-48 - [c183]S. Muthukrishnan:
Theory of data stream computing: where to go. PODS 2011: 317-319 - [c182]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield optimization of display advertising with ad exchange. EC 2011: 27-28 - [c181]Lu Han, Badri Nath, Liviu Iftode, S. Muthukrishnan:
Social Butterfly: Social Caches for Distributed Social Networks. SocialCom/PASSAT 2011: 81-86 - [c180]Mangesh Gupte, Pravin Shankar, Jing Li, S. Muthukrishnan, Liviu Iftode:
Finding hierarchy in directed online social networks. WWW 2011: 557-566 - [p1]Smriti Bhagat, Graham Cormode, S. Muthukrishnan:
Node Classification in Social Networks. Social Network Data Analytics 2011: 115-148 - [i30]Smriti Bhagat, Graham Cormode, S. Muthukrishnan:
Node Classification in Social Networks. CoRR abs/1101.3291 (2011) - [i29]Santiago R. Balseiro, Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan:
Yield Optimization of Display Advertising with Ad Exchange. CoRR abs/1102.2551 (2011) - [i28]Jean Bolot, Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov, Nina Taft:
Private Decayed Sum Estimation under Continual Observation. CoRR abs/1108.6123 (2011) - [i27]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection. CoRR abs/1110.3381 (2011) - 2010
- [j56]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. Algorithmica 58(4): 1022-1044 (2010) - [j55]S. Muthukrishnan, Gopal Pandurangan:
Thresholding random geometric graph properties motivated by ad hoc sensor networks. J. Comput. Syst. Sci. 76(7): 686-696 (2010) - [j54]S. Muthukrishnan:
Data Management and Mining in Internet Ad Systems. Proc. VLDB Endow. 3(2): 1655-1656 (2010) - [j53]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Periodicity testing with sublinear samples and space. ACM Trans. Algorithms 6(2): 43:1-43:14 (2010) - [j52]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4): 66:1-66:19 (2010) - [c179]S. Muthukrishnan:
Data Mining Problems in Internet Ad Systems. COMAD 2010: 9 - [c178]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. LATIN 2010: 565-576 - [c177]Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang:
Optimal sampling from distributed streams. PODS 2010: 77-86 - [c176]Jon Feldman, Vahab S. Mirrokni, S. Muthukrishnan, Mallesh M. Pai:
Auctions with intermediaries: extended abstract. EC 2010: 23-32 - [c175]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Selective Call Out and Real Time Bidding. WINE 2010: 145-157 - [c174]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions. WINE 2010: 158-169 - [c173]Nikolay Archak, Vahab S. Mirrokni, S. Muthukrishnan:
Mining advertiser-specific user behavior using adfactors. WWW 2010: 31-40 - [c172]Mark Sandler, S. Muthukrishnan:
Monitoring algorithms for negative feedback systems. WWW 2010: 871-880 - [i26]Bhaskar DasGupta, S. Muthukrishnan:
Stochastic Budget Optimization in Internet Advertising. CoRR abs/1001.2735 (2010) - [i25]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Selective Call Out and Real Time Bidding. CoRR abs/1002.3102 (2010) - [i24]Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions. CoRR abs/1008.1616 (2010) - [i23]Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright:
Pan-private Algorithms: When Memory Does Not Help. CoRR abs/1009.1544 (2010)
2000 – 2009
- 2009
- [j51]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan:
Compressing and indexing labeled trees, with applications. J. ACM 57(1): 4:1-4:33 (2009) - [j50]S. Muthukrishnan:
AdX: a model for ad exchanges. SIGecom Exch. 8(2): 9 (2009) - [c171]S. Muthukrishnan:
Bidding on Configurations in Internet Ad Auctions. COCOON 2009: 1-6 - [c170]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. FOCS 2009: 117-126 - [c169]André Madeira, S. Muthukrishnan:
Functionally Private Approximations of Negligibly-Biased Estimators. FSTTCS 2009: 323-334 - [c168]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 - [c167]S. Muthukrishnan:
Stochastic Data Streams. MFCS 2009: 55 - [c166]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pál:
An online mechanism for ad slot reservations with cancellations. SODA 2009: 1265-1274 - [c165]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468 - [c164]S. Muthukrishnan:
Ad Exchanges: Research Issues. WINE 2009: 1-12 - [c163]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál:
Online Ad Assignment with Free Disposal. WINE 2009: 374-385 - [c162]Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan, Yishay Mansour, Uri Nadav:
Bid optimization for broad match ad auctions. WWW 2009: 231-240 - [c161]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General auction mechanism for search advertising. WWW 2009: 241-250 - [i22]Eyal Even-Dar, Yishay Mansour, Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Bid Optimization in Broad-Match Ad Auctions. CoRR abs/0901.3754 (2009) - [i21]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal cache-aware suffix selection. CoRR abs/0902.1737 (2009) - [i20]Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, S. Muthukrishnan:
Online Stochastic Matching: Beating 1-1/e. CoRR abs/0905.4100 (2009) - [i19]Vahab S. Mirrokni, S. Muthukrishnan, Uri Nadav:
Quasi-Proportional Mechanisms: Prior-free Revenue Maximization. CoRR abs/0909.5365 (2009) - 2008
- [j49]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan:
Relative-Error CUR Matrix Decompositions. SIAM J. Matrix Anal. Appl. 30(2): 844-881 (2008) - [j48]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) - [j47]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 Rec. 37(1): 34-38 (2008) - [j46]Zhivko Prodanov Nedev, S. Muthukrishnan:
The Magnus-Derek game. Theor. Comput. Sci. 393(1-3): 124-132 (2008) - [j45]Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Finding hierarchical heavy hitters in streaming data. ACM Trans. Knowl. Discov. Data 1(4): 2:1-2:48 (2008) - [j44]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. ACM Trans. Database Syst. 33(4): 26:1-26:30 (2008) - [c160]Sariel Har-Peled, S. Muthukrishnan:
Range Medians. ESA 2008: 503-514 - [c159]Gagan Aggarwal, S. Muthukrishnan:
Theory of Sponsored Search Auctions. FOCS 2008: 7 - [c158]S. Muthukrishnan:
Internet Ad Auctions: Insights and Directions. ICALP (1) 2008: 14-23 - [c157]Graham Cormode, Flip Korn, S. Muthukrishnan, Yihua Wu:
On Signatures for Communication Graphs. ICDE 2008: 189-198 - [c156]Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck:
Query-Aware Partitioning for Monitoring Massive Network Data Streams. ICDE 2008: 1528-1530 - [c155]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál:
A Truthful Mechanism for Offline Ad Slot Scheduling. SAGT 2008: 182-193 - [c154]Theodore Johnson, S. Muthu Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck:
Query-aware partitioning for monitoring massive network data streams. SIGMOD Conference 2008: 1135-1146 - [c153]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. SODA 2008: 710-719 - [c152]Graham Cormode, S. Muthukrishnan, Ke Yi:
Algorithms for distributed functional monitoring. SODA 2008: 1076-1085 - [c151]Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors. SSDBM 2008: 42-60 - [c150]Eyal Even-Dar, Jon Feldman, Yishay Mansour, S. Muthukrishnan:
Position Auctions with Bidder-Specific Minimum Prices. WINE 2008: 577-584 - [c149]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pál:
Sponsored Search Auctions with Markovian Users. WINE 2008: 621-628 - [e3]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.08. - 22.08.2008. Dagstuhl Seminar Proceedings 08341, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i18]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Abstracts Collection - Sublinear Algorithms. Sublinear Algorithms 2008 - [i17]Artur Czumaj, S. Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
08341 Executive Summary - Sublinear Algorithms. Sublinear Algorithms 2008 - [i16]Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal:
A Truthful Mechanism for Offline Ad Slot Scheduling. CoRR abs/0801.2931 (2008) - [i15]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan, Martin Pal:
Sponsored Search Auctions with Markovian Users. CoRR abs/0805.0766 (2008) - [i14]Florin Constantin, Jon Feldman, S. Muthukrishnan, Martin Pal:
Online Ad Slotting With Cancellations. CoRR abs/0805.1213 (2008) - [i13]Jon Feldman, S. Muthukrishnan:
Algorithmic Methods for Sponsored Search Advertising. CoRR abs/0805.1759 (2008) - [i12]Sariel Har-Peled, S. Muthukrishnan:
Range Medians. CoRR abs/0807.0222 (2008) - [i11]Gagan Aggarwal, S. Muthukrishnan, Dávid Pál, Martin Pál:
General Auction Mechanism for Search Advertising. CoRR abs/0807.1297 (2008) - 2007
- [j43]Graham Cormode, S. Muthukrishnan:
The string edit distance matching problem with moves. ACM Trans. Algorithms 3(1): 2:1-2:19 (2007) - [j42]Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan:
A data structure for a sequence of string accesses in external memory. ACM Trans. Algorithms 3(1): 6:1-6:23 (2007) - [j41]Paolo Ferragina, Giovanni Manzini, S. Muthukrishnan:
Foreword. Theor. Comput. Sci. 387(3): 197-199 (2007) - [c148]S. Muthukrishnan:
Stringology: Some Classic and Some Modern Problems. CPM 2007: 2 - [c147]Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu:
Radix Sorting with No Extra Space. ESA 2007: 194-205 - [c146]Michael Hoffmann, S. Muthukrishnan, Rajeev Raman:
Streaming Algorithms for Data in Motion. ESCAPE 2007: 294-304 - [c145]Gianni Franceschini, S. Muthukrishnan:
In-Place Suffix Sorting. ICALP 2007: 533-545 - [c144]Supratik Bhattacharyya, André Madeira, S. Muthukrishnan, Tao Ye:
How to scalably and accurately skip past streams. ICDE Workshops 2007: 654-663 - [c143]Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck:
Query-Aware Sampling for Data Streams. ICDE Workshops 2007: 664-673 - [c142]Graham Cormode, S. Muthukrishnan, Wei Zhuang:
Conquering the Divide: Continuous Clustering of Distributed Data Streams. ICDE 2007: 1036-1045 - [c141]Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum:
Monitoring Regular Expressions on Out-of-Order Streams. ICDE 2007: 1315-1319 - [c140]S. Muthukrishnan, Eric van den Berg, Yihua Wu:
Sequential Change Detection on Data Streams. ICDM Workshops 2007: 551-550 - [c139]Smriti Bhagat, Graham Cormode, S. Muthukrishnan, Irina Rozenbaum, Hongyi Xue:
No Blog is an Island - Analyzing Connections Across Information Networks. ICWSM 2007 - [c138]Supranamaya Ranjan, Shaleen Shah, Antonio Nucci, Maurizio M. Munafò, Rene L. Cruz, S. Muthukrishnan:
DoWitcher: Effective Worm Detection and Containment in the Internet Core. INFOCOM 2007: 2541-2545 - [c137]T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee:
Estimating statistical aggregates on probabilistic data streams. PODS 2007: 243-252 - [c136]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget optimization in search-based advertising auctions. EC 2007: 40-49 - [c135]Gianni Franceschini, S. Muthukrishnan:
Optimal suffix selection. STOC 2007: 328-337 - [c134]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. WINE 2007: 131-142 - [i10]Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu:
Radix Sorting With No Extra Space. CoRR abs/0706.4107 (2007) - [i9]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan:
Relative-Error CUR Matrix Decompositions. CoRR abs/0708.3696 (2007) - [i8]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, Tamás Sarlós:
Faster Least Squares Approximation. CoRR abs/0710.1435 (2007) - 2006
- [j40]Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan:
Estimating Entropy and Entropy Norm on Data Streams. Internet Math. 3(1): 63-78 (2006) - [j39]Navin Goyal, Sachin Lodha, S. Muthukrishnan:
The Graham-Knowlton Problem Revisited. Theory Comput. Syst. 39(3): 399-412 (2006) - [j38]Süleyman Cenk Sahinalp, Ugur Dogrusöz, S. Muthukrishnan:
Preface. Theor. Comput. Sci. 368(3): 195 (2006) - [c133]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan:
Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods. APPROX-RANDOM 2006: 316-326 - [c132]Graham Cormode, S. Muthukrishnan:
Combinatorial Algorithms for Compressed Sensing. CISS 2006: 198-201 - [c131]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan:
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods. ESA 2006: 304-314 - [c130]Graham Cormode, S. Muthukrishnan, Wei Zhuang:
What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. ICDE 2006: 57 - [c129]Flip Korn, S. Muthukrishnan, Yihua Wu:
Fractal Modeling of IP Network Traffic at Streaming Speeds. ICDE 2006: 155 - [c128]Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Space- and time-efficient deterministic algorithms for biased quantiles over data streams. PODS 2006: 263-272 - [c127]Flip Korn, S. Muthukrishnan, Yihua Wu:
Modeling skew in data streams. SIGMOD Conference 2006: 181-192 - [c126]Graham Cormode, S. Muthukrishnan:
Combinatorial Algorithms for Compressed Sensing. SIROCCO 2006: 280-294 - [c125]Petros Drineas, Michael W. Mahoney, S. Muthukrishnan:
Sampling algorithms for l2 regression and applications. SODA 2006: 1127-1136 - [c124]Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan:
Estimating Entropy and Entropy Norm on Data Streams. STACS 2006: 196-205 - [c123]Gagan Aggarwal, Jon Feldman, S. Muthukrishnan:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions. WAOA 2006: 15-28 - [c122]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan:
Compressing and searching XML data via two zips. WWW 2006: 751-760 - [e2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
Sublinear Algorithms, 17.07. - 22.07.2005. Dagstuhl Seminar Proceedings 05291, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i7]Gagan Aggarwal, S. Muthukrishnan, Jon Feldman:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions. CoRR abs/cs/0607117 (2006) - [i6]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006) - [i5]Andrew McGregor, S. Muthukrishnan:
Estimating Aggregate Properties on Probabilistic Streams. CoRR abs/cs/0612031 (2006) - [i4]Jon Feldman, S. Muthukrishnan, Martin Pál, Clifford Stein:
Budget Optimization in Search-Based Advertising Auctions. CoRR abs/cs/0612052 (2006) - [i3]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. CoRR abs/cs/0612072 (2006) - 2005
- [j37]S. Muthukrishnan:
Data Streams: Algorithms and Applications. Found. Trends Theor. Comput. Sci. 1(2) (2005) - [j36]S. Muthukrishnan, Torsten Suel:
Approximation algorithms for array partitioning problems. J. Algorithms 54(1): 85-104 (2005) - [j35]Graham Cormode, S. Muthukrishnan:
An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55(1): 58-75 (2005) - [j34]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) - [j33]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) - [j32]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) - [j31]Graham Cormode, S. Muthukrishnan:
What's new: finding significant differences in network data streams. IEEE/ACM Trans. Netw. 13(6): 1219-1232 (2005) - [c121]Theodore Johnson, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava:
Streams, Security and Scalability. DBSec 2005: 1-15 - [c120]S. Chen, Suhas N. Diggavi, Sanket Dusad, S. Muthukrishnan:
Efficient String Matching Algorithms for Combinatorial Universal Denoising. DCC 2005: 153-162 - [c119]S. Muthukrishnan, Martin Strauss, Xuan Zheng:
Workload-Optimal Histograms on Streams. ESA 2005: 734-745 - [c118]Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan:
Structuring labeled trees for optimal succinctness, and beyond. FOCS 2005: 184-196 - [c117]S. Muthukrishnan:
Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. FSTTCS 2005: 285-296 - [c116]Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Effective Computation of Biased Quantiles over Data Streams. ICDE 2005: 20-31 - [c115]Timothy Edmunds, S. Muthukrishnan, Subarna Sadhukhan, Shinjiro Sueda:
MoDB: Database System for Synthesizing Human Motion. ICDE 2005: 1131-1132 - [c114]Vijay Karamcheti, Davi Geiger, Zvi M. Kedem, S. Muthukrishnan:
Detecting malicious network traffic using inverse distributions of packet contents. MineNet 2005: 165-170 - [c113]Graham Cormode, S. Muthukrishnan:
Space efficient mining of multigraph streams. PODS 2005: 271-282 - [c112]Jesús S. Aguilar-Ruiz, S. Muthukrishnan:
Editorial message: special track on data streams. SAC 2005: 553-554 - [c111]Graham Cormode, S. Muthukrishnan:
Summarizing and Mining Skewed Data Streams. SDM 2005: 44-55 - [c110]Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum:
Sampling Algorithms in a Stream Operator. SIGMOD Conference 2005: 1-12 - [c109]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 - [c108]Graham Cormode, S. Muthukrishnan:
Substring compression problems. SODA 2005: 321-330 - [c107]A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss:
Improved range-summable random variable construction algorithms. SODA 2005: 840-849 - [c106]S. Muthukrishnan, Gopal Pandurangan:
The bin-covering technique for thresholding random geometric graph properties. SODA 2005: 989-998 - [c105]Graham Cormode, S. Muthukrishnan, Irina Rozenbaum:
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. VLDB 2005: 25-36 - [c104]Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck:
A Heartbeat Mechanism and Its Application in Gigascope. VLDB 2005: 1079-1088 - [i2]Artur Czumaj, S. Muthu Muthukrishnan, Ronitt Rubinfeld, Christian Sohler:
05291 Abstracts Collection -- Sublinear Algorithms. Sublinear Algorithms 2005 - 2004
- [j30]Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park:
Parallel two dimensional witness computation. Inf. Comput. 188(1): 20-67 (2004) - [j29]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Average stretch without migration. J. Comput. Syst. Sci. 68(1): 80-95 (2004) - [j28]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Approximation Algorithms for Average Stretch Scheduling. J. Sched. 7(3): 195-222 (2004) - [j27]S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke:
Online Scheduling to Minimize Average Stretch. SIAM J. Comput. 34(2): 433-452 (2004) - [j26]S. Muthukrishnan, Süleyman Cenk Sahinalp:
An efficient algorithm for sequence comparison with block reversals. Theor. Comput. Sci. 321(1): 95-101 (2004) - [c103]Graham Cormode, S. Muthukrishnan:
What's New: Finding Significant Differences in Network Data Streams. INFOCOM 2004: 1534-1545 - [c102]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Sublinear Methods for Detecting Periodic Trends in Data Streams. LATIN 2004: 16-28 - [c101]Graham Cormode, S. Muthukrishnan:
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. LATIN 2004: 29-38 - [c100]Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava:
Holistic UDAFs at streaming speeds. SIGMOD Conference 2004: 35-46 - [c99]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 - [c98]S. Muthukrishnan, Rahul Shah, Jeffrey Scott Vitter:
Mining Deviants in Time Series Data Streams. SSDBM 2004: 41-50 - [e1]Süleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusöz:
Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3109, Springer 2004, ISBN 3-540-22341-X [contents] - 2003
- [j25]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) - [j24]Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan:
Generalized substring selectivity estimation. J. Comput. Syst. Sci. 66(1): 98-132 (2003) - [j23]Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Two-dimensional substring indexing. J. Comput. Syst. Sci. 66(4): 763-774 (2003) - [j22]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) - [j21]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) - [j20]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) - [c97]Graham Cormode, S. Muthukrishnan:
Estimating Dominance Norms of Multiple Data Streams. ESA 2003: 148-160 - [c96]Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Comparing Sequences with Segment Rearrangements. FSTTCS 2003: 183-194 - [c95]S. Muthukrishnan, Martin Strauss:
Maintenance of Multidimensional Histograms. FSTTCS 2003: 352-362 - [c94]Xia Gao, Suhas N. Diggavi, S. Muthukrishnan:
LHP: an end-to-end reliable transport protocol over wireless data networks. ICC 2003: 66-70 - [c93]Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Improved sparse approximation over quasiincoherent dictionaries. ICIP (1) 2003: 37-40 - [c92]Graham Cormode, S. Muthukrishnan:
What's hot and what's not: tracking most frequent items dynamically. PODS 2003: 296-306 - [c91]Flip Korn, S. Muthukrishnan, Yunyue Zhu:
IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data. SIGMOD Conference 2003: 677 - [c90]S. Muthukrishnan, Martin Strauss:
Rangesum histograms. SODA 2003: 233-242 - [c89]Anna C. Gilbert, S. Muthukrishnan, Martin Strauss:
Approximation of functions over redundant dictionaries using coherence. SODA 2003: 243-252 - [c88]S. Muthukrishnan:
Data streams: algorithms and applications. SODA 2003: 413-413 - [c87]S. Muthukrishnan, Torsten Suel, Radek Vingralek:
Inferring tree topologies using flow tests. SODA 2003: 828-829 - [c86]Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Finding Hierarchical Heavy Hitters in Data Streams. VLDB 2003: 464-475 - [c85]Flip Korn, S. Muthukrishnan, Yunyue Zhu:
Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases. VLDB 2003: 536-547 - 2002
- [j19]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) - [j18]S. Muthukrishnan, Rajmohan Rajaraman:
An Adversarial Model for Distributed Dynamic Load Balancing. J. Interconnect. Networks 3(1-2): 35-47 (2002) - [j17]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15(2): 252-267 (2002) - [c84]S. Muthukrishnan, Süleyman Cenk Sahinalp:
Simple and Practical Sequence Nearest Neighbors with Block Operations. CPM 2002: 262-278 - [c83]Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan:
Range Searching in Categorical Data: Colored Range Searching on Grid. ESA 2002: 17-28 - [c82]Mayur Datar, S. Muthukrishnan:
Estimating Rarity and Similarity over Data Stream Windows. ESA 2002: 323-334 - [c81]Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan:
Static Optimality Theorem for External Memory String Access. FOCS 2002: 219-227 - [c80]Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692 - [c79]Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan:
Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002: 605-614 - [c78]S. Muthukrishnan, Süleyman Cenk Sahinalp:
An Improved Algorithm for Sequence Comparison with Block Reversals. LATIN 2002: 319-325 - [c77]Tamraparni Dasu, Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk:
Mining database structure; or, how to build a data quality browser. SIGMOD Conference 2002: 240-251 - [c76]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 - [c75]S. Muthukrishnan:
Efficient algorithms for document retrieval problems. SODA 2002: 657-666 - [c74]Graham Cormode, S. Muthukrishnan:
The string edit distance matching problem with moves. SODA 2002: 667-676 - [c73]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 - [c72]Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman:
Improved algorithms for stretch scheduling. SODA 2002: 762-771 - [c71]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 - [c70]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161 - [c69]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 - [c68]Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan:
Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002: 335-345 - [c67]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
How to Summarize the Universe: Dynamic Maintenance of Quantiles. VLDB 2002: 454-465 - [c66]Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB 2002: 814-825 - 2001
- [j16]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) - [j15]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) - [c65]Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Permutation Editing and Matching via Embeddings. ICALP 2001: 481-492 - [c64]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 - [c63]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 - [c62]Darin Nelson, S. Muthukrishnan:
Design issues in multimedia messaging for next generation wireless systems. MobiDE 2001: 98-103 - [c61]Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Two-dimensional Substring Indexing. PODS 2001 - [c60]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001 - [c59]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 - [c58]David Eppstein, S. Muthukrishnan:
Internet packet filter management and rectangle geometry. SODA 2001: 827-835 - [c57]Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. VLDB 2001: 79-88 - [c56]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 - 2000
- [j14]Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan:
On the sorting-complexity of suffix tree construction. J. ACM 47(6): 987-1011 (2000) - [j13]S. Muthukrishnan:
Simple Optimal Parallel Multiple Pattern Matching. J. Algorithms 34(1): 1-13 (2000) - [j12]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 Technol. 10(1): 42-50 (2000) - [c55]Injong Rhee, Srinath R. Joshi, Minsuk Lee, S. Muthukrishnan, Volkan Ozdemir:
Layered Multicast Recovery. INFOCOM 2000: 805-813 - [c54]Anja Feldmann, S. Muthukrishnan:
Tradeoffs for Packet Classification. INFOCOM 2000: 1193-1202 - [c53]Volkan Ozdemir, S. Muthukrishnan, Injong Rhee:
Scalable, Low-Overhead Network Delay Estimation. INFOCOM 2000: 1343-1350 - [c52]Nick Koudas, S. Muthukrishnan, Divesh Srivastava:
Optimal Histograms for Hierarchical Range Queries. PODS 2000: 196-204 - [c51]Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan:
Selectivity Estimation for Boolean Queries. PODS 2000: 216-225 - [c50]Flip Korn, S. Muthukrishnan:
Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD Conference 2000: 201-212 - [c49]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 - [c48]Z. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv:
On the temporal HZY compression scheme. SODA 2000: 185-186 - [c47]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Scheduling to minimize average stretch without migration. SODA 2000: 548-557 - [c46]Yair Bartal, S. Muthukrishnan:
Minimizing maximum response time in scheduling broadcasts. SODA 2000: 558-559 - [c45]S. Muthukrishnan, Süleyman Cenk Sahinalp:
Approximate nearest neighbors and sequence comparison with block operations. STOC 2000: 416-424 - [c44]Piotr Indyk, Nick Koudas, S. Muthukrishnan:
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000: 363-372 - [i1]David Eppstein, S. Muthukrishnan:
Internet Packet Filter Management and Rectangle Geometry. CoRR cs.CG/0010018 (2000)
1990 – 1999
- 1999
- [j11]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) - [c43]S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke:
Online Scheduling to Minimize Average Stretch. FOCS 1999: 433-442 - [c42]S. Muthukrishnan, Viswanath Poosala, Torsten Suel:
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. ICDT 1999: 236-256 - [c41]Sachin More, S. Muthukrishnan, Elizabeth A. M. Shriver:
Efficient Sequencing Tape-Resident Jobs. PODS 1999: 33-43 - [c40]S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp, Torsten Suel:
Compact Grid Layouts of Multi-Level Networks. STOC 1999: 455-463 - [c39]Paolo Ferragina, S. Muthukrishnan, Mark de Berg:
Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999: 483-491 - [c38]H. V. Jagadish, Nick Koudas, S. Muthukrishnan:
Mining Deviants in a Time Series Database. VLDB 1999: 102-113 - 1998
- [j10]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) - [j9]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) - [c37]Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv:
Augmenting Suffix Trees, with Applications. ESA 1998: 67-78 - [c36]Martin Farach, Paolo Ferragina, S. Muthukrishnan:
Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998: 174-185 - [c35]S. Muthukrishnan:
Randomization in Parallel Stringology. IPPS/SPDP Workshops 1998: 361-362 - [c34]Swarup Acharya, S. Muthukrishnan:
Scheduling On-Demand Broadcasts: New Metrics and Algorithms. MobiCom 1998: 43-54 - [c33]S. Muthukrishnan, Torsten Suel:
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. RANDOM 1998: 369-384 - [c32]Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan:
Flow and Stretch Metrics for Scheduling Continuous Job Streams. SODA 1998: 270-279 - [c31]Sanjeev Khanna, S. Muthukrishnan, Mike Paterson:
On Approximating Rectangle Tiling and Packing. SODA 1998: 384-393 - [c30]S. Muthukrishnan, Rajmohan Rajaraman:
An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998: 47-54 - [c29]Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp:
Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998: 172-181 - [c28]H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Viswanath Poosala, Kenneth C. Sevcik, Torsten Suel:
Optimal Histograms with Quality Guarantees. VLDB 1998: 275-286 - 1997
- [j8]S. Muthukrishnan:
Detecting False Matches in String-Matching Algorithms. Algorithmica 18(4): 512-520 (1997) - [j7]Martin Farach, S. Muthukrishnan:
Optimal Parallel Randomized Renaming. Inf. Process. Lett. 61(1): 7-10 (1997) - [j6]Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan:
Hardness of Flip-Cut Problems from Optical Mapping. J. Comput. Biol. 4(2): 119-125 (1997) - [j5]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. J. Comput. Biol. 4(3): 275-296 (1997) - [j4]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. Comput. Aided Des. Integr. Circuits Syst. 16(1): 32-46 (1997) - [c27]K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997: 37-53 - [c26]Sanjeev Khanna, S. Muthukrishnan, Steven Skiena:
Efficient Array Partitioning. ICALP 1997: 616-626 - [c25]Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam:
Engineering Diffusive Load Balancing Algorithms Using Experiments. IRREGULAR 1997: 111-122 - [c24]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 - [c23]S. Muthukrishnan, Laxmi Parida:
Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997: 209-219 - [c22]Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan:
Hardness of flip-cut problems from optical mapping [DNA molecules application]. SEQUENCES 1997: 275-284 - [c21]Martin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan:
Group testing problems with sequences in experimental molecular biology. SEQUENCES 1997: 357-367 - [c20]Artur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan, Jesper Larsson Träff:
The Architecture of a Software Library for String Processing. WAE 1997: 166-176 - 1996
- [j3]Bhaskar Ghosh, S. Muthukrishnan:
Dynamic Load Balancing by Random Matchings. J. Comput. Syst. Sci. 53(3): 357-370 (1996) - [c19]Martin Farach, S. Muthukrishnan:
Perfect Hashing for Strings: Formalization and Algorithms. CPM 1996: 130-140 - [c18]Paolo Ferragina, S. Muthukrishnan:
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). ESA 1996: 107-120 - [c17]Martin Farach, S. Muthukrishnan:
Optimal Logarithmic Time Randomized Suffix Tree Construction. ICALP 1996: 550-561 - [c16]S. Muthukrishnan, Martin Müller:
Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). SODA 1996: 42-51 - [c15]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 - [c14]Soumen Chakrabarti, S. Muthukrishnan:
Resource Scheduling for Parallel Database and Scientific Applications. SPAA 1996: 329-335 - 1995
- [j2]S. Muthukrishnan, H. Ramesh:
String Matching Under a General Matching Relation. Inf. Comput. 122(1): 140-148 (1995) - [c13]Vineet Bafna, S. Muthukrishnan, R. Ravi:
Computing Similarity between RNA Strings. CPM 1995: 1-16 - [c12]S. Muthukrishnan:
New Results and Open Problems Related to Non-Standard Stringology. CPM 1995: 298-317 - [c11]Martin Farach, S. Muthukrishnan:
Optimal Parallel Dictionary Matching and Compression (Extended Abstract). SPAA 1995: 244-253 - [c10]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 - 1994
- [b1]S. Muthukrishnan:
Searching for Strings and Searching in Presence of Errors. New York University, USA, 1994 - [j1]Amihood Amir, Martin Farach, S. Muthukrishnan:
Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49(3): 111-115 (1994) - [c9]Shashidhar Thakur, D. F. Wong, S. Muthukrishnan:
Algorithms for a switch module routing problem. EURO-DAC 1994: 265-270 - [c8]Ramesh Hariharan, S. Muthukrishnan:
Optimal Parallel Algorithms for Prefix Matching. ICALP 1994: 203-214 - [c7]S. Muthukrishnan:
On Optimal Strategies for Searching in Presence of Errors. SODA 1994: 680-689 - [c6]Bhaskar Ghosh, S. Muthukrishnan:
Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). SPAA 1994: 226-235 - [c5]S. Muthukrishnan, Krishna V. Palem:
Non-standard stringology: algorithms and complexity. STOC 1994: 770-779 - 1993
- [c4]S. Muthukrishnan:
Detecting False Matches in String Matching Algorithms. CPM 1993: 164-178 - [c3]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 - [c2]S. Muthukrishnan, Krishna V. Palem:
Highly Efficient Dictionary Matching in Parallel. SPAA 1993: 69-78 - 1992
- [c1]S. Muthukrishnan, H. Ramesh:
String Matching Under a General Matching Relation. FSTTCS 1992: 356-367
Coauthor Index
[c218] [i48] [c200] [c199] [i46] [i43] [j62] [c197] [i39] [j61] [j60] [j59] [c190] [i37] [i32] [i31] [j57] [p1] [i30] [c177] [j45] [c157] [c152] [c151] [j43] [c142] [c139] [c132] [c130] [c128] [c126] [j35] [j32] [j31] [c116] [c113] [c111] [c109] [c108] [c105] [c103] [c101] [c100] [c99] [j22] [c97] [c92] [c86] [c79] [c74] [c68] [c65]
Martin Farach-Colton
aka: Martin Farach
aka: Martin Farach
Martin Pál
aka: Martin Pal
aka: Martin Pal
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
