Michael T. Goodrich
Computer Networks and Communications · 2005–2014
A researcher in the Science corpus: 4 papers; trusts 21 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 16 citations into it; #5,448 of 9,886 by trust here, #6,788 by citations
- Artificial Intelligence — 15 citations into it; #19,370 of 35,345 by trust here, #23,077 by citations
- Computational Theory and Mathematics — 6 citations into it
Whom Michael T. Goodrich trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Rafail M. Ostrovsky
- Benny Pinkas
- Rasmus Pagh
- Philippe Golle
- Oded Goldreich
- James Aspnes
- Benny Chor
- Shuo Chen
- Bernard Chazelle
- Tzachy Reinman
Who trusts Michael T. Goodrich overall
- Yuliang Li
- James Bell
- Tong Yang
- O. Ohrimenko
- Rui Miao
- Kallista A. Bonawitz
- Ú. Erlingsson
- Felix Schuster
- Jie Jiang
- Hung Dang
Papers from Michael T. Goodrich's perspective
Ordered by how strongly the researchers Michael T. Goodrich trusts endorse each paper. Same corpus, a different order for every researcher.
- Space/time trade-offs in hash coding with allowable errors
- Towards a theory of software protection and simulation by oblivious RAMs
- Software protection and simulation on oblivious RAMs
- Private information retrieval
- Cuckoo Hashing
- Computationally Private Information Retrieval with Polylogarithmic Communication
- Network Applications of Bloom Filters: A Survey
- An improved data stream summary: the count-min sketch and its applications
- Replication is not needed: single database, computationally-private information retrieval
- Building castles out of mud: practical access pattern privacy and correctness on untrusted storage (Conference on Computer and Communications Security)
Their papers
- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud (2014) — 77 citations
- Invertible bloom lookup tables (2011) — 251 citations
- The rainbow skip graph: a fault-tolerant constant-degree distributed data structure (2006) — 58 citations
- Searching for High-Value Rare Events with Uncheatable Grid Computing (2005) — 33 citations