A work-efficient deterministic algorithm is presented for finding a maximum matching in a bipartite expander graph with any expansion factor β > 1. This improves upon a recently presented deterministic maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (β ≥ Δ∊, ∊ > 0), and is not work-efficient [1].