Welcome to D
SIGMOD'00
PODS'00
SIGMOD Recor
CIKM 2000/CI
COMAD 2000
Data Enginee
DL 2000
DPDJ
EDBT 2000
Hypertext 20
ICDE 2000
KDD 2000
KDD Explorat
KRDB 2000
SBBD 2000
SIGIR 2000
SIGIR Forum
SSDBM 2000
TODS
VLDB'00
VLDBJ
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2001 Pr
ADVIS
DiSC'01 Feed
DiSC'01 Site
Search DiSC'
<<<Author Index>>>
Copyright No

S. Muthukrishnan

Papers on DiSC'01


Influence Sets Based on Reverse Nearest Neighbor Queries

Optimal Histograms for Hierarchical Range Queries

Selectivity Estimation for Boolean Queries

Identifying Representative Trends in Massive Time Series Data Sets Using Sketches

Publications


Note: Links lead to the DBLP on the Web.

S. Muthukrishnan

65 Zhiyuan Chen , H. V. Jagadish , Flip Korn , Nick Koudas , S. Muthukrishnan, Raymond T. Ng , Divesh Srivastava : Counting Twig Matches in a Tree. ICDE 2001

64 Anna C. Gilbert , Yannis Kotidis , S. Muthukrishnan, Martin Strauss : Optimal and Approximate Computation of Summary Statistics for Range Aggregates. PODS 2001

63 Paolo Ferragina , Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Two-dimensional Substring Indexing. PODS 2001

62 Injong Rhee , Srinath R. Joshi , Minsuk Lee , S. Muthukrishnan, Volkan Ozdemir : Layered Multicast Recovery. INFOCOM (2) 2000 : 805-813

61 Anja Feldmann , S. Muthukrishnan: Tradeoffs for Packet Classification. INFOCOM (3) 2000 : 1193-1202

60 Volkan Ozdemir , S. Muthukrishnan, Injong Rhee : Scalable, Low-Overhead Network Delay Estimation. INFOCOM (3) 2000 : 1343-1350

59 Nick Koudas , S. Muthukrishnan, Divesh Srivastava : Optimal Histograms for Hierarchical Range Queries. PODS 2000 : 196-204

58 Zhiyuan Chen , Flip Korn , Nick Koudas , S. Muthukrishnan: Selectivity Estimation for Boolean Queries. PODS 2000 : 216-225

57 Flip Korn , S. Muthukrishnan: Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD Conference 2000 : 201-212

56 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

55 Z. Cohen , Yossi Matias , S. Muthukrishnan, Süleyman Cenk Sahinalp , Jacob Ziv : On the temporal HZY compression scheme. SODA 2000 : 185-186

54 Luca Becchetti , Stefano Leonardi , S. Muthukrishnan: Scheduling to minimize average stretch without migration. SODA 2000 : 548-557

53 Yair Bartal , S. Muthukrishnan: Minimizing maximum response time in scheduling broadcasts. SODA 2000 : 558-559

52 S. Muthukrishnan, Süleyman Cenk Sahinalp : Approximate nearest neighbors and sequence comparison with block operations. STOC 2000 : 416-424

51 Piotr Indyk , Nick Koudas , S. Muthukrishnan: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000 : 363-372

50 S. Muthukrishnan: Simple Optimal Parallel Multiple Pattern Matching. J. Algorithms 34 (1): 1-13 (2000)

49 S. Muthukrishnan, Rajmohan Rajaraman , Anthony Shaheen , Johannes Gehrke : Online Scheduling to Minimize Average Stretch. FOCS 1999 : 433-442

48 S. Muthukrishnan, Viswanath Poosala , Torsten Suel : On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications. ICDT 1999 : 236-256

47 Sachin More , S. Muthukrishnan, Elizabeth A. M. Shriver : Efficient Sequencing Tape-Resident Jobs. PODS 1999 : 33-43

46 S. Muthukrishnan, Michael S. Paterson , Süleyman Cenk Sahinalp , Torsten Suel : Compact Grid Layouts of Multi-Level Networks. STOC 1999 : 455-463

45 Paolo Ferragina , S. Muthukrishnan, Mark de Berg : Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems. STOC 1999 : 483-491

44 H. V. Jagadish , Nick Koudas , S. Muthukrishnan: Mining Deviants in a Time Series Database. VLDB 1999 : 102-113

43 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)

42 Yossi Matias , S. Muthukrishnan, Süleyman Cenk Sahinalp , Jacob Ziv : Augmenting Suffix Trees, with Applications. ESA 1998 : 67-78

41 Martin Farach , Paolo Ferragina , S. Muthukrishnan: Overcoming the Memory Bottleneck in Suffix Tree Construction. FOCS 1998 : 174-185

40 S. Muthukrishnan: Randomization in Parallel Stringology. IPPS/SPDP Workshops 1998 : 361-362

39 Swarup Acharya , S. Muthukrishnan: Scheduling On-Demand Broadcasts: New Metrics and Algorithms. MOBICOM 1998 : 43-54

38 S. Muthukrishnan, Torsten Suel : Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. RANDOM 1998 : 369-384

