Author of the publication

Low-Diameter Graph Decomposition is in NC.

, , , and . SWAT, volume 621 of Lecture Notes in Computer Science, page 83-93. Springer, (1992)

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

A tight upper bound on the probabilistic embedding of series-parallel graphs., and . SODA, page 1045-1053. ACM Press, (2006)Improved recommendation systems., , , and . SODA, page 1174-1183. SIAM, (2005)A note of omega-regular languages., and . Bulletin of the EATCS, (1983)Majority Voting, Coalitions and Monopolies in Graphs.. SIROCCO, page 152-169. Carleton Scientific, (1996)Tight Bounds on the Size of 2-Monopolies., , , and . SIROCCO, page 170-179. Carleton Scientific, (1996)Approximating Minimum Communication Spanning Trees.. SIROCCO, page 1-11. Carleton Scientific, (1997)An Optimal Synchronizer for the Hypercube., and . SIAM J. Comput., 18 (4): 740-747 (1989)More on Looping vs. Repeating in Dynamic Logic., and . Inf. Process. Lett., 20 (2): 87-90 (1985)Fault Tolerant Spanners for General Graphs., , , and . SIAM J. Comput., 39 (7): 3403-3423 (2010)Constructing Labeling Schemes through Universal Matrices., , and . Algorithmica, 57 (4): 641-652 (2010)