Before revision: We design an algorithm for computing connectivity in hypergraphs which runs in time \hat O_r(p + \min\{\lambda  n^2, n^r/\lambda  \}) (the \hat O_r(\cdot) hides the terms subpolynomial in the main parameter and terms that depend only on r) where p is the size, n is the number of vertices, and r is the rank of the hypergraph.
After revision: We design an algorithm for computing connectivity in hypergraphs which runs in time \hat O_r(p + \min\{\lambda ^{\frac{r-3 n^2, n^r/\lambda \}) (the \hat O_r(\cdot) hides the terms subpolynomial in the main parameter and terms that depend only on r) where p is the size, n is the number of vertices, and r is the rank of the hypergraph.