Two time-space tradeoffs for element distinctness are given. The first one shows on a branching program using minimum operations. By a result of Yao (1982), this implies the same bounds for linear queries. The second result extends one by Duris and Galil (1984) who constructed a Boolean function that requires on a k-headed Turing machine. Here it is shown that their proof also holds for element distinctness, a more natural problem.