<h1>Tamuz, Omer</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Arieli, Itai and Babichenkoyako, Yakov, el al. (2023) <a href="https://authors.library.caltech.edu/records/jhp7z-fw809">The Hazards and Benefits of Condescension in Social Learning</a>; ISBN 9798400701047; EC '23: Proceedings of the 24th ACM Conference on Economics and Computation; 119; <a href="https://doi.org/10.1145/3580507.3597752">10.1145/3580507.3597752</a></li>
<li>Huang, Wanying and Strack, Philipp, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220707-170550926">Learning in Repeated Interactions on Networks</a>; ISBN 978-1-4503-9150-4; Proceedings of the 23rd ACM Conference on Economics and Computation; 325; <a href="https://doi.org/10.1145/3490486.3538307">10.1145/3490486.3538307</a></li>
<li>Mu, Xiaosheng and Pomatto, Luciano, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210303-154811036">Monotone Additive Statistics</a>; ISBN 978-1-4503-9150-4; Proceedings of the 23rd ACM Conference on Economics and Computation; 34; <a href="https://doi.org/10.1145/3490486.3538318">10.1145/3490486.3538318</a></li>
<li>He, Kevin and Sandomirskiy, Fedor, el al. (2022) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220707-170554297">Private Private Information</a>; ISBN 978-1-4503-9150-4; Proceedings of the 23rd ACM Conference on Economics and Computation; 1145; <a href="https://doi.org/10.1145/3490486.3538348">10.1145/3490486.3538348</a></li>
<li>Galeotti, Andrea and Golub, Benjamin, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220707-170547552">Taxes and Market Power: A Principal Components Approach</a>; <a href="https://doi.org/10.48550/arXiv.2112.08153">10.48550/arXiv.2112.08153</a></li>
<li>Chase, Zachary and Hann-Caruthers, Wade, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200124-084913765">Additive conjugacy and the Bohr compactification of orthogonal representations</a>; Mathematische Annalen; Vol. 381; No. 1-2; 319-333; <a href="https://doi.org/10.1007/s00208-021-02191-w">10.1007/s00208-021-02191-w</a></li>
<li>Arieli, Itai and Babichenko, Yakov, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210727-175655408">Feasible Joint Posterior Beliefs</a>; Journal of Political Economy; Vol. 129; No. 9; 2546-2594; <a href="https://doi.org/10.1086/714993">10.1086/714993</a></li>
<li>Bikhchandani, Sushil and Hirshleifer, David, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220707-170537442">Information Cascades and Social Learning</a>; <a href="https://doi.org/10.48550/arXiv.2105.11044">10.48550/arXiv.2105.11044</a></li>
<li>Bartholdi, Laurent and Hann-Caruthers, Wade, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210414-131421263">Equitable Voting Rules</a>; Econometrica; Vol. 89; No. 2; 563-589; <a href="https://doi.org/10.3982/ecta17032">10.3982/ecta17032</a></li>
<li>Harel, Matan and Mossel, Elchanan, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-135545798">Rational Groupthink</a>; Quarterly Journal of Economics; Vol. 136; No. 1; 621-668; <a href="https://doi.org/10.1093/qje/qjaa026">10.1093/qje/qjaa026</a></li>
<li>Mu, Xiaosheng and Pomatto, Luciano, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200124-080643011">From Blackwell Dominance in Large Samples to Rényi Divergences and Back Again</a>; Econometrica; Vol. 89; No. 1; 475-506; <a href="https://doi.org/10.3982/ECTA17548">10.3982/ECTA17548</a></li>
<li>Basu, Pathikrit and Chatterjee, Kalyan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190628-075628753">Repeated Coordination with Private Learning</a>; Journal of Economic Theory; Vol. 190; Art. No. 105106; <a href="https://doi.org/10.1016/j.jet.2020.105106">10.1016/j.jet.2020.105106</a></li>
<li>Mu, Xiaosheng and Pomatto, Luciano, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210303-154333226">Background Risk and Small-Stakes Risk Aversion</a>; <a href="https://doi.org/10.48550/arXiv.2010.08033">10.48550/arXiv.2010.08033</a></li>
<li>Conley, Clinton T. and Tamuz, Omer (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200124-090354536">Unfriendly colorings of graphs with finite average degree</a>; Proceedings of the London Mathematical Society; Vol. 121; No. 4; 828-832; <a href="https://doi.org/10.1112/plms.12345">10.1112/plms.12345</a></li>
<li>Arieli, Itai and Babichenko, Yakov, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200615-155012317">Feasible Joint Posterior Beliefs</a>; ISBN 978-1-4503-7975-5; Proceedings of the 21st ACM Conference on Economics and Computation; 643; <a href="https://doi.org/10.1145/3391403.3399505">10.1145/3391403.3399505</a></li>
<li>Mossel, Elchanan and Mueller-Frank, Manuel, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200521-152747894">Social Learning Equilibria</a>; Econometrica; Vol. 88; No. 3; 1235-1267; <a href="https://doi.org/10.3982/ecta16465">10.3982/ecta16465</a></li>
<li>Pomatto, Luciano and Strack, Philipp, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190405-101226198">Stochastic Dominance Under Independent Noise</a>; Journal of Political Economy; Vol. 128; No. 5; 1877-1900; <a href="https://doi.org/10.1086/705555">10.1086/705555</a></li>
<li>Biringer, Ian and Bowen, Lewis, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170712-084843331">Invariant random subgroups of semidirect products</a>; Ergodic Theory and Dynamical Systems; Vol. 40; No. 2; 353-366; <a href="https://doi.org/10.1017/etds.2018.46">10.1017/etds.2018.46</a></li>
<li>Fritz, Tobias and Tamuz, Omer (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200123-105749369">There are no monotone homomorphisms out of the convolution semigroup</a>; <a href="https://doi.org/10.48550/arXiv.1912.01733">10.48550/arXiv.1912.01733</a></li>
<li>Frisch, Joshua and Tamuz, Omer, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191114-102021413">Strong amenability and the infinite conjugacy class property</a>; Inventiones Mathematicae; Vol. 218; No. 3; 833-851; <a href="https://doi.org/10.1007/s00222-019-00896-z">10.1007/s00222-019-00896-z</a></li>
<li>Frisch, Joshua and Tamuz, Omer (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200615-160518971">Characteristic measures of symbolic dynamical systems</a>; <a href="https://doi.org/10.48550/arXiv.1908.02930">10.48550/arXiv.1908.02930</a></li>
<li>Frisch, Joshua and Hartman, Yair, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190725-090144871">Choquet-Deny groups and the infinite conjugacy class property</a>; Annals of Mathematics; Vol. 190; No. 1; 307-320; <a href="https://doi.org/10.4007/annals.2019.190.1.5">10.4007/annals.2019.190.1.5</a></li>
<li>Bartholdi, Laurent and Hann-Caruthers, Wade, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190625-114737785">Equitable Voting Rules</a>; ISBN 978-1-4503-6792-9; Proceedings of the 2019 ACM Conference on Economics and Computation; 315; <a href="https://doi.org/10.1145/3328526.3329551">10.1145/3328526.3329551</a></li>
<li>Frisch, Joshua and Schlank, Tomer, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-133444186">Normal amenable subgroups of the automorphism group of the full shift</a>; Ergodic Theory and Dynamical Systems; Vol. 39; No. 5; 1290-1298; <a href="https://doi.org/10.1017/etds.2017.72">10.1017/etds.2017.72</a></li>
<li>Hartman, Yair and Juschenko, Kate, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-131006027">Thompson's group F is not strongly amenable</a>; Ergodic Theory and Dynamical Systems; Vol. 39; No. 4; 925-929; <a href="https://doi.org/10.1017/etds.2017.49">10.1017/etds.2017.49</a></li>
<li>Tamuz, Omer and Zheng, Tianyi (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200124-085648355">On the spectrum of asymptotic entropies of random walks</a>; <a href="https://doi.org/10.48550/arXiv.1903.01312">10.48550/arXiv.1903.01312</a></li>
<li>Pomatto, Luciano and Strack, Philipp, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190404-161816718">The cost of information</a>; <a href="https://doi.org/10.48550/arXiv.1812.04211">10.48550/arXiv.1812.04211</a></li>
<li>Mossel, Elchanan and Mueller-Frank, Manuel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-104138106">Social Learning Equilibria</a>; ISBN 978-1-4503-5829-3; Proceedings of the 2018 ACM Conference on Economics and Computation; 639; <a href="https://doi.org/10.1145/3219166.3219207">10.1145/3219166.3219207</a></li>
<li>Cheng, Yu and Hann-Caruthers, Wade, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181126-153354872">A Deterministic Protocol for Sequential Asymptotic Learning</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 1735-1738; <a href="https://doi.org/10.1109/ISIT.2018.8437859">10.1109/ISIT.2018.8437859</a></li>
<li>Tamuz, Omer and Vardi, Shai, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20191010-132749128">Non-Exploitable Protocols for Repeated Cake Cutting</a></li>
<li>Hann-Caruthers, Wade and Martynov, Vadim V., el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170712-081145954">The speed of sequential asymptotic learning</a>; Journal of Economic Theory; Vol. 173; 383-409; <a href="https://doi.org/10.1016/j.jet.2017.11.009">10.1016/j.jet.2017.11.009</a></li>
<li>Kempe, David and Schulman, Leonard J., el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180410-145958889">Quasi-regular sequences and optimal schedules for security games</a>; ISBN 978-1-6119-7503-1; Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms; 1625-1644; <a href="https://doi.org/10.1137/1.9781611975031.106">10.1137/1.9781611975031.106</a></li>
<li>Bowen, Lewis and Hartman, Yair, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-092928470">Generic Stationary Measures and Actions</a>; Transactions of the American Mathematical Society; Vol. 369; No. 7; 4889-4929; <a href="https://doi.org/10.1090/tran/6803">10.1090/tran/6803</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-150254761">Opinion Exchange Dynamics</a>; Probability Surveys; Vol. 14; 155-204; <a href="https://doi.org/10.1214/14-PS230">10.1214/14-PS230</a></li>
<li>Biringer, Ian and Bowen, Lewis, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200124-092403035">Invariant random subgroups of semidirect products</a>; <a href="https://doi.org/10.48550/arXiv.1703.01282">10.48550/arXiv.1703.01282</a></li>
<li>Biringer, Ian and Tamuz, Omer (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-145903029">Unimodularity of Invariant Random Subgroups</a>; Transactions of the American Mathematical Society; Vol. 369; 4043-4061; <a href="https://doi.org/10.1090/tran/6755">10.1090/tran/6755</a></li>
<li>Hartman, Yair and Tamuz, Omer (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-132848541">Stabilizer rigidity in irreducible group actions</a>; Israel Journal of Mathematics; Vol. 216; No. 2; 679-705; <a href="https://doi.org/10.1007/s11856-016-1424-4">10.1007/s11856-016-1424-4</a></li>
<li>Mossel, Elchanan and Olsman, Noah, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-074103834">Efficient Bayesian Learning in Social Networks with Gaussian Estimators</a>; ISBN 978-1-5090-4551-8; 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016; 425-432; <a href="https://doi.org/10.1109/ALLERTON.2016.7852341">10.1109/ALLERTON.2016.7852341</a></li>
<li>Frisch, Joshua and Tamuz, Omer (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-141028249">Transitive graphs uniquely determined by their local structure</a>; Proceedings of the American Mathematical Society; Vol. 144; No. 5; 1913-1918; <a href="https://doi.org/10.1090/proc/12901">10.1090/proc/12901</a></li>
<li>Babichenko, Yakov and Tamuz, Omer (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160603-083016959">Graphical potential games</a>; Journal of Economic Theory; Vol. 163; 889-899; <a href="https://doi.org/10.1016/j.jet.2016.03.010">10.1016/j.jet.2016.03.010</a></li>
<li>Burton, Peter and Lupini, Martino, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-122744051">Weak equivalence of stationary actions and the entropy realization problem</a>; <a href="https://doi.org/10.48550/arXiv.1603.05013">10.48550/arXiv.1603.05013</a></li>
<li>Bowen, Lewis and Hartman, Yair, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-141359999">Property (T) and the Furstenberg Entropy of Nonsingular Actions</a>; Proceedings of the American Mathematical Society; Vol. 144; No. 1; 31-39; <a href="https://doi.org/10.1090/proc/12685">10.1090/proc/12685</a></li>
<li>Mossel, Elchanan and Sly, Allan, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151029-144956303">Strategic Learning and the Topology of Social Networks</a>; Econometrica; Vol. 83; No. 5; 1755-1794; <a href="https://doi.org/10.3982/ECTA12058">10.3982/ECTA12058</a></li>
<li>Hartman, Yair and Tamuz, Omer (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-085457028">Furstenberg entropy realizations for virtually free groups and lamplighter groups</a>; Journal d'Analyse Mathématique; Vol. 126; No. 1; 227-257; <a href="https://doi.org/10.1007/s11854-015-0016-2">10.1007/s11854-015-0016-2</a></li>
<li>Frisch, Joshua and Tamuz, Omer (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-134938105">Symbolic dynamics on amenable groups: the entropy of generic shifts</a>; <a href="https://doi.org/10.48550/arXiv.1503.06251">10.48550/arXiv.1503.06251</a></li>
<li>Tamuz, Omer and Tessler, Ran J. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-074309531">Majority Dynamics and the Retention of Information</a>; Israel Journal of Mathematics; Vol. 206; No. 1; 483-507; <a href="https://doi.org/10.1007/s11856-014-1148-2">10.1007/s11856-014-1148-2</a></li>
<li>Finucane, Hilary and Tamuz, Omer, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-120309955">Scenery Reconstruction on Finite Abelian Groups</a>; Stochastic Processes and their Applications; Vol. 124; No. 8; 2754-2770; <a href="https://doi.org/10.1016/j.spa.2014.03.012">10.1016/j.spa.2014.03.012</a></li>
<li>Benjamini, Itai and Chan, Siu-On, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161111-145123837">Convergence, unanimity and disagreement in majority dynamics on unimodular graphs and random graphs</a>; <a href="https://doi.org/10.48550/arXiv.1405.2486">10.48550/arXiv.1405.2486</a></li>
<li>Mossel, Elchanan and Neeman, Joe, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-070336278">Majority Dynamics and Aggregation of Information in Social Networks</a>; Autonomous Agents and Mutli-Agent Systems; Vol. 28; No. 3; 408-429; <a href="https://doi.org/10.1007/s10458-013-9230-4">10.1007/s10458-013-9230-4</a></li>
<li>Mossel, Elchanan and Sly, Allan, el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-072802716">Asymptotic learning on Bayesian social networks</a>; Probability Theory and Related Fields; Vol. 158; No. 1-2; 127-157; <a href="https://doi.org/10.1007/s00440-013-0479-y">10.1007/s00440-013-0479-y</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-081650257">Making Consensus Tractable</a>; ACM Transactions on Economics and Computation; Vol. 1; No. 4; Art. No. 20; <a href="https://doi.org/10.1145/2542174.2542176">10.1145/2542174.2542176</a></li>
<li>Gur, Tom and Tamuz, Omer (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-144803099">Testing Booleanity and the Uncertainty Principle</a>; Chicago Journal of Theoretical Computer Science; Vol. 2013; Art. No. 14; <a href="https://doi.org/10.4086/cjtcs.2013.014">10.4086/cjtcs.2013.014</a></li>
<li>Tamuz, Omer (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-065718415">A lower bound on seller revenue in single buyer monopoly auctions</a>; Operations Research Letters; Vol. 41; No. 5; 474-476; <a href="https://doi.org/10.1016/j.orl.2013.05.011">10.1016/j.orl.2013.05.011</a></li>
<li>Menon, Aditya Krishna and Tamuz, Omer, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-080916122">Textual Features for Programming by Example</a>; <a href="https://doi.org/10.48550/arXiv.1209.3811">10.48550/arXiv.1209.3811</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-073042338">Complete Characterization of Functions Satisfying the Conditions of Arrow's Theorem</a>; Social Choice and Welfare; Vol. 39; No. 1; 127-140; <a href="https://doi.org/10.1007/s00355-011-0547-0">10.1007/s00355-011-0547-0</a></li>
<li>Hartman, Yair and Lima, Yuri, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-064703507">An Abramov formula for stationary spaces of discrete groups</a>; <a href="https://doi.org/10.48550/arXiv.1204.5414">10.48550/arXiv.1204.5414</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-143929904">Bundling Customers: How to Exploit Trust Among Customers to Maximize Seller Profit</a>; <a href="https://doi.org/10.48550/arXiv.1202.0969">10.48550/arXiv.1202.0969</a></li>
<li>Sivan, Balasubramanian and Syrgkanis, Vasilis, el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161114-082632264">Lower Bounds on Revenue of Approximately Optimal Auctions</a>; ISBN 978-3-642-35310-9; Internet and Network Economics; 526-531; <a href="https://doi.org/10.1007/978-3-642-35311-6_42">10.1007/978-3-642-35311-6_42</a></li>
<li>Frongillo, Rafael M. and Schoenebeck, Grant, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-121844664">Social Learning in a Changing World</a>; ISBN 978-3-642-25509-0; Internet and Network Economics; 146-157; <a href="https://doi.org/10.1007/978-3-642-25510-6_13">10.1007/978-3-642-25510-6_13</a></li>
<li>Tamuz, Omer and Liu, Ce, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-102619803">Adaptively Learning the Crowd Kernel</a>; ISBN 978-1-4503-0619-5; International Conference on Machine Learning; 673-680; <a href="https://doi.org/10.48550/arXiv.1105.1033">10.48550/arXiv.1105.1033</a></li>
<li>Kanoria, Yashodhan and Tamuz, Omer (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-083842987">Efficient Bayesian Social Learning on Trees</a>; <a href="https://doi.org/10.48550/arXiv.1102.1398">10.48550/arXiv.1102.1398</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-165317769">Iterative maximum likelihood on networks</a>; Advances in Applied Mathematics; Vol. 45; No. 1; 36-49; <a href="https://doi.org/10.1016/j.aam.2009.11.004">10.1016/j.aam.2009.11.004</a></li>
<li>Mossel, Elchanan and Tamuz, Omer (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161110-075056609">Truthful Fair Division</a>; ISBN 978-3-642-16169-8; Algorithmic Game Theory; 288-299; <a href="https://doi.org/10.1007/978-3-642-16170-4_25">10.1007/978-3-642-16170-4_25</a></li>
<li>Shporer, A. and Tamuz, O., el al. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-163957800">Photometric follow-up of the transiting planet WASP-1b</a>; Monthly Notices of the Royal Astronomical Society; Vol. 376; No. 3; 1296-1300; <a href="https://doi.org/10.1111/j.1365-2966.2007.11537.x">10.1111/j.1365-2966.2007.11537.x</a></li>
<li>Mazeh, T. and Tamuz, O., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161115-090420610">The Sys-Rem Detrending Algorithm: Implementation and Testing</a>; <a href="https://doi.org/10.48550/arXiv.0612418">10.48550/arXiv.0612418</a></li>
<li>Mazeh, Tsevi and Tamuz, Omer, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161115-085954023">Analysis of the eclipsing binaries in the LMC discovered by OGLE:  period distribution and frequency of the short-period binaries</a>; <a href="https://doi.org/10.48550/arXiv.0611482">10.48550/arXiv.0611482</a></li>
<li>Tamuz, O. and Mazeh, T., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-162833455">Automated analysis of eclipsing binary light curves - I. EBAS - a new Eclipsing Binary Automated Solver with EBOP</a>; Monthly Notices of the Royal Astronomical Society; Vol. 367; No. 4; 1521-1530; <a href="https://doi.org/10.1111/j.1365-2966.2006.10049.x">10.1111/j.1365-2966.2006.10049.x</a></li>
<li>Mazeh, T. and Tamuz, O., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-163450950">Automated analysis of eclipsing binary light curves - II. Statistical analysis of OGLE LMC eclipsing binaries</a>; Monthly Notices of the Royal Astronomical Society; Vol. 367; No. 4; 1531-1542; <a href="https://doi.org/10.1111/j.1365-2966.2006.10050.x">10.1111/j.1365-2966.2006.10050.x</a></li>
<li>Tamuz, O. and Mazeh, T., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161109-161950022">Correcting systematic effects in a large set of photometric light curves</a>; Monthly Notices of the Royal Astronomical Society; Vol. 356; No. 4; 1466-1470; <a href="https://doi.org/10.1111/j.1365-2966.2004.08585.x">10.1111/j.1365-2966.2004.08585.x</a></li>
</ul>