37 Michael A. Bender , Soumen Chakrabarti , S. Muthukrishnan: Flow and Stretch Metrics for Scheduling Continuous Job Streams. SODA 1998 : 270-279

36 Sanjeev Khanna , S. Muthukrishnan, Mike Paterson : On Approximating Rectangle Tiling and Packing. SODA 1998 : 384-393

35 Shimon Even , S. Muthukrishnan, Michael S. Paterson , Süleyman Cenk Sahinalp : Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998 : 172-181

34 S. Muthukrishnan, Rajmohan Rajaraman : An Adversarial Model for Distributed Dynamic Load Balancing. SPAA 1998 : 47-54

33 H. V. Jagadish , Nick Koudas , S. Muthukrishnan, Viswanath Poosala , Kenneth C. Sevcik , Torsten Suel : Optimal Histograms with Quality Guarantees. VLDB 1998 : 275-286

32 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)

31 S. Muthukrishnan, Bhaskar Ghosh , Martin H. Schultz : First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing. Theory of Computing Systems 31 (4): 331-354 (1998)

30 K. Cirino , S. Muthukrishnan, N. S. Narayanaswamy , H. Ramesh : Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds. FSTTCS 1997 : 37-53

29 Sanjeev Khanna , S. Muthukrishnan, Steven Skiena : Efficient Array Partitioning. ICALP 1997 : 616-626

28 Ralf Diekmann , S. Muthukrishnan, Madhu V. Nayakkankuppam : Engineering Diffusive Load Balancing Algorithms Using Experiments. IRREGULAR 1997 : 111-122

27 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

26 S. Muthukrishnan, Laxmi Parida : Towards constructing physical maps by optical mapping (extended abstract): an effective, simple, combinatorial approach. RECOMB 1997 : 209-219

25 S. Muthukrishnan: Detecting False Matches in String-Matching Algorithms. Algorithmica 18 (4): 512-520 (1997)

24 Martin Farach , S. Muthukrishnan: Optimal Parallel Randomized Renaming. IPL 61 (1): 7-10 (1997)

23 Vlado Dancík , Sridhar Hannenhalli , S. Muthukrishnan: Hardness of Flip-Cut Problems from Optical Mapping. Journal of Computational Biology 4 (2): 119-126 (1997)

22 Richa Agarwala , Serafim Batzoglou , Vlado Dancík , Scott E. Decatur , Sridhar Hannenhalli , Martin Farach , S. Muthukrishnan, Steven Skiena : Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model. Journal of Computational Biology 4 (3): 275-296 (1997)

21 Martin Farach , S. Muthukrishnan: Perfect Hashing for Strings: Formalization and Algorithms. CPM 1996 : 130-140

20 Paolo Ferragina , S. Muthukrishnan: Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). ESA 1996 : 107-120

19 Martin Farach , S. Muthukrishnan: Optimal Logarithmic Time Randomized Suffix Tree Construction. ICALP 1996 : 550-561

18 S. Muthukrishnan, Martin Müller II : Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). SODA 1996 : 42-51

17 Soumen Chakrabarti , S. Muthukrishnan: Resource Scheduling for Parallel Database and Scientific Applications. SPAA 1996 : 329-335

16 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

15 Bhaskar Ghosh , S. Muthukrishnan: Dynamic Load Balancing by Random Matchings. JCSS 53 (3): 357-370 (1996)

14 Vineet Bafna , S. Muthukrishnan, R. Ravi : Computing Similarity between RNA Strings. CPM 1995 : 1-16

13 S. Muthukrishnan: New Results and Open Problems Related to Non-Standard Stringology. CPM 1995 : 298-317

12 Martin Farach , S. Muthukrishnan: Optimal Parallel Dictionary Matching and Compression (Extended Abstract). SPAA 1995 : 244-253

11 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

10 S. Muthukrishnan, H. Ramesh : String Matching Under a General Matching Relation. Information and Computation 122 (1): 140-148 (1995)

9 Ramesh Hariharan , S. Muthukrishnan: Optimal Parallel Algorithms for Prefix Matching. ICALP 1994 : 203-214

8 S. Muthukrishnan: On Optimal Strategies for Searching in Presence of Errors. SODA 1994 : 680-689

7 Bhaskar Ghosh , S. Muthukrishnan: Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract). SPAA 1994 : 226-235

6 S. Muthukrishnan, Krishna V. Palem : Non-standard Stringology: Algorithms and Complexity. STOC 1994 : 770-779

5 Amihood Amir , Martin Farach , S. Muthukrishnan: Alphabet Dependence in Parameterized Matching. IPL 49 (3): 111-115 (1994)

4 S. Muthukrishnan: Detecting False Matches in String Matching Algorithms. CPM 1993 : 164-178

3 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

2 S. Muthukrishnan, Krishna V. Palem : Highly Efficient Dictionary Matching in Parallel. SPAA 1993 : 69-78

1 S. Muthukrishnan, H. Ramesh : String Matching Under a General Matching Relation. FSTTCS 1992 : 356-367





DiSC'01 Copyright ©2002 ACM Inc.