<h1>Effros, Michelle</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Sun, Siming and Effros, Michelle (2024) <a href="https://authors.library.caltech.edu/records/h189z-y6s04">Almost Lossless Onion Peeling Data Compression</a>; ISBN 979-8-3503-8587-8; 2024 Data Compression Conference (DCC); 472-481; <a href="https://doi.org/10.1109/dcc58796.2024.00055">10.1109/dcc58796.2024.00055</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2023) <a href="https://authors.library.caltech.edu/records/d2gvc-3yj77">Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels</a>; IEEE Transactions on Information Theory; <a href="https://doi.org/10.1109/tit.2023.3338632">10.1109/tit.2023.3338632</a></li>
<li>Han, SooJean and Effros, Michelle, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20221219-234018464">OUTformation: Distributed Data-Gathering with Feedback under Unknown Environment and Communication Delay Constraints</a>; <a href="https://doi.org/10.48550/arXiv.2208.06395">10.48550/arXiv.2208.06395</a></li>
<li>Kosut, Oliver and Effros, Michelle, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-765731000">On the Benefit of Cooperation in Relay Networks</a>; ISBN 978-1-6654-2159-1; 2022 IEEE International Symposium on Information Theory (ISIT); 1945-1950; <a href="https://doi.org/10.1109/isit50566.2022.9834763">10.1109/isit50566.2022.9834763</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-765685000">Third-order Analysis of Channel Coding in the Moderate Deviations Regime</a>; ISBN 978-1-6654-2159-1; 2022 IEEE International Symposium on Information Theory (ISIT); 2309-2314; <a href="https://doi.org/10.1109/isit50566.2022.9834841">10.1109/isit50566.2022.9834841</a></li>
<li>Sun, Siming and Effros, Michelle (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-765699000">Source Coding with Unreliable Side Information in the Finite Blocklength Regime</a>; ISBN 978-1-6654-2159-1; 2022 IEEE International Symposium on Information Theory (ISIT); 222-227; <a href="https://doi.org/10.1109/isit50566.2022.9834490">10.1109/isit50566.2022.9834490</a></li>
<li>Langberg, Michael and Effros, Michelle (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201325308">Network Coding Multicast Key-Capacity</a>; <a href="https://doi.org/10.48550/arXiv.2202.03918">10.48550/arXiv.2202.03918</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211122-171053652">Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis</a>; IEEE Transactions on Information Theory; Vol. 67; No. 11; 6983-7009; <a href="https://doi.org/10.1109/tit.2021.3111676">10.1109/tit.2021.3111676</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220105-510075300">Nested Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels</a>; ISBN 978-1-6654-0312-2; 2021 IEEE Information Theory Workshop (ITW); 1-6; <a href="https://doi.org/10.1109/itw48936.2021.9611385">10.1109/itw48936.2021.9611385</a></li>
<li>Noorzad, Parham and Langberg, Michael, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210729-170824093">Negligible Cooperation: Contrasting the Maximaland Average-Error Cases</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5885-5902; <a href="https://doi.org/10.1109/tit.2021.3093891">10.1109/tit.2021.3093891</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210825-143502652">The Birthday Problem and Zero-Error List Codes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 9; 5791-5803; <a href="https://doi.org/10.1109/tit.2021.3100806">10.1109/tit.2021.3100806</a></li>
<li>Kosut, Oliver and Effros, Michelle, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211122-162445616">Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 2214-2219; <a href="https://doi.org/10.1109/isit45174.2021.9517769">10.1109/isit45174.2021.9517769</a></li>
<li>Liu, Yuxin and Effros, Michelle (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211105-214402906">Nested LDPC Codes for Random Access Communication</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 1877-1882; <a href="https://doi.org/10.1109/isit45174.2021.9518171">10.1109/isit45174.2021.9518171</a></li>
<li>Langberg, Michael and Effros, Michelle (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200526-155245665">Edge removal in undirected networks</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory; 1421-1426; <a href="https://doi.org/10.1109/ISIT45174.2021.9518243">10.1109/ISIT45174.2021.9518243</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210329-152031630">Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory; 1883-1888; <a href="https://doi.org/10.1109/ISIT45174.2021.9517993">10.1109/ISIT45174.2021.9517993</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210113-163504947">Random Access Channel Coding in the Finite Blocklength Regime</a>; IEEE Transactions on Information Theory; Vol. 67; No. 4; 2115-2140; <a href="https://doi.org/10.1109/tit.2020.3047630">10.1109/tit.2020.3047630</a></li>
<li>Langberg, Michael and Effros, Michelle (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201329416">Beyond Capacity: The Joint Time-Rate Region</a>; <a href="https://doi.org/10.48550/arXiv.2101.12236">10.48550/arXiv.2101.12236</a></li>
<li>Chen, Shuqing and Effros, Michelle, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200723-131543186">Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios</a>; IEEE Transactions on Information Theory; Vol. 66; No. 11; 6688-6722; <a href="https://doi.org/10.1109/tit.2020.3005155">10.1109/tit.2020.3005155</a></li>
<li>Liu, Yuxin and Effros, Michelle (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200527-072536184">Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 361-366; <a href="https://doi.org/10.1109/ISIT44484.2020.9173963">10.1109/ISIT44484.2020.9173963</a></li>
<li>Yavas, Recep Can and Kostina, Victoria, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105613893">Gaussian Multiple and Random Access in the Finite Blocklength Regime</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 3013-3018; <a href="https://doi.org/10.1109/ISIT44484.2020.9174026">10.1109/ISIT44484.2020.9174026</a></li>
<li>Wei, Fei and Langberg, Michael, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105545016">Towards an Operational Definition of Group Network Codes</a>; <a href="https://doi.org/10.48550/arXiv.2002.00781">10.48550/arXiv.2002.00781</a></li>
<li>Langberg, Michael and Effros, Michelle (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191031-124927142">The Edge-Removal Problem's Connections to the Zero-Error and δ-Dependence Problems in Network Coding</a>; IEEE Transactions on Information Theory; Vol. 66; No. 2; 900-913; <a href="https://doi.org/10.1109/tit.2019.2949803">10.1109/tit.2019.2949803</a></li>
<li>Noorzad, Parham and Langberg, Michael, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200214-105541551">Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases</a>; <a href="https://doi.org/10.48550/arXiv.1911.10449">10.48550/arXiv.1911.10449</a></li>
<li>Chaudhuri, Debaditya and Langberg, Michael, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333424">Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 2309-2313; <a href="https://doi.org/10.1109/isit.2019.8849665">10.1109/isit.2019.8849665</a></li>
<li>Arrieta, Miguel and Esnaola, Iñaki, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333246">Universal Privacy Guarantees for Smart Meters</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 2154-2158; <a href="https://doi.org/10.1109/isit.2019.8849679">10.1109/isit.2019.8849679</a></li>
<li>Chen, Shuqing and Effros, Michelle, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-132221601">Lossless Source Coding in the Point-to-Point, Multiple Access, and Random Access Scenarios</a>; ISBN 978-1-5386-9291-2; 2019 IEEE International Symposium on Information Theory (ISIT); 1692-1696; <a href="https://doi.org/10.1109/ISIT.2019.8849742">10.1109/ISIT.2019.8849742</a></li>
<li>Wei, Fei and Langberg, Michael, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100329963">A Local Perspective on the Edge Removal Problem</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 191-195; <a href="https://doi.org/10.1109/isit.2019.8849282">10.1109/isit.2019.8849282</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181126-145651855">Can Negligible Cooperation Increase Capacity? The Average-Error Case</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 1256-1260; <a href="https://doi.org/10.1109/ISIT.2018.8437746">10.1109/ISIT.2018.8437746</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170614-160818881">Can Negligible Rate Increase Network Reliability?</a>; IEEE Transactions on Information Theory; Vol. 64; No. 6; 4282-4293; <a href="https://doi.org/10.1109/TIT.2017.2713801">10.1109/TIT.2017.2713801</a></li>
<li>Effros, Michelle and Kostina, Victoria, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181126-150049870">Random Access Channel Coding in the Finite Blocklength Regime</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 1261-1265; <a href="https://doi.org/10.1109/ISIT.2018.8437831">10.1109/ISIT.2018.8437831</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180104-165541678">The Unbounded Benefit of Encoder Cooperation for the k-user MAC</a>; IEEE Transactions on Information Theory; Vol. 64; No. 5; 3655-3678; <a href="https://doi.org/10.1109/TIT.2017.2777965">10.1109/TIT.2017.2777965</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-145653639">Can Negligible Cooperation Increase Network Capacity? The Average-Error Case</a>; <a href="https://doi.org/10.48550/arXiv.1801.03655">10.48550/arXiv.1801.03655</a></li>
<li>Wong, Ming Fai and Effros, Michelle, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-151411717">A code equivalence between streaming network coding and streaming index coding</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 1638-1642; <a href="https://doi.org/10.1109/ISIT.2017.8006807">10.1109/ISIT.2017.8006807</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-163747105">The birthday problem and zero-error list codes</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 1648-1652; <a href="https://doi.org/10.1109/ISIT.2017.8006809">10.1109/ISIT.2017.8006809</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-155534409">The benefit of encoder cooperation in the presence of state information</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 41-45; <a href="https://doi.org/10.1109/ISIT.2017.8006486">10.1109/ISIT.2017.8006486</a></li>
<li>Effros, Michelle and Poor, H. Vincent (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170911-153412853">Claude Shannon: His Work and Its Legacy</a>; EMS Newsletter; Vol. 2017; 29-34; <a href="https://doi.org/10.4171/NEWS/103/5">10.4171/NEWS/103/5</a></li>
<li>Langberg, Michael and Effros, Michelle (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170616-101527136">On the Capacity Advantage of a Single Bit</a>; ISBN 978-1-5090-2482-7; Globecom Workshops (GC Wkshps), 2016; 1-6; <a href="https://doi.org/10.1109/GLOCOMW.2016.7848976">10.1109/GLOCOMW.2016.7848976</a></li>
<li>Jalali, Shirin and Effros, Michelle, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-145650198">On the Impact of a Single Edge on the Network Coding Capacity</a>; <a href="https://doi.org/10.48550/arXiv.1607.06793">10.48550/arXiv.1607.06793</a></li>
<li>Kim, Woong and Langberg, Michael, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-104540804">A characterization of the capacity region for network coding with dependent sources</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 1764-1768; <a href="https://doi.org/10.1109/ISIT.2016.7541602">10.1109/ISIT.2016.7541602</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160823-153226672">The unbounded benefit of encoder cooperation for the k-user MAC</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 340-344; <a href="https://doi.org/10.1109/ISIT.2016.7541317">10.1109/ISIT.2016.7541317</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-091111532">Can negligible cooperation increase network reliability?</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 1784-1788; <a href="https://doi.org/10.1109/ISIT.2016.7541606">10.1109/ISIT.2016.7541606</a></li>
<li>Wong, Ming Fai and Effros, Michelle, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-105856700">On tightness of an entropic region outer bound for network coding and the edge removal property</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 1769-1773; <a href="https://doi.org/10.1109/ISIT.2016.7541603">10.1109/ISIT.2016.7541603</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-145646746">The Multivariate Covering Lemma and its Converse</a>; <a href="https://doi.org/10.48550/arXiv.1508.03349">10.48550/arXiv.1508.03349</a></li>
<li>Andrews, Jeff and Dimakis, Alex, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-145643163">A Perspective on Future Research Directions in Information Theory</a>; <a href="https://doi.org/10.48550/arXiv.1507.05941">10.48550/arXiv.1507.05941</a></li>
<li>Ji, Mingyue and Wong, Ming Fai, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160901-145310351">On the Fundamental Limits of Caching in Combination Networks</a>; ISBN 978-1-4799-1931-4; IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC); 695-699; <a href="https://doi.org/10.1109/SPAWC.2015.7227127">10.1109/SPAWC.2015.7227127</a></li>
<li>Wong, Ming Fai and Effros, Michelle, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151006-104241849">On an equivalence of the reduction of k-unicast to 2-unicast capacity and the edge removal property</a>; ISBN 978-1-4673-7704-1; 2015 IEEE International Symposium on Information Theory; 371-375; <a href="https://doi.org/10.1109/ISIT.2015.7282479">10.1109/ISIT.2015.7282479</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151006-134532103">On the cost and benefit of cooperation</a>; ISBN 978-1-4673-7704-1; 2015 IEEE International Symposium on Information Theory; 36-40; <a href="https://doi.org/10.1109/ISIT.2015.7282412">10.1109/ISIT.2015.7282412</a></li>
<li>Effros, Michelle and El Rouayheb, Salim, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150324-094743353">An Equivalence between Network Coding and Index Coding</a>; IEEE Transactions on Information Theory; Vol. 61; No. 5; 2478-2487; <a href="https://doi.org/10.1109/TIT.2015.2414926">10.1109/TIT.2015.2414926</a></li>
<li>Jalali, Shirin and Effros, Michelle (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150420-095344158">Separation of Source-Network Coding and Channel Coding in Wireline Networks</a>; IEEE Transactions on Information Theory; Vol. 61; No. 4; 1524-1538; <a href="https://doi.org/10.1109/TIT.2015.2397932">10.1109/TIT.2015.2397932</a></li>
<li>Effros, Michelle and Langberg, Michael (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150109-094609255">Is there a canonical network for network information theory?</a>; <a href="https://doi.org/10.1109/ITW.2014.6970797">10.1109/ITW.2014.6970797</a></li>
<li>Heidarzadeh, Anoosheh and Zhao, Shiyu, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150203-101915601">Efficient pooling against strategic adversary with applications in anonymous and reliable networking</a>; ISBN 978-1-4799-8009-3; 2014 52nd Annual Allerton Conference on Communication, Control, and Computing; 1317-1324; <a href="https://doi.org/10.1109/ALLERTON.2014.7028608">10.1109/ALLERTON.2014.7028608</a></li>
<li>Wong, M. F. and Langberg, M., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150227-085509466">Linear Capacity Equivalence Between Multiple Multicast and Multiple Unicast</a>; ISBN 978-1-4799-5186-4; 2014 IEEE International Symposium on Information Theory (ISIT); 2152-2156; <a href="https://doi.org/10.1109/ISIT.2014.6875214">10.1109/ISIT.2014.6875214</a></li>
<li>Koetter, Ralf and Effros, Michelle, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141016-103239168">A Theory of Network Equivalence - Part II: Multiterminal Channels</a>; IEEE Transactions on Information Theory; Vol. 60; No. 7; 3709-3732; <a href="https://doi.org/10.1109/TIT.2014.2319075">10.1109/TIT.2014.2319075</a></li>
<li>Noorzad, Parham and Effros, Michelle, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150227-092238378">On the power of cooperation: Can a little help a lot?</a>; ISBN 978-1-4799-5186-4; 2014 IEEE International Symposium on Information Theory (ISIT); 3132-3136; <a href="https://doi.org/10.1109/ISIT.2014.6875411">10.1109/ISIT.2014.6875411</a></li>
<li>Dikaliotis, Theodoros K. and Dimakis, Alexandros G., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140529-100215879">On the Delay Advantage of Coding in Packet Erasure Networks</a>; IEEE Transactions on Information Theory; Vol. 60; No. 5; 2868-2883; <a href="https://doi.org/10.1109/TIT.2014.2306817">10.1109/TIT.2014.2306817</a></li>
<li>Lee, Eun Jee and Langberg, Michael, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140306-131703841">Outer Bounds and a Functional Study of the Edge Removal Problem</a>; ISBN 978-1-4799-1321-3; 2013 IEEE Information Theory Workshop (ITW); 1-5; <a href="https://doi.org/10.1109/ITW.2013.6691271">10.1109/ITW.2013.6691271</a></li>
<li>Levi, I. and Vilenchik, D., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170125-145710627">Zero vs. ε error in interference channels</a>; ISBN 978-1-4799-1323-7; 2013 IEEE Information Theory Workshop (ITW); 1-5; <a href="https://doi.org/10.1109/ITW.2013.6691281">10.1109/ITW.2013.6691281</a></li>
<li>Wong, M. F. and Langberg, M., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170125-162234095">On a capacity equivalence between network and index coding and the edge removal problem</a>; ISBN 978-1-4799-0446-4; 2013 IEEE International Symposium on Information Theory; 972-976; <a href="https://doi.org/10.1109/ISIT.2013.6620371">10.1109/ISIT.2013.6620371</a></li>
<li>Effros, M. and El Rouayheb, S., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170125-152255596">An equivalence between network coding and index coding</a>; ISBN 978-1-4799-0446-4; 2013 IEEE International Symposium on Information Theory; 967-971; <a href="https://doi.org/10.1109/ISIT.2013.6620370">10.1109/ISIT.2013.6620370</a></li>
<li>Karagöz, Batuhan and Yavuz, Semih, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190402-145635729">Multi-Resolution Video Streaming in Peer-to-peer Networks</a>; <a href="https://doi.org/10.48550/arXiv.1304.1858">10.48550/arXiv.1304.1858</a></li>
<li>Dikaliotis, Theodoros K. and Yao, Hongyi, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130731-073911147">Network Equivalence in the Presence of an Eavesdropper</a>; ISBN 978-1-4673-4537-8; 2012 50th Annual Allerton Conference on Communication, Control, and Computing; 960-967; <a href="https://doi.org/10.1109/Allerton.2012.6483322">10.1109/Allerton.2012.6483322</a></li>
<li>Bakshi, Mayank and Effros, Michelle (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170201-165323248">On network coding capacity under on-off scheduling</a>; ISBN 978-1-4673-2579-0; 2012 IEEE International Symposium on Information Theory Proceedings; 1667-1671; <a href="https://doi.org/10.1109/ISIT.2012.6283560">10.1109/ISIT.2012.6283560</a></li>
<li>Effros, Michelle (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120618-103335318">On dependence and delay: Capacity bounds for wireless networks</a>; ISBN 978-1-4673-0436-8; 2012 IEEE Wireless Communications and Networking Conference (WCNC); 550-554; <a href="https://doi.org/10.1109/WCNC.2012.6214429">10.1109/WCNC.2012.6214429</a></li>
<li>Marden, Jason R. and Effros, Michelle (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120502-135624623">The Price of Selfishness in Network Coding</a>; IEEE Transactions on Information Theory; Vol. 58; No. 4; 2349-2361; <a href="https://doi.org/10.1109/TIT.2011.2177576">10.1109/TIT.2011.2177576</a></li>
<li>Effros, Michelle (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170306-170616021">On sources and networks: Can computational tools derive information theoretic limits?</a>; ISBN 978-1-4577-1818-2; 49th Annual Allerton Conference on Communication, Control, and Computing; 1190-1194; <a href="https://doi.org/10.1109/Allerton.2011.6120302">10.1109/Allerton.2011.6120302</a></li>
<li>Langberg, M. and Effros, M. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170307-164206303">Network coding: Is zero error always possible?</a>; ISBN 978-1-4577-1818-2; 49th Annual Allerton Conference on Communication, Control, and Computing; 1478-1485; <a href="https://doi.org/10.1109/Allerton.2011.6120342">10.1109/Allerton.2011.6120342</a></li>
<li>Yao, Hongyi and Ho, Tracey, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120405-094455952">On the Equivalence of Shannon Capacity and Stable Capacity in Networks with Memoryless Channels</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 503-507; <a href="https://doi.org/10.1109/ISIT.2011.6034178">10.1109/ISIT.2011.6034178</a></li>
<li>Jalali, Shirin and Effros, Michelle (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120405-085320474">On Distortion Bounds for Dependent Sources Over Wireless Networks</a>; ISBN 978-1-4577-0596-0; 2011 IEEE international symposium on information theory proceedings; 46-50; <a href="https://doi.org/10.1109/ISIT.2011.6034171">10.1109/ISIT.2011.6034171</a></li>
<li>Bakshi, Mayank and Effros, Michelle, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120406-092406435">On Equivalence for Networks of Noisy Channels under Byzantine Attacks</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 973-977; <a href="https://doi.org/10.1109/ISIT.2011.6034284">10.1109/ISIT.2011.6034284</a></li>
<li>Feng, Hanying and Effros, Michelle (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110615-075056151">Near Optimality of Composite Multiple Description Source Codes</a>; IEEE Transactions on Information Theory; Vol. 57; No. 6; 3783-3795; <a href="https://doi.org/10.1109/TIT.2011.2132890">10.1109/TIT.2011.2132890</a></li>
<li>Goldsmith, Andrea and Effros, Michelle, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110601-090031771">Beyond Shannon: the quest for fundamental performance limits of wireless ad hoc networks</a>; IEEE Communications Magazine; Vol. 49; No. 5; 195-205; <a href="https://doi.org/10.1109/MCOM.2011.5762818">10.1109/MCOM.2011.5762818</a></li>
<li>Kim, Sukwon and Ho, Tracey, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110316-153639993">Network Error Correction With Unequal Link Capacities</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 1144-1164; <a href="https://doi.org/10.1109/TIT.2010.2095090">10.1109/TIT.2010.2095090</a></li>
<li>Dikaliotis, Theodoros K. and Ho, Tracey, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110314-145005157">Multiple-Access Network Information-Flow and Correction Codes</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 1067-1079; <a href="https://doi.org/10.1109/TIT.2010.2095130">10.1109/TIT.2010.2095130</a></li>
<li>Ho, Tracey and Kim, Sukwon, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170308-155527646">On network error correction with limited feedback capacity</a>; ISBN 978-1-4577-0361-4; 2011 Information Theory and Applications Workshop; <a href="https://doi.org/10.1109/ITA.2011.5743579">10.1109/ITA.2011.5743579</a></li>
<li>Koetter, Ralf and Effros, Michelle, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110322-093250669">A Theory of Network Equivalence-
Part I: Point-to-Point Channels</a>; IEEE Transactions on Information Theory; Vol. 57; No. 2; 972-995; <a href="https://doi.org/10.1109/TIT.2010.2102110">10.1109/TIT.2010.2102110</a></li>
<li>Koetter, Ralf and Effros, Michelle, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120531-144116913">A Theory of Network Equivalence, Parts I and II</a>; <a href="https://doi.org/10.48550/arXiv.1007.1033">10.48550/arXiv.1007.1033</a></li>
<li>Feizi, Soheil and Médard, Muriel, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170315-174808247">Compressive sensing over networks</a>; ISBN 978-1-4244-8216-0; 48th Annual Allerton Conference on Communication, Control, and Computing; 1129-1136; <a href="https://doi.org/10.1109/ALLERTON.2010.5707037">10.1109/ALLERTON.2010.5707037</a></li>
<li>Doshi, Vishal and Shah, Devavrat, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101011-105632282">Functional Compression Through Graph Coloring</a>; IEEE Transactions on Information Theory; Vol. 56; No. 8; 3901-3917; <a href="https://doi.org/10.1109/TIT.2010.2050835">10.1109/TIT.2010.2050835</a></li>
<li>Dikaliotis, Theodoros K. and Dimakis, Alexandros, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140529-141715127">On the Delay Advantage of Coding in Packet Erasure Networks</a>; ISBN 978-1-4244-8262-7; 2010 IEEE Information Theory Workshop (ITW); 1-5; <a href="https://doi.org/10.1109/CIG.2010.5592713">10.1109/CIG.2010.5592713</a></li>
<li>Jalali, Shirin and Effros, Michelle (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110329-101424835">On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks</a>; ISBN 978-1-4244-6960-4; 2010 IEEE International Symposium on Information Theory; 500-504; <a href="https://doi.org/10.1109/ISIT.2010.5513477">10.1109/ISIT.2010.5513477</a></li>
<li>Effros, Michelle and Goldsmith, Andrea, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100709-094818847">Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels</a>; IEEE Transactions on Information Theory; Vol. 56; No. 7; 3069-3087; <a href="https://doi.org/10.1109/TIT.2010.2048456">10.1109/TIT.2010.2048456</a></li>
<li>Effros, Michelle and Goldsmith, Andrea, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100615-104959080">The rise of instant wireless networks</a>; Scientific American; Vol. 302; No. 4; 72-77</li>
<li>Kim, Sukwon and Ho, Tracey, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100805-081437710">Network error correction with unequal link capacities</a>; ISBN 978-1-4244-5870-7; 47th Annual Allerton Conference on Communication, Control and Computing; 1387-1394; <a href="https://doi.org/10.1109/ALLERTON.2009.5394512">10.1109/ALLERTON.2009.5394512</a></li>
<li>Effros, Michelle (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110329-151508730">Capacity Bounds for Networks of Broadcast Channels</a>; ISBN 978-1-4244-7891-0; 2010 IEEE International Symposium on Information Theory; 580-584; <a href="https://doi.org/10.1109/ISIT.2010.5513528">10.1109/ISIT.2010.5513528</a></li>
<li>Bakshi, Mayank and Jaggi, Sidharth, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110331-091110603">Concatenated Polar codes</a>; ISBN 978-1-4244-7890-3; 2010 IEEE International Symposium on Information Theory Proceedings (ISIT); 918-922; <a href="https://doi.org/10.1109/ISIT.2010.5513508">10.1109/ISIT.2010.5513508</a></li>
<li>Bakshi, Mayank and Effros, Michelle (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110331-093006187">On Zero-Error Source Coding with Feedback</a>; ISBN 978-1-4244-7890-3; 2010 IEEE International Symposium on Information Theory Proceedings (ISIT); 11-15; <a href="https://doi.org/10.1109/ISIT.2010.5513304">10.1109/ISIT.2010.5513304</a></li>
<li>Cohen, Asaf and Effros, Michelle, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170316-135356404">Linearly representable entropy vectors and their relation to network coding solutions</a>; ISBN 978-1-4244-4982-8; 2009 IEEE Information Theory Workshop; 549-553; <a href="https://doi.org/10.1109/ITW.2009.5351447">10.1109/ITW.2009.5351447</a></li>
<li>Gu, WeiHsin and Effros, Michelle (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-111642548">A strong converse for a collection of network source coding problems</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 2316-2320; <a href="https://doi.org/10.1109/ISIT.2009.5205934">10.1109/ISIT.2009.5205934</a></li>
<li>Bakshi, Mayank and Effros, Michelle (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-092052973">On feedback in network source coding</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 1348-1352; <a href="https://doi.org/10.1109/ISIT.2009.5205920">10.1109/ISIT.2009.5205920</a></li>
<li>Cohen, Asaf and Avestimehr, Salman, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-093044500">On networks with side information</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 1343-1347; <a href="https://doi.org/10.1109/ISIT.2009.5205925">10.1109/ISIT.2009.5205925</a></li>
<li>Dikaliotis, Theodoros K. and Dimakis, Alexandros G., el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-110713053">On the delay of network coding over line networks</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 1408-1412; <a href="https://doi.org/10.1109/ISIT.2009.5205897">10.1109/ISIT.2009.5205897</a></li>
<li>Vyetrenko, Svitlana and Ho, Tracey, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-135601648">Rate regions for coherent and noncoherent multisource network error correction</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 1001-1005; <a href="https://doi.org/10.1109/ISIT.2009.5206077">10.1109/ISIT.2009.5206077</a></li>
<li>Marco, Daniel and Effros, Michelle (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090821-135659881">On Lossless Coding With Coded Side Information</a>; IEEE Transactions on Information Theory; Vol. 55; No. 7; 3284-3296; <a href="https://doi.org/10.1109/TIT.2009.2021309">10.1109/TIT.2009.2021309</a></li>
<li>Chang, Christopher S. and Ho, Tracey, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100722-131717463">On robust network coding subgraph construction under uncertainty</a>; ISBN 978-1-4244-2940-0; Conference record of the 42nd Asilomar Conference on Signals, Systems and Computers; 2211-2215; <a href="https://doi.org/10.1109/ACSSC.2008.5074828">10.1109/ACSSC.2008.5074828</a></li>
<li>Kim, Sukwon and Ho, Tracey, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100716-091516848">Network coding with periodic recomputation for minimum energy multicasting in mobile ad-hoc networks</a>; ISBN 978-1-4244-2925-7; 46th annual Allerton Conference on Communication, Control, and Computing; 154-161; <a href="https://doi.org/10.1109/ALLERTON.2008.4797549">10.1109/ALLERTON.2008.4797549</a></li>
<li>Gu, WeiHsin and Effros, Michelle, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100716-085815513">A Continuity Theory for Lossless Source Coding over Networks</a>; ISBN 978-1-4244-2925-7; 46th annual Allerton Conference on Communication, Control, and Computing; 1527-1534; <a href="https://doi.org/10.1109/ALLERTON.2008.4797743">10.1109/ALLERTON.2008.4797743</a></li>
<li>Kim, Sukwon and Effros, Michelle, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100716-104652225">Distributed design of network codes for wireless multiple unicasts</a>; ISBN 978-1-4244-2925-7; 46th annual Allerton Conference on Communication, Control, and Computing; 324-331; <a href="https://doi.org/10.1109/ALLERTON.2008.4797575">10.1109/ALLERTON.2008.4797575</a></li>
<li>Erez, Elona and Effros, Michelle, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170404-165519201">Network codes with deadlines</a>; ISBN 978-1-4244-2925-7; 46th Annual Allerton Conference on Communication, Control, and Computing; 339-346; <a href="https://doi.org/10.1109/ALLERTON.2008.4797577">10.1109/ALLERTON.2008.4797577</a></li>
<li>Effros, Michelle (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFitaw08">Optimal multiple description and multiresolution scalar quantizer design</a>; ISBN 978-1-4244-2670-6; Information Theory and Applications Workshop, 2008, Univesity of California, San Diego, 27 January-1 February 2008; 70-76; <a href="https://doi.org/10.1109/ITA.2008.4601027">10.1109/ITA.2008.4601027</a></li>
<li>Bakshi, Mayank and Effros, Michelle (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BAKisit08">On achievable rates for multicast in the presence of side information</a>; ISBN 978-1-4244-2256-2; IEEE International Symposium on  Information Theory (ISIT 2008), Toronto, Canada, 6-11 July 2008; 1661-1665; <a href="https://doi.org/10.1109/ISIT.2008.4595270">10.1109/ISIT.2008.4595270</a></li>
<li>Bakshi, Mayank and Effros, Michelle, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BAKisit07">On Network Coding of Independent and Dependent Sources in Line Networks</a>; ISBN 978-1-4244-1397-3; IEEE International Symposium on  Information Theory (ISIT 2007), Nice France, 24-29 June 2007; 1096-1100; <a href="https://doi.org/10.1109/ISIT.2007.4557370">10.1109/ISIT.2007.4557370</a></li>
<li>Effros, Michelle and Goldsmith, Andrea, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit07">Capacity Definitions of General Channels with Receiver Side Information</a>; ISBN 978-1-4244-1397-3; IEEE International Symposium on  Information Theory (ISIT 2007), Nice France, 24-29 June 2007; 921-925; <a href="https://doi.org/10.1109/ISIT.2007.4557342">10.1109/ISIT.2007.4557342</a></li>
<li>Gu, WeiHsin and Koetter, Ralf, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWisit07">On Source Coding with Coded Side Information for a Binary Source with Binary Side Information</a>; ISBN 978-1-4244-1397-3; IEEE International Symposium on  Information Theory (ISIT 2007), Nice France, 24-29 June 2007; 1456-1460; <a href="https://doi.org/10.1109/ISIT.2007.4557427">10.1109/ISIT.2007.4557427</a></li>
<li>Jaggi, Sidharth and Langberg, Michael, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit08">Resilient Network Coding in the Presence of Byzantine Adversaries</a>; IEEE Transactions on Information Theory; Vol. 54; No. 6; 2596-2603; <a href="https://doi.org/10.1109/TIT.2008.921711">10.1109/TIT.2008.921711</a></li>
<li>Ho, Tracey and Leong, Ben, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit08">Byzantine Modification Detection in Multicast Networks With Random Network Coding</a>; IEEE Transactions on Information Theory; Vol. 54; No. 6; 2798-2803; <a href="https://doi.org/10.1109/TIT.2008.921894">10.1109/TIT.2008.921894</a></li>
<li>Muresan, Dan and Effros, Michelle (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MURieeetit08">Quantization as Histogram Segmentation: Optimal Scalar Quantizer Design in Network Systems</a>; IEEE Transactions on Information Theory; Vol. 54; No. 1; 344-366; <a href="https://doi.org/10.1109/TIT.2007.911170">10.1109/TIT.2007.911170</a></li>
<li>Liang, Yifan and Goldsmith, Andrea, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LIAitw07">Distortion Metrics of Composite Channels with Receiver Side Information</a>; ISBN 1-4244-1564-0; Information Theory Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007; 559-564; <a href="https://doi.org/10.1109/ITW.2007.4313135">10.1109/ITW.2007.4313135</a></li>
<li>Gu, WeiHsin and Effros, Michelle (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07b">On Approximating the Rate Region for Source Coding with Coded Side Information</a>; ISBN 1-4244-1564-0; Information Theory  Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007; 432-435; <a href="https://doi.org/10.1109/ITW.2007.4313113">10.1109/ITW.2007.4313113</a></li>
<li>Gu, WeiHsin and Effros, Michelle (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWitw07a">On the Continuity of Achievable Rate Regions for Source Coding over Networks</a>; ISBN 1-4244-1564-0; Information Theory  Workshop (ITW 2007), Tahoe City, CA, 2-6 September 2007; 632-637; <a href="https://doi.org/10.1109/ITW.2007.4313148">10.1109/ITW.2007.4313148</a></li>
<li>Mehyar, Mortada and Gu, WeiHsin, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MEHicassp07">Optimal Strategies for Efficient Peer-to-Peer File Sharing</a>; ISBN 1-4244-0728-1; IEEE International Conference on Acoustics, Speech and Signal Processing, (ICASSP 2007), Honolulu, HI, 15-20 April 2007; IV-1337; <a href="https://doi.org/10.1109/ICASSP.2007.367325">10.1109/ICASSP.2007.367325</a></li>
<li>Kim, Minkyu and Médard, Muriel, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:KIMinfocomm07">Evolutionary Approaches To Minimizing Network Coding Resources</a>; ISBN 1-4244-1047-9; IEEE INFOCOM 2007, IEEE International Conference on Computer Communications, 26th, Anchorage, AK, 6-12 May 2007; 1991-1999; <a href="https://doi.org/10.1109/INFCOM.2007.231">10.1109/INFCOM.2007.231</a></li>
<li>Ray, Siddarth and Médard, Muriel, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:RAYitw06">On Separation for Multiple Access Channels</a>; ISBN 1-4244-0067-8; IEEE Information Theory  Workshop (ITW 2006), Punta del Este, Uruguay, 13-17 March 2006; 399-403; <a href="https://doi.org/10.1109/ITW.2006.322847">10.1109/ITW.2006.322847</a></li>
<li>Gowaikar, Radhika and Dana, Amir F., el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOWieeetc07">A Practical Scheme for Wireless Network Operation</a>; IEEE Transactions on Communications; Vol. 55; No. 3; 463-476; <a href="https://doi.org/10.1109/TCOMM.2007.892448">10.1109/TCOMM.2007.892448</a></li>
<li>Jaggi, Sidharth and Cassuto, Yuval, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGisit06">Low Complexity Encoding for Network Codes</a>; ISBN 1-4244-0504-1; IEEE International Symposium on Information Theory (ISIT '06), Seattle, WA, 6-12 July 2006; 40-44; <a href="https://doi.org/10.1109/ISIT.2006.261594">10.1109/ISIT.2006.261594</a></li>
<li>Gu, Wei-Hsin and Effros, Michelle (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWisit06">On the Concavity of Rate Regions for Lossless Source Coding in Networks</a>; ISBN 1-4244-0504-1; 2006 IEEE International Symposium on Information Theory, Seattle, WA, 6-12 July 2006; 1599-1603; <a href="https://doi.org/10.1109/ISIT.2006.261546">10.1109/ISIT.2006.261546</a></li>
<li>Ho, Tracey and Médard, Muriel, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTieeetit06">A Random Linear Network Coding Approach to Multicast</a>; IEEE Transactions on Information Theory; Vol. 52; No. 10; 4413-4430; <a href="https://doi.org/10.1109/TIT.2006.881746">10.1109/TIT.2006.881746</a></li>
<li>Coleman, Todd P. and Lee, Anna H., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLieeetit06">Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression</a>; IEEE Transactions on Information Theory; Vol. 52; No. 8; 3546-3561; <a href="https://doi.org/10.1109/TIT.2006.878215">10.1109/TIT.2006.878215</a></li>
<li>Coleman, Todd P. and Martinian, Emin, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLitw05">Interference management via capacity-achieving codes for the deterministic broadcast channel</a>; ISBN 0 7803 9481 X; IEEE ISOC Information Theory Workshop on Coding and Complexity (ITW '05), Rotorua, New Zealand, 29 August - 1 September 2005; 29-33; <a href="https://doi.org/10.1109/ITW.2006.1633821">10.1109/ITW.2006.1633821</a></li>
<li>Coleman, Todd P. and Lee, Anna H., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLdcc04">On some new approaches to practical Slepian-Wolf compression inspired by channel coding</a>; ISBN 0 7695 2082 0; Data Compression Conference (DCC 2004), Snowbird, UT, USA, 23-25 March 2004; 282-291; <a href="https://doi.org/10.1109/DCC.2004.1281473">10.1109/DCC.2004.1281473</a></li>
<li>Effros, Michelle and Ho, Tracey, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFitw06">A tiling approach to network code design for wireless networks</a>; ISBN 1-4244-0035-X; IEEE Information Theory Workshop (ITW '06), Punta del Este, Uruguay, 13-17 March, 2006; 62-66; <a href="https://doi.org/10.1109/ITW.2006.1633782">10.1109/ITW.2006.1633782</a></li>
<li>Marco, Daniel and Effros, Michelle (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MARitw06">A partial solution for lossless source coding with coded side information</a>; ISBN 1-4244-0036-8; IEEE Information Theory Workshop (ITW '06), Punta del Este, Uruguay, 13-17 March 2006; 247-251; <a href="https://doi.org/10.1109/ITW.2006.1633821">10.1109/ITW.2006.1633821</a></li>
<li>Ramamoorthy, Aditya and Jain, Kamal, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:RAMieeetit06">Separating distributed source coding from network coding</a>; IEEE Transactions on Information Theory; Vol. 52; No. 6; 2785-2795; <a href="https://doi.org/10.1109/TIT.2006.874534">10.1109/TIT.2006.874534</a></li>
<li>Todd P. Coleman, Todd P. and Médard, Muriel, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLdcc06">Time-sharing vs. source-splitting in the Slepian-Wolf problem: error exponents analysis</a>; ISBN 0 7695 2545 8; Data Compression Conference (DCC '06), Snowbird, UT, 28-30 March 2006; 53-62; <a href="https://doi.org/10.1109/DCC.2006.77">10.1109/DCC.2006.77</a></li>
<li>Gu, Wei-Hsin and Effros, Michelle (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc06">On Multi-Resolution Coding and a Two-Hop Network</a>; ISBN 0-7695-2545-8; DCC 2006 -- Data Compression Conference, March 28-30, 2006, Snowbird, Utah; 451; <a href="https://doi.org/10.1109/DCC.2006.58">10.1109/DCC.2006.58</a></li>
<li>Fleming, Michael and Effros, Michelle (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit06">On rate-distortion with mixed types of side information</a>; IEEE Transactions on Information Theory; Vol. 52; No. 4; 1698-1705; <a href="https://doi.org/10.1109/TIT.2006.871059">10.1109/TIT.2006.871059</a></li>
<li>Dana, Amir F. and Gowaikar, Radhika, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DANieeetit06a">Capacity of wireless erasure networks</a>; IEEE Transactions on Information Theory; Vol. 52; No. 3; 789-804; <a href="https://doi.org/10.1109/TIT.2005.864424">10.1109/TIT.2005.864424</a></li>
<li>Coleman, Todd P. and Médard, Muriel, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLwir05">Linear complexity universal decoding with exponential error probability decay</a>; ISBN 0 7803 9305 8; International Conference on Wireless Networks, Communications and Mobile Computing, Maui, HI, 13-16 June 2005; 1593-1596; <a href="https://doi.org/10.1109/WIRLES.2005.1549651">10.1109/WIRLES.2005.1549651</a></li>
<li>Coleman, Todd P. and Effros, Michelle, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLisit05">Rate-splitting for the deterministic broadcast channel</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory  (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005; 2189-2192; <a href="https://doi.org/10.1109/ISIT.2005.1523735">10.1109/ISIT.2005.1523735</a></li>
<li>Feng, Hanying and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit05">On the rate loss and construction of source codes for broadcast channels</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005; 82-86; <a href="https://doi.org/10.1109/ISIT.2005.1523297">10.1109/ISIT.2005.1523297</a></li>
<li>Gu, Wei-Hsin and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWisit05">Source coding for a simple multi-hop network</a></li>
<li>Jaggi, Sidharth and Langberg, Michael, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGisit05">Correction of adversarial errors in networks</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory  (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005; 1455-1459; <a href="https://doi.org/10.1109/ISIT.2005.1523584">10.1109/ISIT.2005.1523584</a></li>
<li>Lun, Desmond S. and Médard, Muriel, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LUNisit05">Further results on coding for reliable communication over packet networks</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory  (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005; 1848-1852; <a href="https://doi.org/10.1109/ISIT.2005.1523665">10.1109/ISIT.2005.1523665</a></li>
<li>Ho, Tracey and Leong, Ben, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTiwwan04">On the utility of network coding in dynamic environments</a>; ISBN 0-7803-8275-7; International Workshop on Wireless Ad-Hoc Networks, Oulu, Finald, May 31-June 3, 2004; 196-200; <a href="https://doi.org/10.1109/IWWAN.2004.1525570">10.1109/IWWAN.2004.1525570</a></li>
<li>Jaggi, Sidharth and Sanders, Peter, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGieeetit05">Polynomial time algorithms for multicast network code construction</a>; IEEE Transactions on Information Theory; Vol. 51; No. 6; 1973-1982; <a href="https://doi.org/10.1109/TIT.2005.847712">10.1109/TIT.2005.847712</a></li>
<li>Coleman, Todd P. and Médard, Muriel, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLdcc05">Towards practical minimum-entropy universal decoding</a>; ISBN 0 7695 2309 9; Data Compression Conference (DCC '05), Snowbird, UT, 29-31 March 2005; 33-42; <a href="https://doi.org/10.1109/DCC.2005.90">10.1109/DCC.2005.90</a></li>
<li>Gu, Wei-Hsin and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GUWdcc05">Source Coding for a Multihop Network</a>; ISBN 9780769523095; DCC 2005 : Data Compression Conference, March 29-31, 2005, Snowbird, Utah; 461; <a href="https://doi.org/10.1109/DCC.2005.82">10.1109/DCC.2005.82</a></li>
<li>Effros, Michelle and Koetter, Ralf, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFitw04">On source and channel codes for multiple inputs and outputs: does multiple description beat space time?</a>; ISBN 0 7803 8720 1; IEEE Information Theory Workshop (ITW '04), San Antonio, TX, 24-29 October 2004; 324-329; <a href="https://doi.org/10.1109/ITW.2004.1405323">10.1109/ITW.2004.1405323</a></li>
<li>Feng, Hanying and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit05">On the rate loss of multiple description source codes</a>; IEEE Transactions on Information Theory; Vol. 51; No. 2; 671-683; <a href="https://doi.org/10.1109/TIT.2004.840900">10.1109/TIT.2004.840900</a></li>
<li>Ho, Tracey and Leong, Ben, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTisit04">Byzantine modification detection in multicast networks using randomized network coding</a>; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004; 143; <a href="https://doi.org/10.1109/ISIT.2004.1365180">10.1109/ISIT.2004.1365180</a></li>
<li>Coleman, Todd and Lee, Anna, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:COLisit04">A new source-splitting approach to the Slepian-Wolf problem</a>; ISBN 0 7803 8280 3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004; 332; <a href="https://doi.org/10.1109/ISIT.2004.1365369">10.1109/ISIT.2004.1365369</a></li>
<li>Zhao, Qian and Effros, Michelle (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04">Uniquely decodable multiple access source codes</a>; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, Illinois, 27 June-2 July 2004; 197; <a href="https://doi.org/10.1109/ISIT.2004.1365234">10.1109/ISIT.2004.1365234</a></li>
<li>Effros, Michelle and Schulman, Leonard J. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit04">Rapid near-optimal VQ design with a deterministic data net</a>; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June - 2 July 2004; 299; <a href="https://doi.org/10.1109/ISIT.2004.1365336">10.1109/ISIT.2004.1365336</a></li>
<li>Effros, Michelle and Dugatkin, Diego (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04a">Multiresolution vector quantization</a>; IEEE Transactions on Information Theory; Vol. 50; No. 12; 3130-3145; <a href="https://doi.org/10.1109/TIT.2004.838381">10.1109/TIT.2004.838381</a></li>
<li>Zhao, Qian and Feng, Hanying, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc04">Multiresolution source coding using entropy constrained dithered scalar quantization</a>; ISBN 0769520820; Data Compression Conference (DCC '04), Snowbird, UT, 23-25 March 2004; 22-31; <a href="https://doi.org/10.1109/DCC.2004.1281447">10.1109/DCC.2004.1281447</a></li>
<li>Fleming, Michael and Zhao, Qian, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEieeetit02">Network vector quantization</a>; IEEE Transactions on Information Theory; Vol. 50; No. 8; 1584-1604; <a href="https://doi.org/10.1109/TIT.2004.831832">10.1109/TIT.2004.831832</a></li>
<li>Effros, Michelle and Feng, Hanying, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit04b">Suboptimality of the Karhunen-Loève transform for transform coding</a>; IEEE Transactions on Information Theory; Vol. 50; No. 8; 1605-1619; <a href="https://doi.org/10.1109/TIT.2004.831787">10.1109/TIT.2004.831787</a></li>
<li>Gowaikar, Radhika and Dana, Amir F., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOWisit04">On the capacity of wireless erasure networks</a>; ISBN 0 7803 8280 3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004; 400; <a href="https://doi.org/10.1109/ISIT.2004.1365437">10.1109/ISIT.2004.1365437</a></li>
<li>Feng, Hanying and Effros, Michelle (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit02">On the rate loss of multiple description source codes and additive successive refinement codes</a>; ISBN 0-7803-7501-7; IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002; 94; <a href="https://doi.org/10.1109/ISIT.2002.1023366">10.1109/ISIT.2002.1023366</a></li>
<li>Jaggi, Sidharth and Effros, Michelle (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGisit04">Communication and distributional complexity of joint probability mass functions</a>; ISBN 0-7803-8280-3; International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004; 362; <a href="https://doi.org/10.1109/ISIT.2004.1365399">10.1109/ISIT.2004.1365399</a></li>
<li>Dana, Amir F. and Sharif, Masoud, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DANasilo03">Is broadcast plus multiaccess optimal for Gaussian wireless networks?</a>; ISBN 0780381041; Asilomar Conference on Signals, Systems and Computers, 37th, Pacific Grove, CA, 9-12 November 2003; 1748-1752; <a href="https://doi.org/10.1109/ACSSC.2003.1292284">10.1109/ACSSC.2003.1292284</a></li>
<li>Feng, Hanying and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit03">On the achievable region for multiple description source codes on Gaussian sources</a>; ISBN 0-7803-7728-1; IEEE International Symposium on Information Theory (ISIT '03), Yokohama, Japan, 29 June-4 July, 2003; 195; <a href="https://doi.org/10.1109/ISIT.2003.1228209">10.1109/ISIT.2003.1228209</a></li>
<li>Ho, Tracey and Koetter, Ralf, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOTisit03a">The benefits of coding over routing in a randomized setting</a>; ISBN 0-7803-7728-1; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July, 2004; 442; <a href="https://doi.org/10.1109/ISIT.2003.1228459">10.1109/ISIT.2003.1228459</a></li>
<li>Fleming, Michael and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEisit03">Rate-distortion with mixed types of side information</a>; ISBN 0-7803-7728-1; IEEE International Symposium on Information Theory, 2003, Yokohama, Japan, June 29-July 4, 2003; 144; <a href="https://doi.org/10.1109/ISIT.2003.1228158">10.1109/ISIT.2003.1228158</a></li>
<li>Effros, Michelle and Feng, Hanying, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc03">Suboptimality of the Karhunen-Loève transform for transform coding</a>; ISBN 0-7695-1896-6; DCC 2003, Data Compression Conference, Snowbird, UT, 23-25 March 2003; 293-302; <a href="https://doi.org/10.1109/DCC.2003.1194020">10.1109/DCC.2003.1194020</a></li>
<li>Zhao, Qian and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc03">Low complexity code design for lossless and near-lossless side information source codes</a>; ISBN 0-7695-1896-6; Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003; 3-12</li>
<li>Feng, Hanying and Zhao, Qian, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENdcc03">Network source coding using entropy constrained dithered quantization</a>; ISBN 0-7695-1896-6; Data Compression Conference (DCC '03), Snowbird, UT, 25-27 March 2003; 427; <a href="https://doi.org/10.1109/DCC.2003.1194046">10.1109/DCC.2003.1194046</a></li>
<li>Feng, Hanying and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetit03">Improved bounds for the rate loss of multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 49; No. 4; 809-821; <a href="https://doi.org/10.1109/TIT.2003.809604">10.1109/TIT.2003.809604</a></li>
<li>Zhao, Qian and Effros, Michelle (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAieeetit03">Lossless and near-lossless source coding for multiple access networks</a>; IEEE Transactions on Information Theory; Vol. 49; No. 1; 112-128; <a href="https://doi.org/10.1109/TIT.2002.806145">10.1109/TIT.2002.806145</a></li>
<li>Dana, Amir F. and Gowaikar, Radhika, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150212-071001793">Should we break a wireless network into sub-networks?</a></li>
<li>Effros, Michelle and Médard, Muriel, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150210-075301992">Linear network codes: A unified framework for source, channel, and network coding</a>; ISBN 0821834673; Advances in Network Information Theory; 197-216</li>
<li>Effros, Michelle and Muresan, Dan (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc02">Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers</a>; ISBN 0-7695-1477-4; DCC 2002 -- Data Compression Conference, 2-4 April, 2002, Snowbird, Utah; 312-321; <a href="https://doi.org/10.1109/DCC.2002.999969">10.1109/DCC.2002.999969</a></li>
<li>Effros, Michelle and Chou, Philip A. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:Efficip95">Weighted universal transform coding: universal image compression with the Karhunen-Loève transform</a>; ISBN 0 7803 3122 2; International Conference on Image Processing (ICIP '95), Washington, DC, 23-26 October 1995; 61-64; <a href="https://doi.org/10.1109/ICIP.1995.537415">10.1109/ICIP.1995.537415</a></li>
<li>Varnica, Nedeljko and Fleming, Michael, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:VARdcc00">Multi-resolution adaptation of the SPIHT algorithm for multiple description</a>; ISBN 0769505929; DCC 2000: proceedings, Data Compression Conference, March 28-30, 2000, Snowbird, Utah; 303-312; <a href="https://doi.org/10.1109/DCC.2000.838170">10.1109/DCC.2000.838170</a></li>
<li>Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97b">Robustness to channel variation in source coding for transmission across noisy channels</a>; ISBN 0 8186 7919 0; International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), Munich, Germany, 21-24 April 1997; 2961-2964; <a href="https://doi.org/10.1109/ICASSP.1997.595413">10.1109/ICASSP.1997.595413</a></li>
<li>Dugatkin, Diego and Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:DUGasilo99">Multi-resolution VQ: parameter meaning and choice</a>; ISBN 0 7803 5148 7; Asilomar Conference on Signals, Systems and Computers, 32nd, Pacific Grove, CA, 1-4 November 1998; 159-162; <a href="https://doi.org/10.1109/ACSSC.1998.750846">10.1109/ACSSC.1998.750846</a></li>
<li>Effros, Michelle and Visweswariah, Karthik, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit02">Universal lossless source coding with the Burrows Wheeler transform</a>; IEEE Transactions on Information Theory; Vol. 48; No. 5; 1061-1081; <a href="https://doi.org/10.1109/18.995542">10.1109/18.995542</a></li>
<li>Feng, Hanying and Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENieeetip02">On the rate-distortion performance and computational efficiency of the Karhunen-Loeve transform for lossy data compression</a>; IEEE Transactions on Image Processing; Vol. 11; No. 2; 113-122; <a href="https://doi.org/10.1109/83.982819">10.1109/83.982819</a></li>
<li>Jaggi, Sidharth and Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JAGisit02">Universal linked multiple access source codes</a>; ISBN 0-7803-7501-7; IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002; 95; <a href="https://doi.org/10.1109/ISIT.2002.1023367">10.1109/ISIT.2002.1023367</a></li>
<li>Zhao, Qiang and Jaggi, Sidharth, el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo02">Side information source coding: low complexity design and source independence</a>; ISBN 0-7803-7576-9; Asilomar Conference on Signals, Systems &amp; Computers, 36th, Pacific Grove, CA, 3-6 November 2002; 257-261; <a href="https://doi.org/10.1109/ACSSC.2002.1197187">10.1109/ACSSC.2002.1197187</a></li>
<li>Muresan, Dan and Effros, Michelle (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:MURdcc02">Quantization as histogram segmentation: globally optimal scalar quantizer design in network systems</a>; ISBN 0-7695-1477-4; Data Compression Conference (DCC '02), Snowbird, UT, 2-4 April 2002; 302-311; <a href="https://doi.org/10.1109/DCC.2002.999968">10.1109/DCC.2002.999968</a></li>
<li>Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit01">Universal multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 47; No. 6; 2113-2129; <a href="https://doi.org/10.1109/18.945238">10.1109/18.945238</a></li>
<li>Goldsmith, Andrea J. and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetit01">The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise</a>; IEEE Transactions on Information Theory; Vol. 47; No. 1; 219-240; <a href="https://doi.org/10.1109/18.904524">10.1109/18.904524</a></li>
<li>Fleming, Michael and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc01">Network Vector Quantization</a>; ISBN 0 7695 1031 0; Data Compression Conference (DCC '01), Snowbird, UT, 27-29 March 2001; 13-22</li>
<li>Zhao, Qian and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAisit01">Lossless source coding for multiple access networks</a>; ISBN 0-7803-7123-2; IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001; 285; <a href="https://doi.org/10.1109/ISIT.2001.936148">10.1109/ISIT.2001.936148</a></li>
<li>Feng, Hanying and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit01">Improved bounds for the rate loss of multi-resolution source codes</a>; ISBN 0-7803-7123-2; IEEE International Symposium on Information Theory (ISIT '01), Washington, DC, 24-29 June 2001; 193; <a href="https://doi.org/10.1109/ISIT.2001.936056">10.1109/ISIT.2001.936056</a></li>
<li>Zhao, Qian and Effros, Michelle (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc01">Optimal code design for lossless and near lossless source coding in multiple access networks</a>; ISBN 0-7695-0592-9; Data Compression Conference (DCC '01), Snowbird, UT, 27-29 March 2001; 263-272; <a href="https://doi.org/10.1109/DCC.2001.917157">10.1109/DCC.2001.917157</a></li>
<li>Dugatkin, Diego and Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181204-132725764">Setting priorities: a new SPIHT-compatible algorithm for image compression</a>; ISBN 9780819437648; Wavelet Applications in Signal and Image Processing VIII; 799-805; <a href="https://doi.org/10.1117/12.408670">10.1117/12.408670</a></li>
<li>Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFprocieee00">PPM performance with BWT complexity: a fast and effective data compression algorithm</a>; Proceedings of the IEEE; Vol. 88; No. 11; 1703-1712; <a href="https://doi.org/10.1109/5.892706">10.1109/5.892706</a></li>
<li>Zhao, Qian and Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAdcc00">Lossless and lossy broadcast system source codes: theoretical limits, optimal design, and empirical performance</a>; ISBN 0-7695-0592-9; Data Compression Conference (DCC '00), Snowbird, UT, 28-30 March 2000; 63-72; <a href="https://doi.org/10.1109/DCC.2000.838146">10.1109/DCC.2000.838146</a></li>
<li>Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc00">PPM performance with BWT complexity: a new method for lossless data compression</a>; ISBN 0 7695 0592 9; Data Compression Conference (DCC 2000), Snowbird, UT, 28-30 March 2000; 203-212; <a href="https://doi.org/10.1109/DCC.2000.838160">10.1109/DCC.2000.838160</a></li>
<li>Feng, Hanying and Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENisit00">Multi-resolution channel codes</a>; ISBN 0-7803-5857-0; IEEE International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000; 487; <a href="https://doi.org/10.1109/ISIT.2000.866785">10.1109/ISIT.2000.866785</a></li>
<li>Fleming, Michael and Effros, Michelle (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEisit00">The rate distortion region for the multiple description problem</a>; ISBN 0 7803 5857 0; International Symposium on Information Theory (ISIT '00), Sorrento, Italy, 25-30 June 2000; 208; <a href="https://doi.org/10.1109/ISIT.2000.866506">10.1109/ISIT.2000.866506</a></li>
<li>Shen, Yirong and Goldsmith, Andrea J., el al. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SHEglobecom00">Joint design of vector quantizers and RCPC channel codes for Rayleigh fading channels</a>; ISBN 0-7803-6451-1; IEEE Global Telecommunications Conference (GLOBECOM '00), San Francisco, CA, 27 November-1 December 2000; 1611-1615; <a href="https://doi.org/10.1109/GLOCOM.2000.891910">10.1109/GLOCOM.2000.891910</a></li>
<li>Effros, Michelle and Chou, Philip A., el al. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetip99">Weighted universal image compression</a>; IEEE Transactions on Image Processing; Vol. 8; No. 10; 1317-1329; <a href="https://doi.org/10.1109/83.791958">10.1109/83.791958</a></li>
<li>Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit99">Distortion-rate bounds for fixed- and variable-rate multiresolution source codes</a>; IEEE Transactions on Information Theory; Vol. 45; No. 6; 1887-1910; <a href="https://doi.org/10.1109/18.782109">10.1109/18.782109</a></li>
<li>Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc99">Universal lossless source coding with the Burrows Wheeler transform</a>; ISBN 0-7695-0096-X; DCC 1999 -- Data Compression Conference, 29-31 March, 1999, Snowbird, Utah; 178-187; <a href="https://doi.org/10.1109/DCC.1999.755667">10.1109/DCC.1999.755667</a></li>
<li>Fleming, Michael and Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FLEdcc99">Generalized multiple description vector quantization</a>; ISBN 0 7695 0096 X; Data Compression Conference (DCC '99), Snowbird, UT, 29-31 March 1999; 3-12; <a href="https://doi.org/10.1109/DCC.1999.755648">10.1109/DCC.1999.755648</a></li>
<li>Feng, Hanying and Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FENicassp99">Separable Karhunen Loeve transforms for the weighted universal transform coding algorithm</a>; ISBN 0-7803-5041-3; IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '99), Phoenix, AZ, 15-19 March 1999; 2435-2438; <a href="https://doi.org/10.1109/ICASSP.1999.760622">10.1109/ICASSP.1999.760622</a></li>
<li>Zhao, Qian and Effros, Michelle (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZHAasilo99">Broadcast system source codes: a new paradigm for data compression</a>; ISBN 0-7803-5701-9; Asilomar Conference on Signals, Systems, &amp; Computers, 33rd, Pacific Grove, CA, 24-27 October 1999; 337-341; <a href="https://doi.org/10.1109/ACSSC.1999.832348">10.1109/ACSSC.1999.832348</a></li>
<li>Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeespm98">Optimal modeling for complex system design</a>; IEEE Signal Processing Magazine; Vol. 15; No. 6; 51-73; <a href="https://doi.org/10.1109/79.733496">10.1109/79.733496</a></li>
<li>Goldsmith, Andrea J. and Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLieeetc98">Joint design of fixed-rate source codes and multiresolution channel codes</a>; IEEE Transactions on Communications; Vol. 46; No. 10; 1301-1312; <a href="https://doi.org/10.1109/26.725308">10.1109/26.725308</a></li>
<li>Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc98">Practical multi-resolution source coding: TSVQ revisited</a>; ISBN 0 8186 8406 2; Data Compression Conference (DCC '98), Snowbird, UT, 30 March-1 April 1998; 53-62; <a href="https://doi.org/10.1109/DCC.1998.672131">10.1109/DCC.1998.672131</a></li>
<li>Effros, Michelle (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98a">Multi-resolution source coding theorems</a>; ISBN 0-7803-5001-4; IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, 16-21 August 1998; 226; <a href="https://doi.org/10.1109/ISIT.1998.708829">10.1109/ISIT.1998.708829</a></li>
<li>Tie, Hai-Xin and Goldsmith, Andrea, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:TIEasilo98">Joint design of fixed-rate source codes and UEP channel codes for fading channels</a>; ISBN 0-7803-5148-7; Asilomar Conference on Signals, Systems and Computers, 32nd, Pacific Grove, CA, 1-4 November 1998; 92-96; <a href="https://doi.org/10.1109/ACSSC.1998.750834">10.1109/ACSSC.1998.750834</a></li>
<li>Effros, Michelle and Goldsmith, Andrea (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit98b">Capacity definitions and coding strategies for general channels with receiver side information</a>; ISBN 0-7803-5000-6; IEEE International Symposium on Information Theory (ISIT '98), Cambridge, MA, 16-21 August 1998; 39; <a href="https://doi.org/10.1109/ISIT.1998.708619">10.1109/ISIT.1998.708619</a></li>
<li>Effros, Michelle (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFicip97">Zerotree design for image compression: toward weighted universal zerotree coding</a>; ISBN 0 8186 8183 7; International Conference on Image Processing, Santa Barbara, CA,  26-29 Oct. 1997; 616-619; <a href="https://doi.org/10.1109/ICIP.1997.647988">10.1109/ICIP.1997.647988</a></li>
<li>Effros, Michelle (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp97a">Conditional weighted universal source codes: second order statistics in universal coding</a>; ISBN 0 8186 7919 0; IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97), Munich, Germany, 21-24 April 1997; 2733-2736; <a href="https://doi.org/10.1109/ICASSP.1997.595354">10.1109/ICASSP.1997.595354</a></li>
<li>Effros, Michelle (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc97">Fast weighted universal transform coding: toward optimal, low complexity bases for image compression</a>; ISBN 0-8186-7761-9; Data Compression Conference (DCC '97), Snowbird, Utah, 25-27 March 1997; 211-220; <a href="https://doi.org/10.1109/DCC.1997.582021">10.1109/DCC.1997.582021</a></li>
<li>Goldsmith, Andrea and Effros, Michelle (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLicc97">Iterative joint design of source codes and multiresolution channel codes</a>; ISBN 0 7803 3925 8; International Conference on Communications (ICC '97), Montreal, Que., Canada, 8-12 June 1997; 319-323; <a href="https://doi.org/10.1109/ICC.1997.605283">10.1109/ICC.1997.605283</a></li>
<li>Goldsmith, Andrea and Effros, Michelle (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GOLisit97">The capacity region of broadcast channels with memory</a>; ISBN 0 7803 3956 8; International Symposium on Information Theory (ISIT '97), Ulm, Germany, 29 June-4 July 1997; 28; <a href="https://doi.org/10.1109/ISIT.1997.612943">10.1109/ISIT.1997.612943</a></li>
<li>Chou, Philip A. and Effros, Michelle, el al. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHOieeetit96">A vector quantization approach to universal noiseless coding and quantization</a>; IEEE Transactions on Information Theory; Vol. 42; No. 4; 1109-1138; <a href="https://doi.org/10.1109/18.508836">10.1109/18.508836</a></li>
<li>Effros, M. and Chou, P. A. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp95">Weighted universal bit allocation: optimal multiple quantization matrix coding</a>; ISBN 0-7803-2431-5; IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '95), Detroit, MI, 9-12 May 1995; 2343-2346; <a href="https://doi.org/10.1109/ICASSP.1995.479962">10.1109/ICASSP.1995.479962</a></li>
<li>Cheng, Jung-Fu and Dolinar, Sam, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHEisit95a">Data expansion with Huffman codes</a>; ISBN 0-7803-2453-6; IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, 17-22 September 1995; 325; <a href="https://doi.org/10.1109/ISIT.1995.531102">10.1109/ISIT.1995.531102</a></li>
<li>Chou, P. A. and Effros, M., el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHOisit95">Universal quantization of parametric sources has redundancy k/2 (log n)/n</a>; ISBN 0-7803-2454-4; IEEE International Symposium on Information Theory (ISIT '95), Whistler, British Columbia, Canada, 17-22 September 1995; 371; <a href="https://doi.org/10.1109/ISIT.1995.550358">10.1109/ISIT.1995.550358</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94b">Variable-rate source coding theorems for stationary nonergodic sources</a>; IEEE Transactions on Information Theory; Vol. 40; No. 6; 1920-1925; <a href="https://doi.org/10.1109/18.340466">10.1109/18.340466</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFdcc94">Variable dimension weighted universal vector quantization and noiseless coding</a>; ISBN 0-8186-5637-9; Data Compression Conference (4th : 1994 : Snowbird, Utah); 2-11; <a href="https://doi.org/10.1109/DCC.1994.305907">10.1109/DCC.1994.305907</a></li>
<li>Effros, Michelle and Chou, Philip A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFieeetit94a">A Progressive Universal Noiseless Coder</a>; IEEE Transactions on Information Theory; Vol. 40; No. 1; 108-117; <a href="https://doi.org/10.1109/18.272460">10.1109/18.272460</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFicassp94">One-pass adaptive universal vector quantization</a>; ISBN 0-7803-1775-0; IEEE International Conference on Acoustics, Speech, and Signal (ICASSP '94), Adelaide, Australia, 19-22 April 1994; V-625; <a href="https://doi.org/10.1109/ICASSP.1994.389437">10.1109/ICASSP.1994.389437</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94b">Variable-rate source coding theorems for stationary nonergodic sources</a>; ISBN 0-7803-2015-8; IEEE International Symposium on Information Theory (ISIT '94), Trondheim, Norway, 27 June - 1 July 1994; 266; <a href="https://doi.org/10.1109/ISIT.1994.395006">10.1109/ISIT.1994.395006</a></li>
<li>Perlmutter, Keren O. and Perlmutter, Sharon M., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:PERasilo94">An iterative joint codebook and classifier improvement algorithm for finite-state vector quantization</a>; ISBN 0-8186-6405-3; Asilomar Conference on Signals, Systems and Computers, 28th, Pacific Grove, CA, 31 October-2 November 1998; 701-705; <a href="https://doi.org/10.1109/ACSSC.1994.471542">10.1109/ACSSC.1994.471542</a></li>
<li>Effros, M. and Chou, P. A., el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit94a">Rates of convergence in adaptive universal vector quantization</a>; ISBN 0-7803-2015-8; IEEE International Symposium on Information Theory (ISIT '94), Trondheim, Norway, 27 June - 1 July 1994; 456; <a href="https://doi.org/10.1109/ISIT.1994.395071">10.1109/ISIT.1994.395071</a></li>
<li>Chou, Philip A. and Effros, Michelle (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHOisit93">Rate and distortion redundancies for universal source coding with respect to a fidelity criterion</a>; ISBN 0-7803-0878-6; IEEE International Symposium on Information Theory, ISIT93, San Antonio, TX, 17-22 January 1993; 53</li>
<li>Andrews, Barry D. and Effros, Michelle, el al. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ANDdcc93">A mean-removed variation of weighted universal vector quantization for image coding</a>; ISBN 0-8186-3392-1; Data Compression Conference (3rd : 1993 : Snowbird, Utah); 302-309; <a href="https://doi.org/10.1109/DCC.1993.253119">10.1109/DCC.1993.253119</a></li>
<li>Effros, Michelle and Chou, Philip A., el al. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:EFFisit91">A Progressive Universal Noiseless Coder</a>; ISBN 0-7803-0056-4; IEEE International Symposium on Information Technology (ISIT 91), Budapest, Hungary, 24-28 June 1991; 185</li>
</ul>