( en | de | ru )

 

Disambiguation of "Goodrich, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Reactive Proximity Data Structures for Graphs.

, , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 777-789. Springer, (2018)

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 Peters

T Frieberg

T Neumann

T Attin

 

Other publications of authors with the same name

Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data., , , , and . CoRR, (2018)Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees., , and . SODA, page 300-309. ACM/SIAM, (1999)Guard Placement For Wireless Localization, , and . CoRR, (2006)Improved Adaptive Group Testing Algorithms with Applications to Multiple Access Channels and Dead Sensor Diagnosis, and . CoRR, (2009)Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms., , and . SIAM J. Comput., 18 (3): 499-532 (1989)Generalized Sweep Methods for Parallel Computational Geometry., , and . SPAA, page 280-289. ACM, (1990)Privacy-preserving data-oblivious geometric algorithms for geographic data., , and . GIS, page 13-22. ACM, (2010)Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis., , and . SPAA, page 265-274. ACM, (2016)Checking Value-Sensitive Data Structures in Sublinear Space., and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 353-364. Springer, (2007)Succinct Greedy Geometric Routing in the Euclidean Plane., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 781-791. Springer, (2009)