Author of the publication

Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)

, and . SWAT, page 12-15. IEEE Computer Society, (1973)

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

Site Optimal Termination Protocols for a Distributed Database under Network Partitioning., and . PODC, page 111-121. ACM, (1985)Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)., and . WDAG, volume 392 of Lecture Notes in Computer Science, page 303-314. Springer, (1989)Notes on Multiple Input Signature Analysis., , and . IEEE Trans. Computers, 42 (2): 228-234 (1993)Optimal Code Generation for Machines with Different Types of Instructions., and . IFIP Congress, page 129-132. (1977)Design of Minimum-Cost Deadlock-Free Systems, , and . J. ACM, 30 (4): 736-751 (October 1983)On the Computational Power of Some Machines with Pushdown-Like Storage. SWAT, page 72. IEEE Computer Society, (1970)A Resource Assignment Problem on Graphs., , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 418-427. Springer, (1995)Quad-B Tree for Point Data., and . CODAS, page 554-560. World Scientific, (1996)Efficient generation of all regular non-dominated coteries., and . PODC, page 279-288. ACM, (2000)A polynomial-time test for the deadlock-freedom of computer systems.. Theoretical Computer Science, volume 48 of Lecture Notes in Computer Science, page 282-291. Springer, (1977)