 |











|
Online DBLP entries are available for S. Muthukrishnan and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- S. Muthukrishnan,
Viswanath Poosala
,
Torsten Suel
:
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications.
ICDT 1999
: 236-256
-
Yossi Matias
,
S. Muthukrishnan,
Süleyman Cenk Sahinalp
,
Jacob Ziv
:
Augmenting Suffix Trees, with Applications.
ESA 1998
: 67-78
-
H. V. Jagadish
,
Nick Koudas
,
S. Muthukrishnan,
Viswanath Poosala
,
Kenneth C. Sevcik
,
Torsten Suel
:
Optimal Histograms with Quality Guarantees.
VLDB 1998
: 275-286
-
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)
- 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)
-
K. Cirino
,
S. Muthukrishnan,
N. S. Narayanaswamy
,
H. Ramesh
:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds.
FSTTCS 1997
: 37-53
-
Sanjeev Khanna
,
S. Muthukrishnan,
Steven Skiena
:
Efficient Array Partitioning.
ICALP 1997
: 616-626
-
Ralf Diekmann
,
S. Muthukrishnan,
Madhu V. Nayakkankuppam
:
Engineering Diffusive Load Balancing Algorithms Using Experiments.
IRREGULAR 1997
: 111-122
- S. Muthukrishnan:
Detecting False Matches in String-Matching Algorithms.
Algorithmica 18
(4): 512-520 (1997)
-
Martin Farach
,
S. Muthukrishnan:
Optimal Parallel Randomized Renaming.
IPL 61
(1): 7-10 (1997)
-
Martin Farach
,
S. Muthukrishnan:
Perfect Hashing for Strings: Formalization and Algorithms.
CPM 1996
: 130-140
-
Paolo Ferragina
,
S. Muthukrishnan:
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract).
ESA 1996
: 107-120
-
Martin Farach
,
S. Muthukrishnan:
Optimal Logarithmic Time Randomized Suffix Tree Construction.
ICALP 1996
: 550-561
- S. Muthukrishnan,
Martin Müller
:
Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract).
SODA 1996
: 42-51
-
Soumen Chakrabarti
,
S. Muthukrishnan:
Resource Scheduling for Parallel Database and Scientific Applications.
SPAA 1996
: 329-335
-
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
-
Bhaskar Ghosh
,
S. Muthukrishnan:
Dynamic Load Balancing by Random Matchings.
JCSS 53
(3): 357-370 (1996)
-
Vineet Bafna
,
S. Muthukrishnan,
R. Ravi
:
Computing Similarity between RNA Strings.
CPM 1995
: 1-16
- S. Muthukrishnan:
New Results and Open Problems Related to Non-Standard Stringology.
CPM 1995
: 298-317
-
Martin Farach
,
S. Muthukrishnan:
Optimal Parallel Dictionary Matching and Compression (Extended Abstract).
SPAA 1995
: 244-253
-
Bhaskar Ghosh
,
Frank Thomson Leighton
,
Bruce M. Maggs
,
S. Muthukrishnan,
C. Greg Plaxton
,
R. Rajaraman
,
Andréa W. Richa
,
Robert Endre Tarjan
,
David Zuckerman
:
Tight Analyses of Two Local Load Balancing Algorithms.
STOC 1995
: 548-558
- S. Muthukrishnan,
H. Ramesh
:
String Matching Under a General Matching Relation.
Information and Computation 122
(1): 140-148 (1995)
-
Ramesh Hariharan
,
S. Muthukrishnan:
Optimal Parallel Algorithms for Prefix Matching.
ICALP 1994
: 203-214
- S. Muthukrishnan,
Krishna V. Palem
:
Non-standard Stringology: Algorithms and Complexity.
STOC 1994
: 770-779
-
Amihood Amir
,
Martin Farach
,
S. Muthukrishnan:
Alphabet Dependence in Parameterized Matching.
IPL 49
(3): 111-115 (1994)
- S. Muthukrishnan:
Detecting False Matches in String Matching Algorithms.
CPM 1993
: 164-178
-
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
- S. Muthukrishnan,
H. Ramesh
:
String Matching Under a General Matching Relation.
FSTTCS 1992
: 356-367
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|