[Cai2014]J. Cai, B. Macready, and A. Roy, (2014). A Practical Heuristic for Finding Graph Minors. arXiv:1406.2741.
[Denchev2015]V.S. Denchev, S. Boixo, S.V. Isakov, N. Ding, R. Babbush, V. Smelyanskiy, J. Martinis, and H. Neven (2015). What is the Computational Value of Finite Range Tunneling?, arXiv:1512.02206.
[Douglass2015]A. Douglass, A.D. King, and J. Raymond, (2015). Constructing SAT Filters with a Quantum Annealer, Theory and Applications of Satisfiability Testing, pp. 104–120. Springer International Publishing.
[Efron1982]B. Efron, (1982). The Jackknife, the Bootstrap, and Other Resampling Plans. Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN 9781611970319.
[Grassberger2008]P. Grassberger, (2008). Entropy Estimates from Insufficient Samplings, arXiv:physics/0307138v2.
[Jensen1990]F.V. Jensen, S.L. Lauritzen, and K.G. Olesen (1990). Bayesian updating in causal probabilistic networks by local computations, Computational Statistics Quarterly, vol. 4, p. 269-282.
[Markowitz1957]H.M. Markowitz (1957). The Elimination Form of the Inverse and its Application to Linear Programming, Management Science, vol. 3, no. 3, p. 255-269.
[Raymond2016]J. Raymond, S. Yarkoni and E. Andriyash (2016). Global Warming: Temperature Estimation in Annealers, arXiv:1606.00919.