( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Two minimum spanning forest algorithms on fixed-size hypercube computers.

, , и . 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.

Parasnath Deo

Maria Deoudi

Fiorenza Deon

Deo Barume

Hans-Joachim Deobald

 

Другие публикации лиц с тем же именем

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