PhD Seminar • Networks and Distributed Systems — Work-Stealing, Locality-Aware Actor Scheduling
Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science
Saman Barghi, PhD candidate
David R. Cheriton School of Computer Science
Marijn Heule, Research Assistant Professor
University of Texas at Austin
Progress in satisfiability (SAT) solving has enabled answering long-standing open questions in mathematics completely automatically, resulting in clever though potentially gigantic proofs. We illustrate the success of this approach by presenting the solution of the Boolean Pythagorean triples problem. We also produced and validated a proof of the solution, which has been called the "largest math proof ever."
Joe Mitchell
Department of Applied Mathematics and Statistics
State University of New York at Stony Brook
Xiao-Bo Li, PhD candidate
David R. Cheriton School of Computer Science
Dimitrios Skrepetos, PhD candidate
David R. Cheriton School of Computer Science
Nisarg Shah, Department of Computer Science
University of Toronto
Fiodar Kazhamiaka, PhD candidate
David R. Cheriton School of Computer Science
Priyank Jaini, PhD candidate
David R. Cheriton School of Computer Science
Stephen Askew, Master’s candidate
David R. Cheriton School of Computer Science
Edward Zulkoski, PhD candidate
David R. Cheriton School of Computer Science