From post

An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.

, , , и . ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 668-680. Springer, (2007)

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.

 

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

Deterministic Majority filters applied to stochastic sorting., , и . ACM Southeast Regional Conference, стр. 228-233. ACM, (2004)Catching a Robot Intruder with Limited Information., и . IRC, стр. 17-23. IEEE, (2020)Rectilinear p-Piercing Problems.. ISSAC, стр. 316-323. ACM, (1997)Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces., , , , , и . Discret. Comput. Geom., 44 (4): 762-801 (2010)On the Message Complexity of Global Computations., и . OPODIS, том 6490 из Lecture Notes in Computer Science, стр. 427-442. Springer, (2010)Parallel Neighbourhood Modelling., , , , , и . ACM-GIS, стр. 25-34. ACM, (1996)Spikes annihilation in the Hodgkin-Huxley neuron., , и . Biol. Cybern., 98 (3): 239-257 (2008)Disassembling Two-Dimensional Composite Parts via Translations., и . Optimal Algorithms, том 401 из Lecture Notes in Computer Science, стр. 153-167. Springer, (1989)Comparing Performance of Two Mobile Agent Platforms in Distributed Search., , , и . IAT, стр. 425-428. IEEE Computer Society, (2004)Parallel Neighborhood Modeling., , , , , , и . SPAA, стр. 204-207. ACM, (1996)