| Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem MY Kao, JH Reif, SR Tate Information and computation 131 (1), 63-79, 1996 | 259 | 1996 |
| Band ordering in lossless compression of multispectral images SR Tate IEEE Transactions on Computers 46 (4), 477-483, 1997 | 199 | 1997 |
| On threshold circuits and polynomial computation JH Reif, SR Tate SIAM Journal on Computing 21, 896, 1992 | 181 | 1992 |
| A direct anonymous attestation scheme for embedded devices H Ge, SR Tate Public Key Cryptography–PKC 2007: 10th International Conference on Practice …, 2007 | 95 | 2007 |
| The advanced encryption standard SR Tate | 95 | 2001 |
| Higher Compression from the Burrows-Wheeler Transform by Modified Sorting. B Chapin, SR Tate Data Compression Conference, 532, 1998 | 51 | 1998 |
| Optimal size integer division circuits JH Reif, SR Tate Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989 | 50 | 1989 |
| Multi-user dynamic proofs of data possession using trusted hardware SR Tate, R Vishwanathan, L Everhart Proceedings of the third ACM conference on Data and application security and …, 2013 | 46 | 2013 |
| Protomon: Embedded monitors for cryptographic protocol intrusion detection and prevention SP Joglekar, SR Tate Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004 …, 2004 | 46 | 2004 |
| Mobile Agent Security Through Multi-Agent Cryptographic Protocols. SR Tate, K Xu International Conference on Internet Computing, 462-470, 2003 | 43 | 2003 |
| The complexity of N-body simulation JH Reif, SR Tate Automata, Languages and Programming: 20th International Colloquium, ICALP 93 …, 1993 | 37 | 1993 |
| Generalized non-interactive oblivious transfer using count-limited objects with applications to secure mobile agents V Gunupudi, SR Tate International Conference on Financial Cryptography and Data Security, 98-112, 2008 | 32 | 2008 |
| On garbled circuits and constant round secure function evaluation SR Tate, K Xu CoPS Lab, University of North Texas, Tech. Rep 2, 2003, 2003 | 30 | 2003 |
| SAgent: A security framework for JADE V Gunupudi, SR Tate Proceedings of the fifth international joint conference on Autonomous agents …, 2006 | 28 | 2006 |
| Approximate kinodynamic planning using l2-norm dynamics bounds JH Reif, SR Tate Duke University, Durham, NC, 1990 | 28* | 1990 |
| The power of combining the techniques of algebraic and numerical computing: Improved approximate multipoint polynomial evaluation and improved multipole algorithms VY Pan, JH Reif, SR Tate Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 703-713, 1992 | 24 | 1992 |
| On dynamic algorithms for algebraic problems JH Reif, SR Tate Journal of Algorithms 22 (2), 347-371, 1997 | 21 | 1997 |
| Online matching with blocked input MY Kao, SR Tate Information Processing Letters 38 (3), 113-116, 1991 | 20 | 1991 |
| Online/offline signature schemes for devices with limited computing capabilities P Yu, SR Tate Cryptographers’ Track at the RSA Conference, 301-317, 2008 | 18 | 2008 |
| Lossless compression of region edge maps SR Tate Dept. Comput. Sci., Duke Univ., Durham, NC, Tech. Rep. CS-1992-9, 1992 | 18 | 1992 |
John ReifA. Hollis Edens Distinguished Professor, Department of Computer Science, Duke UniversityDirección de correo verificada de cs.duke.edu
