O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18, 2001.

M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), 2001, vol. 2064, pp. 378–388.

M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.

V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184.

J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp. 275–278.

M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01, 2001.

F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.

F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.

F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.

I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.