From post

An optimal algorithm for the boundary of a cell in a union of rays.

, , и . Geometry and Robotics, том 391 из Lecture Notes in Computer Science, стр. 247-274. Springer, (1988)

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 Fast Stable Sorting Algorithm with Absolutely Minimum Storage.. Theor. Comput. Sci., 1 (2): 185-190 (1975)Size-time complexity of Boolean networks for prefix computations., и . J. ACM, 36 (2): 362-382 (1989)Widest-Corridor Problems., и . Nord. J. Comput., 1 (2): 231-245 (1994)Size-Time Complexity of Boolean Networks for Prefix Computations, и . STOC, стр. 436-442. ACM, (1987)On the Boundary of a Union of Rays., , и . STACS, том 349 из Lecture Notes in Computer Science, стр. 72-83. Springer, (1989)A Heuristic for Channel Routing., и . FODO, том 367 из Lecture Notes in Computer Science, стр. 155-170. Springer, (1989)Generalized Scans and Tri-Diagonal Systems., , и . STACS, том 900 из Lecture Notes in Computer Science, стр. 168-180. Springer, (1995)Continuously Valued Logic., и . J. Comput. Syst. Sci., 6 (5): 397-418 (1972)On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization., , , и . WABI, том 2452 из Lecture Notes in Computer Science, стр. 392-403. Springer, (2002)A Practical Constructive Scheme for Deterministic Shared-Memory Access., и . SPAA, стр. 100-109. ACM, (1993)