Publications
1999. Efficient learning using constrained sufficient statistics. Proceedings of the 7th International Workshop on Artificial Intelligence and Statistics (AISTATS-99).
1996. Efficient local model-checking for fragments of the modal $\mu$-calculus. Tools and Algorithms for the Construction and Analysis of Systems. :107-126.
2007. Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications. 25(1):62-72.
2005. Efficient online computation of statement coverage. Journal of Systems and Software. 78(2):146-165.
1994. An efficient parallel algorithm for the single function coarsest partition problem. Theoretical computer science. 129(2):293-307.
1986. Efficient Parallel and Serial String Matching. Computer Science Department Technical Report. 221
2011. EFFICIENT PARALLEL NON-NEGATIVE LEAST SQUARES ON MULTI-CORE ARCHITECTURES. SIAM Journal on Scientific Computing. 33(5):2848-2863.
1995. Efficient parsing for Korean and English: A parameterized message-passing approach. Computational Linguistics. 21(2):255-263.
2001. Efficient password-authenticated key exchange using human-memorable passwords. Advances in Cryptology—EUROCRYPT 2001. :475-494.
2009. Efficient peer-to-Peer lookup in multi-hop wireless networks. KSII Trans. Internet and Information Systems. 3(1):5-25.
2004. Efficient peer-to-peer namespace searches. University of Maryland, College Park, MD, Tech. Rep. CSTR-4568.
2000. Efficient performance prediction for large-scale, data-intensive applications. International Journal of High Performance Computing Applications. 14(3):216-216.
1988. An efficient pictorial database system for PSQL. IEEE Transactions on Software Engineering. 14(5):639-650.
2011. Efficient privacy-preserving biometric identification. Network and Distributed System Security Symposium.
2001. Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
1998. Efficient randomized algorithms for the repeated median line estimator. Algorithmica. 20(2):136-150.
2010. Efficient rational secret sharing in standard communication networks. Theory of Cryptography. :419-436.
2007. Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology. 20(4):493-514.