( en | de | ru )

 

Disambiguation of "Goodrich, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems.

, , and . Algorithmica, 60 (3): 505-552 (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 Peters

T Frieberg

T Attin

T Weber

 

Other publications of authors with the same name

The Online House Numbering Problem: Min-Max Online List Labeling., , , and . ESA, volume 87 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Minimum-Width Drawings of Phylogenetic Trees., , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 39-55. Springer, (2019)A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time., , and . Discret. Comput. Geom., 26 (2): 245-265 (2001)Efficient Piecewise-Linear Function Approximation Using the Uniform Metric.. Discret. Comput. Geom., 14 (4): 445-462 (1995)Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching., , , and . CCCG, page 98-113. (2018)Straggler Identification in Round-Trip Data Streams via Newton's Identities and Invertible Bloom Filters., and . IEEE Trans. Knowl. Data Eng., 23 (2): 297-306 (2011)Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces to Disseminate Dynamic Information., , , , and . IEEE Trans. Knowl. Data Eng., 18 (10): 1352-1367 (2006)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)Pipelined Algorithms to Detect Cheating in Long-Term Grid Computations. CoRR, (2009)