Jason M. Rute

According to our database, Jason M. Rute authored at least 6 papers between 2012 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2019

Algorithmic barriers to representing conditional independence.

Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

On the computability of graphons.

Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute

CoRR, 2018

2015

A formal proof of the Kepler conjecture.

Thomas C. Hales, Mark Adams, Gertrud Bauer, Dat Tat Dang, John Harrison, Truong Le Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Thang Tat Nguyen, Truong Quang Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason M. Rute, Alexey Solovyev, An Hoai Thi Ta, Trung Nam Tran, Diep Thi Trieu, Josef Urban, Ky Khac Vu, Roland Zumkeller

CoRR, 2015

2014

Algorithmic randomness for Doob's martingale convergence theorem in continuous time.

Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen, Jason M. Rute

Log. Methods Comput. Sci., 2014

2012

A metastable dominated convergence theorem.

Jeremy Avigad, Edward T. Dean, Jason M. Rute

J. Log. Anal., 2012

Algorithmic randomness, reverse mathematics, and the dominated convergence theorem.

Jeremy Avigad, Edward T. Dean, Jason M. Rute

Ann. Pure Appl. Log., 2012