( en | de | ru )

 

Disambiguation of "Deo, Narsingh"

Author of the publication

copydeleteadd this publication to your clipboard
Two minimum spanning forest algorithms on fixed-size hypercube computers.

, , and . Parallel Comput., 15 (1-3): 179-187 (1990)

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.

Parasnath Deo

Maria Deoudi

Fiorenza Deon

Deo Barume

Hans-Joachim Deobald

 

Other publications of authors with the same name

Parallel algorithms and architectures report of a workshop., , , , , , , , , and 11 other author(s). J. Supercomput., 1 (3): 301-325 (1988)Bibliometric approach to community discovery., and . ACM Southeast Regional Conference (2), page 41-42. ACM, (2005)1-59593-059-0.A birth-death dynamic model of scale-free networks., and . ACM Southeast Regional Conference (2), page 26-27. ACM, (2005)1-59593-059-0.Parallel Heap: Improved and Simplified., and . IPPS, page 448-451. IEEE Computer Society, (1992)Metric Graphs Elastically Embeddable in the Plane., and . Inf. Process. Lett., 55 (6): 309-315 (1995)Mining parameters that characterize the communities in web-like networks., and . GrC, page 188-193. IEEE, (2006)Parallel Heap., and . ICPP (3), page 169-172. Pennsylvania State University Press, (1990)0-271-00728-1.Parallel Hungarian algorithm., and . Comput. Syst. Sci. Eng., 5 (3): 131-136 (1990)Parallel Algorithms for Parenthesis Matching and Generation of Random Balanced Sequences of Parentheses., and . ICS, volume 297 of Lecture Notes in Computer Science, page 970-984. Springer, (1987)Two EREW Algorithms for Parentheses Matching., and . IPPS, page 126-131. IEEE Computer Society, (1991)