Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
3 open access dissertations and theses found for:
if(Communication-minimizing)  »   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.
Identifying Emotional Intelligence and Metacognition in Medical Education
by Weigand, Robert, Ed.D.  University of New England. 2017: 101 pages; 10798589.
1 - 3 of 3 displayed.
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest