Qual Exams

[1.]   Andrej Bogdonov, Computer science, U.C. Berkeley, final exam. 

Thesis titled: "On the relation between worst-case and average-case complexity for NP", submitted 2005.

[2.]   Nicholas Eriksson, Mathematics, U.C. Berkeley, qualifying exam.

Thesis titled: "Algebraic combinatorics in computational biology", submitted 2006.
[3.] Elitza Nikolaeva Maneva, Computer Science, qualifying exam, Dec 2004
Thesis Title: Belief Propagation Algorithms for Constraint Satisfiaction Problems, submitted, Fall 2006.

[4.]  Jommy Joseph Alappattu, Mathematics, qualifying exam, Aug 2004.

Thesis titled: "Algorithms for the construction, fragmantaion and coalesence of random trees", submitted, Spring 2007.
[5.] Sabastien Roch, Statistics, U.C. Berkeley, qualifying exam, Nov 2005.             
Thesis titled: " Markov Models on Trees, Reconstruction and Applications", (thesis chair), Submitted, Spring 2007.
[6.] Hoeteck Wee, EECS, qualifying exam, Oct 2006.

              Thesis titled: "Black Block Complexity of Encrypton and Committment", Submitted, Fall 2007.
             [7.] Lionel Levine, Thesis Committee, Submitted Fall 2007.            
              "Limit Theorems for Internal Aggregation Models", Submitted, Fall 2007.

[8.] Mikhail Traskin, Statistics, U.C. Berkeley, chair of qualifying exam, May 2005.  

[9.] Yun Long,  Mathematics, U.C. Berkeley, qualifying exam, Oct 2005.  

            [10.] Peter Ralph, Statistics, chair of qualifying exam, Aug 2006
            [11.] Salman Avestimehr, EECS, qualifying exam, Aug 2006. 
            [12.] Alex Dimakis, EECS, qualifying exam, Aug 2006.