This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...

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