<h1>Bruck, Jehoshua</h1> <h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Sima, Jin and Bruck, Jehoshua (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201302433">Correcting k Deletions and Insertions in Racetrack Memory</a>; <a href="https://doi.org/10.48550/arXiv.2207.08372">10.48550/arXiv.2207.08372</a></li> <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>Horovitz, Michal and Yaakobi, Eitan, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220104-235424700">Iterative Programming of Noisy Memory Cells</a>; IEEE Transactions on Communications; Vol. 70; No. 2; 769-782; <a href="https://doi.org/10.1109/tcomm.2021.3130660">10.1109/tcomm.2021.3130660</a></li> <li>Jain, Siddharth and Xiao, Xiongye, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251">Generator based approach to analyze mutations in genomic datasets</a>; Scientific Reports; Vol. 11; Art. No. 21084; PMCID PMC8548350; <a href="https://doi.org/10.1038/s41598-021-00609-8">10.1038/s41598-021-00609-8</a></li> <li>Jain, Siddharth and Mazaheri, Bijan, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511">Glioblastoma signature in the DNA of blood-derived cells</a>; PLoS ONE; Vol. 16; No. 9; Art. No. e0256831; PMCID PMC8425531; <a href="https://doi.org/10.1371/journal.pone.0256831">10.1371/journal.pone.0256831</a></li> <li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000">Expert Graphs: Synthesizing New Expertise via Collaboration</a>; <a href="https://doi.org/10.48550/arXiv.2107.07054">10.48550/arXiv.2107.07054</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>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>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>Sima, Jin and Bruck, Jehoshua (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201008-083807800">On Optimal k-Deletion Correcting Codes</a>; IEEE Transactions on Information Theory; Vol. 67; No. 6; 3360-3375; <a href="https://doi.org/10.1109/TIT.2020.3028702">10.1109/TIT.2020.3028702</a></li> <li>Sima, Jin and Raviv, Netanel, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210315-103437288">On Coding over Sliced Information</a>; IEEE Transactions on Information Theory; Vol. 67; No. 5; 2793-2807; <a href="https://doi.org/10.1109/tit.2021.3063709">10.1109/tit.2021.3063709</a></li> <li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214">Synthesizing New Expertise via Collaboration</a></li> <li>Kilic, Kordag Mehmet and Bruck, Jehoshua (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-214748102">Neural Networks Computations with DOMINATION Functions</a></li> <li>Sima, Jin and Bruck, Jehoshua (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-215307865">Trace Reconstruction with Bounded Edit Distance</a></li> <li>Mazaheri, Bijan and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517">Robust Correction of Sampling Bias Using Cumulative Distribution Functions</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-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>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: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>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>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>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633">Coding for Optimized Writing Rate in DNA Storage</a></li> <li>Lou, Hao and Schwartz, Moshe, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-142813980">Evolution of k-mer Frequencies and Entropy in Duplication and Substitution Mutation Systems</a>; IEEE Transactions on Information Theory; Vol. 66; No. 5; 3171-3186; <a href="https://doi.org/10.1109/TIT.2019.2946846">10.1109/TIT.2019.2946846</a></li> <li>Jain, Siddharth and Mazaheri, Bijan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527">Cancer Classification from Blood-Derived DNA</a>; <a href="https://doi.org/10.1101/517839">10.1101/517839</a></li> <li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325">CodNN - Robust Neural Networks From Coded Classification</a></li> <li>Sima, Jin and Raviv, Netanel, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191031-124926783">Two Deletion Correcting Codes from Indicator Vectors</a>; IEEE Transactions on Information Theory; Vol. 66; No. 4; 2375-2391; <a href="https://doi.org/10.1109/tit.2019.2950290">10.1109/tit.2019.2950290</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>Elishco, Ohad and Farnoud (Hassanzadeh), Farzad, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190829-100210948">The Entropy Rate of Some Pólya String Models</a>; IEEE Transactions on Information Theory; Vol. 65; No. 12; 8180-8193; <a href="https://doi.org/10.1109/tit.2019.2936556">10.1109/tit.2019.2936556</a></li> <li>Sima, Jin and Bruck, Jehoshua (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200409-105733198">Optimal k-Deletion Correcting Codes</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 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>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 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>Yaakobi, Eitan and Bruck, Jehoshua (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181101-121348346">On the Uncertainty of Information Retrieval in Associative Memories</a>; IEEE Transactions on Information Theory; Vol. 65; No. 4; 2155-2165; <a href="https://doi.org/10.1109/tit.2018.2878750">10.1109/tit.2018.2878750</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190211-084750757">Estimation of duplication history under a stochastic model for tandem repeats</a>; BMC Bioinformatics; Vol. 20; Art. No. 64; <a href="https://doi.org/10.1186/s12859-019-2603-1">10.1186/s12859-019-2603-1</a></li> <li>Jain, Siddharth and Mazaheri, Bijan, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818">Short Tandem Repeats Information in TCGA is Statistically Biased by Amplification</a>; <a href="https://doi.org/10.1101/518878">10.1101/518878</a></li> <li>Jain, Siddharth and Mazaheri, Bijan, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836">Cancer Classification from Healthy DNA using Machine Learning</a>; <a href="https://doi.org/10.1101/517839">10.1101/517839</a></li> <li>Raviv, Netanel and Yu, Qian, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190220-123432908">Download and Access Trade-offs in Lagrange Coded Computing</a></li> <li>Sima, Jin and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181002-162910265">On Coding over Sliced Information</a></li> <li>Elishco, Ohad and Farnoud (Hassanzadeh), Farzad, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180820-100255874">The Capacity of Some Pólya String Models</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>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>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>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>Sima, Jin and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180709-102730008">Two Deletion Correcting Codes from Indicator Vectors</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>Jain, Siddharth and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028">Attaining the 2nd Chargaff Rule by Tandem Duplications</a></li> <li>Wilhelm, Daniel and Bruck, Jehoshua, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180117-072812871">Probabilistic switching circuits in DNA</a>; Proceedings of the National Academy of Sciences of the United States of America; Vol. 115; No. 5; 903-908; PMCID PMC5798357; <a href="https://doi.org/10.1073/pnas.1715926115">10.1073/pnas.1715926115</a></li> <li>Alon, Noga and Bruck, Jehoshua, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925">Duplication Distance to the Root for Binary Sequences</a>; IEEE Transactions on Information Theory; Vol. 63; No. 12; 7793-7803; <a href="https://doi.org/10.1109/TIT.2017.2730864">10.1109/TIT.2017.2730864</a></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>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439">Capacity and Expressiveness of Genomic Tandem Duplication</a>; IEEE Transactions on Information Theory; Vol. 63; No. 10; 6129-6138; <a href="https://doi.org/10.1109/TIT.2017.2728079">10.1109/TIT.2017.2728079</a></li> <li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; IEEE Transactions on Information Theory; Vol. 63; No. 8; 4996-5010; <a href="https://doi.org/10.1109/TIT.2017.2688361">10.1109/TIT.2017.2688361</a></li> <li>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170713-092535943">Generic Secure Repair for Distributed Storage</a>; <a href="https://doi.org/10.48550/arXiv.1706.00500">10.48550/arXiv.1706.00500</a></li> <li>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-142514161">Generic Secure Repair for Distributed Storage</a>; <a href="https://doi.org/10.48550/arXiv.1706.00500">10.48550/arXiv.1706.00500</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-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>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>Wang, Zhiying and Kiah, Han Mao, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170315-151626957">Switch Codes: Codes for Fully Parallel Reconstruction</a>; IEEE Transactions on Information Theory; Vol. 63; No. 4; 2061-2075; <a href="https://doi.org/10.1109/TIT.2017.2664867">10.1109/TIT.2017.2664867</a></li> <li>Wang, Zhiying and Tamo, Itzhak, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170119-080421044">Optimal Rebuilding of Multiple Erasures in MDS Codes</a>; IEEE Transactions on Information Theory; Vol. 63; No. 2; 1084-1101; <a href="https://doi.org/10.1109/TIT.2016.2633411">10.1109/TIT.2016.2633411</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>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180709-102239656">Secret Sharing with Optimal Decoding and Repair Bandwidth</a></li> <li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104">Noise and Uncertainty in String-Duplication Systems</a></li> <li>Huang, Wentao and Bruck, Jehoshua (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551">Secure RAID Schemes from EVENODD and STAR Codes</a></li> <li>Huang, Wentao and Langberg, Michael, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161011-150403696">Communication Efficient Secret Sharing</a>; IEEE Transactions on Information Theory; Vol. 62; No. 12; 7195-7206; <a href="https://doi.org/10.1109/TIT.2016.2616144">10.1109/TIT.2016.2616144</a></li> <li>Farnoud (Hassanzadeh), Farzad and Yaakobi, Eitan, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161202-085415227">Approximate sorting of data streams with limited storage</a>; Journal of Combination Optimization; Vol. 32; No. 4; 1133-1164; <a href="https://doi.org/10.1007/s10878-015-9930-6">10.1007/s10878-015-9930-6</a></li> <li>Alon, Noga and Bruck, Jehoshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672">Duplication Distance to the Root for Binary Sequences</a></li> <li>Wang, Zhiying and Tamo, Itzhak, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160930-131654865">Explicit Minimum Storage Regenerating Codes</a>; IEEE Transactions on Information Theory; Vol. 62; No. 8; 4466-4480; <a href="https://doi.org/10.1109/TIT.2016.2553675">10.1109/TIT.2016.2553675</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>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>En Gad, Eyal and Li, Yue, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160622-104849133">Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes</a>; IEEE Transactions on Information Theory; Vol. 62; No. 7; 4024-4038; <a href="https://doi.org/10.1109/TIT.2016.2539967">10.1109/TIT.2016.2539967</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>Buzaglo, Sarit and Yaakobi, Eitan, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160825-142242242">Systematic Error-Correcting Codes for Permutations and Multi-Permutations</a>; IEEE Transactions on Information Theory; Vol. 62; No. 6; 3113-3124; <a href="https://doi.org/10.1109/TIT.2016.2543739">10.1109/TIT.2016.2543739</a></li> <li>Yaakobi, Eitan and Bruck, Jehoshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160426-074534474">Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels</a>; IEEE Transactions on Information Theory; Vol. 62; No. 4; 1541-1551; <a href="https://doi.org/10.1109/TIT.2016.2522434">10.1109/TIT.2016.2522434</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>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>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160119-151223798">Bounds for Permutation Rate-Distortion</a>; IEEE Transactions on Information Theory; Vol. 62; No. 2; 703-712; <a href="https://doi.org/10.1109/TIT.2015.2504521">10.1109/TIT.2015.2504521</a></li> <li>Huang, Wentao and Bruck, Jehoshua (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160125-120110556">Secure RAID Schemes for Distributed Storage</a>; <a href="https://doi.org/10.1109/ISIT.2016.7541529">10.1109/ISIT.2016.7541529</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160119-142638953">The Capacity of String-Duplication Systems</a>; IEEE Transactions on Information Theory; Vol. 62; No. 2; 811-824; <a href="https://doi.org/10.1109/TIT.2015.2505735">10.1109/TIT.2015.2505735</a></li> <li>Gabrys, Ryan and Yaakobi, Eitan, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160225-140310853">Codes Correcting Erasures and Deletions for Rank Modulation</a>; IEEE Transactions on Information Theory; Vol. 62; No. 1; 136-150; <a href="https://doi.org/10.1109/TIT.2015.2493147">10.1109/TIT.2015.2493147</a></li> <li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; <a href="https://doi.org/10.1109/ISIT.2016.7541455">10.1109/ISIT.2016.7541455</a></li> <li>Lee, David T. and Bruck, Jehoshua (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151221-152740679">Algorithms for Generating Probabilities with Multivalued Stochastic Relay Circuits</a>; IEEE Transactions on Computers; Vol. 64; No. 12; 3376-3388; <a href="https://doi.org/10.1109/TC.2015.2401027">10.1109/TC.2015.2401027</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>En Gad, Eyal and Yaakobi, Eitan, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150814-153713652">Rank-Modulation Rewrite Coding for Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 61; No. 8; 4209-4226; <a href="https://doi.org/10.1109/TIT.2015.2442579">10.1109/TIT.2015.2442579</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>Huang, Wentao and Langberg, Michael, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150529-105023455">Communication Efficient Secret Sharing</a>; <a href="https://doi.org/10.1109/TIT.2016.2616144">10.1109/TIT.2016.2616144</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:20150209-155348874">Capacity and Expressiveness of Genomic Tandem Duplication</a>; <a href="https://doi.org/10.48550/arXiv.1509.06029">10.48550/arXiv.1509.06029</a></li> <li>En Gad, Eyal and Huang, Wentao, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150209-161244506">Rewriting Flash Memories by Message Passing</a>; <a href="https://doi.org/10.48550/arXiv.1502.00189">10.48550/arXiv.1502.00189</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150209-161532302">A Stochastic Model for Genomic Interspersed Duplication</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>Wang, Zhiying and Tamo, Itzhak, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-152728882">Explicit MDS Codes for Optimal Repair Bandwidth</a>; <a href="https://doi.org/10.48550/arXiv.1411.6328">10.48550/arXiv.1411.6328</a></li> <li>Levy, Yifat and Bruck, Jehoshua, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150105-103814566">Logic operations in memory using a memristive Akers array</a>; Microelectronics Journal; Vol. 45; No. 11; 1429-1437; <a href="https://doi.org/10.1016/j.mejo.2014.06.006">10.1016/j.mejo.2014.06.006</a></li> <li>Zhou, Hongchao and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150202-150301749">Systematic Error-Correcting Codes for Rank Modulation</a>; IEEE Transactions on Information Theory; Vol. 61; No. 1; 17-32; <a href="https://doi.org/10.1109/TIT.2014.2365499">10.1109/TIT.2014.2365499</a></li> <li>En Gad, Eyal and Li, Yue, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150206-113520153">Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes</a>; <a href="https://doi.org/10.1109/TIT.2016.2539967">10.1109/TIT.2016.2539967</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 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>Dolecek, Lara and Blaum, Mario, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140529-153422648">Guest Editorial: Communication Methodologies for the Next-Generation Storage Systems</a>; IEEE Journal on Selected Areas in Communications; Vol. 32; No. 5; 809-814; <a href="https://doi.org/10.1109/JSAC.2014.140501">10.1109/JSAC.2014.140501</a></li> <li>Zhou, Hongchao and Chen, Ho-Lin, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140627-103709955">Synthesis of Stochastic Flow Networks</a>; IEEE Transactions on Computers; Vol. 63; No. 5; 1234-1247; <a href="https://doi.org/10.1109/TC.2012.270">10.1109/TC.2012.270</a></li> <li>Tamo, Itzhak and Wang, Zhiying, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140425-151109319">Access Versus Bandwidth in Codes for Storage</a>; IEEE Transactions on Information Theory; Vol. 60; No. 4; 2028-2037; <a href="https://doi.org/10.1109/TIT.2014.2305698">10.1109/TIT.2014.2305698</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-144116872">The Capacity of String-Replication Systems</a>; <a href="https://doi.org/10.48550/arXiv.1401.4634">10.48550/arXiv.1401.4634</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-151348066">Rate-Distortion for Ranking with Incomplete Information</a>; <a href="https://doi.org/10.48550/arXiv.1401.3093">10.48550/arXiv.1401.3093</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140127-105959677">The Capacity of String-Replication Systems</a>; <a href="https://doi.org/10.48550/arXiv.1401.4634">10.48550/arXiv.1401.4634</a></li> <li>Farnoud (Hassanzadeh), Farzad and Schwartz, Moshe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140127-104737329">Rate-Distortion for Ranking with Incomplete Information</a>; <a href="https://doi.org/10.48550/arXiv.1401.3093">10.48550/arXiv.1401.3093</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>Buzaglo, Sarit and Yaakobi, Eitan, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-084734898">Systematic Codes for Rank Modulation</a>; <a href="https://doi.org/10.48550/arXiv.1311.7113">10.48550/arXiv.1311.7113</a></li> <li>En Gad, Eyal and Langberg, Michael, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131017-105937816">Generalized Gray Codes for Local Rank Modulation</a>; IEEE Transactions on Information Theory; Vol. 59; No. 10; 6664-6673; <a href="https://doi.org/10.1109/TIT.2013.2268534">10.1109/TIT.2013.2268534</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>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130826-103812140">Trajectory Codes for Flash Memory</a>; IEEE Transactions on Information Theory; Vol. 59; No. 7; 4530-4541; <a href="https://doi.org/10.1109/TIT.2013.2251755">10.1109/TIT.2013.2251755</a></li> <li>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130617-115747407">Nonuniform Codes for Correcting Asymmetric Errors in Data Storage</a>; IEEE Transactions on Information Theory; Vol. 59; No. 5; 2988-3002; <a href="https://doi.org/10.1109/TIT.2013.2241175">10.1109/TIT.2013.2241175</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130429-085506668">On the Average Complexity of Reed–Solomon List Decoders</a>; IEEE Transactions on Information Theory; Vol. 59; No. 4; 2336-2351; <a href="https://doi.org/10.1109/TIT.2012.2235522">10.1109/TIT.2012.2235522</a></li> <li>Tamo, Itzhak and Wang, Zhiying, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130321-102330661">Zigzag Codes: MDS Array Codes With Optimal Rebuilding</a>; IEEE Transactions on Information Theory; Vol. 59; No. 3; 1597-1616; <a href="https://doi.org/10.1109/TIT.2012.2227110">10.1109/TIT.2012.2227110</a></li> <li>Buzaglo, Sarit and Yaakobi, Eitan, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130215-094523026">Error-Correcting Codes for Multipermutations</a></li> <li>Wang, Zhiying and Shaked, Omer, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130128-153803180">Codes for Network Switches</a></li> <li>Yaakobi, Eitan and Schwartz, Moshe, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130215-095250632">Sequence Reconstruction for Grassmann Graphs and Permutations</a></li> <li>En Gad, Eyal and Yaakobi, Eitan, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130128-144020108">Rank-Modulation Rewriting Codes for Flash Memories</a></li> <li>Yaakobi, Eitan and Jiang, Anxiao (Andrew), el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130215-092157295">In-Memory Computing of Akers Logic Array</a></li> <li>Farnoud (Hassanzadeh), Farzad and Yaakobi, Eitan, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130215-093909657">Building Consensus via Iterative Voting</a></li> <li>Yaakobi, Eitan and Langberg, Michael, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130215-092855327">Information-Theoretic Study of Voting Systems</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>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-102504919">Streaming Algorithms for Optimal Generation of Random Bits</a>; <a href="https://doi.org/10.48550/arXiv.1209.0730">10.48550/arXiv.1209.0730</a></li> <li>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-151746022">Linear Transformations for Randomness Extraction</a>; <a href="https://doi.org/10.48550/arXiv.1209.0732">10.48550/arXiv.1209.0732</a></li> <li>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704">A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice</a>; <a href="https://doi.org/10.48550/arXiv.1209.0726">10.48550/arXiv.1209.0726</a></li> <li>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-104324682">Efficiently Extracting Randomness from Imperfect Stochastic Processes</a>; <a href="https://doi.org/10.48550/arXiv.1209.0734">10.48550/arXiv.1209.0734</a></li> <li>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160120-083936607">Balanced Modulation for Nonvolatile Memories</a>; <a href="https://doi.org/10.48550/arXiv.1209.0744">10.48550/arXiv.1209.0744</a></li> <li>Zhou, Hongchao and Loh, Po-Ling, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160203-092316194">The Synthesis and Analysis of Stochastic Switching Circuits</a>; <a href="https://doi.org/10.48550/arXiv.1209.0715">10.48550/arXiv.1209.0715</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20121109-103154708">Cyclic Boolean circuits</a>; Discrete Applied Mathematics; Vol. 160; No. 13-14; 1877-1900; <a href="https://doi.org/10.1016/j.dam.2012.03.039">10.1016/j.dam.2012.03.039</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 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, 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>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>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>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>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: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>Wang, Zhiying and Tamo, Itzhak, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120616-221646611">Long MDS Codes for Optimal Repair Bandwidth</a></li> <li>En Gad, Eyal and Jiang, Anxiao (Andrew), el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120516-141137208">Trade-offs between Instantaneous and Total Capacity in Multi-Cell Flash Memories</a></li> <li>Zhou, Hongchao and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120503-095551724">Efficient Generation of Random Bits From Finite State Markov Chains</a>; IEEE Transactions on Information Theory; Vol. 58; No. 4; 2490-2506; <a href="https://doi.org/10.1109/TIT.2011.2175698">10.1109/TIT.2011.2175698</a></li> <li>Jiang, Anxiao (Andrew) and Li, Hao, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120326-082904019">On the Capacity and Programming of Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 58; No. 3; 1549-1564; <a href="https://doi.org/10.1109/TIT.2011.2177755">10.1109/TIT.2011.2177755</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120203-154015264">Low-Complexity Array Codes for Random and Clustered 4-Erasures</a>; IEEE Transactions on Information Theory; Vol. 58; No. 1; 146-158; <a href="https://doi.org/10.1109/TIT.2011.2171518">10.1109/TIT.2011.2171518</a></li> <li>En Gad, Eyal and Langberg, Michael, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120420-092834437">Constant-Weight Gray Codes for Local Rank Modulation</a>; IEEE Transactions on Information Theory; Vol. 57; No. 11; 7431-7442; <a href="https://doi.org/10.1109/TIT.2011.2162570">10.1109/TIT.2011.2162570</a></li> <li>Jiang, Anxiao (Andrew) and Zhou, Hongchao, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120502-130441311">Patterned Cells for Phase Change Memories</a></li> <li>Jiang, Anxiao (Andrew) and Zhou, Hongchao, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120502-125850834">Variable-level Cells for Nonvolatile Memories</a></li> <li>Qian, Weikang and Riedel, Marc D., el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110922-104607230">Transforming Probabilities With Combinational Logic</a>; IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems; Vol. 30; No. 9; 1279-1292; <a href="https://doi.org/10.1109/TCAD.2011.2144630">10.1109/TCAD.2011.2144630</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>Qian, Lulu and Winfree, Erik, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110801-112437228">Neural network computation with DNA strand displacement cascades</a>; Nature; Vol. 475; No. 7356; 368-372; <a href="https://doi.org/10.1038/nature10262">10.1038/nature10262</a></li> <li>Wang, Zhiying and Tamo, Itzhak, el al. (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR111">On Codes for Optimal Rebuilding Access</a>; <a href="https://doi.org/10.48550/arXiv.1107.1627">10.48550/arXiv.1107.1627</a></li> <li>Wang, Zhiying and Tamo, Itzhak, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-150559432">On Codes for Optimal Rebuilding Access</a>; <a href="https://doi.org/10.48550/arXiv.1107.1627">10.48550/arXiv.1107.1627</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>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>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>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>Zhou, Hongchao and Jiang, Anxiao (Andrew), el al. (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR112">Systematic Error-Correcting Codes for Rank Modulation</a>; <a href="https://doi.org/10.48550/arXiv.1310.6817">10.48550/arXiv.1310.6817</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>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>Tamo, Itzhak and Wang, Zhiying, el al. (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR110">MDS Array Codes with Optimal Rebuilding</a>; <a href="https://doi.org/10.48550/arXiv.1103.3737">10.48550/arXiv.1103.3737</a></li> <li>En Gad, Eyal and Langberg, Michael, el al. (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR107">Generalized Gray Codes for Local Rank Modulation</a>; <a href="https://doi.org/10.48550/arXiv.1103.0317">10.48550/arXiv.1103.0317</a></li> <li>En Gad, Eyal and Jiang, Anxiao (Andrew), el al. (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR108">Compressed Encoding for Rank Modulation</a>; <a href="https://doi.org/10.48550/arXiv.1108.2741">10.48550/arXiv.1108.2741</a></li> <li>Lee, David and Bruck, Jehoshua (2011) <a href="https://resolver.caltech.edu/CaltechPARADISE:2011.ETR106">Generating Probability Distributions using Multivalued Stochastic Relay Circuits</a>; <a href="https://doi.org/10.48550/arXiv.1102.1441">10.48550/arXiv.1102.1441</a></li> <li>Lee, David and Bruck, Jehoshua (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191004-150014222">Generating Probability Distributions using Multivalued Stochastic Relay Circuits</a>; <a href="https://doi.org/10.48550/arXiv.1102.1441">10.48550/arXiv.1102.1441</a></li> <li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR104">Trajectory Codes for Flash Memory</a>; <a href="https://doi.org/10.48550/arXiv.1012.5430">10.48550/arXiv.1012.5430</a></li> <li>En Gad, Eyal and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR105">Constant-Weight Gray Codes for Local Rank Modulation</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>Jiang, Anxiao (Andrew) and Mateescu, Robert, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170309-140500073">Storage Coding for Wear Leveling in Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 56; No. 10; 5290-5299; <a href="https://doi.org/10.1109/TIT.2010.2059833">10.1109/TIT.2010.2059833</a></li> <li>Jiang, Anxiao and Bruck, Jehoshua (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20101108-153955478">Rewriting Codes for Joint Information Storage in Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 56; No. 10; 5300-5313; <a href="https://doi.org/10.1109/TIT.2010.2059530">10.1109/TIT.2010.2059530</a></li> <li>Wang, Zhiying and Dimakis, Alexandros G., el al. (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103">Rebuilding for Array Codes in Distributed Storage Systems</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>Zhao, Hongchao and Bruck, Jehoshua (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR102">Efficiently Generating Random Bits from Finite State Markov Chains</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 ("Frog Voting")</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>Jiang, Anxiao (Andrew) and Bruck, Jehoshua, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100617-092653362">Correcting Charge-Constrained Errors in the Rank-Modulation Scheme</a>; IEEE Transactions on Information Theory; Vol. 56; No. 5; 2112-2120; <a href="https://doi.org/10.1109/TIT.2010.2043764">10.1109/TIT.2010.2043764</a></li> <li>Cassuto, Yuval and Schwartz, Moshe, el al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100415-101346040">Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 56; No. 4; 1582-1595; <a href="https://doi.org/10.1109/TIT.2010.2040971">10.1109/TIT.2010.2040971</a></li> <li>Schwartz, Moshe and Bruck, Jehoshua (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100407-095238680">On the Capacity of the Precision-Resolution System</a>; IEEE Transactions on Information Theory; Vol. 56; No. 3; 1028-1037; <a href="https://doi.org/10.1109/TIT.2009.2039089">10.1109/TIT.2009.2039089</a></li> <li>Zhou, Hongchao and Chen, Ho-Lin, el al. (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR101">On the Synthesis of Stochastic Flow Networks</a>; <a href="https://doi.org/10.48550/arXiv.1209.0724">10.48550/arXiv.1209.0724</a></li> <li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2010) <a href="https://resolver.caltech.edu/CaltechPARADISE:2010.ETR100">Data Movement and Aggregation in Flash Memories</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>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>Riedel, Marc D. and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR099">Cyclic Boolean circuits</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR098">Low-Complexity Codes for Random and Clustered High-Order Failures in Storage Arrays</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>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>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>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>Slivkins, Aleksandrs and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090925-102048176">Interleaving schemes on circulant graphs with two offsets</a>; Discrete Mathematics; Vol. 309; No. 13; 4384-4398; <a href="https://doi.org/10.1016/j.disc.2009.01.020">10.1016/j.disc.2009.01.020</a></li> <li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR097">Data Movement in Flash Memories</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>Jiang, Anxiao (Andrew) and Mateescu, Robert, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090820-152000947">Rank Modulation for Flash Memories</a>; IEEE Transactions on Information Theory; Vol. 55; No. 6; 2659-2673; <a href="https://doi.org/10.1109/TIT.2009.2018336">10.1109/TIT.2009.2018336</a></li> <li>Wilhelm, Daniel and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR089">Stochastic Switching Circuit Synthesis</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090514-113712174">Cyclic lowest density MDS array codes</a>; IEEE Transactions on Information Theory; Vol. 55; No. 4; 1721-1729; <a href="https://doi.org/10.1109/TIT.2009.2013024">10.1109/TIT.2009.2013024</a></li> <li>Jiang, Anxiao (Andrew) and Schwartz, Moshe, el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR095">Correcting Charge-Constrained Errors in the Rank-Modulation Scheme</a></li> <li>Jiang, Anxiao (Andrew) and Langberg, Michael, el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR096">Universal Rewriting in Constrained Memories</a></li> <li>Bohossian, Vasken and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090717-115258499">Shortening array codes and the perfect 1-factorization conjecture</a>; IEEE Transactions on Information Theory; Vol. 55; No. 2; 507-513; <a href="https://doi.org/10.1109/TIT.2008.2009850">10.1109/TIT.2008.2009850</a></li> <li>Zhou, Hongchao and Bruck, Jehoshua (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR093">On the Expressibility of Stochastic Switching Circuits</a></li> <li>Bruck, Jehoshua and Gao, Jie, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090504-113921187">Localization and routing in sensor networks by local angle information</a>; ACM Transactions on Sensor Networks; Vol. 5; No. 1; No. 7; <a href="https://doi.org/10.1145/1464420.1464427">10.1145/1464420.1464427</a></li> <li>Jiang, Anxiao (Andrew) and Mateescu, Robert, el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR094">Storage Coding for Wear Leveling in Flash Memories</a></li> <li>Loh, Po-Ling and Zhou, Hongchao, el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2009.ETR092">The Robustness of Stochastic Switching Networks</a></li> <li>Langberg, Michael and Sprintson, Alexander, el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit09">Network Coding: A Computational Perspective</a>; IEEE Transactions on Information Theory; Vol. 55; No. 1; 147-157; <a href="https://doi.org/10.1109/TIT.2008.2008135">10.1109/TIT.2008.2008135</a></li> <li>Wang, Zhiying and Jiang, Anxiao (Andrew), el al. (2009) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR091">On the capacity of bounded rank modulation for flash memories</a></li> <li>Soloveichik, David and Cook, Matthew, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111020-132840264">Computation with finite stochastic chemical reaction networks</a>; Natural Computing; Vol. 7; No. 4; 615-633; <a href="https://doi.org/10.1007/s11047-008-9067-y">10.1007/s11047-008-9067-y</a></li> <li>Standley, Brian and Bao, Wenzhong, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:STAnl08">Graphene-based atomic-scale switches</a>; Nano Letters; Vol. 8; No. 10; 3345-3349; <a href="https://doi.org/10.1021/nl801774a">10.1021/nl801774a</a></li> <li>Cook, Matthew and Soloveichik, David, el al. (2008) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR090">Programmability of Chemical Reaction Networks</a></li> <li>Langberg, Michael and Sprintson, Alexander, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit08">Optimal Universal Schedules for Discrete Broadcast</a>; IEEE Transactions on Information Theory; Vol. 54; No. 9; 4365-4372; <a href="https://doi.org/10.1109/TIT.2008.928296">10.1109/TIT.2008.928296</a></li> <li>Yu, R. C. and Resnekov, O., el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090728-082033135">The Alpha Project: a model system for systems biology research</a>; IET Systems Biology; Vol. 2; No. 5; 222-233; <a href="https://doi.org/10.1049/iet-syb:20080127">10.1049/iet-syb:20080127</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>Cassuto, Yuval and Schwartz, Moshe, el al. (2008) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR088">Codes for Asymmetric Limited-Magnitude Errors with Application to Multi-Level Flash Memories</a></li> <li>Schwartz, Moshe and Bruck, Jehoshua (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:SCHWieeetit08">Constrained Codes as Networks of Relations</a>; IEEE Transactions on Information Theory; Vol. 54; No. 5; 2179-2195; <a href="https://doi.org/10.1109/TIT.2008.920245">10.1109/TIT.2008.920245</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2008) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR087">Joint Coding for Flash Memory Storage</a></li> <li>Jiang, Anxiao (Andrew) and Mateescu, Robert, el al. (2008) <a href="https://resolver.caltech.edu/CaltechPARADISE:2008.ETR086">Rank Modulation for Flash Memories</a></li> <li>Soloveichik, David and Cook, Matthew, el al. (2008) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR085">Computation with Finite Stochastic Chemical Reaction Networks</a></li> <li>Bruck, Jehoshua and Gao, Jie, el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100505-134021747">MAP: Medial axis based geometric routing in sensor networks</a>; Wireless Networks; Vol. 13; No. 6; 835-853; <a href="https://doi.org/10.1007/s11276-006-9857-z">10.1007/s11276-006-9857-z</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>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>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>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>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>Langberg, Michael and Schwartz, Moshe, el al. (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR084">Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks</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>Bohassian, Vasken and Jiang, Anxiao (Andrew), el al. (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR083">Buffer Coding for Asymmetric Multi-Level Memory</a></li> <li>Jiang, Anxiao (Andrew) and Bohossian, Vasken, el al. (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR080">Floating Codes for Joint Information Storage in Write Asymmetric Memories</a></li> <li>Cassuto, Yuval and Schwartz, Moshe, el al. (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR079">Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors</a></li> <li>Schwartz, Moshe and Bruck, Jehoshua (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR082">Constrained Codes as Networks of Relations</a></li> <li>Fett, Brian and Bruck, Jehoshua, el al. (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR081">Synthesizing Stochasticity in Biochemical Systems</a></li> <li>Schwartz, Moshe and Bruck, Jehoshua (2007) <a href="https://resolver.caltech.edu/CaltechPARADISE:2007.ETR078">Increasing the Information Density of Storage Systems Using the Precision-Resolution Paradigm</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR077">Exact Stochastic Simulation of Chemical Reactions with Cycle Leaping</a></li> <li>Jiang, Anxiao (Andrew) and Cook, Matthew, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JIAsiamjdm06">Optimal Interleaving on Tori</a>; SIAM Journal on Discrete Mathematics; Vol. 20; No. 4; 841-879; <a href="https://doi.org/10.1137/040618655">10.1137/040618655</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>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>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>Langberg, Michael and Sprintson, Alexander, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06">The encoding complexity of network coding</a>; IEEE Transactions on Information Theory; Vol. 52; No. 6; 2386-2397; <a href="https://doi.org/10.1109/TIT.2006.874434">10.1109/TIT.2006.874434</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR076">Cyclic Low-Density MDS Array Codes</a></li> <li>Bohossian, Vasken and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR075">Shortening Array Codes and the Perfect 1-Factorization Conjecture</a></li> <li>Langberg, Michael and Sprintson, Alexander, el al. (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR074">Network Coding: A Computational Perspective</a></li> <li>Brent, Roger and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150319-090453634">2020 Computing: Can computers help to explain biology?</a>; Nature; Vol. 440; No. 7083; 416-417; <a href="https://doi.org/10.1038/440416a">10.1038/440416a</a></li> <li>Schwartz, Moshe and Bruck, Jehoshua (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR073">On the Capacity of Precision-Resolution Constrained Systems</a></li> <li>Bruck, Jehoshua and Gao, Jie, el al. (2006) <a href="https://resolver.caltech.edu/CaltechPARADISE:2006.ETR072">Adaptive Bloom filter</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>Cook, Matthew and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR071">Networks of Relations for Representation, Learning, and Generalization</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>Codenotti, Paolo and Sprintson, Alexander, el al. (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR070">Anti-Jamming Schedules for Wireless Broadcast Systems</a></li> <li>Bruck, Jehoshua and Gao, Jie, el al. (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR069">MAP: Medial Axis Based Geometric Routing in Sensor Networks</a>; <a href="https://doi.org/10.1145/1080829.1080839">10.1145/1080829.1080839</a></li> <li>Bruck, Jehoshua and Gao, Jie, el al. (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR068">Localization and Routing in Sensor Networks by Local Angle Information</a>; <a href="https://doi.org/10.1145/1062689.1062713">10.1145/1062689.1062713</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161107-163620734">Network file storage with graceful performance degradation</a>; ACM Transactions on Storage; Vol. 1; No. 2; 171-189; <a href="https://doi.org/10.1145/1063786.1063788">10.1145/1063786.1063788</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>Cook, Matthew and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR067">Implementability Among Predicates</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>Cronin, Christopher J. and Mendel, Jane E., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CRObmcg05">An automated system for measuring parameters of nematode sinusoidal movement</a>; BMC Genetics; Vol. 6; Art. No. 5; PMCID PMC549551; <a href="https://doi.org/10.1186/1471-2156-6-5">10.1186/1471-2156-6-5</a></li> <li>Cronin, Christopher J. and Mendel, Jane E., el al. (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR066">An automated system for measuring parameters of nematode sinusoidal movement</a></li> <li>Franceschetti, Massimo and Booth, Lorna, el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191009-093219813">Continuum Percolation with Unreliable and Spread-Out Connections</a>; Journal of Statistical Physics; Vol. 118; No. 3-4; 721-734; <a href="https://doi.org/10.1007/s10955-004-8826-0">10.1007/s10955-004-8826-0</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:JIAieeetit05">Multicluster interleaving on paths and cycles</a>; IEEE Transactions on Information Theory; Vol. 51; No. 2; 597-611; <a href="https://doi.org/10.1109/TIT.2004.840893">10.1109/TIT.2004.840893</a></li> <li>Cassuto, Yuval and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR064">Network Coding for Nonuniform Demands</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2005) <a href="https://resolver.caltech.edu/CaltechPARADISE:2005.ETR065">Monotone Percolation and The Topology Control of Wireless Networks</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:LANisit05a">Staleness vs. waiting time in universal discrete broadcast</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. (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR063">The Encoding Complexity of Network Coding</a></li> <li>Langberg, Michael and Sprintson, Alexander, el al. (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR062">Optimal Schedules for Asynchronous Transmission of Discrete Packets</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehosua (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR061">Network File Storage With Graceful Performance Degradation</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>Levchenko, A. and Bruck, J., el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111014-095736081">Regulatory modules that generate biphasic signal response in biological systems</a>; Systems Biology; Vol. 1; No. 1; 139-148; <a href="https://doi.org/10.1049/sb:20045014">10.1049/sb:20045014</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/CaltechPARADISE:2004.ETR058">A Combinatorial Bound on the List Size</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1160">Timing Analysis of Cyclic Combinatorial Circuits</a></li> <li>Reidel, Marc D. and Bruck, Jehoshua (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1159">Timing Analysis of Cyclic Combinational Circuits</a></li> <li>Franceschetti, Massimo and Bruck, Jehoshua, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04">A random walk model of wave propagation</a>; IEEE Transactions on Antennas and Propagation; Vol. 52; No. 5; 1304-1317; <a href="https://doi.org/10.1109/TAP.2004.827540">10.1109/TAP.2004.827540</a></li> <li>Langberg, Michael and Sprintson, Alexander, el al. (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR057">Optimal Unviersal Schedules for Discrete Broadcast</a></li> <li>Franceschetti, Massimo and Cook, Matthew, el al. (2004) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetc04">A Geometric Theorem for Network Design</a>; IEEE Transactions on Computers; Vol. 53; No. 4; 483-489; <a href="https://doi.org/10.1109/TC.2004.1268406">10.1109/TC.2004.1268406</a></li> <li>Jiang, Anxiao (Andrew) and Cook, Matthew, el al. (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR059">Optimal Interleaving on Tori</a></li> <li>Foltz, Kevin and Xu, Lihao, el al. (2004) <a href="https://resolver.caltech.edu/CaltechPARADISE:2004.ETR056">Scheduling for Efficient Data Broadcast over Two Channels</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>Booth, Lorna and Bruck, Jehoshua, el al. (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BOOaoap03">Covering algorithms, continuum percolation and the geometry of wireless networks</a>; Annals of Applied Probability; Vol. 13; No. 2; 722-741; <a href="https://doi.org/10.1214/aoap/1050689601">10.1214/aoap/1050689601</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>Bohossian, Vasken and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BOHsiamjdm03">Algebraic techniques for constructing minimal weight threshold functions</a>; SIAM Journal on Discrete Mathematics; Vol. 16; No. 1; 114-126; <a href="https://doi.org/10.1137/S0895480197326048">10.1137/S0895480197326048</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:ETR053">Algorithmic Aspects of Cyclic Combinational Circuit Synthesis</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:ETR052">The Synthesis of Cyclic Combinatorial Circuits</a></li> <li>Bruck, Jehoshua and Jiang, Anxiao (Andrew) (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:2003.ETR051">Multi-Cluster interleaving in linear arrays and rings</a></li> <li>Franceschetti, Massimo and Booth, Lorna, el al. (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:2003.ETR055">Percolation in Multi-hop Wireless Networks</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:ETR052a">The Synthesis of Cyclic Combinatorial Circuits</a></li> <li>Slivkins, Aleksandrs and Bruck, Jehoshua (2003) <a href="https://resolver.caltech.edu/CaltechPARADISE:2003.ETR054">Interleaving Schemes on Circulant Graphs with Two Offsets</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>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>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>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>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>Foltz, Kevin and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FOLieeetit02.854">Splitting schedules for Internet broadcast communication</a>; IEEE Transactions on Information Theory; Vol. 48; No. 2; 345-358; <a href="https://doi.org/10.1109/18.978728">10.1109/18.978728</a></li> <li>Franceschetti, Massimo and Cook, Matthew, el al. (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR044">A Geometric Theorem for Wireless Network Design Optimization</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR048">Memory Allocation in Information Storage Networks</a></li> <li>Foltz, Kevin and Xu, Lihao, el al. (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR049">Coding and Scheduling for Efficient Loss-Resilient Data Broadcasting</a></li> <li>Booth, Lorna and Bruck, Jehoshua, el al. (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR047">Ad hoc wireless networks with noisy links</a></li> <li>Franceschetti, Massimo and Bruck, Jehoshua, el al. (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR045">Microcellular Systems, Random Walks, and Wave Propagation</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR043">DNAS: Dispersed Network Attached Storage for Reliability and Performance</a></li> <li>Slivkins, Aleksandrs and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR046">Interleaving Schemes on Circulant Graphs</a></li> <li>Foltz, Kevin and Bruck, Jehoshua (2002) <a href="https://resolver.caltech.edu/CaltechPARADISE:2002.ETR042">Time-Division is Better Than Frequency-Division for Periodic Internet Broadcasting</a></li> <li>Franceschetti, Martin and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetpds01">A group membership algorithm with a practical specification</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 12; No. 11; 1190-1200; <a href="https://doi.org/10.1109/71.969128">10.1109/71.969128</a></li> <li>Fan, Chenggong Charles and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FANieeeic01">The Raincore API for clusters of networking elements</a>; IEEE Internet Computing; Vol. 5; No. 5; 70-76; <a href="https://doi.org/10.1109/4236.957897">10.1109/4236.957897</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>Avresky, D. R. and Bruck, Jehoshua, el al. (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:AVRieeetpds01">Introduction to the special section on dependable network computing</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 12; No. 2; 97-98; <a href="https://doi.org/10.1109/TPDS.2001.910865">10.1109/TPDS.2001.910865</a></li> <li>Bohossian, Vasken and Fan, Chenggong C., el al. (2001) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetpds01">Computing in the RAIN: a reliable array of independent nodes</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 12; No. 2; 99-114; <a href="https://doi.org/10.1109/71.910866">10.1109/71.910866</a></li> <li>Mukhtar, Saleem and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechPARADISE:2001.ETR040">Interval Modulation Coding</a></li> <li>Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechPARADISE:2001.ETR038">Diversity Coloring for Distributed Storage in Mobile Networks</a></li> <li>Mukhtar, Saleem and Bruck, Jehoshua (2001) <a href="https://resolver.caltech.edu/CaltechPARADISE:2001.ETR036">Frequency Modulation for Asynchronous Data Transfer</a></li> <li>Franceschetti, Massimo and Cook, Matthew, el al. (2001) <a href="https://resolver.caltech.edu/CaltechPARADISE:2001.ETR035">A Geometric Theorem for Approximate Disk Covering Algorithms</a></li> <li>Booth, Lorna and Bruck, Jehoshua, el al. (2001) <a href="https://resolver.caltech.edu/CaltechPARADISE:2001.ETR037">Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks.</a></li> <li>Blaum, Mario and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00">Coding for tolerance and detection of skew in parallel asynchronous communications</a>; IEEE Transactions on Information Theory; Vol. 46; No. 7; 2329-2335; <a href="https://doi.org/10.1109/18.887847">10.1109/18.887847</a></li> <li>Fan, Chenggong Charles and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:FANieeetc00">Tolerating multiple faults in multistage interconnection networks with minimal extra stages</a>; IEEE Transactions on Computers; Vol. 49; No. 9; 998-1004; <a href="https://doi.org/10.1109/12.869334">10.1109/12.869334</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>Levchenko, Andre and Bruck, Jehoshua, el al. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:LEVpnas00">Scaffold proteins may biphasically affect the levels of mitogen-activated protein kinase signaling and reduce its threshold properties</a>; Proceedings of the National Academy of Sciences of the United States of America; Vol. 97; No. 11; 5818-5823; PMCID PMC18517</li> <li>Blaum, Mario and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00b">MDS array codes for correcting a signle criss-cross error</a>; IEEE Transactions on Information Theory; Vol. 46; No. 3; 1068-1077; <a href="https://doi.org/10.1109/18.841187">10.1109/18.841187</a></li> <li>Gibson, Michael A. and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170719-082029624">Efficient Exact Stochastic Simulation of Chemical Systems with Many Species and Many Channels</a>; Journal of Physical Chemistry A; Vol. 104; No. 9; 1876-1889; <a href="https://doi.org/10.1021/jp993732q">10.1021/jp993732q</a></li> <li>Blaum, Mario and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechPARADISE:2000.ETR033">Coding for Tolerance and Detection of Skew in Parallel Asynchronous Communications</a></li> <li>Foltz, Kevin and Bruck, Jehoshua (2000) <a href="https://resolver.caltech.edu/CaltechPARADISE:2000.ETR034">Splitting Schedules for Internet Broadcast Communication</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>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>Xu, Lihao and Bohossian, Vasken, el al. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99a">Low-density MDS codes and factors of complete graphs</a>; IEEE Transactions on Information Theory; Vol. 45; No. 6; 1817-1826; <a href="https://doi.org/10.1109/18.782102">10.1109/18.782102</a></li> <li>Gibson, Michael A. and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:GIBieeetit99">Efficient digital-to-analog encoding</a>; IEEE Transactions on Information Theory; Vol. 45; No. 5; 1551-1554; <a href="https://doi.org/10.1109/18.771156">10.1109/18.771156</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 & 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>Bohossian, Vasken and Fan, Charles C., el al. (1999) <a href="https://resolver.caltech.edu/CaltechPARADISE:1999.ETR029">Computing in the RAIN: A Reliable Array of Independent Nodes</a></li> <li>Foltz, Kevin and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechPARADISE:1999.ETR030">Splitting the Scheduling Headache</a></li> <li>Franceschetti, Massimo and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechPARADISE:1999.ETR032">A Possible Solution to the Impossible Membership Problem</a></li> <li>Gibson, Michael A. and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechPARADISE:1999.ETR031">Efficient Exact Stochastic Simulation of Chemical Systems with Many Species and Many Channels</a></li> <li>Xu, Lihao and Bruck, Jehoshua (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b">X-code: MDS array codes with optimal encoding</a>; IEEE Transactions on Information Theory; Vol. 45; No. 1; 272-276; <a href="https://doi.org/10.1109/18.746809">10.1109/18.746809</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>Ho, Ching-Tien and Bruck, Jehoshua, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:HOCieeetc98">Partial-sum queries in OLAP data cubes using covering codes</a>; IEEE Transactions on Computers; Vol. 47; No. 12; 1326-1340; <a href="https://doi.org/10.1109/12.737680">10.1109/12.737680</a></li> <li>Bohossian, Vasken and Hasler, Paul, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetcpmtb98">Programmable neural logic</a>; IEEE Transactions on Components, Packaging, and Manufacturing Technology, Part B: Advanced Packaging,; Vol. 21; No. 4; 346-351; <a href="https://doi.org/10.1109/96.730415">10.1109/96.730415</a></li> <li>Xu, Lihao and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:XULieeetpds98">Deterministic voting in distributed systems using error-correcting codes</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 9; No. 8; 813-824; <a href="https://doi.org/10.1109/71.706052">10.1109/71.706052</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>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>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>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>Blaum, Mario and Bruck, Jehoshua, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit98">Interleaving schemes for multidimensional cluster errors</a>; IEEE Transactions on Information Theory; Vol. 44; No. 2; 730-743; <a href="https://doi.org/10.1109/18.661516">10.1109/18.661516</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 & 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>Ziv, Avi and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc98">Analysis of checkpointing schemes with task duplication</a>; IEEE Transactions on Computers; Vol. 47; No. 2; 222-227; <a href="https://doi.org/10.1109/12.663769">10.1109/12.663769</a></li> <li>Gibson, Michael A. and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR026">An Efficient Algorithm for Generating Trajectories of Stochastic Gene Regulation Reactions</a></li> <li>Bohossian, Vasken and Riedel, Marc D., el al. (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR028">Trading Weight Size for Circuit Depth: A Circuit for Comparison</a></li> <li>Xu, Lihao and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR027">Improving the Performance of Data Servers Using Array Codes</a></li> <li>Riedel, Marc D. and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR022">Tolerating Faults in Counting Networks</a></li> <li>Xu, Lihao and Bohossian, Vasken, el al. (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR025">Low Density MDS Codes and Factors of Complete Graphs</a></li> <li>LeMahieu, Paul S. and Bohossian, Vasken, el al. (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR021">Fault-Tolerant Switched Local Area Networks</a></li> <li>LeMahieu, Paul S. and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR023">A Consistent History Link Connectivity Protocol</a></li> <li>Franceschetti, Massimo and Bruck, Jehoshua (1998) <a href="https://resolver.caltech.edu/CaltechPARADISE:1998.ETR024">A Leader Election Protocol for Fault Recovery in Asynchronous Fully-Connected Networks</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1998) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc98">A coding approach for detection of tampering in write-once optical disks</a>; IEEE Transactions on Computers; Vol. 47; No. 1; 120-125; <a href="https://doi.org/10.1109/12.656095">10.1109/12.656095</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>Ziv, Avi and Bruck, Jehoshua (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97a">Performance optimization of checkpointing schemes with task duplication</a>; IEEE Transactions on Computers; Vol. 46; No. 12; 1381-1386; <a href="https://doi.org/10.1109/12.641939">10.1109/12.641939</a></li> <li>Bruck, Jehoshua and Ho, Ching-Tien, el al. (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds97">Efficient algorithms for all-to-all communications in multiport message-passing systems</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 8; No. 11; 1143-1156; <a href="https://doi.org/10.1109/71.642949">10.1109/71.642949</a></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>Ziv, Avi and Bruck, Jehoshua (1997) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97b">An on-line algorithm for checkpoint placement</a>; IEEE Transactions on Computers; Vol. 46; No. 9; 976-985; <a href="https://doi.org/10.1109/12.620479">10.1109/12.620479</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/CaltechPARADISE:1997.ETR019">MDS Array Codes for Correcting Criss-Cross Errors</a></li> <li>Ho, Ching-Tien and Bruck, Jehoshua, el al. (1997) <a href="https://resolver.caltech.edu/CaltechPARADISE:1997.ETR018">Partial-Sum Queries in OLAP Data Cubes Using Covering Codes</a></li> <li>Bohossian, Vasken and Hasler, Paul, el al. (1997) <a href="https://resolver.caltech.edu/CaltechPARADISE:1997.ETR017">Programmable Neural Logic</a></li> <li>Xu, Lihao and Bruck, Jehoshua (1997) <a href="https://resolver.caltech.edu/CaltechPARADISE:1997.ETR020">X-Code: MDS Array Codes with Optimal Encoding</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1997) <a href="https://resolver.caltech.edu/CaltechPARADISE:1997.ETR016">Two-Dimensional Interleaving Schemes with Repetitions</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>Bruck, Jehoshua and Ho, Ching-Tien (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit96">Fault-tolerant cube graphs and coding theory</a>; IEEE Transactions on Information Theory; Vol. 42; No. 6, pt.; 2217-2221; <a href="https://doi.org/10.1109/18.556609">10.1109/18.556609</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>Blaum, Mario and Bruck, Jehoshua, el al. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit96">MDS array codes with independent parity symbols</a>; IEEE Transactions on Information Theory; Vol. 42; No. 2; 529-542; <a href="https://doi.org/10.1109/18.485722">10.1109/18.485722</a></li> <li>Bruck, Jehoshua and De Coster, Luc, el al. (1996) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds96">On the design and implementation of broadcast and global combine operations using the postal model</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 7; No. 3; 256-265; <a href="https://doi.org/10.1109/71.491579">10.1109/71.491579</a></li> <li>Bohossian, Vasken and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR010">Multiple Threshold Neural Logic</a></li> <li>Gibson, Michael A. and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR009">Efficient Digital to Analog Encoding</a></li> <li>Bohossian, Vasken and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR015">Algebraic Techniques for Constructing Minimal Weight Threshold Functions</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR013">A Coding Approach for Detection of Tampering in Write-Once Optical Disks</a></li> <li>Fan, Charles C. and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR014">Optimal Constructions of Fault-Tolerant Multistage Interconnection Networks</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR012">On Optimal Placements of Processors in Tori Networks</a></li> <li>Xu, Lihao and Bruck, Jehoshua (1996) <a href="https://resolver.caltech.edu/CaltechPARADISE:1996.ETR011">Deterministic Voting in Distributed Systems Using Error-Correcting Codes</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>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>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>Bar-Noy, Amotz and Bruck, Jehoshua, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BARieeetpds95">Computing global combine operations in the multiport postal model</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 6; No. 8; 896-900; <a href="https://doi.org/10.1109/71.406965">10.1109/71.406965</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>Blaum, Mario and Bruck, Jehoshua (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120215-131718595">Delay-insensitive pipelined communication on parallel buses</a>; IEEE Transactions on Computers; Vol. 44; No. 5; 660-668; <a href="https://doi.org/10.1109/12.381951">10.1109/12.381951</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>Bala, Vasanth and Bruck, Jehoshua, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BALieeetpds95">CCL: a portable and tunable collective communication library for scalable parallel computers</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 6; No. 2; 154-164; <a href="https://doi.org/10.1109/71.342126">10.1109/71.342126</a></li> <li>Blaum, Mario and Brady, Jim, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120216-065736330">EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures</a>; IEEE Transactions on Computers; Vol. 44; No. 2; 192-202; <a href="https://doi.org/10.1109/12.364531">10.1109/12.364531</a></li> <li>Bruck, Jehoshua and Ho, Ching-Tien (1995) <a href="https://resolver.caltech.edu/CaltechPARADISE:1995.ETR007">Fault-Tolerant Cube Graphs and Coding Theory</a></li> <li>Ziv, Avi and Bruck, Jehoshua (1995) <a href="https://resolver.caltech.edu/CaltechPARADISE:1995.ETR006">An Online Algorithm for Checkpointing Placement</a></li> <li>Blaum, Mario and Bruck, Jehoshua (1995) <a href="https://resolver.caltech.edu/CaltechPARADISE:1995.ETR008">Interleaving Schemes for Multidimensional Cluster Errors</a></li> <li>Bohossian, Vasken and Bruck, Jehoshua (1995) <a href="https://resolver.caltech.edu/CaltechPARADISE:1995.ETR005">On Neural Networks with Minimal Weights</a></li> <li>Bruck, Jehoshua and Cypher, Robert, el al. (1995) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc95">Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes</a>; IEEE Transactions on Computers; Vol. 44; No. 1; 150-155; <a href="https://doi.org/10.1109/12.367998">10.1109/12.367998</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>Bruck, Jehoshua and Cypher, Robert, el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeeetc94">Embedding cube-connected cycles graphs into faulty hypercubes</a>; IEEE Transactions on Computers; Vol. 43; No. 10; 1210-1220; <a href="https://doi.org/10.1109/12.324546">10.1109/12.324546</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>Bruck, Jehoshua and Cypher, Robert, el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds94">Fault-tolerant de Bruijn and shuffle-exchange networks</a>; IEEE Transactions on Parallel and Distributed Systems; Vol. 5; No. 5; 548-553; <a href="https://doi.org/10.1109/71.282566">10.1109/71.282566</a></li> <li>Bruck, Jehoshua and Dolev, Danny, el al. (1994) <a href="https://resolver.caltech.edu/CaltechPARADISE:1994.ETR002">Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations</a>; <a href="https://doi.org/10.1145/215399.215421">10.1145/215399.215421</a></li> <li>Bruck, Jehoshua and Cypher, Robert, el al. (1994) <a href="https://resolver.caltech.edu/CaltechPARADISE:1994.ETR001">Fault-Tolerant Meshes with Small Degree</a></li> <li>Ziv, Avi and Bruck, Jehoshua (1994) <a href="https://resolver.caltech.edu/CaltechPARADISE:1994.ETR004">Performance Optimization of Checkpointing Schemes with Task Duplication</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1994) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc94">A Note on "A Systematic (12,8) Code for Correcting Single Errors and Detecting Adjacent Errors"</a>; IEEE Transactions on Computers; Vol. 43; No. 1; 125; <a href="https://doi.org/10.1109/12.250619">10.1109/12.250619</a></li> <li>Ziv, Avi and Bruck, Jehoshua (1994) <a href="https://resolver.caltech.edu/CaltechPARADISE:1994.ETR003">Analysis of Checkpointing Schemes for Multiprocessor Systems</a></li> <li>Blaum, Mario and Bruck, Jehoshua, el al. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93b">Constructions of skew-tolerant and skew-detecting codes</a>; IEEE Transactions on Information Theory; Vol. 39; No. 5; 1751-1757; <a href="https://doi.org/10.1109/18.259671">10.1109/18.259671</a></li> <li>Bruck, Jehoshua and Cypher, Robert, el al. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc93a">Fault-tolerant meshes and hypercubes with minimal numbers of spares</a>; IEEE Transactions on Computers; Vol. 42; No. 9; 1089-1104; <a href="https://doi.org/10.1109/12.241598">10.1109/12.241598</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>Siu, Kai-Yeung and Bruck, Jehoshua, el al. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120309-113620511">Depth Efficient Neural Networks for Division and Related Problems</a>; IEEE Transactions on Information Theory; Vol. 39; No. 3; 946-956; <a href="https://doi.org/10.1109/18.256501">10.1109/18.256501</a></li> <li>Blaum, Mario and Bruck, Jehoshua (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93a">Coding for skew-tolerant parallel asynchronous communications</a>; IEEE Transactions on Information Theory; Vol. 39; No. 2; 379-388; <a href="https://doi.org/10.1109/18.212269">10.1109/18.212269</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 Blaum, Mario (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92b">New techniques for constructing EC/AUED codes</a>; IEEE Transactions on Computers; Vol. 41; No. 10; 1318-1324; <a href="https://doi.org/10.1109/12.166607">10.1109/12.166607</a></li> <li>Bruck, Jehoshua and Cypher, Robert, el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92a">Tolerating faults in hypercubes using subcube partitioning</a>; IEEE Transactions on Computers; Vol. 41; No. 5; 599-605; <a href="https://doi.org/10.1109/12.142686">10.1109/12.142686</a></li> <li>Alon, Noga and Bruck, Jehoshua, el al. (1992) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ALOieeetit92">Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs</a>; IEEE Transactions on Information Theory; Vol. 38; No. 2; 509-516; <a href="https://doi.org/10.1109/18.119713">10.1109/18.119713</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>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>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>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>Bruck, Jehoshua (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120426-132042598">On the Convergence Properties of the Hopfield Model</a>; Proceedings of the IEEE; Vol. 78; No. 10; 1579-1585; <a href="https://doi.org/10.1109/5.58341">10.1109/5.58341</a></li> <li>Siu, Kai-Yeung and Bruck, Jehoshua (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120503-090033553">Neural computation of arithmetic functions</a>; Proceedings of the IEEE; Vol. 78; No. 10; 1669-1675; <a href="https://doi.org/10.1109/5.58350">10.1109/5.58350</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>Blaum, Mario and Bruck, Jehoshua (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit90">Decoding the Golay code with Venn diagrams</a>; IEEE Transactions on Information Theory; Vol. 36; No. 4; 906-910; <a href="https://doi.org/10.1109/18.53756">10.1109/18.53756</a></li> <li>Roychowdhury, Vwani P. and Bruck, Jehoshua, el al. (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:ROYieeetc90">Efficient algorithms for reconfiguration in VLSI/WSI arrays</a>; IEEE Transactions on Computers; Vol. 39; No. 4; 480-489; <a href="https://doi.org/10.1109/12.54841">10.1109/12.54841</a></li> <li>Bruck, Jehoshua and Naor, Moni (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90b">The hardness of decoding linear codes with preprocessing</a>; IEEE Transactions on Information Theory; Vol. 36; No. 2; 381-385; <a href="https://doi.org/10.1109/18.52484">10.1109/18.52484</a></li> <li>Bruck, Jehoshua and Roychowdhury, Vwani P. (1990) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90a">On the number of spurious memories in the Hopfield model</a>; IEEE Transactions on Information Theory; Vol. 36; No. 2; 393-397; <a href="https://doi.org/10.1109/18.52486">10.1109/18.52486</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 and Blaum, Mario (1989) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit89">Neural networks, error-correcting codes, and polynomials over the binary n-cube</a>; IEEE Transactions on Information Theory; Vol. 35; No. 5; 976-987; <a href="https://doi.org/10.1109/18.42215">10.1109/18.42215</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> <li>Bruck, Jehoshua and Goodman, Joseph W. (1988) <a href="https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit88">A generalized convergence theorem for neural networks</a>; IEEE Transactions on Information Theory; Vol. 34; No. 5; 1089-1092; <a href="https://doi.org/10.1109/18.21239">10.1109/18.21239</a></li> </ul>