  Based on the general strategy described by Borel and Serre and the Voronoi
algorithm for computing unit groups of orders we present an algorithm for
finding presentations of $S$-unit groups of orders. The algorithm is then used
for some investigations concerning the congruence subgroup property.

Number Theory