( en | de | ru )

 

Disambiguation of "Goodrich, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Succinct Greedy Geometric Routing Using Hyperbolic Geometry.

, and . IEEE Trans. Computers, 60 (11): 1571-1580 (2011)

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.

Michael R T Macnair

T Masselink

T Groth

T Attin

T Weber

 

Other publications of authors with the same name

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching., , , , , and . CoRR, (2022)Output-Sensitive Methods for Rectilinear Hidden Surface Removal, , and . Inf. Comput., 107 (1): 1-24 (November 1993)Balanced aspect ratio trees: Combining the advantages of k-d trees and octtrees, , and . SODA '99: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, page 300―309. (1999)On the algorithmic complexity of the Mastermind game with black-peg results.. Inf. Process. Lett., 109 (13): 675-678 (2009)Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees., , and . SODA, page 300-309. ACM/SIAM, (1999)Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data., , , , and . CoRR, (2018)Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis, and . CoRR, (2009)Guard Placement For Wireless Localization, , and . CoRR, (2006)Generalized Sweep Methods for Parallel Computational Geometry., , and . SPAA, page 280-289. ACM, (1990)Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms., , and . SIAM J. Comput., 18 (3): 499-532 (1989)