@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1159,
    title = "Timing Analysis of Cyclic Combinational Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1159",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201302433,
    title = "Correcting k Deletions and Insertions in Racetrack Memory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201302433",
    id = "record",
    doi = "10.48550/arXiv.2207.08372"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000,
    title = "Expert Graphs: Synthesizing New Expertise via Collaboration",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000",
    id = "record",
    doi = "10.48550/arXiv.2107.07054"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20220804-765672000,
    title = "2022 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "On Algebraic Constructions of Neural Networks with Small Weights",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-765672000",
    id = "record",
    isbn = "978-1-6654-2159-1",
    doi = "10.1109/isit50566.2022.9834401"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20220104-235424700,
    title = "Iterative Programming of Noisy Memory Cells",
    journal = "IEEE Transactions on Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220104-235424700",
    id = "record",
    issn = "0090-6778",
    doi = "10.1109/tcomm.2021.3130660",
    volume = "70"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251,
    title = "Generator based approach to analyze mutations in genomic datasets",
    journal = "Scientific Reports",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251",
    id = "record",
    issn = "2045-2322",
    doi = "10.1038/s41598-021-00609-8",
    volume = "11",
    pmcid = "PMC8548350"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511,
    title = "Glioblastoma signature in the DNA of blood-derived cells",
    journal = "PLoS ONE",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511",
    id = "record",
    issn = "1932-6203",
    doi = "10.1371/journal.pone.0256831",
    volume = "16",
    pmcid = "PMC8425531"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519,
    title = "2021 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Synthesizing New Expertise via Collaboration",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519",
    id = "record",
    isbn = "978-1-5386-8209-8",
    doi = "10.1109/isit45174.2021.9517822"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211110-153719711,
    title = "2021 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Trace Reconstruction with Bounded Edit Distance",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211110-153719711",
    id = "record",
    isbn = "978-1-5386-8209-8",
    doi = "10.1109/isit45174.2021.9518244"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211110-155100881,
    title = "2021 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Neural Network Computations with DOMINATION Functions",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211110-155100881",
    id = "record",
    isbn = "978-1-5386-8209-8",
    doi = "10.1109/isit45174.2021.9517872"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-214748102,
    title = "Neural Networks Computations with DOMINATION Functions",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-214748102",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-215307865,
    title = "Trace Reconstruction with Bounded Edit Distance",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-215307865",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214,
    title = "Synthesizing New Expertise via Collaboration",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517,
    title = "Robust Correction of Sampling Bias Using Cumulative Distribution Functions",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20201008-083807800,
    title = "On Optimal k-Deletion Correcting Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201008-083807800",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2020.3028702",
    volume = "67"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20210315-103437288,
    title = "On Coding over Sliced Information",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210315-103437288",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/tit.2021.3063709",
    volume = "67"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-142617575,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Syndrome Compression for Optimal Redundancy Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-142617575",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9174009"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "CodNN – Robust Neural Networks From Coded Classification",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171",
    id = "record",
    isbn = "978-1-7281-6432-8",
    doi = "10.1109/ISIT44484.2020.9174480"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-144630883,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Optimal Systematic t-Deletion Correcting Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-144630883",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9173986"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-150933262,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Optimal Codes for the q-ary Deletion Channel",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-150933262",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9174241"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "What is the Value of Data? on Mathematical Methods for Data Quality Estimation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9174311"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-134827466,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Robust Indexing - Optimal Codes for DNA Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-134827466",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9174447"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Coding for Optimized Writing Rate in DNA Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146",
    id = "record",
    isbn = "978-1-7281-6432-8",
    doi = "10.1109/ISIT44484.2020.9174253"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633,
    title = "Coding for Optimized Writing Rate in DNA Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191004-142813980,
    title = "Evolution of k-mer Frequencies and Entropy in Duplication and Substitution Mutation Systems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-142813980",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2019.2946846",
    volume = "66"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325,
    title = "CodNN - Robust Neural Networks From Coded Classification",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527,
    title = "Cancer Classification from Blood-Derived DNA",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527",
    id = "record",
    doi = "10.1101/517839"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200409-105733198,
    title = "Optimal k-Deletion Correcting Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200409-105733198",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191031-124926783,
    title = "Two Deletion Correcting Codes from Indicator Vectors",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191031-124926783",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/tit.2019.2950290",
    volume = "66"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085,
    title = "2020 Information Theory and Applications Workshop (ITA)",
    chapter = "Improve Robustness of Deep Neural Networks by Coding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085",
    id = "record",
    isbn = "9781728141909",
    doi = "10.1109/ita50056.2020.9244998"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190829-100210948,
    title = "The Entropy Rate of Some Pólya String Models",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190829-100210948",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/tit.2019.2936556",
    volume = "65"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-150559432,
    title = "On Codes for Optimal Rebuilding Access",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-150559432",
    id = "record",
    doi = "10.48550/arXiv.1107.1627"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-150014222,
    title = "Generating Probability Distributions using Multivalued Stochastic Relay Circuits",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-150014222",
    id = "record",
    doi = "10.48550/arXiv.1102.1441"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-151746022,
    title = "Linear Transformations for Randomness Extraction",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-151746022",
    id = "record",
    doi = "10.48550/arXiv.1209.0732"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-151348066,
    title = "Rate-Distortion for Ranking with Incomplete Information",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-151348066",
    id = "record",
    doi = "10.48550/arXiv.1401.3093"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-142514161,
    title = "Generic Secure Repair for Distributed Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-142514161",
    id = "record",
    doi = "10.48550/arXiv.1706.00500"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20191004-144116872,
    title = "The Capacity of String-Replication Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-144116872",
    id = "record",
    doi = "10.48550/arXiv.1401.4634"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-104451577,
    title = "2019 IEEE Information Theory Workshop (ITW)",
    chapter = "Iterative Programming of Noisy Memory Cells",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-104451577",
    id = "record",
    isbn = "978-1-5386-6900-6",
    doi = "10.1109/ITW44776.2019.8989404"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333511,
    title = "2019 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "On Coding Over Sliced Information",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100333511",
    id = "record",
    isbn = "9781538692912",
    doi = "10.1109/isit.2019.8849596"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332823,
    title = "2019 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Correcting Deletions in Multiple-Heads Racetrack Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332823",
    id = "record",
    isbn = "9781538692912",
    doi = "10.1109/isit.2019.8849783"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190826-143512243,
    title = "2019 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Optimal k-Deletion Correcting Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190826-143512243",
    id = "record",
    isbn = "978-1-5386-9291-2",
    doi = "10.1109/ISIT.2019.8849750"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332096,
    title = "2019 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Download and Access Trade-offs in Lagrange Coded Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191004-100332096",
    id = "record",
    isbn = "9781538692912",
    doi = "10.1109/isit.2019.8849547"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20181101-121348346,
    title = "On the Uncertainty of Information Retrieval in Associative Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20181101-121348346",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/tit.2018.2878750",
    volume = "65"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190220-123432908,
    title = "Download and Access Trade-offs in Lagrange Coded Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190220-123432908",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20190211-084750757,
    title = "Estimation of duplication history under a stochastic model for tandem repeats",
    journal = "BMC Bioinformatics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190211-084750757",
    id = "record",
    issn = "1471-2105",
    doi = "10.1186/s12859-019-2603-1",
    volume = "20"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836,
    title = "Cancer Classification from Healthy DNA using Machine Learning",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836",
    id = "record",
    doi = "10.1101/517839"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818,
    title = "Short Tandem Repeats Information in TCGA is Statistically Biased by Amplification",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818",
    id = "record",
    doi = "10.1101/518878"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20181002-162910265,
    title = "On Coding over Sliced Information",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20181002-162910265",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180820-100255874,
    title = "The Capacity of Some Pólya String Models",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180820-100255874",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551,
    title = "Secure RAID Schemes from EVENODD and STAR Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180709-102730008,
    title = "Two Deletion Correcting Codes from Indicator Vectors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180709-102730008",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180709-102239656,
    title = "Secret Sharing with Optimal Decoding and Repair Bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180709-102239656",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190328-165908772,
    title = "Proceedings of the 11th ACM International Systems and Storage Conference",
    chapter = "Stash in a Flash",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190328-165908772",
    id = "record",
    isbn = "9781450358491",
    doi = "10.1145/3211890.3211906"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180709-103747373,
    title = "2018 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Two Deletion Correcting Codes from Indicator Vectors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180709-103747373",
    id = "record",
    isbn = "978-1-5386-4780-6",
    doi = "10.1109/ISIT.2018.8437868"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016,
    title = "Proceedings of the 11th ACM International Systems and Storage Conference",
    chapter = "How to Best Share a Big Secret",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180828-142513016",
    id = "record",
    isbn = "978-1-4503-5849-1",
    doi = "10.1145/3211890.3211896"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274,
    title = "2018 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Attaining the 2nd Chargaff Rule by Tandem Duplications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274",
    id = "record",
    isbn = "978-1-5386-4780-6",
    doi = "10.1109/ISIT.2018.8437526"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180308-133517936,
    title = "16th USENIX Conference on File and Storage Technologies",
    chapter = "Stash in a Flash",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180308-133517936",
    id = "record",
    isbn = "978-1-931971-42-3"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028,
    title = "Attaining the 2nd Chargaff Rule by Tandem Duplications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20180117-072812871,
    title = "Probabilistic switching circuits in DNA",
    journal = "Proceedings of the National Academy of Sciences of the United States of America",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180117-072812871",
    id = "record",
    issn = "0027-8424",
    doi = "10.1073/pnas.1715926115",
    volume = "115",
    pmcid = "PMC5798357"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925,
    title = "Duplication Distance to the Root for Binary Sequences",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2730864",
    volume = "63"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726,
    title = "2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)",
    chapter = "Stopping Set Elimination for LDPC Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180125-132316726",
    id = "record",
    isbn = "978-1-5386-3267-3",
    doi = "10.1109/ALLERTON.2017.8262806"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439,
    title = "Capacity and Expressiveness of Genomic Tandem Duplication",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2728079",
    volume = "63"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690,
    title = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2688361",
    volume = "63"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170713-092535943,
    title = "Generic Secure Repair for Distributed Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170713-092535943",
    id = "record",
    doi = "10.48550/arXiv.1706.00500"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-162125720,
    title = "2017 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Secure RAID schemes from EVENODD and STAR codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-162125720",
    id = "record",
    isbn = "978-1-5090-4096-4",
    doi = "10.1109/ISIT.2017.8006600"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076,
    title = "2017 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Noise and uncertainty in string-duplication systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076",
    id = "record",
    isbn = "978-1-5090-4096-4",
    doi = "10.1109/ISIT.2017.8007104"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-153318334,
    title = "2017 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Secret sharing with optimal decoding and repair bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-153318334",
    id = "record",
    isbn = "978-1-5090-4096-4",
    doi = "10.1109/ISIT.2017.8006842"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170315-151626957,
    title = "Switch Codes: Codes for Fully Parallel Reconstruction",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170315-151626957",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2664867",
    volume = "63"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170907-081956775,
    title = "2017 Information Theory and Applications Workshop (ITA)",
    chapter = "Correcting errors by natural redundancy",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170907-081956775",
    id = "record",
    isbn = "978-1-5090-5293-6",
    doi = "10.1109/ITA.2017.8023455"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170119-080421044,
    title = "Optimal Rebuilding of Multiple Erasures in MDS Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170119-080421044",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2633411",
    volume = "63"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104,
    title = "Noise and Uncertainty in String-Duplication Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161011-150403696,
    title = "Communication Efficient Secret Sharing",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161011-150403696",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2616144",
    volume = "62"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672,
    title = "Duplication Distance to the Root for Binary Sequences",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161202-085415227,
    title = "Approximate sorting of data streams with limited storage",
    journal = "Journal of Combination Optimization",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161202-085415227",
    id = "record",
    issn = "1382-6905",
    doi = "10.1007/s10878-015-9930-6",
    volume = "32"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160930-131654865,
    title = "Explicit Minimum Storage Regenerating Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160930-131654865",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2553675",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160622-104849133,
    title = "Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160622-104849133",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2539967",
    volume = "62"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070",
    id = "record",
    isbn = "978-1-5090-1806-2",
    doi = "10.1109/ISIT.2016.7541455"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "On the duplication distance of binary strings",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060",
    id = "record",
    isbn = "978-1-5090-1807-9",
    doi = "10.1109/ISIT.2016.7541301"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160823-165433889,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Secure RAID Schemes for Distributed Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160823-165433889",
    id = "record",
    isbn = "978-1-5090-1806-2",
    doi = "10.1109/ISIT.2016.7541529"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-102815029,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "The capacity of some Pólya string models",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-102815029",
    id = "record",
    isbn = "978-1-5090-1807-9",
    doi = "10.1109/ISIT.2016.7541303"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160825-142242242,
    title = "Systematic Error-Correcting Codes for Permutations and Multi-Permutations",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160825-142242242",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2543739",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160426-074534474,
    title = "Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160426-074534474",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2016.2522434",
    volume = "62"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161004-114313111,
    title = "2016 International Reliability Physics Symposium",
    chapter = "Error Characterization and Mitigation for 16nm MLC NAND Flash Memory under Total Ionizing Dose Effect",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161004-114313111",
    id = "record",
    isbn = "978-1-4673-9138-2",
    doi = "10.1109/IRPS.2016.7574638"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161003-155557445,
    title = "2016 IEEE International Reliability Physics Symposium (IRPS)",
    chapter = "Data archiving in 1x-nm NAND flash memories: Enabling long-term storage using rank modulation and scrubbing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161003-155557445",
    id = "record",
    isbn = "978-1-4673-9138-2",
    doi = "10.1109/IRPS.2016.7574572"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160203-092316194,
    title = "The Synthesis and Analysis of Stochastic Switching Circuits",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160203-092316194",
    id = "record",
    doi = "10.48550/arXiv.1209.0715"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160119-151223798,
    title = "Bounds for Permutation Rate-Distortion",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160119-151223798",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2015.2504521",
    volume = "62"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675,
    title = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675",
    id = "record",
    doi = "10.1109/ISIT.2016.7541455"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160125-120110556,
    title = "Secure RAID Schemes for Distributed Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160125-120110556",
    id = "record",
    doi = "10.1109/ISIT.2016.7541529"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-152728882,
    title = "Explicit MDS Codes for Optimal Repair Bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-152728882",
    id = "record",
    doi = "10.48550/arXiv.1411.6328"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-102504919,
    title = "Streaming Algorithms for Optimal Generation of Random Bits",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-102504919",
    id = "record",
    doi = "10.48550/arXiv.1209.0730"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704,
    title = "A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-102042704",
    id = "record",
    doi = "10.48550/arXiv.1209.0726"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-084734898,
    title = "Systematic Codes for Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-084734898",
    id = "record",
    doi = "10.48550/arXiv.1311.7113"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-104324682,
    title = "Efficiently Extracting Randomness from Imperfect Stochastic Processes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-104324682",
    id = "record",
    doi = "10.48550/arXiv.1209.0734"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160120-083936607,
    title = "Balanced Modulation for Nonvolatile Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160120-083936607",
    id = "record",
    doi = "10.48550/arXiv.1209.0744"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160119-142638953,
    title = "The Capacity of String-Duplication Systems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160119-142638953",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2015.2505735",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20160225-140310853,
    title = "Codes Correcting Erasures and Deletions for Rank Modulation",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160225-140310853",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2015.2493147",
    volume = "62"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20151221-152740679,
    title = "Algorithms for Generating Probabilities with Multivalued Stochastic Relay Circuits",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151221-152740679",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/TC.2015.2401027",
    volume = "64"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160909-113811678,
    title = "Non-Volatile Memory Technology Symposium (NVMTS), 2015 15th",
    chapter = "Reliability and Hardware Implementation of Rank Modulation Flash Memory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160909-113811678",
    id = "record",
    isbn = "978-1-5090-2126-0",
    doi = "10.1109/NVMTS.2015.7457493"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150814-153713652,
    title = "Rank-Modulation Rewrite Coding for Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150814-153713652",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2015.2442579",
    volume = "61"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151012-143650853,
    title = "2015 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "A Stochastic Model for Genomic Interspersed Duplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151012-143650853",
    id = "record",
    isbn = "978-1-4673-7704-1",
    doi = "10.1109/ISIT.2015.7282586"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151012-142447290,
    chapter = "Rewriting Flash Memories by Message Passing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151012-142447290",
    id = "record",
    doi = "10.1109/ISIT.2015.7282534"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150529-105023455,
    title = "Communication Efficient Secret Sharing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150529-105023455",
    id = "record",
    doi = "10.1109/TIT.2016.2616144"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160915-122649767,
    title = "2015 IEEE Information Theory Workshop (ITW)",
    chapter = "Error correction through language processing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160915-122649767",
    id = "record",
    isbn = "978-1-4799-5524-4",
    doi = "10.1109/ITW.2015.7133145"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150209-155348874,
    title = "Capacity and Expressiveness of Genomic Tandem Duplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150209-155348874",
    id = "record",
    doi = "10.48550/arXiv.1509.06029"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150209-161244506,
    title = "Rewriting Flash Memories by Message Passing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150209-161244506",
    id = "record",
    doi = "10.48550/arXiv.1502.00189"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150209-161532302,
    title = "A Stochastic Model for Genomic Interspersed Duplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150209-161532302",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150206-113520153,
    title = "Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150206-113520153",
    id = "record",
    doi = "10.1109/TIT.2016.2539967"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161111-153306808,
    title = "2015 Information Theory and Applications Workshop (ITA)",
    chapter = "Is there a new way to correct errors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161111-153306808",
    id = "record",
    isbn = "978-1-4799-7195-4",
    doi = "10.1109/ITA.2015.7308985"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366,
    chapter = "Capacity and expressiveness of genomic tandem duplication",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366",
    id = "record",
    doi = "10.1109/ISIT.2015.7282795"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150105-103814566,
    title = "Logic operations in memory using a memristive Akers array",
    journal = "Microelectronics Journal",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150105-103814566",
    id = "record",
    issn = "0026-2692",
    doi = "10.1016/j.mejo.2014.06.006",
    volume = "45"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150202-150301749,
    title = "Systematic Error-Correcting Codes for Rank Modulation",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150202-150301749",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2014.2365499",
    volume = "61"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150227-082940148,
    title = "2014 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "The capacity of string-duplication systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150227-082940148",
    id = "record",
    isbn = "978-1-4799-5186-4",
    doi = "10.1109/ISIT.2014.6875043"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150227-084706095,
    title = "2014 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Polar coding for noisy write-once memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150227-084706095",
    id = "record",
    isbn = "978-1-4799-5186-4",
    doi = "10.1109/ISIT.2014.6875111"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20150227-075642886,
    title = "2014 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Bounds for Permutation Rate-Distortion",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150227-075642886",
    id = "record",
    isbn = "978-1-4799-5186-4",
    doi = "10.1109/ISIT.2014.6874784"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140529-153422648,
    title = "Guest Editorial: Communication Methodologies for the Next-Generation Storage Systems",
    journal = "IEEE Journal on Selected Areas in Communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140529-153422648",
    id = "record",
    issn = "0733-8716",
    doi = "10.1109/JSAC.2014.140501",
    volume = "32"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140627-103709955,
    title = "Synthesis of Stochastic Flow Networks",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140627-103709955",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/TC.2012.270",
    volume = "63"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20140425-151109319,
    title = "Access Versus Bandwidth in Codes for Storage",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140425-151109319",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2014.2305698",
    volume = "60"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20140127-104737329,
    title = "Rate-Distortion for Ranking with Incomplete Information",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140127-104737329",
    id = "record",
    doi = "10.48550/arXiv.1401.3093"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20140127-105959677,
    title = "The Capacity of String-Replication Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20140127-105959677",
    id = "record",
    doi = "10.48550/arXiv.1401.4634"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20141203-103210856,
    title = "Computing and Combinatorics, COCOON 2014",
    chapter = "Approximate Sorting of Data Streams with Limited Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20141203-103210856",
    id = "record",
    isbn = "978-3-319-08782-5",
    doi = "10.1007/978-3-319-08783-2\_40"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20131017-105937816,
    title = "Generalized Gray Codes for Local Rank Modulation",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20131017-105937816",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2013.2268534",
    volume = "59"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130826-103812140,
    title = "Trajectory Codes for Flash Memory",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130826-103812140",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2013.2251755",
    volume = "59"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170125-143159155,
    title = "2013 IEEE International Symposium on Information Theory",
    chapter = "Sequence reconstruction for Grassmann graphs and permutations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170125-143159155",
    id = "record",
    isbn = "978-1-4799-0446-4",
    doi = "10.1109/ISIT.2013.6620351"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130617-115747407,
    title = "Nonuniform Codes for Correcting Asymmetric Errors in Data Storage",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130617-115747407",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2013.2241175",
    volume = "59"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130429-085506668,
    title = "On the Average Complexity of Reed–Solomon List Decoders",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130429-085506668",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2012.2235522",
    volume = "59"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20130321-102330661,
    title = "Zigzag Codes: MDS Array Codes With Optimal Rebuilding",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130321-102330661",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2012.2227110",
    volume = "59"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130215-094523026,
    title = "Error-Correcting Codes for Multipermutations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130215-094523026",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130215-093909657,
    title = "Building Consensus via Iterative Voting",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130215-093909657",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130215-092157295,
    title = "In-Memory Computing of Akers Logic Array",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130215-092157295",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130215-092855327,
    title = "Information-Theoretic Study of Voting Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130215-092855327",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130128-153803180,
    title = "Codes for Network Switches",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130128-153803180",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130128-144020108,
    title = "Rank-Modulation Rewriting Codes for Flash Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130128-144020108",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20130215-095250632,
    title = "Sequence Reconstruction for Grassmann Graphs and Permutations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130215-095250632",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170207-175141968,
    title = "2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)",
    chapter = "Content-assisted file decoding for nonvolatile memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170207-175141968",
    id = "record",
    isbn = "978-1-4673-5051-8",
    doi = "10.1109/ACSSC.2012.6489154"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20121109-103154708,
    title = "Cyclic Boolean circuits",
    journal = "Discrete Applied Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20121109-103154708",
    id = "record",
    issn = "0166-218X",
    doi = "10.1016/j.dam.2012.03.039",
    volume = "160"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120829-103740126,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Long MDS Codes for Optimal Repair Bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120829-103740126",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6283041"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120828-151501177,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Systematic Error-Correcting Codes for Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120828-151501177",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6284106"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120828-165227181,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Variable-Length Extractors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120828-165227181",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6283024"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120828-151832251,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Trade-offs between Instantaneous and Total Capacity in Multi-Cell Flash Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120828-151832251",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6284712"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20130204-132322886,
    title = "2012 IEEE International Symposium on Information Theory",
    chapter = "Long MDS Codes for Optimal Repair Bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20130204-132322886",
    id = "record",
    isbn = "978-1-4673-2579-0",
    doi = "10.1109/ISIT.2012.6283041"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120828-144523977,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "On the Uncertainty of Information Retrieval in Associative Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120828-144523977",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6283016"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120828-151322448,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Decoding of Cyclic Codes over Symbol-Pair Read Channels",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120828-151322448",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6284053"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120829-092120549,
    title = "2012 IEEE International Symposium on Information Theory Proceedings (ISIT)",
    chapter = "Access vs. Bandwidth in Codes for Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120829-092120549",
    id = "record",
    isbn = "978-1-4673-2580-6",
    doi = "10.1109/ISIT.2012.6283042"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20120616-221646611,
    title = "Long MDS Codes for Optimal Repair Bandwidth",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120616-221646611",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20120516-141137208,
    title = "Trade-offs between Instantaneous and Total Capacity in Multi-Cell Flash Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120516-141137208",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20120502-130441311,
    title = "Patterned Cells for Phase Change Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120502-130441311",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20120502-125850834,
    title = "Variable-level Cells for Nonvolatile Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120502-125850834",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120503-095551724,
    title = "Efficient Generation of Random Bits From Finite State Markov Chains",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120503-095551724",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2011.2175698",
    volume = "58"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120326-082904019,
    title = "On the Capacity and Programming of Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120326-082904019",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2011.2177755",
    volume = "58"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120203-154015264,
    title = "Low-Complexity Array Codes for Random and Clustered 4-Erasures",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120203-154015264",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2011.2171518",
    volume = "58"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120420-092834437,
    title = "Constant-Weight Gray Codes for Local Rank Modulation",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120420-092834437",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2011.2162570",
    volume = "57"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110922-104607230,
    title = "Transforming Probabilities With Combinational Logic",
    journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110922-104607230",
    id = "record",
    issn = "0278-0070",
    doi = "10.1109/TCAD.2011.2144630",
    volume = "30"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120330-134402245,
    title = "2011 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Linear extractors for extracting randomness from noisy sources",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120330-134402245",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6033845"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20110801-112437228,
    title = "Neural network computation with DNA strand displacement cascades",
    journal = "Nature",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110801-112437228",
    id = "record",
    issn = "0028-0836",
    doi = "10.1038/nature10262",
    volume = "475"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR112,
    title = "Systematic Error-Correcting Codes for Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR112",
    id = "record",
    doi = "10.48550/arXiv.1310.6817"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR111,
    title = "On Codes for Optimal Rebuilding Access",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR111",
    id = "record",
    doi = "10.48550/arXiv.1107.1627"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170213-160905267,
    title = "2011 IEEE International Symposium on Information Theory Proceedings",
    chapter = "Patterned cells for phase change memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170213-160905267",
    id = "record",
    isbn = "978-1-4577-0595-3",
    doi = "10.1109/ISIT.2011.6033979"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120406-093959188,
    title = "2011 IEEE International Symposium on Information Theory Proceedings",
    chapter = "MDS Array Codes with Optimal Rebuilding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120406-093959188",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6033733"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120405-104551517,
    title = "IEEE International Symposium on Information Theory Proceedings",
    chapter = "Compressed Encoding for Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120405-104551517",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6034264"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120406-094817699,
    title = "2011 IEEE International Symposium on Information Theory Proceedings",
    chapter = "Error-Correcting Schemes with Dynamic Thresholds  in Nonvolatile Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120406-094817699",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6033936"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120405-102509210,
    title = "2011 IEEE International Symposium on Information Theory Proceedings",
    chapter = "Generalized Gray Codes for Local Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120405-102509210",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6034262"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120406-093123448,
    title = "2011 IEEE International Symposium on Information Theory Proceedings",
    chapter = "Nonuniform Codes for Correcting Asymmetric Errors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120406-093123448",
    id = "record",
    isbn = "978-1-4577-0596-0",
    doi = "10.1109/ISIT.2011.6033689"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR110,
    title = "MDS Array Codes with Optimal Rebuilding",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR110",
    id = "record",
    doi = "10.48550/arXiv.1103.3737"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR108,
    title = "Compressed Encoding for Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR108",
    id = "record",
    doi = "10.48550/arXiv.1108.2741"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR107,
    title = "Generalized Gray Codes for Local Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR107",
    id = "record",
    doi = "10.48550/arXiv.1103.0317"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2011.ETR106,
    title = "Generating Probability Distributions using Multivalued Stochastic Relay Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2011.ETR106",
    id = "record",
    doi = "10.48550/arXiv.1102.1441"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR104,
    title = "Trajectory Codes for Flash Memory",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR104",
    id = "record",
    doi = "10.48550/arXiv.1012.5430"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR105,
    title = "Constant-Weight Gray Codes for Local Rank Modulation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR105",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110707-082718436,
    title = "2010 IEEE GLOBECOM Workshops",
    chapter = "Rebuilding for Array Codes in Distributed Storage Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110707-082718436",
    id = "record",
    isbn = "978-1-4244-8863-6",
    doi = "10.1109/GLOCOMW.2010.5700274"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170309-151553099,
    title = "IEEE 26th Convention of Electrical and Electronics Engineers in Israel",
    chapter = "On a construction for constant-weight Gray codes for local rank modulation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170309-151553099",
    id = "record",
    isbn = "978-1-4244-8682-3",
    doi = "10.1109/EEEI.2010.5661923"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170309-140500073,
    title = "Storage Coding for Wear Leveling in Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170309-140500073",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2010.2059833",
    volume = "56"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20101108-153955478,
    title = "Rewriting Codes for Joint Information Storage in Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20101108-153955478",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2010.2059530",
    volume = "56"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103,
    title = "Rebuilding for Array Codes in Distributed Storage Systems",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR103",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-132532031,
    title = "2010 IEEE International Symposium on Information Theory",
    chapter = "On the Synthesis of Stochastic Flow Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-132532031",
    id = "record",
    isbn = "978-1-4244-7891-0",
    doi = "10.1109/ISIT.2010.5513754"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR102,
    title = "Efficiently Generating Random Bits from Finite State Markov Chains",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR102",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170309-135756699,
    title = "2010 IEEE International Symposium on Information Theory",
    chapter = "Data movement and aggregation in flash memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170309-135756699",
    id = "record",
    isbn = "978-1-4244-7892-7",
    doi = "10.1109/ISIT.2010.5513391"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100805-151724246,
    title = "Towards trustworthy elections : new directions in electronic voting",
    chapter = {A Modular Voting Architecture ("Frog Voting")},
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100805-151724246",
    id = "record",
    isbn = "978-3-642-12979-7",
    doi = "10.1007/978-3-642-12980-3\_5"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100617-092653362,
    title = "Correcting Charge-Constrained Errors in the Rank-Modulation Scheme",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100617-092653362",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2010.2043764",
    volume = "56"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100415-101346040,
    title = "Codes for Asymmetric Limited-Magnitude Errors  With Application to Multilevel Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100415-101346040",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2010.2040971",
    volume = "56"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100407-095238680,
    title = "On the Capacity of the Precision-Resolution System",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100407-095238680",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2039089",
    volume = "56"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR101,
    title = "On the Synthesis of Stochastic Flow Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR101",
    id = "record",
    doi = "10.48550/arXiv.1209.0724"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2010.ETR100,
    title = "Data Movement and Aggregation in Flash Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2010.ETR100",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-130545474,
    title = "2010 IEEE International Symposium on Information Theory",
    chapter = "Partial Rank Modulation for Flash Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-130545474",
    id = "record",
    isbn = "978-1-4244-7891-0",
    doi = "10.1109/ISIT.2010.5513597"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110331-095348080,
    title = "2010 IEEE International Symposium on Information Theory",
    chapter = "Generalizing the Blum-Elias Method for Generating
 Random Bits from Markov Chains",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110331-095348080",
    id = "record",
    isbn = "978-1-4244-7891-0",
    doi = "10.1109/ISIT.2010.5513679"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR099,
    title = "Cyclic Boolean circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR099",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR098,
    title = "Low-Complexity Codes for Random and Clustered High-Order Failures in Storage Arrays",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR098",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR094,
    title = "Storage Coding for Wear Leveling in Flash Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR094",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170321-173656746,
    title = "47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)",
    chapter = "Data movement in flash memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170321-173656746",
    id = "record",
    isbn = "978-1-4244-5871-4",
    doi = "10.1109/ALLERTON.2009.5394879"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-142932373,
    title = "ISIT 2009",
    chapter = "On the capacity of bounded rank modulation for flash memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-142932373",
    id = "record",
    isbn = "978-1-4244-4312-3",
    doi = "10.1109/ISIT.2009.5205972"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-134022210,
    title = "ISIT 2009",
    chapter = "The robustness of stochastic switching networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-134022210",
    id = "record",
    isbn = "978-1-4244-4312-3",
    doi = "10.1109/ISIT.2009.5205379"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20100816-150432698,
    title = "ISIT 2009",
    chapter = "On the expressibility of stochastic switching circuits",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100816-150432698",
    id = "record",
    isbn = "978-1-4244-4312-3",
    doi = "10.1109/ISIT.2009.5205401"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111020-103016495,
    title = "Algorithmic Bioprocesses",
    chapter = "Programmability of Chemical Reaction Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111020-103016495",
    id = "record",
    isbn = "978-3-540-88868-0",
    doi = "10.1007/978-3-540-88869-7\_27"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090925-102048176,
    title = "Interleaving schemes on circulant graphs with two offsets",
    journal = "Discrete Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090925-102048176",
    id = "record",
    issn = "0012-365X",
    doi = "10.1016/j.disc.2009.01.020",
    volume = "309"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR097,
    title = "Data Movement in Flash Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR097",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090820-152000947,
    title = "Rank Modulation for Flash Memories",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090820-152000947",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2018336",
    volume = "55"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170321-172544029,
    title = "2009 IEEE International Symposium on Information Theory",
    chapter = "Universal rewriting in constrained memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170321-172544029",
    id = "record",
    isbn = "978-1-4244-4312-3",
    doi = "10.1109/ISIT.2009.5205981"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR089,
    title = "Stochastic Switching Circuit Synthesis",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR089",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090514-113712174,
    title = "Cyclic lowest density MDS array codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090514-113712174",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2009.2013024",
    volume = "55"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR095,
    title = "Correcting Charge-Constrained Errors in the Rank-Modulation Scheme",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR095",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR096,
    title = "Universal Rewriting in Constrained Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR096",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090717-115258499,
    title = "Shortening array codes and the perfect 1-factorization conjecture",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090717-115258499",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2008.2009850",
    volume = "55"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR093,
    title = "On the Expressibility of Stochastic Switching Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR093",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090504-113921187,
    title = "Localization and routing in sensor networks by local angle information",
    journal = "ACM Transactions on Sensor Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090504-113921187",
    id = "record",
    issn = "1550-4859",
    doi = "10.1145/1464420.1464427",
    volume = "5"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2009.ETR092,
    title = "The Robustness of Stochastic Switching Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2009.ETR092",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit09,
    title = "Network Coding: A Computational Perspective",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit09",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2008.2008135",
    volume = "55"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR091,
    title = "On the capacity of bounded rank modulation for flash memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR091",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111020-132840264,
    title = "Computation with finite stochastic chemical reaction networks",
    journal = "Natural Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111020-132840264",
    id = "record",
    issn = "1567-7818",
    doi = "10.1007/s11047-008-9067-y",
    volume = "7"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:STAnl08,
    title = "Graphene-based atomic-scale switches",
    journal = "Nano Letters",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:STAnl08",
    id = "record",
    issn = "1530-6984",
    doi = "10.1021/nl801774a",
    volume = "8"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR090,
    title = "Programmability of Chemical Reaction Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR090",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit08,
    title = "Optimal Universal Schedules for Discrete Broadcast",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit08",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2008.928296",
    volume = "54"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20090728-082033135,
    title = "The Alpha Project: a model system for systems biology research",
    journal = "IET Systems Biology",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20090728-082033135",
    id = "record",
    issn = "1751-8849",
    doi = "10.1049/iet-syb:20080127",
    volume = "2"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:WILisit08,
    title = "IEEE International Symposium on Information Theory (ISIT '08), Toronto, Canada, 6-11 July 2008",
    chapter = "Stochastic switching circuit synthesis",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:WILisit08",
    id = "record",
    isbn = "978-1-4244-2571-6",
    doi = "10.1109/ISIT.2008.4595215"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR088,
    title = "Codes for Asymmetric Limited-Magnitude Errors  with Application to Multi-Level Flash Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR088",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:SCHWieeetit08,
    title = "Constrained Codes as Networks of Relations",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:SCHWieeetit08",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2008.920245",
    volume = "54"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR087,
    title = "Joint Coding for Flash Memory Storage",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR087",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2008.ETR086,
    title = "Rank Modulation for Flash Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2008.ETR086",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20100505-134021747,
    title = "MAP: Medial axis based geometric routing in sensor networks",
    journal = "Wireless Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20100505-134021747",
    id = "record",
    issn = "1022-0038",
    doi = "10.1007/s11276-006-9857-z",
    volume = "13"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR085,
    title = "Computation with Finite Stochastic Chemical Reaction Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR085",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161121-163644968,
    title = "PODC '07 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing",
    chapter = "Distributed broadcasting and mapping protocols in directed anonymous networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161121-163644968",
    id = "record",
    isbn = "978-1-59593-616-5",
    doi = "10.1145/1281100.1281184"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376,
    title = "2007 IEEE International Symposium on Information Theory",
    chapter = "Buffer Coding for Asymmetric Multi-Level Memory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376",
    id = "record",
    isbn = "978-1-4244-1397-3",
    doi = "10.1109/ISIT.2007.4557384"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170424-171247108,
    title = "2007 IEEE International Symposium on Information Theory",
    chapter = "Constrained Codes as Networks of Relations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170424-171247108",
    id = "record",
    isbn = "978-1-4244-1397-3",
    doi = "10.1109/ISIT.2007.4557416"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161019-153750816,
    title = "DAC '07 Proceedings of the 44th annual Design Automation Conference",
    chapter = "Synthesizing stochasticity in biochemical systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161019-153750816",
    id = "record",
    isbn = "978-1-59593-627-1",
    doi = "10.1145/1278480.1278643"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170426-165849521,
    title = "2007 IEEE International Symposium on Information Theory",
    chapter = "Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170426-165849521",
    id = "record",
    isbn = "978-1-4244-1397-3",
    doi = "10.1109/ISIT.2007.4557123"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR084,
    title = "Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR084",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170419-152416338,
    title = "2007 IEEE International Symposium on Information Theory",
    chapter = "Floating Codes for Joint Information Storage in Write Asymmetric Memories",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170419-152416338",
    id = "record",
    isbn = "978-1-4244-1397-3",
    doi = "10.1109/ISIT.2007.4557381"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR080,
    title = "Floating Codes for Joint Information Storage in Write Asymmetric Memories",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR080",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR083,
    title = "Buffer Coding for Asymmetric Multi-Level Memory",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR083",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR079,
    title = "Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude Errors",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR079",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR082,
    title = "Constrained Codes as Networks of Relations",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR082",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR081,
    title = "Synthesizing Stochasticity in Biochemical Systems",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR081",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2007.ETR078,
    title = "Increasing the Information Density of Storage Systems Using the Precision-Resolution Paradigm",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2007.ETR078",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR077,
    title = "Exact Stochastic Simulation of Chemical Reactions  with Cycle Leaping",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR077",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:JIAsiamjdm06,
    title = "Optimal Interleaving on Tori",
    journal = "SIAM Journal on Discrete Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:JIAsiamjdm06",
    id = "record",
    issn = "0895-4801",
    doi = "10.1137/040618655",
    volume = "20"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170516-150511939,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "Shortening Array Codes and the Perfect 1-Factorization Conjecture",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170516-150511939",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.261572"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170510-171516844,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "Anti-Jamming Schedules for Wireless Data Broadcast Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170510-171516844",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.261756"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170516-163950291,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "Cyclic Low-Density MDS Array Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170516-163950291",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.261571"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170509-172831834,
    title = "2006 IEEE International Symposium on Information Theory",
    chapter = "On the Capacity of Precision-Resolution Constrained Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170509-172831834",
    id = "record",
    isbn = "1-4244-0505-X",
    doi = "10.1109/ISIT.2006.262110"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06,
    title = "The encoding complexity of network coding",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANieeetit06",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2006.874434",
    volume = "52"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR076,
    title = "Cyclic Low-Density MDS Array Codes",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR076",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR075,
    title = "Shortening Array Codes and the Perfect 1-Factorization Conjecture",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR075",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR074,
    title = "Network Coding: A Computational Perspective",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR074",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150319-090453634,
    title = "2020 Computing: Can computers help to explain biology?",
    journal = "Nature",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150319-090453634",
    id = "record",
    issn = "0028-0836",
    doi = "10.1038/440416a",
    volume = "440"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR073,
    title = "On the Capacity of Precision-Resolution Constrained Systems",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR073",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2006.ETR072,
    title = "Adaptive Bloom filter",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2006.ETR072",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110630-145653337,
    title = "40th Annual Conference on Information Sciences and Systems",
    chapter = "Network Coding: A Computational Perspective",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110630-145653337",
    id = "record",
    isbn = "1-4244-0349-9",
    doi = "10.1109/CISS.2006.286590"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR071,
    title = "Networks of Relations for Representation, Learning, and Generalization",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR071",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:CASisit05,
    title = "International Symposium on Information Theory (ISIT 2005), Adelaide, Australia, 4-9 September 2005",
    chapter = "Network coding for non-uniform demands",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CASisit05",
    id = "record",
    isbn = "0-7803-9151-9",
    doi = "10.1109/ISIT.2005.1523639"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160811-164254714,
    title = "MobiCom '05 Proceedings of the 11th annual international conference on Mobile computing and networking",
    chapter = "MAP: medial axis based geometric routing in sensor networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160811-164254714",
    id = "record",
    isbn = "1-59593-020-5",
    doi = "10.1145/1080829.1080839"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR070,
    title = "Anti-Jamming Schedules for Wireless Broadcast Systems",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR070",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR069,
    title = "MAP: Medial Axis Based Geometric Routing in Sensor Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR069",
    id = "record",
    doi = "10.1145/1080829.1080839"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR068,
    title = "Localization and Routing in Sensor Networks by Local Angle
 Information",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR068",
    id = "record",
    doi = "10.1145/1062689.1062713"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20161107-163620734,
    title = "Network file storage with graceful performance degradation",
    journal = "ACM Transactions on Storage",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161107-163620734",
    id = "record",
    issn = "1553-3077",
    doi = "10.1145/1063786.1063788",
    volume = "1"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160811-163730860,
    title = "MobiHoc '05 Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing",
    chapter = "Localization and routing in sensor networks by local angle information",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160811-163730860",
    id = "record",
    isbn = "1-59593-004-3",
    doi = "10.1145/1062689.1062713"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR067,
    title = "Implementability Among Predicates",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR067",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-114857462,
    title = "Infocom 2005: The Conference on Computer Communications",
    chapter = "Monotone Percolation and The Topology Control of Wireless Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-114857462",
    id = "record",
    isbn = "0-7803-8968-9",
    doi = "10.1109/INFCOM.2005.1497903"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR066,
    title = "An automated system for measuring parameters of nematode sinusoidal movement",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR066",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:CRObmcg05,
    title = "An automated system for measuring parameters of nematode sinusoidal movement",
    journal = "BMC Genetics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CRObmcg05",
    id = "record",
    issn = "1471-2156",
    doi = "10.1186/1471-2156-6-5",
    volume = "6",
    pmcid = "PMC549551"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:JIAieeetit05,
    title = "Multicluster interleaving on paths and cycles",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:JIAieeetit05",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2004.840893",
    volume = "51"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20191009-093219813,
    title = "Continuum Percolation with Unreliable and Spread-Out Connections",
    journal = "Journal of Statistical Physics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20191009-093219813",
    id = "record",
    issn = "0022-4715",
    doi = "10.1007/s10955-004-8826-0",
    volume = "118"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR064,
    title = "Network Coding for Nonuniform Demands",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR064",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2005.ETR065,
    title = "Monotone Percolation and The Topology Control of Wireless Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2005.ETR065",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:LANisit04,
    title = "IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July, 2004",
    chapter = "Optimal universal schedules for discrete broadcast",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANisit04",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365148"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:LANisit05b,
    chapter = "The encoding complexity of network coding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANisit05b",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:LANisit05a,
    chapter = "Staleness vs. waiting time in universal discrete broadcast",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LANisit05a",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR063,
    title = "The Encoding Complexity of Network Coding",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR063",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR062,
    title = "Optimal Schedules for Asynchronous Transmission of Discrete Packets",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR062",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR061,
    title = "Network File Storage With Graceful Performance Degradation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR061",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20111014-095736081,
    title = "Regulatory modules that generate biphasic signal
 response in biological systems",
    journal = "Systems Biology",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111014-095736081",
    id = "record",
    issn = "1741-2471",
    doi = "10.1049/sb:20045014",
    volume = "1"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:CASisit04,
    title = "International Symposium on Information Theory (ISIT 2004), Chicago IL, 27 June-2 July 2004",
    chapter = "Miscorrection probability beyond the minimum distance",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:CASisit04",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365561"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110818-083929592,
    title = "2004 IEEE International Symposium on Information Theory",
    chapter = "Optimal t-Interleaving on Tori",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110818-083929592",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365060"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20110921-122835869,
    title = "2004 IEEE International Symposium on Information Theory",
    chapter = "Scheduling for Efficient Data Broadcast over Two Channels",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20110921-122835869",
    id = "record",
    isbn = "0-7803-8280-3",
    doi = "10.1109/ISIT.2004.1365147"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR058,
    title = "A Combinatorial Bound on the List Size",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR058",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1160,
    title = "Timing Analysis of Cyclic Combinatorial Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR060.1160",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04,
    title = "A random walk model of wave propagation",
    journal = "IEEE Transactions on Antennas and Propagation",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetap04",
    id = "record",
    issn = "0018-926X",
    doi = "10.1109/TAP.2004.827540",
    volume = "52"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR057,
    title = "Optimal Unviersal Schedules for Discrete Broadcast",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR057",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetc04,
    title = "A Geometric Theorem for Network Design",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetc04",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/TC.2004.1268406",
    volume = "53"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR056,
    title = "Scheduling for Efficient Data Broadcast over Two Channels",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR056",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2004.ETR059,
    title = "Optimal Interleaving on Tori",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2004.ETR059",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111025-143359852,
    title = "Proceedings of the 2003 IEEE Bioinformatics Conference",
    chapter = "Bridging Paradigm Gaps Between Biology and Engineering",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111025-143359852",
    id = "record",
    isbn = "0-7695-2000-6",
    doi = "10.1109/CSB.2003.1227290"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111005-091318608,
    title = "2003 IEEE International Symposium on Information Theory",
    chapter = "Ad hoc wireless networks with noisy links",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111005-091318608",
    id = "record",
    isbn = "0-7803-7728-1",
    doi = "10.1109/ISIT.2003.1228402"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111005-113409987,
    title = "2003 IEEE International Symposium on Information Theory",
    chapter = "Coding and scheduling for efficient loss-resilient data broadcasting",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111005-113409987",
    id = "record",
    isbn = "0-7803-7728-1",
    doi = "10.1109/ISIT.2003.1228430"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BOOaoap03,
    title = "Covering algorithms, continuum percolation and the geometry of wireless networks",
    journal = "Annals of Applied Probability",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BOOaoap03",
    id = "record",
    issn = "1050-5164",
    doi = "10.1214/aoap/1050689601",
    volume = "13"
}


@inbook{https://resolver.caltech.edu/CaltechPARADISE:ETR050,
    title = "Second IEEE International Symposium on Network Computing and Applications",
    chapter = "Optimal Content Placement for En-Route Web Caching",
    url = "https://resolver.caltech.edu/CaltechPARADISE:ETR050",
    id = "record",
    isbn = "0-7695-1938-5",
    doi = "10.1109/NCA.2003.1201132"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BOHsiamjdm03,
    title = "Algebraic techniques for constructing minimal weight threshold functions",
    journal = "SIAM Journal on Discrete Mathematics",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BOHsiamjdm03",
    id = "record",
    issn = "0895-4801",
    doi = "10.1137/S0895480197326048",
    volume = "16"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2003.ETR055,
    title = "Percolation in Multi-hop Wireless Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2003.ETR055",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2003.ETR051,
    title = "Multi-Cluster interleaving in linear arrays and rings",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2003.ETR051",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:ETR052a,
    title = "The Synthesis of Cyclic Combinatorial Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:ETR052a",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:ETR053,
    title = "Algorithmic Aspects of Cyclic Combinational Circuit Synthesis",
    url = "https://resolver.caltech.edu/CaltechPARADISE:ETR053",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2003.ETR054,
    title = "Interleaving Schemes on Circulant Graphs with Two Offsets",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2003.ETR054",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:ETR052,
    title = "The Synthesis of Cyclic Combinatorial Circuits",
    url = "https://resolver.caltech.edu/CaltechPARADISE:ETR052",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111012-143707754,
    title = "40th Design Automation Conference",
    chapter = "The synthesis of cyclic combinational circuits",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111012-143707754",
    id = "record",
    isbn = "1-58113-688-9"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1994.ETR002,
    title = "Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1994.ETR002",
    id = "record",
    doi = "10.1145/215399.215421"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111019-133944822,
    title = "2002 IEEE International Symposium on Information Theory",
    chapter = "Diversity Coloring for information storage in networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111019-133944822",
    id = "record",
    isbn = "0-7803-7501-7",
    doi = "10.1109/ISIT.2002.1023653"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111102-090203478,
    title = "2002 IEEE International Symposium on Information Theory",
    chapter = "Power requirements for connectivity in clustered wireless networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111102-090203478",
    id = "record",
    isbn = "0-7803-7501-7",
    doi = "10.1109/ISIT.2002.1023625"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111102-132442999,
    title = "2002 IEEE International Symposium on Information Theory",
    chapter = "Robustness of Time-Division Schedules for Internet Broadcast",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111102-132442999",
    id = "record",
    isbn = "0-7803-7501-7",
    doi = "10.1109/ISIT.2002.1023655"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111027-155844420,
    title = "2002 IEEE International Symposium on Information Theory",
    chapter = "Interval modulation coding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111027-155844420",
    id = "record",
    isbn = "0-7803-7501-7",
    doi = "10.1109/ISIT.2002.1023599"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FOLieeetit02.854,
    title = "Splitting schedules for Internet broadcast communication",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FOLieeetit02.854",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.978728",
    volume = "48"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR048,
    title = "Memory Allocation in Information Storage Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR048",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR044,
    title = "A Geometric Theorem for Wireless Network Design Optimization",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR044",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR047,
    title = "Ad hoc wireless networks with noisy links",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR047",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR046,
    title = "Interleaving Schemes on Circulant Graphs",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR046",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR043,
    title = "DNAS: Dispersed Network Attached Storage for Reliability and Performance",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR043",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR042,
    title = "Time-Division is Better Than Frequency-Division for Periodic Internet Broadcasting",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR042",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR049,
    title = "Coding and Scheduling for Efficient Loss-Resilient Data Broadcasting",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR049",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2002.ETR045,
    title = "Microcellular Systems, Random Walks, and Wave Propagation",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2002.ETR045",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetpds01,
    title = "A group membership algorithm with a practical specification",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FRAieeetpds01",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.969128",
    volume = "12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FANieeeic01,
    title = "The Raincore API for clusters of networking elements",
    journal = "IEEE Internet Computing",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FANieeeic01",
    id = "record",
    issn = "1089-7801",
    doi = "10.1109/4236.957897",
    volume = "5"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111117-083940997,
    title = "2001 IEEE International Symposium on Information Theory",
    chapter = "Time Division is Better Than Frequency Division for Periodic Internet Broadcast of Dynamic Data",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111117-083940997",
    id = "record",
    isbn = "0-7803-7123-2",
    doi = "10.1109/ISIT.2001.936021"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111110-152519883,
    title = "Proceedings of the 15th International Parallel and Distributed Processing Symposium",
    chapter = "The Raincore Distributed Session Service for Networking Elements",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111110-152519883",
    id = "record",
    isbn = "0-7695-0990-8",
    doi = "10.1109/IPDPS.2001.925154"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:AVRieeetpds01,
    title = "Introduction to the special section on dependable network computing",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:AVRieeetpds01",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/TPDS.2001.910865",
    volume = "12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetpds01,
    title = "Computing in the RAIN: a reliable array of independent nodes",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetpds01",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.910866",
    volume = "12"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2001.ETR036,
    title = "Frequency Modulation for Asynchronous Data Transfer",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2001.ETR036",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2001.ETR035,
    title = "A Geometric Theorem for Approximate Disk Covering Algorithms",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2001.ETR035",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2001.ETR037,
    title = "Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks.",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2001.ETR037",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2001.ETR040,
    title = "Interval Modulation Coding",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2001.ETR040",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2001.ETR038,
    title = "Diversity Coloring for Distributed Storage in Mobile Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2001.ETR038",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00,
    title = "Coding for tolerance and detection of skew in parallel asynchronous communications",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.887847",
    volume = "46"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:FANieeetc00,
    title = "Tolerating multiple faults in multistage interconnection networks with minimal extra stages",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:FANieeetc00",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.869334",
    volume = "49"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967,
    title = "2000 IEEE International Symposium on Information Theory",
    chapter = "Splitting the Scheduling Headache",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111117-110955967",
    id = "record",
    isbn = "0-7803-5858-9",
    doi = "10.1109/ISIT.2000.866787"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317828,
    title = "Parallel and distributed processing : 15 IPDPS 2000 workshops, Cancun, Mexico, May 1 - 5, 2000, proceedings",
    chapter = "Computing in the RAIN: A Reliable Array of Independent Nodes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190828-102317828",
    id = "record",
    isbn = "9783540674429",
    doi = "10.1007/3-540-45591-4\_167"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:LEVpnas00,
    title = "Scaffold proteins may biphasically affect the levels of mitogen-activated protein kinase signaling and reduce its threshold properties",
    journal = "Proceedings of the National Academy of Sciences of the United States of America",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:LEVpnas00",
    id = "record",
    issn = "0027-8424",
    volume = "97",
    pmcid = "PMC18517"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00b,
    title = "MDS array codes for correcting a signle criss-cross error",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit00b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.841187",
    volume = "46"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170719-082029624,
    title = "Efficient Exact Stochastic Simulation of Chemical Systems with Many Species and Many Channels",
    journal = "Journal of Physical Chemistry A",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170719-082029624",
    id = "record",
    issn = "1089-5639",
    doi = "10.1021/jp993732q",
    volume = "104"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2000.ETR034,
    title = "Splitting Schedules for Internet Broadcast Communication",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2000.ETR034",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:2000.ETR033,
    title = "Coding for Tolerance and Detection of Skew in Parallel Asynchronous Communications",
    url = "https://resolver.caltech.edu/CaltechPARADISE:2000.ETR033",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200127-124216616,
    title = "Dependable Network Computing",
    chapter = "On the Possibility of Group Membership Protocols",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200127-124216616",
    id = "record",
    isbn = "978-1-4613-7053-6",
    doi = "10.1007/978-1-4615-4549-1\_4"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20190830-101628653,
    title = "Dependable Network Computing",
    chapter = "Tolerating Faults in Counting Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190830-101628653",
    id = "record",
    isbn = "978-1-4613-7053-6",
    doi = "10.1007/978-1-4615-4549-1\_12"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99a,
    title = "Low-density MDS codes and factors of complete graphs",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.782102",
    volume = "45"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:GIBieeetit99,
    title = "Efficient digital-to-analog encoding",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:GIBieeetit99",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.771156",
    volume = "45"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566,
    title = "13th International Parallel Processing Symposium \& 10th Symposium on Parallel and Distributed Processing",
    chapter = "A Consistent History Link Connectivity Protocol",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111207-091413566",
    id = "record",
    isbn = "0-7695-0143-5",
    doi = "10.1109/IPPS.1999.760448"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1999.ETR031,
    title = "Efficient Exact Stochastic Simulation of Chemical Systems with Many Species and Many Channels",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1999.ETR031",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1999.ETR032,
    title = "A Possible Solution to the Impossible Membership Problem",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1999.ETR032",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1999.ETR029,
    title = "Computing in the RAIN: A Reliable Array of Independent Nodes",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1999.ETR029",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1999.ETR030,
    title = "Splitting the Scheduling Headache",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1999.ETR030",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b,
    title = "X-code: MDS array codes with optimal encoding",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:XULieeetit99b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.746809",
    volume = "45"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200709-082541313,
    title = "Workshop on Wide Area Networks and High Performance Computing",
    chapter = "Highly available distributed storage systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200709-082541313",
    id = "record",
    isbn = "978-1-85233-642-4",
    doi = "10.1007/bfb0110096"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:HOCieeetc98,
    title = "Partial-sum queries in OLAP data cubes using covering codes",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:HOCieeetc98",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.737680",
    volume = "47"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetcpmtb98,
    title = "Programmable neural logic",
    journal = "IEEE Transactions on Components, Packaging, and Manufacturing Technology, Part B: Advanced Packaging,",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BOHieeetcpmtb98",
    id = "record",
    issn = "1070-9894",
    doi = "10.1109/96.730415",
    volume = "21"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:XULieeetpds98,
    title = "Deterministic voting in distributed systems using error-correcting codes",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:XULieeetpds98",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.706052",
    volume = "9"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:XULisit98,
    title = "IEEE International Symposium on Information Theory, 1998.",
    chapter = "Low density MDS codes and factors of complete graphs",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:XULisit98",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708599"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111215-111208543,
    title = "1998 IEEE International Symposium on Information Theory",
    chapter = "Efficient digital to analog encoding",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111215-111208543",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708930"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120112-112036174,
    title = "1998 IEEE International Symposium on Information Theory",
    chapter = "Coding for skew correcting and detecting in parallel asynchronous communications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120112-112036174",
    id = "record",
    isbn = "0-7803-5000-6",
    doi = "10.1109/ISIT.1998.708659"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161122-142619200,
    title = "PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing",
    chapter = "A consistent history link connectivity protocol",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161122-142619200",
    id = "record",
    isbn = "0-89791-977-7",
    doi = "10.1145/277697.277757"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit98,
    title = "Interleaving schemes for multidimensional cluster errors",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit98",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.661516",
    volume = "44"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20111215-115455804,
    title = "Proceedings of the first merged International Parallel Processing Symposium \& Symposium on Parallel and Distributed Processing",
    chapter = "Fault-tolerant switched local area networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20111215-115455804",
    id = "record",
    isbn = "0-8186-8403-8",
    doi = "10.1109/IPPS.1998.670011"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc98,
    title = "Analysis of checkpointing schemes with task duplication",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc98",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.663769",
    volume = "47"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR026,
    title = "An Efficient Algorithm for Generating Trajectories of Stochastic Gene Regulation Reactions",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR026",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR025,
    title = "Low Density MDS Codes and Factors of Complete Graphs",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR025",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR028,
    title = "Trading Weight Size for Circuit Depth: A Circuit for Comparison",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR028",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR022,
    title = "Tolerating Faults in Counting Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR022",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR027,
    title = "Improving the Performance of Data Servers Using Array Codes",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR027",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR024,
    title = "A Leader Election Protocol for Fault Recovery in Asynchronous Fully-Connected Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR024",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR023,
    title = "A Consistent History Link Connectivity Protocol",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR023",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1998.ETR021,
    title = "Fault-Tolerant Switched Local Area Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1998.ETR021",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc98,
    title = "A coding approach for detection of tampering in write-once optical disks",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc98",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.656095",
    volume = "47"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160224-141437128,
    title = "Advances in Neural Information Processing Systems 10 (NIPS 1997)",
    chapter = "Multiple Threshold Neural Logic",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160224-141437128",
    id = "record",
    isbn = "0-262-10076-2"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97a,
    title = "Performance optimization of checkpointing schemes with task duplication",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97a",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.641939",
    volume = "46"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds97,
    title = "Efficient algorithms for all-to-all communications in multiport message-passing systems",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds97",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.642949",
    volume = "8"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:BOHiciss97,
    title = "IEEE International Conference on Innovative Systems in Silicon, 2nd,  Austin, TX, 8-10 October 1997",
    chapter = "Programmable neural logic",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BOHiciss97",
    id = "record",
    isbn = "0-7803-4276-3",
    doi = "10.1109/ICISS.1997.630242"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97b,
    title = "An on-line algorithm for checkpoint placement",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVieeetc97b",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.620479",
    volume = "46"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120119-135511706,
    title = "1997 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Two-dimensional interleaving schemes with repetitions",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120119-135511706",
    id = "record",
    isbn = "0-7803-3956-8",
    doi = "10.1109/ISIT.1997.613272"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20161103-134218465,
    title = "PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems",
    chapter = "Partial-sum queries in OLAP data cubes using covering codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161103-134218465",
    id = "record",
    isbn = "0-89791-910-6",
    doi = "10.1145/263661.263686"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1997.ETR017,
    title = "Programmable Neural Logic",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1997.ETR017",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1997.ETR018,
    title = "Partial-Sum Queries in OLAP Data Cubes Using Covering Codes",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1997.ETR018",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1997.ETR016,
    title = "Two-Dimensional Interleaving Schemes with Repetitions",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1997.ETR016",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1997.ETR019,
    title = "MDS Array Codes for Correcting Criss-Cross Errors",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1997.ETR019",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1997.ETR020,
    title = "X-Code: MDS Array Codes with Optimal Encoding",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1997.ETR020",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120119-113410577,
    title = "1997 IEEE International Symposium on Information Theory, Proceedings",
    chapter = "Array Codes for Correction of Criss-Cross Errors",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120119-113410577",
    id = "record",
    isbn = "0-7803-3956-8",
    doi = "10.1109/ISIT.1997.613349"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit96,
    title = "Fault-tolerant cube graphs and coding theory",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit96",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.556609",
    volume = "42"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120207-113452642,
    title = "Eighth IEEE Symposium on Parallel and Distributed Processing",
    chapter = "On Optimal Placements of Processors in Tori Networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120207-113452642",
    id = "record",
    isbn = "0-8186-7683-3",
    doi = "10.1109/SPDP.1996.570382"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit96,
    title = "MDS array codes with independent parity symbols",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit96",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.485722",
    volume = "42"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds96,
    title = "On the design and implementation of broadcast and global combine operations using the postal model",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds96",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.491579",
    volume = "7"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR013,
    title = "A Coding Approach for Detection of Tampering in Write-Once Optical Disks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR013",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR014,
    title = "Optimal Constructions of Fault-Tolerant Multistage Interconnection Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR014",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR009,
    title = "Efficient Digital to Analog Encoding",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR009",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR015,
    title = "Algebraic Techniques for Constructing Minimal Weight Threshold Functions",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR015",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR010,
    title = "Multiple Threshold Neural Logic",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR010",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR011,
    title = "Deterministic Voting in Distributed Systems Using Error-Correcting Codes",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR011",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1996.ETR012,
    title = "On Optimal Placements of Processors in Tori Networks",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1996.ETR012",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZIVissre96,
    title = "International Symposium on Software Reliability Engineering, 7th, White Plains, NY, 30 October-2 November 1996",
    chapter = "An on-line algorithm for checkpoint placement",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVissre96",
    id = "record",
    isbn = "0818677074",
    doi = "10.1109/ISSRE.1996.558869"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160223-114401229,
    title = "Advances in Neural Information Processing Systems 8 (NIPS 1995)",
    chapter = "On Neural Networks with Minimal Weights",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160223-114401229",
    id = "record",
    isbn = "0-262-20107-0"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120216-070547466,
    title = "Proceedings 1995 IEEE International Symposium on Information Theory",
    chapter = "MDS Array Codes with Independent Parity Symbols",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-070547466",
    id = "record",
    isbn = "0-7803-2453-6",
    doi = "10.1109/ISIT.1995.535761"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BARieeetpds95,
    title = "Computing global combine operations in the multiport postal model",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BARieeetpds95",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.406965",
    volume = "6"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160811-162638038,
    title = "SPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures",
    chapter = "Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160811-162638038",
    id = "record",
    isbn = "0-89791-717-0",
    doi = "10.1145/215399.215421"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120215-131718595,
    title = "Delay-insensitive pipelined communication on parallel buses",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120215-131718595",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.381951",
    volume = "44"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:BRUipps95,
    title = "International Parallel Processing Symposium, 9th, (IPPS '95), Santa Barbara, CA, 25-28 April 1995",
    chapter = "PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUipps95",
    id = "record",
    isbn = "0-8186-7074-6",
    doi = "10.1109/IPPS.1995.395924"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120216-065736330,
    title = "EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120216-065736330",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.364531",
    volume = "44"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BALieeetpds95,
    title = "CCL: a portable and tunable collective communication library for scalable parallel computers",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BALieeetpds95",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.342126",
    volume = "6"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1995.ETR007,
    title = "Fault-Tolerant Cube Graphs and Coding Theory",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1995.ETR007",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1995.ETR008,
    title = "Interleaving Schemes for Multidimensional Cluster Errors",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1995.ETR008",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1995.ETR006,
    title = "An Online Algorithm for Checkpointing Placement",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1995.ETR006",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1995.ETR005,
    title = "On Neural Networks with Minimal Weights",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1995.ETR005",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc95,
    title = "Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc95",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.367998",
    volume = "44"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZIVreldis94,
    title = "Symposium on Reliable Distributed Systems, 13th, Dana Point, CA, 25-27 October 1994",
    chapter = "Analysis of checkpointing schemes for multiprocessor systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVreldis94",
    id = "record",
    isbn = "0818665750",
    doi = "10.1109/RELDIS.1994.336909"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeeetc94,
    title = "Embedding cube-connected cycles graphs into faulty hypercubes",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeeetc94",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.324546",
    volume = "43"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ZIVftpds94,
    title = "Fault-Tolerant Parallel and Distributed Systems, College Station, TX, 12-14 June 1994",
    chapter = "Efficient checkpointing over local area networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ZIVftpds94",
    id = "record",
    isbn = "0818668075",
    doi = "10.1109/FTPDS.1994.494471"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds94,
    title = "Fault-tolerant de Bruijn and shuffle-exchange networks",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetpds94",
    id = "record",
    issn = "1045-9219",
    doi = "10.1109/71.282566",
    volume = "5"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1994.ETR004,
    title = "Performance Optimization of Checkpointing Schemes with Task Duplication",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1994.ETR004",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1994.ETR001,
    title = "Fault-Tolerant Meshes with Small Degree",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1994.ETR001",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc94,
    title = {A Note on "A Systematic (12,8) Code for Correcting Single Errors and Detecting Adjacent Errors"},
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetc94",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.250619",
    volume = "43"
}


