<h1>Bruck, Jehoshua</h1> <h2>Article from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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 (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>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 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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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>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, 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>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>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>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>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>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>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>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>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>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>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>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>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: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>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>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>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>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>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>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>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>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>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>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 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 (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>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 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 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 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 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>