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
[3]
Hilfe
Suche: Author="Subramonian, Ramesh"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of certified write-all algorithms
Charles Martel
,
Ramesh Subramonian
Journal of Algorithms
16
(3), 1994, pp. 361-387
Efficient multiple-item broadcast in the LogP model
Ramesh Subramonian
,
Narayan Venkatasubramanyan
Parallel Processing Letters
3
(4), 1993, pp. 407-417
Work-optimal asynchronous algorithms for shared memory parallel computers
Charles Martel
,
Arvin Park
,
Ramesh Subramonian
SIAM Journal on Computing
21
(6), 1992, December, pp. 1070-1099
On the complexity of certified write all algorithms
Charles Martel
,
Ramesh Subramonian
Lecture Notes in Computer Science
652
, 1992, pp. 368-379
Designing synchronous algorithms for asynchronous processors
Ramesh Subramonian
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'92 (San Diego, California, June 29 - July 1, 1992)
, 1992, pp. 189-198
An
O(\log n)
time common CRCW PRAM algorithm for minimum spanning trees
Ramesh Subramonian
Technical Report (CSD-673), 1992
Asynchronous PRAM algorithms for list ranking and transitive closure
Charles Martel
,
Ramesh Subramonian
Proceedings of the 1990 International Conference on Parallel Processing. Vol.~III Algorithms and Applications, ICPP'90 (St.~Charles, IL, August 13-17, 1990)
, 1990, pp. 60-63