Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
4 open access dissertations and theses found for:
if(I/O-complexity)  »   Refine Search
1.
An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing
by Scott, Jacob N., Ph.D.  University of California, Berkeley. 2015: 113 pages; 10086162.
2.
Queue Streaming Model: Theory, Algorithms, and Implementation
by Zope, Anup D., Ph.D.  Mississippi State University. 2019: 215 pages; 13860290.
3.
Topics in communication avoiding algorithms and stability analysis
by Lowery, Bradley R., Ph.D.  University of Colorado at Denver. 2014: 136 pages; 3621837.
4.
Provably Efficient Algorithms for Numerical Tensor Algebra
by Solomonik, Edgar, Ph.D.  University of California, Berkeley. 2014: 256 pages; 3686016.
1 - 4 of 4 displayed.
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest