Publications
2003. Construction of an efficient overlay multicast infrastructure for real-time applications. INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies. 2:1521-1531vol.2-1521-1531vol.2.
2009. Generating simplified trapping probability models from simulation of optical tweezers system. Journal of Computing and Information Science in Engineering. 9:021003-021003.
2006. A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts. Geometric Modeling and Processing - GMP 2006. 4077:500-513.
2006. OMNI: An efficient overlay multicast infrastructure for real-time applications. Computer Networks. 50(6):826-841.
2004. Scalable resilient media streaming. Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video. :4-9.
2007. Geometrical algorithms for automated design of side actions in injection moulding of complex parts. Computer-Aided Design. 39(10):882-897.
2002. Scalable secure group communication over IP multicast. Selected Areas in Communications, IEEE Journal on. 20(8):1511-1527.
2007. Incorporating manufacturability considerations during design of injection molded multi-material objects. Research in Engineering Design. 17(4):207-231.
2010. Developing a Stochastic Dynamic Programming Framework for Optical Tweezer-Based Automated Particle Transport Operations. Automation Science and Engineering, IEEE Transactions on. 7(2):218-227.
2002. Scalable peer finding on the Internet. Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE. 3:2205-2209vol.3-2205-2209vol.3.
2002. Efficient Data Processing using Cross Layer Hints. Technical Reports from UMIACS, UMIACS-TR-2002-59.
2010. On k-Column Sparse Packing Programs. Integer Programming and Combinatorial OptimizationInteger Programming and Combinatorial Optimization. 6080:369-382.
1985. Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems (TOPLAS). 7(2):348-357.
1982. Complexity of finding k-path-free dominating sets in graphs. INFO. PROC. LETT.. 14(5):228-232.