 |
candidate for the ph.d. in mathematics, university of california, berkeley. i expect to complete my degree in may 2010. |
advisors
Leo Harrington
Tom Scanlon
research summary
My research focuses the model theory of axiomatizable classes of finite structures. More specifically, on recovering structural
properties (notions of independence) from computational hypotheses.
I am also interested in infinite-model theory -- specifically, representations of independence relations -- and in algorithm design
in biology and finance.
My CV.
papers
Maximal Accurate Forests from Distance Matrices, with Constantinos Daskalakis, Alexander Jaffe, Radu Mihaescu,
Elchanan Mossel, Satish Rao. RECOMB 2006: 281-295.
Fast phylogeny reconstruction through learning of ancestral sequences, with Radu Mihaescu and Satish Rao.
CoRR abs/0812.1587: (2008). (submitted to Algorithmica)
Efficiently inverting the L^2-invariant through stability theory (extended abstract).
Submitted to Logical Approaches to Barriers in Computing and Complexity 2010.
teaching
This semester, I will be absent from Berkeley, but I am (remotely) coordinating the mentorship program for
first-year graduate students in the Mathematics department.
Reimbursement form
Leo Harrington
Tom Scanlon
research summary
My research focuses the model theory of axiomatizable classes of finite structures. More specifically, on recovering structural
properties (notions of independence) from computational hypotheses.
I am also interested in infinite-model theory -- specifically, representations of independence relations -- and in algorithm design
in biology and finance.
My CV.
papers
Maximal Accurate Forests from Distance Matrices, with Constantinos Daskalakis, Alexander Jaffe, Radu Mihaescu,
Elchanan Mossel, Satish Rao. RECOMB 2006: 281-295.
Fast phylogeny reconstruction through learning of ancestral sequences, with Radu Mihaescu and Satish Rao.
CoRR abs/0812.1587: (2008). (submitted to Algorithmica)
Efficiently inverting the L^2-invariant through stability theory (extended abstract).
Submitted to Logical Approaches to Barriers in Computing and Complexity 2010.
teaching
This semester, I will be absent from Berkeley, but I am (remotely) coordinating the mentorship program for
first-year graduate students in the Mathematics department.
Reimbursement form