They develop an efficient algorithm to discover and constrain all multi-cycle paths in a circuit, while considering every reachable circuit state.
[3] does not report the speedup offered by multi-cycling in isolation; rather, it presents results for multi-cycling combined with bitlevel optimizations and control-flow graph restructuring.