Jacob Scott

Dissertation Title: 

An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing

Contact Information
824 Evans Hall
jnscott [at] math [dot] berkeley [dot] edu
PhD Received: 
2015-12