Brendan Juba - Papers

Back to the main page. O. Goldreich, B. Juba, and M. Sudan. A Theory of Goal-Oriented Communication. Electronic Colloquium on Computational Complexity (ECCC) TR09-075. 2009. (PS|PDF) B. Juba. On Learning Finite-State Quantum Sources. Manuscript, October 2009. arXiv:0910.3713v1 [quant-ph] (PS|PDF) B. Juba and M. Sudan. Universal Semantic Communication II: A Theory of Goal-Oriented Communication. Electronic Colloquium on Computational Complexity (ECCC) TR08-095. 2008. (PS|PDF) B. Juba and M. Sudan. Universal Semantic Communication I. In 40th ACM Symposium on Theory of Computing. Victoria (BC) Canada. 2008. (PS|PDF) Previously appeared in Electronic Colloquium on Computational Complexity (ECCC) TR07-084. 2007. (PS|PDF) B. Juba. Estimating relatedness via data compression. In 23rd International Conference on Machine Learning. Pittsburgh, PA. 2006. (PS|PDF) B. Juba. On the role of computational complexity theory in the study of brain function. Thought (Carnegie Mellon University Undergraduate Research Journal) . 1:32-45. 2006. (PS|PDF) My thesis for the M.S. in Mathematical Sciences on Simple Stochastic Games (and their relationship to the Stable Circuit Problem) is available: (PS|PDF) A journal-style report focusing on our contributions on the same topic is also available: (PS| PDF) For a course project in 18.177 (Stochastic Processes), I wrote up a slightly simplified version of Mossel's Gaussian bounds for noise correlations and tight analysis of long codes, specialized to the parts necessary to obtain "Majority is most predictable:" (PDF) Back to the main page. bjuba AT mit DOT edu