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
[1]
Hilfe
Suche: Author="Haldar, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An ``All pairs shortest paths'' distributed algorithm using
2n^2
messages
S. Haldar
Journal of Algorithms
24
(1), 1997, pp. 20-36
Simple extensions of 1-writer atomic variable constructions to multiwriter ones
S. Haldar
,
K. Vidyasankar
Acta Informatica
33
(2), 1996, pp. 177-202
Buffer-optimal constructions of 1-writer multireader multivalued atomic shared variables
S. Haldar
,
K. Vidyasankar
Journal Parallel Distributed Computing
31
(2), 1995, pp. 174-180
Constructing 1-writer multireader multivalued atomic variables from regular variables
S. Haldar
,
K. Vidyasankar
Journal of the ACM
42
(1), 1995, pp. 186-203
Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable
S. Haldar
,
P.S. Subramanian
Proceedings of the 8th International Workshop on Distributed Algorithms, WDAG '94 (Terschelling, The Netherlands, September 29 - October 1, 1994)
LNCS 857
, 1994, pp. 116-129
An 'All Pairs Shortest Paths' distributed algorithm using
2n^2
messages
S. Haldar
Lecture Notes in Computer Science
790
, 1993, pp. 350-363
Ring based termination detection algorithm for distributed computations
S. Haldar
,
D.K. Subramanian
Information Processing Letters
29
, 1988, pp. 149-153