<h1>Bruck, Jehoshua</h1>
<h2>Book Chapter from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Kilic, Kordag Mehmet and Sima, Jin, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-765672000">On Algebraic Constructions of Neural Networks with Small Weights</a>; ISBN 978-1-6654-2159-1; 2022 IEEE International Symposium on Information Theory (ISIT); 3007-3012; <a href="https://doi.org/10.1109/isit50566.2022.9834401">10.1109/isit50566.2022.9834401</a></li>
<li>Sima, Jin and Bruck, Jehoshua (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211110-153719711">Trace Reconstruction with Bounded Edit Distance</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 2519-2524; <a href="https://doi.org/10.1109/isit45174.2021.9518244">10.1109/isit45174.2021.9518244</a></li>
<li>Kilic, Kordag Mehmet and Bruck, Jehoshua (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211110-155100881">Neural Network Computations with DOMINATION Functions</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 1029-1034; <a href="https://doi.org/10.1109/isit45174.2021.9517872">10.1109/isit45174.2021.9517872</a></li>
<li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519">Synthesizing New Expertise via Collaboration</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 2447-2452; <a href="https://doi.org/10.1109/isit45174.2021.9517822">10.1109/isit45174.2021.9517822</a></li>
<li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171">CodNN – Robust Neural Networks From Coded Classification</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 2688-2693; <a href="https://doi.org/10.1109/ISIT44484.2020.9174480">10.1109/ISIT44484.2020.9174480</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146">Coding for Optimized Writing Rate in DNA Storage</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 711-716; <a href="https://doi.org/10.1109/ISIT44484.2020.9174253">10.1109/ISIT44484.2020.9174253</a></li>
<li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055">What is the Value of Data? on Mathematical Methods for Data Quality Estimation</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 2825-2830; <a href="https://doi.org/10.1109/isit44484.2020.9174311">10.1109/isit44484.2020.9174311</a></li>
<li>Sima, Jin and Raviv, Netanel, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-134827466">Robust Indexing - Optimal Codes for DNA Storage</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 717-722; <a href="https://doi.org/10.1109/isit44484.2020.9174447">10.1109/isit44484.2020.9174447</a></li>
<li>Sima, Jin and Gabrys, Ryan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-142617575">Syndrome Compression for Optimal Redundancy Codes</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 751-756; <a href="https://doi.org/10.1109/isit44484.2020.9174009">10.1109/isit44484.2020.9174009</a></li>
<li>Sima, Jin and Gabrys, Ryan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-144630883">Optimal Systematic t-Deletion Correcting Codes</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 769-774; <a href="https://doi.org/10.1109/isit44484.2020.9173986">10.1109/isit44484.2020.9173986</a></li>
<li>Sima, Jin and Gabrys, Ryan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-150933262">Optimal Codes for the q-ary Deletion Channel</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 740-745; <a href="https://doi.org/10.1109/isit44484.2020.9174241">10.1109/isit44484.2020.9174241</a></li>
<li>Huang, Kunping and Raviv, Netanel, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085">Improve Robustness of Deep Neural Networks by Coding</a>; ISBN 9781728141909; 2020 Information Theory and Applications Workshop (ITA); 1-7; <a href="https://doi.org/10.1109/ita50056.2020.9244998">10.1109/ita50056.2020.9244998</a></li>
<li>Horovitz, Michal and Yaakobi, Eitan, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-104451577">Iterative Programming of Noisy Memory Cells</a>; ISBN 978-1-5386-6900-6; 2019 IEEE Information Theory Workshop (ITW); 1-5; <a href="https://doi.org/10.1109/ITW44776.2019.8989404">10.1109/ITW44776.2019.8989404</a></li>
<li>Sima, Jin and Bruck, Jehoshua (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332823">Correcting Deletions in Multiple-Heads Racetrack Memories</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 1367-1371; <a href="https://doi.org/10.1109/isit.2019.8849783">10.1109/isit.2019.8849783</a></li>
<li>Sima, Jin and Bruck, Jehoshua (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190826-143512243">Optimal k-Deletion Correcting Codes</a>; ISBN 978-1-5386-9291-2; 2019 IEEE International Symposium on Information Theory (ISIT); 847-851; <a href="https://doi.org/10.1109/ISIT.2019.8849750">10.1109/ISIT.2019.8849750</a></li>
<li>Raviv, Netanel and Yu, Qian, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332096">Download and Access Trade-offs in Lagrange Coded Computing</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 1787-1791; <a href="https://doi.org/10.1109/isit.2019.8849547">10.1109/isit.2019.8849547</a></li>
<li>Sima, Jin and Raviv, Netanel, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333511">On Coding Over Sliced Information</a>; ISBN 9781538692912; 2019 IEEE International Symposium on Information Theory (ISIT); 767-771; <a href="https://doi.org/10.1109/isit.2019.8849596">10.1109/isit.2019.8849596</a></li>
<li>Sima, Jin and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180709-103747373">Two Deletion Correcting Codes from Indicator Vectors</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 421-425; <a href="https://doi.org/10.1109/ISIT.2018.8437868">10.1109/ISIT.2018.8437868</a></li>
<li>Jain, Siddharth and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274">Attaining the 2nd Chargaff Rule by Tandem Duplications</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 2241-2245; <a href="https://doi.org/10.1109/ISIT.2018.8437526">10.1109/ISIT.2018.8437526</a></li>
<li>Shor, Roman and Yadgar, Gala, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016">How to Best Share a Big Secret</a>; ISBN 978-1-4503-5849-1; Proceedings of the 11th ACM International Systems and Storage Conference; 76-88; <a href="https://doi.org/10.1145/3211890.3211896">10.1145/3211890.3211896</a></li>
<li>Zuck, Aviad and Li, Yue, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190328-165908772">Stash in a Flash</a>; ISBN 9781450358491; Proceedings of the 11th ACM International Systems and Storage Conference; 133; <a href="https://doi.org/10.1145/3211890.3211906">10.1145/3211890.3211906</a></li>
<li>Zuck, Aviad and Li, Yue, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180308-133517936">Stash in a Flash</a>; ISBN 978-1-931971-42-3; 16th USENIX Conference on File and Storage Technologies; 169-185</li>
<li>Jiang, Anxiao (Andrew) and Upadhyaya, Pulakesh, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726">Stopping Set Elimination for LDPC Codes</a>; ISBN 978-1-5386-3267-3; 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton); 700-707; <a href="https://doi.org/10.1109/ALLERTON.2017.8262806">10.1109/ALLERTON.2017.8262806</a></li>
<li>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-162125720">Secure RAID schemes from EVENODD and STAR codes</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 609-613; <a href="https://doi.org/10.1109/ISIT.2017.8006600">10.1109/ISIT.2017.8006600</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076">Noise and uncertainty in string-duplication systems</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 3120-3124; <a href="https://doi.org/10.1109/ISIT.2017.8007104">10.1109/ISIT.2017.8007104</a></li>
<li>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-153318334">Secret sharing with optimal decoding and repair bandwidth</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 1813-1817; <a href="https://doi.org/10.1109/ISIT.2017.8006842">10.1109/ISIT.2017.8006842</a></li>
<li>Jiang, Anxiao (Andrew) and Upadhyaya, Pulakesh, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170907-081956775">Correcting errors by natural redundancy</a>; ISBN 978-1-5090-5293-6; 2017 Information Theory and Applications Workshop (ITA); 1-8; <a href="https://doi.org/10.1109/ITA.2017.8023455">10.1109/ITA.2017.8023455</a></li>
<li>Elishco, Ohad and Farnoud (Hassanzadeh), Farzad, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-102815029">The capacity of some Pólya string models</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 270-274; <a href="https://doi.org/10.1109/ISIT.2016.7541303">10.1109/ISIT.2016.7541303</a></li>
<li>Alon, Noga and Bruck, Jehoshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060">On the duplication distance of binary strings</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 260-264; <a href="https://doi.org/10.1109/ISIT.2016.7541301">10.1109/ISIT.2016.7541301</a></li>
<li>Huang, Wentao and Bruck, Jehoshua (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160823-165433889">Secure RAID Schemes for Distributed Storage</a>; ISBN 978-1-5090-1806-2; 2016 IEEE International Symposium on Information Theory (ISIT); 1401-1405; <a href="https://doi.org/10.1109/ISIT.2016.7541529">10.1109/ISIT.2016.7541529</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; ISBN 978-1-5090-1806-2; 2016 IEEE International Symposium on Information Theory (ISIT); <a href="https://doi.org/10.1109/ISIT.2016.7541455">10.1109/ISIT.2016.7541455</a></li>
<li>Li, Yue and Gad, Eyal En, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161003-155557445">Data archiving in 1x-nm NAND flash memories: Enabling long-term storage using rank modulation and scrubbing</a>; ISBN 978-1-4673-9138-2; 2016 IEEE International Reliability Physics Symposium (IRPS); 6C-6; <a href="https://doi.org/10.1109/IRPS.2016.7574572">10.1109/IRPS.2016.7574572</a></li>
<li>Li, Yue and Sheldon, Douglas J., el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161004-114313111">Error Characterization and Mitigation for 16nm MLC NAND Flash Memory under Total Ionizing Dose Effect</a>; ISBN 978-1-4673-9138-2; 2016 International Reliability Physics Symposium; SE2-1; <a href="https://doi.org/10.1109/IRPS.2016.7574638">10.1109/IRPS.2016.7574638</a></li>
<li>Ma, Yanjun and Li, Yue, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160909-113811678">Reliability and Hardware Implementation of Rank Modulation Flash Memory</a>; ISBN 978-1-5090-2126-0; Non-Volatile Memory Technology Symposium (NVMTS), 2015 15th; 1-5; <a href="https://doi.org/10.1109/NVMTS.2015.7457493">10.1109/NVMTS.2015.7457493</a></li>
<li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151012-143650853">A Stochastic Model for Genomic Interspersed Duplication</a>; ISBN 978-1-4673-7704-1; 2015 IEEE International Symposium on Information Theory (ISIT); 904-908; <a href="https://doi.org/10.1109/ISIT.2015.7282586">10.1109/ISIT.2015.7282586</a></li>
<li>En Gad, Eyal and Huang, Wentao, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151012-142447290">Rewriting Flash Memories by Message Passing</a>; <a href="https://doi.org/10.1109/ISIT.2015.7282534">10.1109/ISIT.2015.7282534</a></li>
<li>Jiang, Anxiao (Andrew) and Li, Yue, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160915-122649767">Error correction through language processing</a>; ISBN 978-1-4799-5524-4; 2015 IEEE Information Theory Workshop (ITW); 1-5; <a href="https://doi.org/10.1109/ITW.2015.7133145">10.1109/ITW.2015.7133145</a></li>
<li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-153306808">Is there a new way to correct errors</a>; ISBN 978-1-4799-7195-4; 2015 Information Theory and Applications Workshop (ITA); 181-181; <a href="https://doi.org/10.1109/ITA.2015.7308985">10.1109/ITA.2015.7308985</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366">Capacity and expressiveness of genomic tandem duplication</a>; <a href="https://doi.org/10.1109/ISIT.2015.7282795">10.1109/ISIT.2015.7282795</a></li>
<li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150227-082940148">The capacity of string-duplication systems</a>; ISBN 978-1-4799-5186-4; 2014 IEEE International Symposium on Information Theory (ISIT); 1301-1305; <a href="https://doi.org/10.1109/ISIT.2014.6875043">10.1109/ISIT.2014.6875043</a></li>
<li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150227-075642886">Bounds for Permutation Rate-Distortion</a>; ISBN 978-1-4799-5186-4; 2014 IEEE International Symposium on Information Theory (ISIT); 6-10; <a href="https://doi.org/10.1109/ISIT.2014.6874784">10.1109/ISIT.2014.6874784</a></li>
<li>En Gad, Eyal and Li, Yue, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150227-084706095">Polar coding for noisy write-once memories</a>; ISBN 978-1-4799-5186-4; 2014 IEEE International Symposium on Information Theory (ISIT); 1638-1642; <a href="https://doi.org/10.1109/ISIT.2014.6875111">10.1109/ISIT.2014.6875111</a></li>
<li>Farnoud (Hassanzadeh), Farzad and Yaakobi, Eitan, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20141203-103210856">Approximate Sorting of Data Streams with Limited Storage</a>; ISBN 978-3-319-08782-5; Computing and Combinatorics, COCOON 2014; 465-476; <a href="https://doi.org/10.1007/978-3-319-08783-2_40">10.1007/978-3-319-08783-2_40</a></li>
<li>Yaakobi, Eitan and Schwartz, Moshe, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170125-143159155">Sequence reconstruction for Grassmann graphs and permutations</a>; ISBN 978-1-4799-0446-4; 2013 IEEE International Symposium on Information Theory; 874-878; <a href="https://doi.org/10.1109/ISIT.2013.6620351">10.1109/ISIT.2013.6620351</a></li>
<li>Li, Yue and Wang, Yue, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170207-175141968">Content-assisted file decoding for nonvolatile memories</a>; ISBN 978-1-4673-5051-8; 2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR); 937-941; <a href="https://doi.org/10.1109/ACSSC.2012.6489154">10.1109/ACSSC.2012.6489154</a></li>
<li>En Gad, Eyal and Jiang, Anxiao (Andrew), el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120828-151832251">Trade-offs between Instantaneous and Total Capacity in Multi-Cell Flash Memories</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 990-994; <a href="https://doi.org/10.1109/ISIT.2012.6284712">10.1109/ISIT.2012.6284712</a></li>
<li>Wang, Zhiying and Tamo, Itzhak, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130204-132322886">Long MDS Codes for Optimal Repair Bandwidth</a>; ISBN 978-1-4673-2579-0; 2012 IEEE International Symposium on Information Theory; 1182-1186; <a href="https://doi.org/10.1109/ISIT.2012.6283041">10.1109/ISIT.2012.6283041</a></li>
<li>Yaakobi, Eitan and Bruck, Jehoshua, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120828-151322448">Decoding of Cyclic Codes over Symbol-Pair Read Channels</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 2891-2895; <a href="https://doi.org/10.1109/ISIT.2012.6284053">10.1109/ISIT.2012.6284053</a></li>
<li>Tamo, Itzhak and Wang, Zhiying, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120829-092120549">Access vs. Bandwidth in Codes for Storage</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 1187-1191; <a href="https://doi.org/10.1109/ISIT.2012.6283042">10.1109/ISIT.2012.6283042</a></li>
<li>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120828-165227181">Variable-Length Extractors</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 1107-1111; <a href="https://doi.org/10.1109/ISIT.2012.6283024">10.1109/ISIT.2012.6283024</a></li>
<li>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120828-151501177">Systematic Error-Correcting Codes for Rank Modulation</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 2978-2982; <a href="https://doi.org/10.1109/ISIT.2012.6284106">10.1109/ISIT.2012.6284106</a></li>
<li>Yaakobi, Eitan and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120828-144523977">On the Uncertainty of Information Retrieval in Associative Memories</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 106-110; <a href="https://doi.org/10.1109/ISIT.2012.6283016">10.1109/ISIT.2012.6283016</a></li>
<li>Wang, Zhiying and Tamo, Itzhak, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120829-103740126">Long MDS Codes for Optimal Repair Bandwidth</a>; ISBN 978-1-4673-2580-6; 2012 IEEE International Symposium on Information Theory Proceedings (ISIT); 1182-1186; <a href="https://doi.org/10.1109/ISIT.2012.6283041">10.1109/ISIT.2012.6283041</a></li>
<li>Zhou, Hongchao and Bruck, Jehoshua (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120330-134402245">Linear extractors for extracting randomness from noisy sources</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory, Proceedings; 1738-1742; <a href="https://doi.org/10.1109/ISIT.2011.6033845">10.1109/ISIT.2011.6033845</a></li>
<li>En Gad, Eyal and Jiang, Anxiao (Andrew), el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120405-104551517">Compressed Encoding for Rank Modulation</a>; ISBN 978-1-4577-0596-0; IEEE International Symposium on Information Theory Proceedings; 884-888; <a href="https://doi.org/10.1109/ISIT.2011.6034264">10.1109/ISIT.2011.6034264</a></li>
<li>Jiang, Anxiao (Andrew) and Zhou, Hongchao, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170213-160905267">Patterned cells for phase change memories</a>; ISBN 978-1-4577-0595-3; 2011 IEEE International Symposium on Information Theory Proceedings; 2333-2337; <a href="https://doi.org/10.1109/ISIT.2011.6033979">10.1109/ISIT.2011.6033979</a></li>
<li>Tamo, Itzhak and Wang, Zhiying, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120406-093959188">MDS Array Codes with Optimal Rebuilding</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 1240-1244; <a href="https://doi.org/10.1109/ISIT.2011.6033733">10.1109/ISIT.2011.6033733</a></li>
<li>En Gad, Eyal and Langberg, Michael, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120405-102509210">Generalized Gray Codes for Local Rank Modulation</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 874-878; <a href="https://doi.org/10.1109/ISIT.2011.6034262">10.1109/ISIT.2011.6034262</a></li>
<li>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120406-093123448">Nonuniform Codes for Correcting Asymmetric Errors</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 1046-1050; <a href="https://doi.org/10.1109/ISIT.2011.6033689">10.1109/ISIT.2011.6033689</a></li>
<li>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120406-094817699">Error-Correcting Schemes with Dynamic Thresholds  in Nonvolatile Memories</a>; ISBN 978-1-4577-0596-0; 2011 IEEE International Symposium on Information Theory Proceedings; 2143-2147; <a href="https://doi.org/10.1109/ISIT.2011.6033936">10.1109/ISIT.2011.6033936</a></li>
<li>Wang, Zhiying and Dimakis, Alexandros G., el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110707-082718436">Rebuilding for Array Codes in Distributed Storage Systems</a>; ISBN 978-1-4244-8863-6; 2010 IEEE GLOBECOM Workshops; 1905-1909; <a href="https://doi.org/10.1109/GLOCOMW.2010.5700274">10.1109/GLOCOMW.2010.5700274</a></li>
<li>En Gad, Eyal and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170309-151553099">On a construction for constant-weight Gray codes for local rank modulation</a>; ISBN 978-1-4244-8682-3; IEEE 26th Convention of Electrical and Electronics Engineers in Israel; 996; <a href="https://doi.org/10.1109/EEEI.2010.5661923">10.1109/EEEI.2010.5661923</a></li>
<li>Zhou, Hongchao and Chen, Ho-Lin, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110331-132532031">On the Synthesis of Stochastic Flow Networks</a>; ISBN 978-1-4244-7891-0; 2010 IEEE International Symposium on Information Theory; 1330-1334; <a href="https://doi.org/10.1109/ISIT.2010.5513754">10.1109/ISIT.2010.5513754</a></li>
<li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170309-135756699">Data movement and aggregation in flash memories</a>; ISBN 978-1-4244-7892-7; 2010 IEEE International Symposium on Information Theory; 1918-1922; <a href="https://doi.org/10.1109/ISIT.2010.5513391">10.1109/ISIT.2010.5513391</a></li>
<li>Bruck, Shuki and Jefferson, David, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100805-151724246">A Modular Voting Architecture (&quot;Frog Voting&quot;)</a>; ISBN 978-3-642-12979-7; Towards trustworthy elections : new directions in electronic voting; 97-106; <a href="https://doi.org/10.1007/978-3-642-12980-3_5">10.1007/978-3-642-12980-3_5</a></li>
<li>Zhou, Hongchao and Bruck, Jehoshua (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110331-095348080">Generalizing the Blum-Elias Method for Generating
Random Bits from Markov Chains</a>; ISBN 978-1-4244-7891-0; 2010 IEEE International Symposium on Information Theory; 1248-1252; <a href="https://doi.org/10.1109/ISIT.2010.5513679">10.1109/ISIT.2010.5513679</a></li>
<li>Wang, Zhiying and Bruck, Jehoshua (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110331-130545474">Partial Rank Modulation for Flash Memories</a>; ISBN 978-1-4244-7891-0; 2010 IEEE International Symposium on Information Theory; 864-868; <a href="https://doi.org/10.1109/ISIT.2010.5513597">10.1109/ISIT.2010.5513597</a></li>
<li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170321-173656746">Data movement in flash memories</a>; ISBN 978-1-4244-5871-4; 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton); 1031-1038; <a href="https://doi.org/10.1109/ALLERTON.2009.5394879">10.1109/ALLERTON.2009.5394879</a></li>
<li>Wang, Zhiying and Jiang, Anxiao (Andrew), el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-142932373">On the capacity of bounded rank modulation for flash memories</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 1234-1238; <a href="https://doi.org/10.1109/ISIT.2009.5205972">10.1109/ISIT.2009.5205972</a></li>
<li>Zhou, Hongchao and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-150432698">On the expressibility of stochastic switching circuits</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 2061-2065; <a href="https://doi.org/10.1109/ISIT.2009.5205401">10.1109/ISIT.2009.5205401</a></li>
<li>Loh, Po-Ling and Zhou, Hongchao, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100816-134022210">The robustness of stochastic switching networks</a>; ISBN 978-1-4244-4312-3; ISIT 2009; 2066-2070; <a href="https://doi.org/10.1109/ISIT.2009.5205379">10.1109/ISIT.2009.5205379</a></li>
<li>Cook, Matthew and Soloveichik, David, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111020-103016495">Programmability of Chemical Reaction Networks</a>; ISBN 978-3-540-88868-0; Algorithmic Bioprocesses; 543-584; <a href="https://doi.org/10.1007/978-3-540-88869-7_27">10.1007/978-3-540-88869-7_27</a></li>
<li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170321-172544029">Universal rewriting in constrained memories</a>; ISBN 978-1-4244-4312-3; 2009 IEEE International Symposium on Information Theory; 1219-1223; <a href="https://doi.org/10.1109/ISIT.2009.5205981">10.1109/ISIT.2009.5205981</a></li>
<li>Wilhelm, Daniel and Bruck, Jehoshua (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:WILisit08">Stochastic switching circuit synthesis</a>; ISBN 978-1-4244-2571-6; IEEE International Symposium on Information Theory (ISIT '08), Toronto, Canada, 6-11 July 2008; 1388-1392; <a href="https://doi.org/10.1109/ISIT.2008.4595215">10.1109/ISIT.2008.4595215</a></li>
<li>Langberg, Michael and Schwartz, Moshe, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161121-163644968">Distributed broadcasting and mapping protocols in directed anonymous networks</a>; ISBN 978-1-59593-616-5; PODC '07 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing; 382-383; <a href="https://doi.org/10.1145/1281100.1281184">10.1145/1281100.1281184</a></li>
<li>Fett, Brian and Bruck, Jehoshua, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161019-153750816">Synthesizing stochasticity in biochemical systems</a>; ISBN 978-1-59593-627-1; DAC '07 Proceedings of the 44th annual Design Automation Conference; 640-645; <a href="https://doi.org/10.1145/1278480.1278643">10.1145/1278480.1278643</a></li>
<li>Jiang, Anxiao (Andrew) and Bohossian, Vasken, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170419-152416338">Floating Codes for Joint Information Storage in Write Asymmetric Memories</a>; ISBN 978-1-4244-1397-3; 2007 IEEE International Symposium on Information Theory; 1166-1170; <a href="https://doi.org/10.1109/ISIT.2007.4557381">10.1109/ISIT.2007.4557381</a></li>
<li>Schwartz, Moshe and Bruck, Jehoshua (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170424-171247108">Constrained Codes as Networks of Relations</a>; ISBN 978-1-4244-1397-3; 2007 IEEE International Symposium on Information Theory; 1386-1390; <a href="https://doi.org/10.1109/ISIT.2007.4557416">10.1109/ISIT.2007.4557416</a></li>
<li>Cassuto, Yuval and Schwartz, Moshe, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170426-165849521">Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors</a>; ISBN 978-1-4244-1397-3; 2007 IEEE International Symposium on Information Theory; 1176-1180; <a href="https://doi.org/10.1109/ISIT.2007.4557123">10.1109/ISIT.2007.4557123</a></li>
<li>Bohossian, Vasken and Jiang, Anxiao (Andrew), el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376">Buffer Coding for Asymmetric Multi-Level Memory</a>; ISBN 978-1-4244-1397-3; 2007 IEEE International Symposium on Information Theory; 1186-1190; <a href="https://doi.org/10.1109/ISIT.2007.4557384">10.1109/ISIT.2007.4557384</a></li>
<li>Bohossian, Vasken and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170516-150511939">Shortening Array Codes and the Perfect 1-Factorization Conjecture</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 2799-2803; <a href="https://doi.org/10.1109/ISIT.2006.261572">10.1109/ISIT.2006.261572</a></li>
<li>Codenotti, Paolo and Sprintson, Alexander, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170510-171516844">Anti-Jamming Schedules for Wireless Data Broadcast Systems</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 1856-1860; <a href="https://doi.org/10.1109/ISIT.2006.261756">10.1109/ISIT.2006.261756</a></li>
<li>Schwartz, Moshe and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170509-172831834">On the Capacity of Precision-Resolution Constrained Systems</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 1462-1466; <a href="https://doi.org/10.1109/ISIT.2006.262110">10.1109/ISIT.2006.262110</a></li>
<li>Cassuto, Yuval and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170516-163950291">Cyclic Low-Density MDS Array Codes</a>; ISBN 1-4244-0505-X; 2006 IEEE International Symposium on Information Theory; 2794-2798; <a href="https://doi.org/10.1109/ISIT.2006.261571">10.1109/ISIT.2006.261571</a></li>
<li>Langberg, Michael and Sprintson, Alexander, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110630-145653337">Network Coding: A Computational Perspective</a>; ISBN 1-4244-0349-9; 40th Annual Conference on Information Sciences and Systems; 877-882; <a href="https://doi.org/10.1109/CISS.2006.286590">10.1109/CISS.2006.286590</a></li>
<li>Bruck, Jehoshua and Gao, Jie, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160811-164254714">MAP: medial axis based geometric routing in sensor networks</a>; ISBN 1-59593-020-5; MobiCom '05 Proceedings of the 11th annual international conference on Mobile computing and networking; 88-102; <a href="https://doi.org/10.1145/1080829.1080839">10.1145/1080829.1080839</a></li>
<li>Cassuto, Yuval and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CASisit05">Network coding for non-uniform demands</a>; ISBN 0-7803-9151-9; International Symposium on Information Theory (ISIT 2005), Adelaide, Australia, 4-9 September 2005; 1720-1724; <a href="https://doi.org/10.1109/ISIT.2005.1523639">10.1109/ISIT.2005.1523639</a></li>
<li>Bruck, Jehoshua and Gao, Jie, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160811-163730860">Localization and routing in sensor networks by local angle information</a>; ISBN 1-59593-004-3; MobiHoc '05 Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing; 181-192; <a href="https://doi.org/10.1145/1062689.1062713">10.1145/1062689.1062713</a></li>
<li>Jiang, Anxiao and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110818-114857462">Monotone Percolation and The Topology Control of Wireless Networks</a>; ISBN 0-7803-8968-9; Infocom 2005: The Conference on Computer Communications; 327-338; <a href="https://doi.org/10.1109/INFCOM.2005.1497903">10.1109/INFCOM.2005.1497903</a></li>
<li>Langberg, Michael and Sprintson, Alexander, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANisit04">Optimal universal schedules for discrete broadcast</a>; ISBN 0-7803-8280-3; IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July, 2004; 111; <a href="https://doi.org/10.1109/ISIT.2004.1365148">10.1109/ISIT.2004.1365148</a></li>
<li>Langberg, Michael and Sprintson, Alexander, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANisit05b">The encoding complexity of network coding</a></li>
<li>Langberg, Michael and Sprintson, Alexander, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANisit05a">Staleness vs. waiting time in universal discrete broadcast</a></li>
<li>Foltz, Kevin and Xu, Lihao, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110921-122835869">Scheduling for Efficient Data Broadcast over Two Channels</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory; 113-113; <a href="https://doi.org/10.1109/ISIT.2004.1365147">10.1109/ISIT.2004.1365147</a></li>
<li>Cassuto, Yuval and Bruck, Jehoshua (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CASisit04">Miscorrection probability beyond the minimum distance</a>; ISBN 0-7803-8280-3; International Symposium on Information Theory (ISIT 2004), Chicago IL, 27 June-2 July 2004; 524; <a href="https://doi.org/10.1109/ISIT.2004.1365561">10.1109/ISIT.2004.1365561</a></li>
<li>Jiang, Anxiao (Andrew) and Cook, Matthew, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110818-083929592">Optimal t-Interleaving on Tori</a>; ISBN 0-7803-8280-3; 2004 IEEE International Symposium on Information Theory; 22-22; <a href="https://doi.org/10.1109/ISIT.2004.1365060">10.1109/ISIT.2004.1365060</a></li>
<li>Bruck, Johoshua (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111025-143359852">Bridging Paradigm Gaps Between Biology and Engineering</a>; ISBN 0-7695-2000-6; Proceedings of the 2003 IEEE Bioinformatics Conference; 14-14; <a href="https://doi.org/10.1109/CSB.2003.1227290">10.1109/CSB.2003.1227290</a></li>
<li>Booth, Lorna and Bruck, Jehoshua, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111005-091318608">Ad hoc wireless networks with noisy links</a>; ISBN 0-7803-7728-1; 2003 IEEE International Symposium on Information Theory; 386-386; <a href="https://doi.org/10.1109/ISIT.2003.1228402">10.1109/ISIT.2003.1228402</a></li>
<li>Foltz, Kevin and Xu, Lihao, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111005-113409987">Coding and scheduling for efficient loss-resilient data broadcasting</a>; ISBN 0-7803-7728-1; 2003 IEEE International Symposium on Information Theory; 413-413; <a href="https://doi.org/10.1109/ISIT.2003.1228430">10.1109/ISIT.2003.1228430</a></li>
<li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:ETR050">Optimal Content Placement for En-Route Web Caching</a>; ISBN 0-7695-1938-5; Second IEEE International Symposium on Network Computing and Applications; 9-16; <a href="https://doi.org/10.1109/NCA.2003.1201132">10.1109/NCA.2003.1201132</a></li>
<li>Riedel, Marc D. and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-143707754">The synthesis of cyclic combinational circuits</a>; ISBN 1-58113-688-9; 40th Design Automation Conference; 163-168</li>
<li>Mukhtar, Saleem and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111027-155844420">Interval modulation coding</a>; ISBN 0-7803-7501-7; 2002 IEEE International Symposium on Information Theory; 327-327; <a href="https://doi.org/10.1109/ISIT.2002.1023599">10.1109/ISIT.2002.1023599</a></li>
<li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111019-133944822">Diversity Coloring for information storage in networks</a>; ISBN 0-7803-7501-7; 2002 IEEE International Symposium on Information Theory; 381-381; <a href="https://doi.org/10.1109/ISIT.2002.1023653">10.1109/ISIT.2002.1023653</a></li>
<li>Foltz, Kevin and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111102-132442999">Robustness of Time-Division Schedules for Internet Broadcast</a>; ISBN 0-7803-7501-7; 2002 IEEE International Symposium on Information Theory; 383-383; <a href="https://doi.org/10.1109/ISIT.2002.1023655">10.1109/ISIT.2002.1023655</a></li>
<li>Booth, L. and Bruck, J., el al. (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111102-090203478">Power requirements for connectivity in clustered wireless networks</a>; ISBN 0-7803-7501-7; 2002 IEEE International Symposium on Information Theory; 353-353; <a href="https://doi.org/10.1109/ISIT.2002.1023625">10.1109/ISIT.2002.1023625</a></li>
<li>Foltz, Kevin and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111117-083940997">Time Division is Better Than Frequency Division for Periodic Internet Broadcast of Dynamic Data</a>; ISBN 0-7803-7123-2; 2001 IEEE International Symposium on Information Theory; 158-158; <a href="https://doi.org/10.1109/ISIT.2001.936021">10.1109/ISIT.2001.936021</a></li>
<li>Fan, Chenggong Charles and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111110-152519883">The Raincore Distributed Session Service for Networking Elements</a>; ISBN 0-7695-0990-8; Proceedings of the 15th International Parallel and Distributed Processing Symposium; 1673-1681; <a href="https://doi.org/10.1109/IPDPS.2001.925154">10.1109/IPDPS.2001.925154</a></li>
<li>Foltz, Kevin and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967">Splitting the Scheduling Headache</a>; ISBN 0-7803-5858-9; 2000 IEEE International Symposium on Information Theory; 489-489; <a href="https://doi.org/10.1109/ISIT.2000.866787">10.1109/ISIT.2000.866787</a></li>
<li>Bohossian, Vasken and Fan, Charles C., el al. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317828">Computing in the RAIN: A Reliable Array of Independent Nodes</a>; ISBN 9783540674429; Parallel and distributed processing : 15 IPDPS 2000 workshops, Cancun, Mexico, May 1 - 5, 2000, proceedings; 1204-1213; <a href="https://doi.org/10.1007/3-540-45591-4_167">10.1007/3-540-45591-4_167</a></li>
<li>Franceschetti, Massimo and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200127-124216616">On the Possibility of Group Membership Protocols</a>; ISBN 978-1-4613-7053-6; Dependable Network Computing; 77-92; <a href="https://doi.org/10.1007/978-1-4615-4549-1_4">10.1007/978-1-4615-4549-1_4</a></li>
<li>Riedel, Marc D. and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190830-101628653">Tolerating Faults in Counting Networks</a>; ISBN 978-1-4613-7053-6; Dependable Network Computing; 267-277; <a href="https://doi.org/10.1007/978-1-4615-4549-1_12">10.1007/978-1-4615-4549-1_12</a></li>
<li>LeMahieu, Paul and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566">A Consistent History Link Connectivity Protocol</a>; ISBN 0-7695-0143-5; 13th International Parallel Processing Symposium &amp; 10th Symposium on Parallel and Distributed Processing; 138-142; <a href="https://doi.org/10.1109/IPPS.1999.760448">10.1109/IPPS.1999.760448</a></li>
<li>Xu, Lihao and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200709-082541313">Highly available distributed storage systems</a>; ISBN 978-1-85233-642-4; Workshop on Wide Area Networks and High Performance Computing; 307-330; <a href="https://doi.org/10.1007/bfb0110096">10.1007/bfb0110096</a></li>
<li>Xu, Lihao and Bohossian, Vasken, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:XULisit98">Low density MDS codes and factors of complete graphs</a>; ISBN 0-7803-5000-6; IEEE International Symposium on Information Theory, 1998.; 20; <a href="https://doi.org/10.1109/ISIT.1998.708599">10.1109/ISIT.1998.708599</a></li>
<li>Gibson, Michael and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111215-111208543">Efficient digital to analog encoding</a>; ISBN 0-7803-5000-6; 1998 IEEE International Symposium on Information Theory; 325-325; <a href="https://doi.org/10.1109/ISIT.1998.708930">10.1109/ISIT.1998.708930</a></li>
<li>Blaum, Mario and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120112-112036174">Coding for skew correcting and detecting in parallel asynchronous communications</a>; ISBN 0-7803-5000-6; 1998 IEEE International Symposium on Information Theory; 75-75; <a href="https://doi.org/10.1109/ISIT.1998.708659">10.1109/ISIT.1998.708659</a></li>
<li>LeMahieu, Paul and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161122-142619200">A consistent history link connectivity protocol</a>; ISBN 0-89791-977-7; PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing; 309; <a href="https://doi.org/10.1145/277697.277757">10.1145/277697.277757</a></li>
<li>LeMahieu, Paul and Bohossian, Vasken, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111215-115455804">Fault-tolerant switched local area networks</a>; ISBN 0-8186-8403-8; Proceedings of the first merged International Parallel Processing Symposium &amp; Symposium on Parallel and Distributed Processing; 747-751; <a href="https://doi.org/10.1109/IPPS.1998.670011">10.1109/IPPS.1998.670011</a></li>
<li>Bohossian, Vasken and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160224-141437128">Multiple Threshold Neural Logic</a>; ISBN 0-262-10076-2; Advances in Neural Information Processing Systems 10 (NIPS 1997); 252-258</li>
<li>Bohossian, Vasken and Hasler, Paul, el al. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BOHiciss97">Programmable neural logic</a>; ISBN 0-7803-4276-3; IEEE International Conference on Innovative Systems in Silicon, 2nd,  Austin, TX, 8-10 October 1997; 13-21; <a href="https://doi.org/10.1109/ICISS.1997.630242">10.1109/ICISS.1997.630242</a></li>
<li>BIaum, Mario and Bruck, Jehoshua, el al. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120119-135511706">Two-dimensional interleaving schemes with repetitions</a>; ISBN 0-7803-3956-8; 1997 IEEE International Symposium on Information Theory, Proceedings; 342-342; <a href="https://doi.org/10.1109/ISIT.1997.613272">10.1109/ISIT.1997.613272</a></li>
<li>Ho, Ching-Tien and Bruck, Jehoshua, el al. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161103-134218465">Partial-sum queries in OLAP data cubes using covering codes</a>; ISBN 0-89791-910-6; PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems; 228-237; <a href="https://doi.org/10.1145/263661.263686">10.1145/263661.263686</a></li>
<li>Blaum, Mario and Bruck, Jehoshua (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120119-113410577">Array Codes for Correction of Criss-Cross Errors</a>; ISBN 0-7803-3956-8; 1997 IEEE International Symposium on Information Theory, Proceedings; 412-412; <a href="https://doi.org/10.1109/ISIT.1997.613349">10.1109/ISIT.1997.613349</a></li>
<li>Blaum, Mario and Bruck, Jehoshua, el al. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120207-113452642">On Optimal Placements of Processors in Tori Networks</a>; ISBN 0-8186-7683-3; Eighth IEEE Symposium on Parallel and Distributed Processing; 552-555; <a href="https://doi.org/10.1109/SPDP.1996.570382">10.1109/SPDP.1996.570382</a></li>
<li>Ziv, Avi and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVissre96">An on-line algorithm for checkpoint placement</a>; ISBN 0818677074; International Symposium on Software Reliability Engineering, 7th, White Plains, NY, 30 October-2 November 1996; 274-283; <a href="https://doi.org/10.1109/ISSRE.1996.558869">10.1109/ISSRE.1996.558869</a></li>
<li>Bohossian, Vasken and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160223-114401229">On Neural Networks with Minimal Weights</a>; ISBN 0-262-20107-0; Advances in Neural Information Processing Systems 8 (NIPS 1995); 246-252</li>
<li>Blaum, Mario and Bruck, Jehoshua, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120216-070547466">MDS Array Codes with Independent Parity Symbols</a>; ISBN 0-7803-2453-6; Proceedings 1995 IEEE International Symposium on Information Theory; 246; <a href="https://doi.org/10.1109/ISIT.1995.535761">10.1109/ISIT.1995.535761</a></li>
<li>Bruck, Jehoshua and Dolev, Danny, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160811-162638038">Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations</a>; ISBN 0-89791-717-0; SPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures; 64-73; <a href="https://doi.org/10.1145/215399.215421">10.1145/215399.215421</a></li>
<li>Bruck, Jehoshua and Dolev, Danny, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUipps95">PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain</a>; ISBN 0-8186-7074-6; International Parallel Processing Symposium, 9th, (IPPS '95), Santa Barbara, CA, 25-28 April 1995; 130-139; <a href="https://doi.org/10.1109/IPPS.1995.395924">10.1109/IPPS.1995.395924</a></li>
<li>Ziv, Avi and Bruck, Jehoshua (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVreldis94">Analysis of checkpointing schemes for multiprocessor systems</a>; ISBN 0818665750; Symposium on Reliable Distributed Systems, 13th, Dana Point, CA, 25-27 October 1994; 52-61; <a href="https://doi.org/10.1109/RELDIS.1994.336909">10.1109/RELDIS.1994.336909</a></li>
<li>Ziv, Avi and Bruck, Jehoshua (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVftpds94">Efficient checkpointing over local area networks</a>; ISBN 0818668075; Fault-Tolerant Parallel and Distributed Systems, College Station, TX, 12-14 June 1994; 30-35; <a href="https://doi.org/10.1109/FTPDS.1994.494471">10.1109/FTPDS.1994.494471</a></li>
<li>Blaum, Mario and Bruck, Jehoshua (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120309-145816573">Unordered Error-Correcting Codes and their Applications</a>; ISBN 0-8186-2875-8; FTCS-22: the Twenty-Second International Symposium on Fault-Tolerant Computing, Digest of Papers; 486-493; <a href="https://doi.org/10.1109/FTCS.1992.243585">10.1109/FTCS.1992.243585</a></li>
<li>Bruck, Jehoshua and Cypher, Robert, el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92a">Tolerating faults in a mesh with a row of spare nodes</a>; ISBN 0-8186-3200-3; IEEE Symposium on Parallel and Distributed Processing, 4th, Arlington, TX, 1-4 December 1992; 12-19; <a href="https://doi.org/10.1109/SPDP.1992.242768">10.1109/SPDP.1992.242768</a></li>
<li>Bruck, Jehoshua and Cypher, Robert, el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b">Multiple message broadcasting with generalized Fibonacci trees</a>; ISBN 0-8186-3200-3; IEEE Symposium on Parallel and Distributed Processing, 4th, Arlington, TX, 1-4 December 1992; 424-431; <a href="https://doi.org/10.1109/SPDP.1992.242714">10.1109/SPDP.1992.242714</a></li>
<li>Ajtai, M. and Alon, N., el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ATJfocs92">Fault tolerant graphs, perfect hash functions and disjoint paths</a>; ISBN 0818629002; 33rd Annual Symposium on Foundations of Computer Science, 1992.; 693-702; <a href="https://doi.org/10.1109/SFCS.1992.267781">10.1109/SFCS.1992.267781</a></li>
<li>Bruck, Jehoshua and Cypher, Robert, el al. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp91">Fault-tolerant meshes with minimal numbers of spares</a>; ISBN 0-8186-2310-1; IEEE Symposium on Parallel and Distributed Processing, 3rd, Dallas, TX, 2-5 December 1991; 288-295; <a href="https://doi.org/10.1109/SPDP.1991.218267">10.1109/SPDP.1991.218267</a></li>
<li>Alon, Noga and Bruck, Jehoshua, el al. (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91">Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs</a>; ISBN 0780300564; IEEE International Symposium on Information Theory (ISIT '91); 139</li>
<li>Bruck, Jehoshua and Smolensky, Roman (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120417-094637010">Harmonic Analysis And The Complexity Of Computing With Threshold (Neural) Elements</a>; ISBN 0-7803-0056-4; 1991 IEEE International Symposium on Information Theory; 86-86; <a href="https://doi.org/10.1109/ISIT.1991.695142">10.1109/ISIT.1991.695142</a></li>
<li>Siu, Kai-Yeung and Bruck, Jehoshua (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120424-103938302">On the Power of Threshold Circuits with Small Weights</a>; ISBN 0-7803-0056-4; 1991 IEEE International Symposium on Information Theory; 82-82; <a href="https://doi.org/10.1109/ISIT.1991.695138">10.1109/ISIT.1991.695138</a></li>
<li>Bruck, Jehoshua and Blaum, Mario (1991) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120418-090627310">New Techniques For Constructing EC/AUED Codes</a>; ISBN 0-7803-0056-4; 1991 IEEE International Symposium on Information Theory: Proceedings; 138; <a href="https://doi.org/10.1109/ISIT.1991.695194">10.1109/ISIT.1991.695194</a></li>
<li>Bruck, Jehoshua and Smolensky, Roman (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120425-065829076">Polynomial Threshold Functions, AC^0 Functions and Spectral Norms</a>; ISBN 0-8186-2082-X; 1990 31st Annual Symposium on Foundations of Computer Science, Proceedings; 632-641; <a href="https://doi.org/10.1109/FSCS.1990.89585">10.1109/FSCS.1990.89585</a></li>
<li>Siu, Kai-Yeung and Bruck, Jehoshua (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120509-132855976">Fast arithmetic computing with neural networks</a>; ISBN 0-87942-556-3; 1990 IEEE Region 10 Conference on Computer and Communication Systems; 28-31; <a href="https://doi.org/10.1109/TENCON.1990.152559">10.1109/TENCON.1990.152559</a></li>
<li>Bruck, Jehoshua (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120524-090912809">Harmonic analysis of neural networks</a>; <a href="https://doi.org/10.1109/ACSSC.1989.1200767">10.1109/ACSSC.1989.1200767</a></li>
<li>Bruck, Jehoshua (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120524-151412678">Polynomial Threshold Elements?</a>; <a href="https://doi.org/10.1109/ITW.1989.761437">10.1109/ITW.1989.761437</a></li>
<li>Bruck, Jehoshua and Blaum, Mario (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120524-150825080">Some new EC/AUED codes</a>; ISBN 0-8186-1959-7; Nineteenth International Symposium on Fault-Tolerant Computing, Digest of Papers; 208-215; <a href="https://doi.org/10.1109/FTCS.1989.105568">10.1109/FTCS.1989.105568</a></li>
</ul>