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="Thurimella, Ramakrishna"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximating minimum-size
k
-connected spanning subgraphs via matching
Joseph Cheriyan
,
Ramakrishna Thurimella
SIAM Journal on Computing
30
(2), 2000, pp. 528-560
Fast algorithms for
k
-shredders and
k
-node connectivity augmentation
Joseph Cheriyan
,
Ramakrishna Thurimella
Journal of Algorithms
33
(1), 1999, pp. 15-50
Sub-linear distributed algorithms for sparse certificates and biconnected components
Ramakrishna Thurimella
Journal of Algorithms
23
(1), 1997, pp. 160-179
Approximating minimum-size
k
-connected spanning subgraphs via matching
Joseph Cheriyan
,
Ramakrishna Thurimella
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 292-301
Fast algorithms for
k
-shredders and
k
-node connectivity augmentation
Joseph Cheriyan
,
Ramakrishna Thurimella
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 37-46
Top-bottom routing around a rectangle is as easy as computing prefix minima
Omer Berkman
,
Joseph JáJá
,
Sridhar Krishnamurthy
,
Ramakrishna Thurimella
,
Uzi Vishkin
SIAM Journal on Computing
23
(3), 1994, June, pp. 449-465
Scan-first search and sparse certificates: An improved parallel algorithm for
k
-vertex connectivity
Joseph Cheriyan
,
Ming-Yang Kao
,
Ramakrishna Thurimella
SIAM Journal on Computing
22
(1), 1993, February, pp. 157-174
Finding triconnected components by local replacement
Donald Fussell
,
Vijaya Ramachandran
,
Ramakrishna Thurimella
SIAM Journal on Computing
22
(3), 1993, June, pp. 587-616
Approximation algorithms for graph augmentation
Samir Khuller
,
Ramakrishna Thurimella
Journal of Algorithms
14
(2), 1993, pp. 214-225
Approximation algorithms for graph augmentation
Samir Khuller
,
Ramakrishna Thurimella
Lecture Notes in Computer Science
623
, 1992, pp. 330-341
A scheduling principle for precedence graphs with communication delay
Ramakrishna Thurimella
,
Yaacov Yesha
Proceedings of the 1992 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'92 (University of Michigan, Michigan, August 17-21, 1992)
, 1992, pp. 229-236
Algorithms for parallel
k
-vertex connectivity and sparse certificates
Joseph Cheriyan
,
Ramakrishna Thurimella
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 391-401
Mapping task trees onto a linear array
Dipak Ghosal
,
Amar Mukherjee
,
Ramakrishna Thurimella
,
Yaacov Yesha
Proceedings of the 1991 International Conference on Parallel Processing. Vol.~I Architecture, ICPP'91 (St.~Charles, IL, August 12-17, 1991)
, 1991, pp. 629-633
Successive approximation in parallel graph algorithms
Donald Fussell
,
Ramakrishna Thurimella
Theoretical Computer Science
74
, 1990, pp. 19-35
Finding triconnected components by local replacements
Donald Fussell
,
Vijaya Ramachandran
,
Ramakrishna Thurimella
misc, 1989
Successive approximation in parallel graph algorithms
Donald Fussell
,
Ramakrishna Thurimella
Lecture Notes in Computer Science
349
, 1989, pp. 205-217