The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. Muthukrishnan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Viswanath Poosala, Kenneth C. Sevcik, Torsten Suel
    Optimal Histograms with Quality Guarantees. [Citation Graph (15, 9)][DBLP]
    VLDB, 1998, pp:275-286 [Conf]
  2. S. Muthukrishnan, Viswanath Poosala, Torsten Suel
    On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. [Citation Graph (3, 24)][DBLP]
    ICDT, 1999, pp:236-256 [Conf]
  3. Sanjeev Khanna, S. Muthukrishnan, Steven Skiena
    Efficient Array Partitioning. [Citation Graph (2, 0)][DBLP]
    ICALP, 1997, pp:616-626 [Conf]
  4. Sanjeev Khanna, S. Muthukrishnan, Mike Paterson
    On Approximating Rectangle Tiling and Packing. [Citation Graph (2, 0)][DBLP]
    SODA, 1998, pp:384-393 [Conf]
  5. Soumen Chakrabarti, S. Muthukrishnan
    Resource Scheduling for Parallel Database and Scientific Applications. [Citation Graph (2, 0)][DBLP]
    SPAA, 1996, pp:329-335 [Conf]
  6. S. Muthukrishnan, Krishna V. Palem
    Non-standard stringology: algorithms and complexity. [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:770-779 [Conf]
  7. H. V. Jagadish, Nick Koudas, S. Muthukrishnan
    Mining Deviants in a Time Series Database. [Citation Graph (1, 9)][DBLP]
    VLDB, 1999, pp:102-113 [Conf]
  8. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
    Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:316-326 [Conf]
  9. Martin Farach, S. Muthukrishnan
    Perfect Hashing for Strings: Formalization and Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:130-140 [Conf]
  10. Vineet Bafna, S. Muthukrishnan, R. Ravi
    Computing Similarity between RNA Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:1-16 [Conf]
  11. S. Muthukrishnan
    Detecting False Matches in String Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:164-178 [Conf]
  12. S. Muthukrishnan
    New Results and Open Problems Related to Non-Standard Stringology. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:298-317 [Conf]
  13. S. Muthukrishnan, Süleyman Cenk Sahinalp
    Simple and Practical Sequence Nearest Neighbors with Block Operations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:262-278 [Conf]
  14. Theodore Johnson, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava
    Streams, Security and Scalability. [Citation Graph (0, 0)][DBLP]
    DBSec, 2005, pp:1-15 [Conf]
  15. S. Chen, Suhas N. Diggavi, S. Dusad, S. Muthukrishnan
    Efficient String Matching Algorithms for Combinatorial Universal Denoising. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:153-162 [Conf]
  16. Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan
    Range Searching in Categorical Data: Colored Range Searching on Grid. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:17-28 [Conf]
  17. Graham Cormode, S. Muthukrishnan
    Estimating Dominance Norms of Multiple Data Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:148-160 [Conf]
  18. Mayur Datar, S. Muthukrishnan
    Estimating Rarity and Similarity over Data Stream Windows. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:323-334 [Conf]
  19. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
    Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:304-314 [Conf]
  20. Paolo Ferragina, S. Muthukrishnan
    Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:107-120 [Conf]
  21. Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv
    Augmenting Suffix Trees, with Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:67-78 [Conf]
  22. S. Muthukrishnan, Martin Strauss, X. Zheng
    Workload-Optimal Histograms on Streams. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:734-745 [Conf]
  23. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan
    Static Optimality Theorem for External Memory String Access. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:219-227 [Conf]
  24. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:248-258 [Conf]
  25. Martin Farach, Paolo Ferragina, S. Muthukrishnan
    Overcoming the Memory Bottleneck in Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:174-185 [Conf]
  26. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
    Structuring labeled trees for optimal succinctness, and beyond. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:184-196 [Conf]
  27. S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke
    Online Scheduling to Minimize Average Stretch. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:433-442 [Conf]
  28. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp
    Comparing Sequences with Segment Rearrangements. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:183-194 [Conf]
  29. K. Cirino, S. Muthukrishnan, N. S. Narayanaswamy, H. Ramesh
    Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1997, pp:37-53 [Conf]
  30. S. Muthukrishnan, H. Ramesh
    String Matching Under a General Matching Relation. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:356-367 [Conf]
  31. S. Muthukrishnan, Martin Strauss
    Maintenance of Multidimensional Histograms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:352-362 [Conf]
  32. S. Muthukrishnan
    Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:285-296 [Conf]
  33. Graham Cormode, S. Muthukrishnan, Süleyman Cenk Sahinalp
    Permutation Editing and Matching via Embeddings. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:481-492 [Conf]
  34. Martin Farach, S. Muthukrishnan
    Optimal Logarithmic Time Randomized Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:550-561 [Conf]
  35. Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
    Histogramming Data Streams with Fast Per-Item Processing. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:681-692 [Conf]
  36. Ramesh Hariharan, S. Muthukrishnan
    Optimal Parallel Algorithms for Prefix Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:203-214 [Conf]
  37. Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koudas, S. Muthukrishnan, Raymond T. Ng, Divesh Srivastava
    Counting Twig Matches in a Tree. [Citation Graph (0, 0)][DBLP]
    ICDE, 2001, pp:595-604 [Conf]
  38. Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan
    Fast Mining of Massive Tabular Data via Approximate Distance Computations. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:605-0 [Conf]
  39. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Effective Computation of Biased Quantiles over Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:20-31 [Conf]
  40. Graham Cormode, S. Muthukrishnan, Wei Zhuang
    What's Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:57- [Conf]
  41. Timothy Edmunds, S. Muthukrishnan, Subarna Sadhukhan, Shinjiro Sueda
    MoDB: Database System for Synthesizing Human Motion. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:1131-1132 [Conf]
  42. Flip Korn, S. Muthukrishnan, Yihua Wu
    Fractal Modeling of IP Network Traffic at Streaming Speeds. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:155- [Conf]
  43. Joel A. Tropp, Anna C. Gilbert, S. Muthukrishnan, Martin Strauss
    Improved sparse approximation over quasiincoherent dictionaries. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 2003, pp:37-40 [Conf]
  44. Graham Cormode, S. Muthukrishnan
    What's New: Finding Significant Differences in Network Data Streams. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  45. Anja Feldmann, S. Muthukrishnan
    Tradeoffs for Packet Classification. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1193-1202 [Conf]
  46. Volkan Ozdemir, S. Muthukrishnan, Injong Rhee
    Scalable, Low-Overhead Network Delay Estimation. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:1343-1350 [Conf]
  47. Injong Rhee, Srinath R. Joshi, Minsuk Lee, S. Muthukrishnan, Volkan Ozdemir
    Layered Multicast Recovery. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2000, pp:805-813 [Conf]
  48. S. Muthukrishnan
    Randomization in Parallel Stringology. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:361-362 [Conf]
  49. Ralf Diekmann, S. Muthukrishnan, Madhu V. Nayakkankuppam
    Engineering Diffusive Load Balancing Algorithms Using Experiments. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:111-122 [Conf]
  50. Graham Cormode, S. Muthukrishnan
    An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:29-38 [Conf]
  51. Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp
    Sublinear Methods for Detecting Periodic Trends in Data Streams. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:16-28 [Conf]
  52. S. Muthukrishnan, Süleyman Cenk Sahinalp
    An Improved Algorithm for Sequence Comparison with Block Reversals. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:319-325 [Conf]
  53. Swarup Acharya, S. Muthukrishnan
    Scheduling On-Demand Broadcasts: New Metrics and Algorithms. [Citation Graph (0, 0)][DBLP]
    MOBICOM, 1998, pp:43-54 [Conf]
  54. Rittwik Jana, Theodore Johnson, S. Muthukrishnan, Andrea Vitaletti
    Location based services in a wireless WAN using cellular digital packet data (CDPD). [Citation Graph (0, 0)][DBLP]
    MobiDE, 2001, pp:74-80 [Conf]
  55. Darin Nelson, S. Muthukrishnan
    Design issues in multimedia messaging for next generation wireless systems. [Citation Graph (0, 0)][DBLP]
    MobiDE, 2001, pp:98-103 [Conf]
  56. Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan
    Selectivity Estimation for Boolean Queries. [Citation Graph (0, 10)][DBLP]
    PODS, 2000, pp:216-225 [Conf]
  57. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Space- and time-efficient deterministic algorithms for biased quantiles over data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:263-272 [Conf]
  58. Graham Cormode, S. Muthukrishnan
    What's hot and what's not: tracking most frequent items dynamically. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:296-306 [Conf]
  59. Graham Cormode, S. Muthukrishnan
    Space efficient mining of multigraph streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:271-282 [Conf]
  60. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Two-dimensional Substring Indexing. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  61. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    Optimal and Approximate Computation of Summary Statistics for Range Aggregates. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  62. Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Optimal Histograms for Hierarchical Range Queries. [Citation Graph (0, 11)][DBLP]
    PODS, 2000, pp:196-204 [Conf]
  63. Sachin More, S. Muthukrishnan, Elizabeth A. M. Shriver
    Efficient Sequencing Tape-Resident Jobs. [Citation Graph (0, 7)][DBLP]
    PODS, 1999, pp:33-43 [Conf]
  64. S. Muthukrishnan, Torsten Suel
    Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:369-384 [Conf]
  65. 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. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:1-2 [Conf]
  66. S. Muthukrishnan, Laxmi Parida
    Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:209-219 [Conf]
  67. Jesús S. Aguilar-Ruiz, S. Muthukrishnan
    Editorial message: special track on data streams. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:553-554 [Conf]
  68. Graham Cormode, S. Muthukrishnan
    Summarizing and Mining Skewed Data Streams. [Citation Graph (0, 0)][DBLP]
    SDM, 2005, pp:- [Conf]
  69. Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, Rajeev Rastogi
    Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2005, pp:25-36 [Conf]
  70. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:155-166 [Conf]
  71. Tamraparni Dasu, Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk
    Mining database structure; or, how to build a data quality browser. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2002, pp:240-251 [Conf]
  72. Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, Divesh Srivastava
    Holistic UDAFs at streaming speeds. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:35-46 [Conf]
  73. Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum
    Sampling Algorithms in a Stream Operator. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2005, pp:1-12 [Conf]
  74. Flip Korn, S. Muthukrishnan
    Influence Sets Based on Reverse Nearest Neighbor Queries. [Citation Graph (0, 15)][DBLP]
    SIGMOD Conference, 2000, pp:201-212 [Conf]
  75. Flip Korn, S. Muthukrishnan, Yihua Wu
    Modeling skew in data streams. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2006, pp:181-192 [Conf]
  76. Flip Korn, S. Muthukrishnan, Yunyue Zhu
    IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:677- [Conf]
  77. Graham Cormode, S. Muthukrishnan
    Combinatorial Algorithms for Compressed Sensing. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:280-294 [Conf]
  78. Yair Bartal, S. Muthukrishnan
    Minimizing maximum response time in scheduling broadcasts. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:558-559 [Conf]
  79. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan
    Scheduling to minimize average stretch without migration. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:548-557 [Conf]
  80. Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan
    Flow and Stretch Metrics for Scheduling Continuous Job Streams. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:270-279 [Conf]
  81. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
    Improved algorithms for stretch scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:762-771 [Conf]
  82. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Slice and dice: a simple, improved approximate tiling recipe. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:455-464 [Conf]
  83. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Simple approximation algorithm for nonoverlapping local alignments. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:677-678 [Conf]
  84. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Improved approximation algorithms for rectangle tiling and packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:427-436 [Conf]
  85. Adam L. Buchsbaum, Donald F. Caldwell, Kenneth Ward Church, Glenn S. Fowler, S. Muthukrishnan
    Engineering the compression of massive tables: an experimental approach. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:175-184 [Conf]
  86. A. Robert Calderbank, Anna C. Gilbert, Kirill Levchenko, S. Muthukrishnan, Martin Strauss
    Improved range-summable random variable construction algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:840-849 [Conf]
  87. Z. Cohen, Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv
    On the temporal HZY compression scheme. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:185-186 [Conf]
  88. Graham Cormode, S. Muthukrishnan
    The string edit distance matching problem with moves. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:667-676 [Conf]
  89. Graham Cormode, S. Muthukrishnan
    Substring compression problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:321-330 [Conf]
  90. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
    Sampling algorithms for l2 regression and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1127-1136 [Conf]
  91. David Eppstein, S. Muthukrishnan
    Internet packet filter management and rectangle geometry. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:827-835 [Conf]
  92. Anna C. Gilbert, S. Muthukrishnan, Martin Strauss
    Approximation of functions over redundant dictionaries using coherence. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:243-252 [Conf]
  93. S. Muthukrishnan
    Efficient algorithms for document retrieval problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:657-666 [Conf]
  94. S. Muthukrishnan
    Data streams: algorithms and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:413-413 [Conf]
  95. S. Muthukrishnan
    On Optimal Strategies for Searching in Presence of Errors. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:680-689 [Conf]
  96. S. Muthukrishnan, Martin Müller 0002
    Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:42-51 [Conf]
  97. S. Muthukrishnan, Gopal Pandurangan
    The bin-covering technique for thresholding random geometric graph properties. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:989-998 [Conf]
  98. S. Muthukrishnan, Martin Strauss
    Rangesum histograms. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:233-242 [Conf]
  99. S. Muthukrishnan, Torsten Suel, Radek Vingralek
    Inferring tree topologies using flow tests. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:828-829 [Conf]
  100. Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti
    Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:238-247 [Conf]
  101. Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp
    Layout of the Batcher Bitonic Sorter (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:172-181 [Conf]
  102. Martin Farach, S. Muthukrishnan
    Optimal Parallel Dictionary Matching and Compression (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:244-253 [Conf]
  103. Bhaskar Ghosh, S. Muthukrishnan
    Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:226-235 [Conf]
  104. Bhaskar Ghosh, S. Muthukrishnan, Martin H. Schultz
    First and Second Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:72-81 [Conf]
  105. S. Muthukrishnan, Krishna V. Palem
    Highly Efficient Dictionary Matching in Parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:69-78 [Conf]
  106. S. Muthukrishnan, Rajmohan Rajaraman
    An Adversarial Model for Distributed Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:47-54 [Conf]
  107. S. Muthukrishnan, Rahul Shah, Jeffrey Scott Vitter
    Mining Deviants in Time Series Data Streams. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2004, pp:41-50 [Conf]
  108. Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
    Estimating Entropy and Entropy Norm on Data Streams. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:196-205 [Conf]
  109. Paolo Ferragina, S. Muthukrishnan, Mark de Berg
    Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:483-491 [Conf]
  110. 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. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:548-558 [Conf]
  111. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    Fast, small-space algorithms for approximate histogram maintenance. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:389-398 [Conf]
  112. Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
    Near-optimal sparse fourier representations via sampling. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:152-161 [Conf]
  113. S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp, Torsten Suel
    Compact Grid Layouts of Multi-Level Networks. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:455-463 [Conf]
  114. S. Muthukrishnan, Süleyman Cenk Sahinalp
    Approximate nearest neighbors and sequence comparison with block operations. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:416-424 [Conf]
  115. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:335-345 [Conf]
  116. Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Finding Hierarchical Heavy Hitters in Data Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2003, pp:464-475 [Conf]
  117. Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
    Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:25-36 [Conf]
  118. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries. [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:79-88 [Conf]
  119. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    How to Summarize the Universe: Dynamic Maintenance of Quantiles. [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:454-465 [Conf]
  120. Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Approximate String Joins in a Database (Almost) for Free. [Citation Graph (0, 0)][DBLP]
    VLDB, 2001, pp:491-500 [Conf]
  121. Theodore Johnson, S. Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck
    A Heartbeat Mechanism and Its Application in Gigascope. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:1079-1088 [Conf]
  122. Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Reverse Nearest Neighbor Aggregates Over Data Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2002, pp:814-825 [Conf]
  123. Flip Korn, S. Muthukrishnan, Yunyue Zhu
    Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2003, pp:536-547 [Conf]
  124. Piotr Indyk, Nick Koudas, S. Muthukrishnan
    Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. [Citation Graph (0, 0)][DBLP]
    VLDB, 2000, pp:363-372 [Conf]
  125. Gagan Aggarwal, Jon Feldman, S. Muthukrishnan
    Bidding to the Top: VCG and Equilibria of Position-Based Auctions. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:15-28 [Conf]
  126. Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan
    Compressing and searching XML data via two zips. [Citation Graph (0, 0)][DBLP]
    WWW, 2006, pp:751-760 [Conf]
  127. S. Muthukrishnan
    Detecting False Matches in String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:4, pp:512-520 [Journal]
  128. Russell G. Thompson, John C. Stone, S. Muthukrishnan, A. N. Halter
    Refinements in energy economic modeling for policy purposes. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1984, v:11, n:1, pp:67-90 [Journal]
  129. David Eppstein, S. Muthukrishnan
    Internet Packet Filter Management and Rectangle Geometry [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  130. 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. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  131. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Data Eng. Bull., 2001, v:24, n:4, pp:28-34 [Journal]
  132. Richard Cole, Zvi Galil, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park
    Parallel two dimensional witness computation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:188, n:1, pp:20-67 [Journal]
  133. S. Muthukrishnan, H. Ramesh
    String Matching Under a General Matching Relation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:122, n:1, pp:140-148 [Journal]
  134. Amihood Amir, Martin Farach, S. Muthukrishnan
    Alphabet Dependence in Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:3, pp:111-115 [Journal]
  135. Martin Farach, S. Muthukrishnan
    Optimal Parallel Randomized Renaming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:1, pp:7-10 [Journal]
  136. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan
    On the sorting-complexity of suffix tree construction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:6, pp:987-1011 [Journal]
  137. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Approximation algorithms for MAX-MIN tiling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:122-134 [Journal]
  138. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:443-470 [Journal]
  139. Graham Cormode, S. Muthukrishnan
    An improved data stream summary: the count-min sketch and its applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:1, pp:58-75 [Journal]
  140. S. Muthukrishnan
    Simple Optimal Parallel Multiple Pattern Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:1-13 [Journal]
  141. S. Muthukrishnan, Torsten Suel
    Approximation algorithms for array partitioning problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:54, n:1, pp:85-104 [Journal]
  142. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:3, pp:275-296 [Journal]
  143. Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan
    Hardness of Flip-Cut Problems from Optical Mapping. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1997, v:4, n:2, pp:119-126 [Journal]
  144. Luca Becchetti, Stefano Leonardi, S. Muthukrishnan
    Average stretch without migration. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:1, pp:80-95 [Journal]
  145. Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukrishnan
    Generalized substring selectivity estimation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:98-132 [Journal]
  146. Paolo Ferragina, Nick Koudas, S. Muthukrishnan, Divesh Srivastava
    Two-dimensional substring indexing. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:4, pp:763-774 [Journal]
  147. Bhaskar Ghosh, S. Muthukrishnan
    Dynamic Load Balancing by Random Matchings. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:3, pp:357-370 [Journal]
  148. S. Muthukrishnan, Rajmohan Rajaraman
    An Adversarial Model for Distributed Dynamic Load Balancing. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2002, v:3, n:1-2, pp:35-47 [Journal]
  149. Navin Goyal, Sachin Lodha, S. Muthukrishnan
    The Graham-Knowlton Problem Revisited. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:399-412 [Journal]
  150. S. Muthukrishnan, Bhaskar Ghosh, Martin H. Schultz
    First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:331-354 [Journal]
  151. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal
    Parallel scheduling problems in next generation wireless networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:1, pp:9-22 [Journal]
  152. Michael A. Bender, S. Muthukrishnan, Rajmohan Rajaraman
    Approximation Algorithms for Average Stretch Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2004, v:7, n:3, pp:195-222 [Journal]
  153. Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
    A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal]
  154. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:29-64 [Journal]
  155. S. Muthukrishnan, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke
    Online Scheduling to Minimize Average Stretch. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:433-452 [Journal]
  156. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:252-267 [Journal]
  157. Graham Cormode, S. Muthukrishnan
    The string edit distance matching problem with moves. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  158. Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio, S. Muthukrishnan
    A data structure for a sequence of string accesses in external memory. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  159. Shashidhar Thakur, Yao-Wen Chang, Martin D. F. Wong, S. Muthukrishnan
    Algorithms for an FPGA switch module routing problem with application to global routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1997, v:16, n:1, pp:32-46 [Journal]
  160. S. Muthukrishnan, Süleyman Cenk Sahinalp
    An efficient algorithm for sequence comparison with block reversals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:95-101 [Journal]
  161. Süleyman Cenk Sahinalp, Ugur Dogrusöz, S. Muthukrishnan
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:368, n:3, pp:195- [Journal]
  162. Injong Rhee, Graham R. Martin, S. Muthukrishnan, Roger A. Packwood
    Quadtree-structured variable-size block-matching motion estimation with minimal error. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Circuits Syst. Video Techn., 2000, v:10, n:1, pp:42-50 [Journal]
  163. Rohit Ananthakrishna, Abhinandan Das, Johannes Gehrke, Flip Korn, S. Muthukrishnan, Divesh Srivastava
    Efficient Approximation of Correlated Sums on Data Streams. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:3, pp:569-572 [Journal]
  164. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
    Comparing Data Streams Using Hamming Norms (How to Zero In). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:3, pp:529-540 [Journal]
  165. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    One-Pass Wavelet Decompositions of Data Streams. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:3, pp:541-554 [Journal]
  166. Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
    Domain-Driven Data Synopses for Dynamic Quantiles. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2005, v:17, n:7, pp:927-938 [Journal]
  167. Graham Cormode, S. Muthukrishnan
    What's hot and what's not: tracking most frequent items dynamically. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2005, v:30, n:1, pp:249-278 [Journal]
  168. Graham Cormode, S. Muthukrishnan
    What's new: finding significant differences in network data streams. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:6, pp:1219-1232 [Journal]
  169. S. Muthukrishnan
    Stringology: Some Classic and Some Modern Problems. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:2- [Conf]
  170. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
    Radix Sorting with No Extra Space. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:194-205 [Conf]
  171. Gianni Franceschini, S. Muthukrishnan
    In-Place Suffix Sorting. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:533-545 [Conf]
  172. Graham Cormode, S. Muthukrishnan, Wei Zhuang
    Conquering the Divide: Continuous Clustering of Distributed Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1036-1045 [Conf]
  173. Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum
    Monitoring Regular Expressions on Out-of-Order Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1315-1319 [Conf]
  174. T. S. Jayram, Andrew McGregor, S. Muthukrishnan, Erik Vee
    Estimating statistical aggregates on probabilistic data streams. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:243-252 [Conf]
  175. Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
    Budget optimization in search-based advertising auctions. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2007, pp:40-49 [Conf]
  176. Gianni Franceschini, S. Muthukrishnan
    Optimal suffix selection. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:328-337 [Conf]
  177. M. Hoffmann, S. Muthukrishnan, Rajeev Raman
    Streaming Algorithms for Data in Motion. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:294-304 [Conf]
  178. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
    Radix Sorting With No Extra Space [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  179. Andrew McGregor, S. Muthukrishnan
    Estimating Aggregate Properties on Probabilistic Streams [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  180. Jon Feldman, S. Muthukrishnan, Martin Pal, Clifford Stein
    Budget Optimization in Search-Based Advertising Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  181. S. Muthukrishnan, Martin Pal, Zoya Svitkina
    Stochastic Models for Budget Optimization in Search-Based Advertising [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  182. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina
    On the Complexity of Processing Massive, Unordered, Distributed Data [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  183. Gagan Aggarwal, S. Muthukrishnan, Jon Feldman
    Bidding to the Top: VCG and Equilibria of Position-Based Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  184. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan
    Relative-Error CUR Matrix Decompositions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  185. Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, Tamás Sarlós
    Faster Least Squares Approximation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  186. Bidding on Configurations in Internet Ad Auctions. [Citation Graph (, )][DBLP]


  187. Range Medians. [Citation Graph (, )][DBLP]


  188. Algorithms for a switch module routing problem. [Citation Graph (, )][DBLP]


  189. Theory of Sponsored Search Auctions. [Citation Graph (, )][DBLP]


  190. Online Stochastic Matching: Beating 1-1/e. [Citation Graph (, )][DBLP]


  191. Functionally Private Approximations of Negligibly-Biased Estimators. [Citation Graph (, )][DBLP]


  192. Internet Ad Auctions: Insights and Directions. [Citation Graph (, )][DBLP]


  193. Query-Aware Sampling for Data Streams. [Citation Graph (, )][DBLP]


  194. How to scalably and accurately skip past streams. [Citation Graph (, )][DBLP]


  195. On Signatures for Communication Graphs. [Citation Graph (, )][DBLP]


  196. Query-Aware Partitioning for Monitoring Massive Network Data Streams. [Citation Graph (, )][DBLP]


  197. Sequential Change Detection on Data Streams. [Citation Graph (, )][DBLP]


  198. Pricing guidance in ad sale negotiations: the PrintAds example. [Citation Graph (, )][DBLP]


  199. Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. [Citation Graph (, )][DBLP]


  200. Stochastic Data Streams. [Citation Graph (, )][DBLP]


  201. Optimal sampling from distributed streams. [Citation Graph (, )][DBLP]


  202. Auctions with intermediaries: extended abstract. [Citation Graph (, )][DBLP]


  203. Algorithms for distributed functional monitoring. [Citation Graph (, )][DBLP]


  204. On distributing symmetric streaming computations. [Citation Graph (, )][DBLP]


  205. An online mechanism for ad slot reservations with cancellations. [Citation Graph (, )][DBLP]


  206. Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors. [Citation Graph (, )][DBLP]


  207. Optimal Cache-Aware Suffix Selection. [Citation Graph (, )][DBLP]


  208. Online Ad Assignment with Free Disposal. [Citation Graph (, )][DBLP]


  209. Position Auctions with Bidder-Specific Minimum Prices. [Citation Graph (, )][DBLP]


  210. Stochastic Models for Budget Optimization in Search-Based Advertising. [Citation Graph (, )][DBLP]


  211. Sponsored Search Auctions with Markovian Users. [Citation Graph (, )][DBLP]


  212. Ad Exchanges: Research Issues. [Citation Graph (, )][DBLP]


  213. General auction mechanism for search advertising. [Citation Graph (, )][DBLP]


  214. Bid optimization for broad match ad auctions. [Citation Graph (, )][DBLP]


  215. Mining advertiser-specific user behavior using adfactors. [Citation Graph (, )][DBLP]


  216. Monitoring algorithms for negative feedback systems. [Citation Graph (, )][DBLP]


  217. A Truthful Mechanism for Offline Ad Slot Scheduling. [Citation Graph (, )][DBLP]


  218. Detecting malicious network traffic using inverse distributions of packet contents. [Citation Graph (, )][DBLP]


  219. A Truthful Mechanism for Offline Ad Slot Scheduling [Citation Graph (, )][DBLP]


  220. Sponsored Search Auctions with Markovian Users [Citation Graph (, )][DBLP]


  221. Online Ad Slotting With Cancellations [Citation Graph (, )][DBLP]


  222. Algorithmic Methods for Sponsored Search Advertising [Citation Graph (, )][DBLP]


  223. Range Medians [Citation Graph (, )][DBLP]


  224. General Auction Mechanism for Search Advertising [Citation Graph (, )][DBLP]


  225. Bid Optimization in Broad-Match Ad Auctions [Citation Graph (, )][DBLP]


  226. Optimal cache-aware suffix selection [Citation Graph (, )][DBLP]


  227. Online Stochastic Matching: Beating 1-1/e [Citation Graph (, )][DBLP]


  228. Quasi-Proportional Mechanisms: Prior-free Revenue Maximization [Citation Graph (, )][DBLP]


  229. Stochastic Budget Optimization in Internet Advertising [Citation Graph (, )][DBLP]


  230. Selective Call Out and Real Time Bidding [Citation Graph (, )][DBLP]


  231. Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions [Citation Graph (, )][DBLP]


Search in 0.205secs, Finished in 0.212secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002