@other{https://resolver.caltech.edu/CaltechPARADISE:1994.ETR003,
    title = "Analysis of Checkpointing Schemes for Multiprocessor Systems",
    url = "https://resolver.caltech.edu/CaltechPARADISE:1994.ETR003",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93b,
    title = "Constructions of skew-tolerant and skew-detecting codes",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.259671",
    volume = "39"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc93a,
    title = "Fault-tolerant meshes and hypercubes with minimal numbers of spares",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc93a",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.241598",
    volume = "42"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120309-145816573,
    title = "FTCS-22: the Twenty-Second International Symposium on Fault-Tolerant Computing, Digest of Papers",
    chapter = "Unordered Error-Correcting Codes and their Applications",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120309-145816573",
    id = "record",
    isbn = "0-8186-2875-8",
    doi = "10.1109/FTCS.1992.243585"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120309-113620511,
    title = "Depth Efficient Neural Networks for Division and Related Problems",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120309-113620511",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.256501",
    volume = "39"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93a,
    title = "Coding for skew-tolerant parallel asynchronous communications",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit93a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.212269",
    volume = "39"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b,
    title = "IEEE Symposium on Parallel and Distributed Processing, 4th, Arlington, TX, 1-4 December 1992",
    chapter = "Multiple message broadcasting with generalized Fibonacci trees",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b",
    id = "record",
    isbn = "0-8186-3200-3",
    doi = "10.1109/SPDP.1992.242714"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92a,
    title = "IEEE Symposium on Parallel and Distributed Processing, 4th, Arlington, TX, 1-4 December 1992",
    chapter = "Tolerating faults in a mesh with a row of spare nodes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92a",
    id = "record",
    isbn = "0-8186-3200-3",
    doi = "10.1109/SPDP.1992.242768"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92b,
    title = "New techniques for constructing EC/AUED codes",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92b",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.166607",
    volume = "41"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ATJfocs92,
    title = "33rd Annual Symposium on Foundations of Computer Science, 1992.",
    chapter = "Fault tolerant graphs, perfect hash functions and disjoint paths",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ATJfocs92",
    id = "record",
    isbn = "0818629002",
    doi = "10.1109/SFCS.1992.267781"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92a,
    title = "Tolerating faults in hypercubes using subcube partitioning",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetc92a",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.142686",
    volume = "41"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ALOieeetit92,
    title = "Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ALOieeetit92",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.119713",
    volume = "38"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp91,
    title = "IEEE Symposium on Parallel and Distributed Processing, 3rd, Dallas, TX, 2-5 December 1991",
    chapter = "Fault-tolerant meshes with minimal numbers of spares",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp91",
    id = "record",
    isbn = "0-8186-2310-1",
    doi = "10.1109/SPDP.1991.218267"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120418-090627310,
    title = "1991 IEEE International Symposium on Information Theory: Proceedings",
    chapter = "New Techniques For Constructing EC/AUED Codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120418-090627310",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695194"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120424-103938302,
    title = "1991 IEEE International Symposium on Information Theory",
    chapter = "On the Power of Threshold Circuits with Small Weights",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120424-103938302",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695138"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120417-094637010,
    title = "1991 IEEE International Symposium on Information Theory",
    chapter = "Harmonic Analysis And The Complexity Of Computing With Threshold (Neural) Elements",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120417-094637010",
    id = "record",
    isbn = "0-7803-0056-4",
    doi = "10.1109/ISIT.1991.695142"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91,
    title = "IEEE International Symposium on Information Theory (ISIT '91)",
    chapter = "Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ALOisit91",
    id = "record",
    isbn = "0780300564"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120425-065829076,
    title = "1990 31st Annual Symposium on Foundations of Computer Science, Proceedings",
    chapter = "Polynomial Threshold Functions, AC^0 Functions and Spectral Norms",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120425-065829076",
    id = "record",
    isbn = "0-8186-2082-X",
    doi = "10.1109/FSCS.1990.89585"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120503-090033553,
    title = "Neural computation of arithmetic functions",
    journal = "Proceedings of the IEEE",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120503-090033553",
    id = "record",
    issn = "0018-9219",
    doi = "10.1109/5.58350",
    volume = "78"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20120426-132042598,
    title = "On the Convergence Properties of the Hopfield Model",
    journal = "Proceedings of the IEEE",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120426-132042598",
    id = "record",
    issn = "0018-9219",
    doi = "10.1109/5.58341",
    volume = "78"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120509-132855976,
    title = "1990 IEEE Region 10 Conference on Computer and Communication Systems",
    chapter = "Fast arithmetic computing with neural networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120509-132855976",
    id = "record",
    isbn = "0-87942-556-3",
    doi = "10.1109/TENCON.1990.152559"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit90,
    title = "Decoding the Golay code with Venn diagrams",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BLAieeetit90",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.53756",
    volume = "36"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:ROYieeetc90,
    title = "Efficient algorithms for reconfiguration in VLSI/WSI arrays",
    journal = "IEEE Transactions on Computers",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:ROYieeetc90",
    id = "record",
    issn = "0018-9340",
    doi = "10.1109/12.54841",
    volume = "39"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90a,
    title = "On the number of spurious memories in the Hopfield model",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90a",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.52486",
    volume = "36"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90b,
    title = "The hardness of decoding linear codes with preprocessing",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit90b",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.52484",
    volume = "36"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-090912809,
    chapter = "Harmonic analysis of neural networks",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-090912809",
    id = "record",
    doi = "10.1109/ACSSC.1989.1200767"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit89,
    title = "Neural networks, error-correcting codes, and polynomials over the binary n-cube",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit89",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.42215",
    volume = "35"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-151412678,
    chapter = "Polynomial Threshold Elements?",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-151412678",
    id = "record",
    doi = "10.1109/ITW.1989.761437"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20120524-150825080,
    title = "Nineteenth International Symposium on Fault-Tolerant Computing, Digest of Papers",
    chapter = "Some new EC/AUED codes",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20120524-150825080",
    id = "record",
    isbn = "0-8186-1959-7",
    doi = "10.1109/FTCS.1989.105568"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit88,
    title = "A generalized convergence theorem for neural networks",
    journal = "IEEE Transactions on Information Theory",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:BRUieeetit88",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/18.21239",
    volume = "34"
}