[10] T. Coleman, A.Lee, M. Medard, and M. Effros. A new source-splitting approach to the Slepian-Wolf problem. In Proceedings of the IEEE International Symposium on Information Theory, page 332, Chicago, June 2004. IEEE.

[26] H. Feng and M. Effros. On the achievable region for multiple description source codes on Gaussian sources. In Proceedings of the IEEE International Symposium on Information Theory, page 195, Yokohama, Japan, June 2003. IEEE.

[27] M. Fleming and M. Effros. Rate-distortion with mixed types of side information. In Proceedings of the IEEE International Symposium on Information Theory, page 144, Yokohama, Japan, June 2003. IEEE.

[28] T. Ho, R. Koetter, M. Medard, D. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory, page 442, Yokohama, Japan, June 2003. IEEE.

[45] H. Feng and M. Effros. A KLT can be arbitrarily worse than the optimal transform for transform coding. In Proceedings of the Conference on Information Sciences and Systems, 2002.

[46] D. Dugatkin, H.M. Zhou, T.F. Chan, and M. Effros. Lagrangian optimization of the group testing for wavelets algorithm. In Proceedings of the Conference on Information Sciences and Systems, Princeton, NJ, March 2002.

[47] H. Feng and M. Effros. On the rate-distortion performance and computational efficiency of the Karhunen Loeve transform for lossy data compression. IEEE Transactions on Image Processing, 11(2):113-122, February 2002.

[79] M. Effros and A. J. Goldsmith. Capacity definitions and coding strategies for general channels with receiver side information. In Proceedings of the IEEE International Symposium on Information Theory, page 39, Cambridge, Massachusetts, August 1998. IEEE.

[101] P. A. Chou and M. Effros. Rate and distortion redundancies for source coding with respect to a fidelity criterion. In Proceedings of the IEEE International Symposium on Information Theory, page 53, San Antonio, Texas, January 1993.