Study proposes a communication-efficient, divide and conquer algorithm that combines information from sub-machines using confidence distributions. The theoretical relationship between the number ...

MUEGANO: A divide and conquer algorithm to overcome memory limitations when assembling shotgun projects Octavio Martinez & Araceli Fernandez-Cortes Nature Precedings (2009) Cite this article ...

Students will practice algorithm design to solve complex computing problems. Exploration of algorithmic paradigms such as greedy algorithms, divide and conquer algorithms, and dynamic programming.

Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.