Travelled to:1 × Canada
1 × Denmark
1 × Switzerland
1 × United Kingdom
5 × USA
Collaborated with:∅ M.Mitzenmacher R.Tamassia O.Ohrimenko N.M.Amato E.A.Ramos M.H.Nodine J.S.Vitter R.Cole C.Ó'Dúnlaing M.J.Atallah M.H.Overmars E.Upfal D.Nguyen C.Papamanthou N.Triandopoulos C.V.Lopes
Talks about:parallel (4) oblivi (3) effici (3) sort (3) shuffl (2) search (2) dynam (2) tree (2) time (2) size (2)
Person: Michael T. Goodrich
 DBLP: Goodrich:Michael_T=
Facilitated 1 volumes:
Contributed to:
Wrote 12 papers:
- ICALP-v2-2014-OhrimenkoGTU #in the cloud
 - The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (OO, MTG, RT, EU), pp. 556–567.
 - STOC-2014-Goodrich #algorithm #sorting
 - Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.
 - ICALP-v2-2012-GoodrichM #parallel
 - Anonymous Card Shuffling and Its Applications to Parallel Mixnets (MTG, MM), pp. 549–560.
 - VLDB-2012-GoodrichNOPTTL #authentication #crawling #performance #verification #web
 - Efficient Verification of Web-Content Searching Through Authenticated Web Crawlers (MTG, DN, OO, CP, RT, NT, CVL), pp. 920–931.
 - ICALP-v2-2011-GoodrichM #outsourcing #privacy #ram #simulation
 - Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation (MTG, MM), pp. 576–587.
 - STOC-1996-Goodrich #parallel #sorting
 - Communication-Efficient Parallel Sorting (MTG), pp. 247–256.
 - STOC-1995-AmatoGR
 - Computing faces in segment and simplex arrangements (NMA, MTG, EAR), pp. 672–682.
 - PODS-1993-NodineGV #graph
 - Blocking for External Graph Searching (MHN, MTG, JSV), pp. 222–232.
 - STOC-1992-Goodrich #parallel
 - Planar Separators and Parallel Polygon Triangulation (MTG), pp. 507–516.
 - STOC-1991-GoodrichT
 - Dynamic Trees and Dynamic Point Location (MTG, RT), pp. 523–533.
 - ICALP-1990-ColeGO #diagrams #parallel #performance
 - Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (RC, MTG, CÓ), pp. 432–445.
 - ICALP-1990-GoodrichAO #trade-off
 - An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (MTG, MJA, MHO), pp. 689–702.
 















