( en | de | ru )

 

Disambiguation of "Goodrich, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Super-Efficient Verification of Dynamic Outsourced Databases.

, , and . CT-RSA, volume 4964 of Lecture Notes in Computer Science, page 407-424. Springer, (2008)

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

Dynamic Trees and Dynamic Point Location., and . SIAM J. Comput., 28 (2): 612-636 (1998)Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors.. SIAM J. Comput., 20 (4): 737-755 (1991)Communication-Efficient Parallel Sorting.. SIAM J. Comput., 29 (2): 416-432 (1999)Data structures and algorithms in Java (3. ed.)., and . Wiley, (2003)Sweep Methods for Parallel Computational Geometry., , and . Algorithmica, 15 (2): 126-153 (1996)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)Minimum-Width Drawings of Phylogenetic Trees., , , and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 39-55. Springer, (2019)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)