Suess, T., Koch, C., Jähn, C., &; Fischer, M. (2011). Approximative occlusion culling using the hull tree. In S. Brooks &; P. Irani (Eds.), Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada (pp. 79--86). Canadian Human-Computer Communications Society.

Klaas, A., Laroque, C., Dangelmaier, W., &; Fischer, M. (2011). Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In Proceedings of the 2011 Winter Simulation Conference (WSC).https://doi.org/10.1109/wsc.2011.6147883 

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

Suess, T. (2011). Parallel Real-Time Rendering using Heterogeneous PC Clusters.

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). 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 (pp. 507--516). IEEE Computer Society.https://doi.org/10.1109/ICDCS.2011.8 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). 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 (pp. 33--36). ACM.https://doi.org/10.1145/2030686.2030697 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). 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 (p. 15). ACM.https://doi.org/10.1145/2107502.2107522 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2011). 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) (pp. 235--244).https://doi.org/10.1145/1989493.1989527 

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

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

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

Kniesburges, S., &; Scheideler, C. (2011). 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 (Vol. 6552, pp. 170--181). Springer.https://doi.org/10.1007/978-3-642-19094-0_18 

Scheideler, C., &; Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer.https://doi.org/10.1007/978-1-4614-1168-0_9 

Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer.https://doi.org/10.1007/978-3-642-15328-0_22 

Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &; Wagner, D. (2011). Algorithms Unplugged.https://doi.org/10.1007/978-3-642-15328-0 

Briest, P., &; Raupach, C. (2011). The car sharing problem. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989518 

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

Kolman, P., &; Scheideler, C. (2011). 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 (pp. 129--140).https://doi.org/10.4230/LIPIcs.STACS.2011.129 

Briest, P., Krysta, P., &; Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. SIAM Journal on Computing, 1587–1622.https://doi.org/10.1137/090772988 

Briest, P., &; Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. SIAM Journal on Computing, 1554–1586.https://doi.org/10.1137/090752353