( en | de | ru )

 

Disambiguation of "Deo, Narsingh"

Author of the publication

copydeleteadd this publication to your clipboard
Discovering communities in complex networks.

, and . ACM Southeast Regional Conference, page 280-285. ACM, (2006)

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

Bernd Deobald

 

Other publications of authors with the same name

Random-tree Diameter and the Diameter-constrained MST., and . Int. J. Comput. Math., 79 (6): 651-663 (2002)The Self-Diagnosability of a Computer.. IEEE Trans. Electronic Computers, 15 (5): 799 (1966)Parallel algorithms and architectures report of a workshop., , , , , , , , , and 11 other author(s). J. Supercomput., 1 (3): 301-325 (1988)A theorem proving approach for automatically synthesizing visualizations of flow cytometry data., , , , , , , , and . BMC Bioinform., 18 (8): 245:1-245:11 (2017)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)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)Metric Graphs Elastically Embeddable in the Plane., and . Inf. Process. Lett., 55 (6): 309-315 (1995)Complexity of the minimum-dummy-activities problem in a pert network., and . Networks, 9 (3): 189-194 (1979)