 For instance, we provide a (randomized)algorithm computing a maximum cardinality matching in an unweighted bipartite graph in O(\log^2 n \cdot \epsilon ^{-1} ) passes, using O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.
<meaning-changed>  For instance, we provide a (randomized)algorithm computing a maximum cardinality matching in an unweighted bipartite graph in O(\log^2 n \cdot \epsilon ^{-1} ) passes, using O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.
 For instance, we provide a (randomized)algorithm computing a maximum cardinality matching in an unweighted bipartite graph in O(\log^2 n \cdot \epsilon ^{-1} )-pass semi-streaming algorithms for computing (1-\epsilon)-approximate maximum cardinality matchings in bipartite graphs. Our most efficient methods are deterministic and use optimal, O(n \log^2 n \cdot \epsilon^{-1)auxiliary memory.