1. J. Backelin. 1989. Square multiples n give infinitely many cyclic n-roots. Reports Matematiska Institutionen 8. Stockholms universitet. J. Backelin. 1989. Square multiples n give infinitely many cyclic n-roots. Reports Matematiska Institutionen 8. Stockholms universitet.
2. The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
3. New classes of finite unimodular sequences with unimodular Fourier transforms. Circulant Hadamard matrices with complex entries;Bjöck G.;C. R. Acad. Sci. Paris, Série,1995
4. Scheduling multithreaded computations by work stealing
5. Computing tropical varieties