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.

 

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

On the intersection of tolerance and cocomparability graphs., и . Discret. Appl. Math., (2016)Computation in an algebra of test selection criteria, и . CoRR, (1999)Applied Tree Enumerations., и . CAAP, том 112 из Lecture Notes in Computer Science, стр. 180-193. Springer, (1981)A New Characterization of Tree Medians with Applications to Distributed Algorithms., и . WG, том 657 из Lecture Notes in Computer Science, стр. 135-144. Springer, (1992)Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks., , и . WDAG, том 486 из Lecture Notes in Computer Science, стр. 373-389. Springer, (1990)Making Distributed Spanning Tree Algorithms Fault-Resilient., , , и . STACS, том 247 из Lecture Notes in Computer Science, стр. 432-444. Springer, (1987)The Bit Complexity of Distributed Sorting (Extended Abstract)., и . ESA, том 726 из Lecture Notes in Computer Science, стр. 181-191. Springer, (1993)Duality in Chain ATM Virtual Path Layouts., и . SIROCCO, стр. 228-239. Carleton Scientific, (1997)Placing regenerators in optical networks to satisfy multiple sets of requests., , , и . IEEE/ACM Trans. Netw., 20 (6): 1870-1879 (2012)Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem., и . Theor. Comput. Sci., 384 (2-3): 250-262 (2007)