Publications
2008. Activity Modeling Using Event Probability Sequences. Image Processing, IEEE Transactions on. 17(4):594-607.
2007. Epitomic Representation of Human Activities. Computer Vision and Pattern Recognition, 2007. CVPR '07. IEEE Conference on. :1-8.
1993. RF scattering and radiation by using a decoupled Helmholtz equation approach. Magnetics, IEEE Transactions on. 29(2):2040-2042.
1988. A general-purpose simulation environment for developing connectionist models. Simulation. 51(1):5-5.
1992. Software approaches to segmentation analysis. Computer Science Technical Report Series; Vol. CS-TR-2991. :24-24.
1989. Parallel plan execution with self-processing networks. Telematics and Informatics. 6(3-4):145-157.
2007. Geometrical Characteristics of Regular Polyhedra: Application to EXAFS Studies of Nanoclusters. X-RAY ABSORPTION FINE STRUCTURE - XAFS13: 13th International Conference. 882:746-748.
2014. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. :217-239.
2009. Efficient Robust Private Set Intersection. Applied Cryptography and Network Security. :125-142.
2012. Securing Circuits against Constant-Rate Tampering. Advances in Cryptology – CRYPTO 2012. :533-551.
2014. On Minimal Assumptions for Sender-Deniable Public Key Encryption. Public-Key Cryptography – PKC 2014. :574-591.
2011. Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. Applied Cryptography and Network Security. :130-146.
2007. Distribution-Free Testing Lower Bounds for Basic Boolean Functions. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :494-508.
2013. Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments. Advances in Cryptology - ASIACRYPT 2013. :316-336.
2007. Configuration Reasoning and Ontology For Web. IEEE International Conference on Services Computing, 2007. SCC 2007. :387-394.
2008. Optimal Cryptographic Hardness of Learning Monotone Functions. Automata, Languages and Programming. :36-47.
2011. A Canonical Form for Testing Boolean Function Properties. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. :460-471.
1997. Hardness of flip-cut problems from optical mapping. Journal of Computational Biology. 4(2):119-125.
1997. Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
2005. Dynamic Queries and Brushing on Choropleth Maps (2001). Institute for Systems Research Technical Reports.
2001. Dynamic queries and brushing on choropleth maps. Fifth International Conference on Information Visualisation, 2001. Proceedings. :757-764.