Author of the publication

Faster Algorithms for k-Medians in Trees.

, , , , and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 218-227. Springer, (2003)

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

Election in unidirectional rings with homonyms., , , , and . J. Parallel Distributed Comput., (2020)Harmonic is 3-Competitive for Two Servers., and . Theor. Comput. Sci., 98 (2): 339-346 (1992)Parallel Construction of Trees with Optimal Weighted Path Length., and . SPAA, page 71-80. ACM, (1991)Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition., and . STACS, volume 577 of Lecture Notes in Computer Science, page 121-132. Springer, (1992)Maximum Matching for Anonymous Trees with Constant Space per Process., , and . OPODIS, volume 46 of LIPIcs, page 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)An O(n)-time self-stabilizing leader election algorithm., , and . J. Parallel Distributed Comput., 71 (11): 1532-1544 (2011)The Set LCS Problem., and . Algorithmica, (1987)An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems., and . Inf. Process. Lett., 52 (1): 31-34 (1994)Packing Items from a Triangular Distribution., , and . Inf. Process. Lett., 25 (6): 351-362 (1987)On Fast Algorithms for Two Servers., and . J. Algorithms, 12 (4): 607-614 (1991)