Michael T. Goodrich Research Group

University of California, Irvine

What efficient algorithms and data structures enable secure, privacy-preserving computation on large distributed systems? His research develops algorithm designs and data structures for diverse computational models including RAM, parallel, distributed, and external-memory. The group works on privacy-preserving data access and efficient solutions for problems like nearest-neighbor searching, convex hulls, and sorting using theoretical and practical algorithmic techniques. Researchers build secure distributed data structures and protocols to support information assurance and cloud security. The group applies these algorithmic methods to networking, machine learning, and geometric computing problems.