Data structures and algorithms in Java MT Goodrich, R Tamassia, MH Goldwasser John wiley & sons, 2014 | 760 | 2014 |
Almost optimal set covers in finite VC-dimension: (preliminary version) H Brönnimann, MT Goodrich Proceedings of the tenth annual symposium on Computational geometry, 293-302, 1994 | 650 | 1994 |
Algorithm design: foundations, analysis, and internet examples MT Goodrich, R Tamassia John Wiley & Sons, 2001 | 562 | 2001 |
External-memory graph algorithms YJ Chiang, MT Goodrich, EF Grove, R Tamassia, DE Vengroff, JS Vitter Society for Industrial and Applied Mathematics, 1995 | 473 | 1995 |
Probabilistic packet marking for large-scale IP traceback MT Goodrich IEEE/ACM Transactions on networking 16 (1), 15-24, 2008 | 418* | 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 | 345 | 2006 |
Privacy-preserving access of outsourced data via oblivious RAM simulation MT Goodrich, M Mitzenmacher International Colloquium on Automata, Languages, and Programming, 576-587, 2011 | 323 | 2011 |
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 | 319 | 1989 |
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 | 318 | 1993 |
Sorting, searching, and simulation in the mapreduce framework MT Goodrich, N Sitchinava, Q Zhang International Symposium on Algorithms and Computation, 374-383, 2011 | 287 | 2011 |
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 | 279 | 2012 |
A multi-dimensional approach to force-directed layouts of large graphs P Gajer, MT Goodrich, SG Kobourov Computational Geometry 29 (1), 3-18, 2004 | 272* | 2004 |
Invertible bloom lookup tables MT Goodrich, M Mitzenmacher 2011 49th Annual Allerton Conference on Communication, Control, and …, 2011 | 261 | 2011 |
Efficient tree-based revocation in groups of low-state devices MT Goodrich, JZ Sun, R Tamassia Advances in Cryptology–CRYPTO 2004: 24th Annual International Cryptology …, 2004 | 248 | 2004 |
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 | 236 | 2001 |
Communication-efficient parallel sorting (preliminary version) MT Goodrich Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996 | 211 | 1996 |
Geometric pattern matching under Euclidean motion LP Chew, MT Goodrich, DP Huttenlocher, K Kedem, JM Kleinberg, ... Computational Geometry 7 (1-2), 113-124, 1997 | 210 | 1997 |
What's the difference? Efficient set reconciliation without prior context D Eppstein, MT Goodrich, F Uyeda, G Varghese ACM SIGCOMM Computer Communication Review 41 (4), 218-229, 2011 | 198 | 2011 |
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 | 188* | 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 | 175 | 2011 |