We construct a family of high order iteration functions for finding polynomial roots of a known multiplicity s. This family is a generalization of a fundamental family of high order algorithms for ...

This is a graduate topics course on learning in networks, focusing in particular on fundamental statistical and computational limits. Topics include the planted clique problem, community detection, ...

The M/G/c queue is separately treated. Two imposed prerequisites, that only minimal prior information about the queue will be required and that no numeric method be needed other than a root-finding ...