Personal Profile of
Dr. Kathleen M. O'Hara

Associate Director of
the Mathematical Sciences Research Institute (MSRI), Berkeley, CA.

Article
with photograph (p. 28) of Dr. Kathleen M. O'Hara

Promoting Diversity at
the Graduate Level in Mathematics: A National Forum (2008).

Mathematics
Genealogy Project: Kathleen Marie O'Hara

Ph.D. University of
California, Berkeley 1984: Dissertation on the Structure and Complexity
of
the Involution Principle for Partitions.

Geometry and
complexity of O'Hara's algorithm (1), (2), (3)

In this
paper by Matjaz Konvalinka and Igor Pak (arXiv.org >
Mathematics > Combinatorics) the authors analyze
O'Hara's partition bijection. They present three type of results.
First, they show that O'Hara's bijection can be viewed geometrically as
a certain scissor congruence type result. Second, they obtain a number
of new complexity bounds, proving that O'Hara's bijection is efficient
in several special cases and mildly exponential in general. Finally,
they prove that for identities with finite support, the map of the
O'Hara's bijection can be computed in polynomial time, i.e. much more
efficiently than by O'Hara's construction (Cornell University Library).

Article
on a mathematical proof of Kathy O'Hara

Article by Doron
Zeilberger on Kathy O'Hara's Constructive Proof of the Unimodality of
the Gaussian Polynomials.

Article
on O’Hara's Unimodality Proof

Article by Dennis Stanton and Doron Zeilberger.