Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Krishnamoorthy, M.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bridge obstructions to circular-three gate matrix layout
Nancy Lawson
,
M.S. Krishnamoorthy
Graphs and Combinatorics
14
(2), 1998, pp. 143-153
Mr.~Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices
E. Kaltofen
,
M.S. Krishnamoorthy
,
B.D. Saunders
Lecture Notes in Computer Science
378
, 1989, pp. 317-322
Algorithms of placing recovery points
Moon Jung Chung
,
M.S. Krishnamoorthy
Information Processing Letters
28
, 1988, pp. 177-181
Fast parallel computation of Hermite and Smith forms of polynomial matrices
Erich Kaltofen
,
M.S. Krishnamoorthy
,
B. David Saunders
SIAM Journal on Algebraic Discrete Methods
8
, 1987, pp. 683-690
Comment on 'Worst-case choice for the stable marriage problem'
D. Kapur
,
M.S. Krishnamoorthy
,
A.K. Pujari
,
S. Gupta
Information Processing Letters
24
(2), 1987, January, pp. 139
An algebraic implementation of packages
S. Agnarsson
,
M.S. Krishnamoorthy
,
B.D. Saunders
Lecture Notes in Computer Science
204
, 1985, pp. 291-302
An Algebraic Implementation of Packages
Snorri Agnarsson
,
M.S. Krishnamoorthy
,
B.D. Saunders
Technical Report (85-13), 1985
Towards a Theory of Packages
Snorri Agnarsson
,
M.S. Krishnamoorthy
Technical Report (85-14), 1985
An
O({|T|}^3)
algorithm for testing the Church-Rosser property of Thue systems
D. Kapur
,
M.S. Krishnamoorthy
,
R. McNaughton
,
P. Narendran
Theoretical Computer Science
35
(1), 1985, pp. 109-114
Worst-case choice for the stable marriage problem
D. Kapur
,
M.S. Krishnamoorthy
Information Processing Letters
21
(1), 1985, July, pp. 27-30
The church-rosser property and special thue systems
D. Kapur
,
P. Narendran
,
M.S. Krishnamoorthy
,
McNaughton
,
R.
Theoretical Computer Science
39
(2-3), 1985, pp. 123-133
On recursive path ordering
M.S. Krishnamoorthy
,
P. Narendran
Theoretical Computer Science
40
(2,3), 1985, pp. 323-328
On the harmonious coloring of graphs
J.E. Hopcroft
,
M.S. Krishnamoorthy
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 306-311
Node-deletion NP-complete problems
M.S. Krishnamoorthy
,
N. Deo
SIAM Journal on Computing
8
(4), 1979, November, pp. 619-625
Generalizations of line graphs and applications
N. Deo
,
M.S. Krishnamoorthy
,
A.B. Pai
Information Processing Letters
6
(1), 1977, February, pp. 14-17
A note on precedence functions
M.S. Krishnamoorthy
,
H.R. Ramesha Chandra
Information Processing Letters
4
, 1975, pp. 99-100