This dissertation is concerned with algebraic list-decoding of error-correcting codes. During the past decade, significant advances in this are were achieved. The breakthrough papers of Sudan, Guruswami & Sudan, and Koetter & Vardy showed that the well-known Reed-Solomon (and other algebraic) codes can correct many more errors---in the list-decoding sense---than previously thought possible. Herein, we extend the theory developed in these seminal papers, and improve upon the results reported therein.