| 
| |  | |  |
Efficient Sequencing Tape-Resident Jobs
Mining Deviants in a Time Series Database
Note: Links lead to the DBLP on the Web.
S. Muthukrishnan
46
Nick Koudas
, S. Muthukrishnan,
Divesh Srivastava
: Optimal Histograms for Hierarchical Range Queries.
PODS 2000
: 0-
45
Zhiyuan Chen
,
Flip Korn
,
Nick Koudas
, S. Muthukrishnan: Selectivity Estimation for Boolean Queries.
PODS 2000
: 0-
44
Flip Korn
, S. Muthukrishnan: Influence Sets Based on Reverse Nearest Neighbor Queries.
SIGMOD Conference 2000
: 0-
43
S. Muthukrishnan: Simple Optimal Parallel Multiple Pattern Matching.
J. Algorithms 34
(1): 1-13 (2000)
42
S. Muthukrishnan,
Rajmohan Rajaraman
,
Anthony Shaheen
,
Johannes Gehrke
: Online Scheduling to Minimize Average Stretch.
FOCS 1999
: 433-442
41
S. Muthukrishnan,
Viswanath Poosala
,
Torsten Suel
: On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
ICDT 1999
: 236-256
40
Sachin More
, S. Muthukrishnan,
Elizabeth A. M. Shriver
: Efficient Sequencing Tape-Resident Jobs.
PODS 1999
: 33-43
39
S. Muthukrishnan,
Michael S. Paterson
,
Süleyman Cenk Sahinalp
,
Torsten Suel
: Compact Grid Layouts of Multi-Level Networks.
STOC 1999
: 455-463
38
Paolo Ferragina
, S. Muthukrishnan,
Mark de Berg
: Multi-Method Dispatching: A Geometric Approach With Applications to String Matching Problems.
STOC 1999
: 483-491
37
H. V. Jagadish
,
Nick Koudas
, S. Muthukrishnan: Mining Deviants in a Time Series Database.
VLDB 1999
: 102-113
36
Yossi Matias
, S. Muthukrishnan,
Süleyman Cenk Sahinalp
,
Jacob Ziv
: Augmenting Suffix Trees, with Applications.
ESA 1998
: 67-78
35
Martin Farach
,
Paolo Ferragina
, S. Muthukrishnan: Overcoming the Memory Bottleneck in Suffix Tree Construction.
FOCS 1998
: 174-185
34
Swarup Acharya
, S. Muthukrishnan: Scheduling On-Demand Broadcasts: New Metrics and Algorithms.
MOBICOM 1998
: 43-54
33
Michael A. Bender
,
Soumen Chakrabarti
, S. Muthukrishnan: Flow and Stretch Metrics for Scheduling Continuous Job Streams.
SODA 1998
: 270-279
32
Sanjeev Khanna
, S. Muthukrishnan,
Mike Paterson
: On Approximating Rectangle Tiling and Packing.
SODA 1998
: 384-393
31
Shimon Even
, S. Muthukrishnan,
Michael S. Paterson
,
Süleyman Cenk Sahinalp
: Layout of the Batcher Bitonic Sorter (Extended Abstract).
SPAA 1998
: 172-181
30
S. Muthukrishnan,
Rajmohan Rajaraman
: An Adversarial Model for Distributed Dynamic Load Balancing.
SPAA 1998
: 47-54
29
H. V. Jagadish
,
Nick Koudas
, S. Muthukrishnan,
Viswanath Poosala
,
Kenneth C. Sevcik
,
Torsten Suel
: Optimal Histograms with Quality Guarantees.
VLDB 1998
: 275-286
28
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)
27
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)
26
K. Cirino
, S. Muthukrishnan,
N. S. Narayanaswamy
,
H. Ramesh
: Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
FSTTCS 1997
: 37-53
25
Sanjeev Khanna
, S. Muthukrishnan,
Steven Skiena
: Efficient Array Partitioning.
ICALP 1997
: 616-626
24
Ralf Diekmann
, S. Muthukrishnan,
Madhu V. Nayakkankuppam
: Engineering Diffusive Load Balancing Algorithms Using Experiments.
IRREGULAR 1997
: 111-122
23
S. Muthukrishnan: Detecting False Matches in String-Matching Algorithms.
Algorithmica 18
(4): 512-520 (1997)
22
Martin Farach
, S. Muthukrishnan: Optimal Parallel Randomized Renaming.
IPL 61
(1): 7-10 (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
Copyright(C) 2000 ACM | | | | | | |
