Publications
2003. Energy-efficient broadcast and multicast trees for reliable wireless communication. Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE. 1:660-667vol.1-660-667vol.1.
2002. Analysis of the NICE Application Layer Multicast Protocol. Technical Reports from UMIACS, UMIACS-TR-2002-60.
1991. Pyramid computation of neighbor distance statistics in dot patterns. CVGIP: Graphical Models and Image Processing. 53(4):373-381.
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.
2004. SESSION 2: STREAMING. Proceedings of the 14th International Workshop on Network and Operating Systems Support for Digital Audio and Video: NOSSDAV 2003: June 16-18, 2004, Cork, Ireland. :3-3.
2009. A Decoupled and Prioritized Stochastic Dynamic Programming Approach for Automated Transport of Multiple Particles Using Optical Tweezers. 6:785-796.
2004. Scalable resilient media streaming. Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video. :4-9.
2006. OMNI: An efficient overlay multicast infrastructure for real-time applications. Computer Networks. 50(6):826-841.
2002. Scalable secure group communication over IP multicast. Selected Areas in Communications, IEEE Journal on. 20(8):1511-1527.
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.
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.
1996. Hybrid network management (communication systems). 16th AIAA International Communications Satellite Systems Conference.