Union-find data structures have an inverse-Ackermann lower bound &Omega;(<i>n &alpha;</i>(<i>n</i>)), see Wikipedia.