From post

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.

 

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

Optimally Edge-Colouring Outerplanar Graphs is in NC., и . Theor. Comput. Sci., 71 (3): 401-411 (1990)Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems., , , , , и . Theor. Comput. Sci., 181 (2): 267-287 (1997)Dense Edge-Disjoint Embedding of Binary Trees in the Mesh., и . SPAA, стр. 257-263. ACM, (1992)Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs., , и . Inf. Process. Lett., 27 (1): 43-51 (1988)An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications., и . FSTTCS, том 241 из Lecture Notes in Computer Science, стр. 453-469. Springer, (1986)Deterministic broadcasting in ad hoc radio networks., , , , и . Distributed Comput., 15 (1): 27-38 (2002)DNA Simulation of Boolean Circuits, , и . Genetic Programming 1998: Proceedings of the Third Annual Conference, стр. 679--683. University of Wisconsin, Madison, Wisconsin, USA, Morgan Kaufmann, (22-25 July 1998)Deterministic broadcasting in unknown radio networks., , , , и . SODA, стр. 861-870. ACM/SIAM, (2000)On the PVM Computations of Transitive Closure and Algebraic Path Problems., , , и . PVM/MPI, том 1497 из Lecture Notes in Computer Science, стр. 338-345. Springer, (1998)Efficient Parallel Algorithms, и . Cambridge University Press, New York, NY, (1988)