M. Fockel, D. Travkin, and M. von Detten, “Interpreting Story Diagrams for the Static Detection of Software Patterns,” 2011.

T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.

A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.

T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in Augmented &; Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.

T. Suess, Parallel Real-Time Rendering using Heterogeneous PC Clusters. Universität Paderborn, 2011.

A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, 2011, pp. 507--516.

A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, 2011, pp. 33--36.

A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, 2011, p. 15.

S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011), 2011, pp. 235--244.

G. Frahling, Algorithms for Dynamic Geometric Data Streams, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.

S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011, vol. 6552, pp. 170--181.

C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.

C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in Algorithms Unplugged, Springer, 2011, pp. 223--229.

B. Vöcking et al., Algorithms Unplugged. 2011.

P. Briest and C. Raupach, “The car sharing problem,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011.

S. Effert, Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen. Universität Paderborn, 2011.

P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.

P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” SIAM Journal on Computing, pp. 1587–1622, 2011.