  We develop algorithms to turn quotients of rings of rings of integers into
effective Euclidean rings by giving polynomial algorithms for all fundamental
ring operations. In addition, we study normal forms for modules over such rings
and their behavior under certain quotients. We illustrate the power of our
ideas in a new modular normal form algorithm for modules over rings of
integers, vastly outperforming classical algorithms.
