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.

 

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

A Work-Time Trade-off in Parallel Computation of Huffman Trees and Concave Least Weight Subsequence Problem., и . Parallel Process. Lett., (1994)Approximate distance oracles for geometric spanners., , , и . ACM Trans. Algorithms, 4 (1): 10:1-10:34 (2008)Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases., , , , и . J. Comput. Syst. Sci., (2021)Quickest path queries on transportation network., , и . Comput. Geom., 47 (7): 695-709 (2014)A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract)., и . SODA, стр. 518-527. ACM/SIAM, (1997)Convex Hulls and Triangulations of Planar Point Sets on the Congested Clique., , и . CoRR, (2023)Approximating a Minimum Manhattan Network., , и . Nord. J. Comput., 8 (2): 219-232 (2001)A Parallel Approximation Algorithm for Minimum Weight Triangulation., и . Nord. J. Comput., 7 (1): 32-57 (2000)Minimum Spanning Trees in d Dimensions., , и . Nord. J. Comput., 6 (4): 446-461 (1999)There Are Planar Graphs Almost as Good as the Complete Graphs and Almost as Cheap as Minimum Spanning Trees., и . Algorithmica, 8 (3): 251-256 (1992)