Speaker: Iftikhar Burhanuddin <br> 

Title: Some computational problems motivated by the BSD conjecture <br>  
Abstract:  
<br>
First, we will present a randomized algorithm which computes elliptic
curve rational torsion in softly linear expected running time.<p>

Next, we conjecturally relate via a polynomial-time reduction, a
subproblem of integer factoring to the problem of computing the
Mordell-Weil group of an elliptic curve from a special family.
This raises an interesting question about the growth of the height
of the generators of the above group with respect to the
discriminant of the elliptic curve. We gather numerical evidence
to shed light on this behavior.