Speaker: Steve Donnelly Title: Descent algorithms for elliptic curves, Part 3 Time & Place: 3:05-4pm, Thursday 24 June, Carslaw 173 Abstract: This talk will summarize some distinctive features of 4-descent and of 3-descent. Also it will begin to discuss the problem of finding "nice" models of the covering curves, via linear change of variables (in fact this breaks into two algorithmic problems, referred to as "minimisation" and "reduction").