Follow
Michael T. Goodrich
Michael T. Goodrich
Professor of Computer Science, University of California, Irvine
Verified email at uci.edu - Homepage
Title
Cited by
Cited by
Year
Data structures and algorithms in Java
MT Goodrich, R Tamassia, MH Goldwasser
John Wiley & Sons, 2014
6702014
Almost optimal set covers in finite VC-dimension
H Brönnimann, MT Goodrich
Discrete & Computational Geometry 14 (4), 463-479, 1995
5941995
Algorithm design: foundation, analysis and internet examples
MT Goodrich, R Tamassia
John Wiley & Sons, 2006
5182006
External-Memory Graph Algorithms.
YJ Chiang, MT Goodrich, EF Grove, R Tamassia, DE Vengroff, JS Vitter
SODA 95, 139-149, 1995
4551995
Probabilistic packet marking for large-scale IP traceback
MT Goodrich
IEEE/ACM Transactions on networking 16 (1), 15-24, 2008
401*2008
Loud and clear: Human-verifiable authentication based on audio
MT Goodrich, M Sirivianos, J Solis, G Tsudik, E Uzun
26th IEEE International Conference on Distributed Computing Systems (ICDCS …, 2006
3342006
Cascading divide-and-conquer: A technique for designing parallel algorithms
MJ Atallah, R Cole, MT Goodrich
SIAM Journal on Computing 18 (3), 499-532, 1989
3071989
External-memory computational geometry
MT Goodrich, JJ Tsay, DE Vengroff, JS Vitter
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 714-723, 1993
3031993
Privacy-preserving access of outsourced data via oblivious RAM simulation
MT Goodrich, M Mitzenmacher
International Colloquium on Automata, Languages, and Programming, 576-587, 2011
2812011
Privacy-preserving group data access via stateless oblivious RAM simulation
MT Goodrich, M Mitzenmacher, O Ohrimenko, R Tamassia
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
2572012
A multi-dimensional approach to force-directed layouts of large graphs
P Gajer, MT Goodrich, SG Kobourov
Computational Geometry 29 (1), 3-18, 2004
253*2004
Efficient tree-based revocation in groups of low-state devices
MT Goodrich, JZ Sun, R Tamassia
Annual International Cryptology Conference, 511-527, 2004
2312004
Sorting, searching, and simulation in the mapreduce framework
MT Goodrich, N Sitchinava, Q Zhang
International Symposium on Algorithms and Computation, 374-383, 2011
2282011
Implementation of an authenticated dictionary with skip lists and commutative hashing
MT Goodrich, R Tamassia, A Schwerin
Proceedings DARPA Information Survivability Conference and Exposition II …, 2001
2212001
Communication-efficient parallel sorting
MT Goodrich
SIAM Journal on Computing 29 (2), 416-432, 1999
1971999
Geometric pattern matching under Euclidean motion
LP Chew, MT Goodrich, DP Huttenlocher, K Kedem, JM Kleinberg, ...
Computational Geometry 7 (1-2), 113-124, 1997
193*1997
Invertible bloom lookup tables
MT Goodrich, M Mitzenmacher
2011 49th Annual Allerton Conference on Communication, Control, and …, 2011
1912011
Approximate geometric pattern matching under rigid motions
MT Goodrich, JSB Mitchell, MW Orletsky
IEEE Transactions on Pattern Analysis and Machine Intelligence 21 (4), 371-379, 1999
167*1999
Oblivious RAM simulation with efficient worst-case access overhead
MT Goodrich, M Mitzenmacher, O Ohrimenko, R Tamassia
Proceedings of the 3rd ACM workshop on Cloud computing security workshop, 95-100, 2011
1662011
Skip quadtrees: Dynamic data structures for multidimensional point sets
D Eppstein, MT Goodrich, JZ Sun
International Journal of Computational Geometry & Applications 18 (01n02 …, 2008
160*2008
The system can't perform the operation now. Try again later.
Articles 1–20