Author of the publication

Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments.

, , and . IEEE Trans. Parallel Distributed Syst., 10 (8): 813-824 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Finite-State Robots in the Land of Rationalia.. ISCIS, page 3-11. Springer, (2012)Corrigendum: Ällocating Storage for Extendible Arrays".. J. ACM, 22 (2): 308 (1975)On the cost-ineffectiveness of redundancy in commercial P2P computing., , and . CCS, page 280-288. ACM, (2005)On n-tape finite state acceptors. SWCT, page 76-81. IEEE Computer Society, (1964)On Scheduling Computation-Dags for Internet-Based Computing., and . PDCS, page 58-63. ISCA, (2004)50 Years of TOCS., and . Theory Comput. Syst., 60 (1): 1-2 (2017)Rapid Identification of Repeated Patterns in Strings, Trees and Arrays, , and . STOC, page 125-136. ACM, (1972)The Changing Challenges of Collaborative Algorithmics.. HiPC, volume 3769 of Lecture Notes in Computer Science, page 5. Springer, (2005)Fault-Tolerant Interconnection Networks: A Graph-Theoretic Approach.. WG, page 286-297. Universitätsverlag Rudolf Trauner, Linz, (1983)Generalized Addressing Schemes for Data Graphs.. Math. Syst. Theory, 8 (4): 353-367 (1975)