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

Algorithms Unplugged
B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.

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

Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk
A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.

Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems
B. Sascha, Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems, 2011.

Stabilizing consensus with the power of two choices
B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.

Self-Stabilizing DeBruijn Networks
A.W. Richa, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–430.

Robust Distributed Computation in Dynamic Networks
P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.

PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned
K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.

Corona: A Stabilizing Deterministic Message-Passing Skip List
M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.

Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord
P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.

Algorithmische Grundlagen verteilter Speichersysteme
F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010) 468--474.

Foreword
C. Gavoille, B. Patt-Shamir, C. Scheideler, Theory of Computing Systems (2010) 809--810.

Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.

Brief announcement: towards robust medium access in multi-hop networks
A.W. Richa, J. Zhang, C. Scheideler, S. Schmid, in: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115.

A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 179--193.

Brief Announcement: Stabilizing Consensus with the Power of Two Choices
B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, Springer, 2010, pp. 528--530.

Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers
C. Scheideler, ed., Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers, 2010.

Foreword
R. D. Kleinberg, C. Scheideler, Theory Comput. Syst. (2009) 187.

Towards a Scalable and Robust DHT
B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009) 234--260.

Robust random number generation for peer-to-peer systems
B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009) 453--466.

A Distributed and Oblivious Heap
C. Scheideler, S. Schmid, in: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, Springer, 2009, pp. 571--582.

A Self-stabilizing and Local Delaunay Graph Construction
R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, in: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, Springer, 2009, pp. 771--780.

A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.

A DoS-resilient information system for dynamic data management
M. Baumgart, C. Scheideler, S. Schmid, in: SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.

Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization
D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, Springer, 2009, pp. 781--782.

Stabilizing Consensus with the Power of Two Choices
B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.

An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
C. Scheideler, A. W. Richa, P. Santi, in: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, ACM, 2008, pp. 91--100.

Algorithms for Overlay Networks
C. Scheideler, Bulletin of the EATCS (2008) 130--152.

A jamming-resistant MAC protocol for single-hop wireless networks
B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.

SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.

Tiara: A Self-stabilizing Deterministic Skip List
T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.

Broadcasting: Wie verbreite ich schnell Informationen?
C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.

INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland
H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, C. Scheideler, eds., INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland, 2008.

Taschenbuch der Algorithmen
B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Taschenbuch Der Algorithmen, 2008.

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007) 141--157.

Linearization: Locally Self-Stabilizing Sorting in Graphs
M. Onus, A. W. Richa, C. Scheideler, in: Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.

Towards Scalable and Robust Overlay Networks
B. Awerbuch, C. Scheideler, in: 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.

A denial-of-service resistant DHT
B. Awerbuch, C. Scheideler, in: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371.

A Denial-of-Service Resistant DHT
B. Awerbuch, C. Scheideler, in: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, Springer, 2007, pp. 33--47.

Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings
J. Aspnes, C. Scheideler, A. Arora, S. Madden, eds., Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings, 2007.

SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007
P. B. Gibbons, C. Scheideler, eds., SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, ACM, 2007.

Overlay Networks for Peer-to-Peer Networks
A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.

Dynamic and redundant data placement
A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Can ISPs and P users cooperate for improved performance?
V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.

Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.

Robust Random Number Generation for Peer-to-Peer Systems
B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.

Towards a scalable and robust DHT
B. Awerbuch, C. Scheideler, in: SPAA, 2006, pp. 318--327.

The Effect of Faults on Network Expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.

Towards a paradigm for robust distributed algorithms and data structures
C. Scheideler, in: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.

Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment
M. Korzeniowski, C. Scheideler, in: ISPAN, 2005, pp. 182--187.

Supervised Peer-to-Peer Systems
K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 188--193.

Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
M. Onus, A. W. Richa, K. Kothapalli, C. Scheideler, in: ISPAN, 2005, pp. 346--351.

Constant density spanners for wireless ad-hoc networks
K. Kothapalli, C. Scheideler, M. Onus, A. W. Richa, in: SPAA, 2005, pp. 116--125.

How to spread adversarial nodes?: rotate!
C. Scheideler, in: STOC, 2005, pp. 704--713.

Overlay networks for wireless ad hoc networks
C. Scheideler, in: IMA Workshop on Wireless Communications, 2005.

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.

Group Spreading: A Protocol for Provably Secure Distributed Name Service
B. Awerbuch, C. Scheideler, in: ICALP, 2004, pp. 183--195.

A Distributed Hash Table for Computational Grids
C. Riley, C. Scheideler, in: IPDPS, 2004.

Robust Distributed Name Service
B. Awerbuch, C. Scheideler, in: IPTPS, 2004, pp. 237--249.

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, in: IWIA, 2004, pp. 33--47.

The hyperring: a low-congestion deterministic data structure for distributed environments
B. Awerbuch, C. Scheideler, in: SODA, 2004, pp. 318--327.

Consistent and compact data management in distributed storage systems
B. Awerbuch, C. Scheideler, in: SPAA, 2004, pp. 44--53.

Pagoda: a dynamic overlay network for routing, data management, and multicasting
A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, M. Thober, in: SPAA, 2004, pp. 170--179.

The effect of faults on network expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, in: SPAA, ACM, 2004, pp. 286--293.

Storage Management as Means to cope with Exponential Information Growth
C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, U. Rückert, in: Proceedings of SSGRR 2003, 2003.

Smoothed Motion Complexity
V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, in: ESA, Springer, 2003, pp. 161--171.

Anycasting in Adversarial Systems: Routing and Admission Control
B. Awerbuch, A. Brinkmann, C. Scheideler, in: ICALP, Springer, 2003, pp. 1153--1168.

Peer-to-peer systems for prefix search
B. Awerbuch, C. Scheideler, in: PODC, ACM, 2003, pp. 123--132.

Perfectly Balanced Allocation
A. Czumaj, C. Riley, C. Scheideler, in: RANDOM-APPROX, Springer, 2003, pp. 240--251.

On local algorithms for topology control and routing in ad hoc networks
L. Jia, R. Rajaraman, C. Scheideler, in: SPAA, ACM, 2003, pp. 220--229.

Information gathering in adversarial systems: lines and cycles
K. Kothapalli, C. Scheideler, in: SPAA, ACM, 2003, pp. 333--342.

Improved Bounds for Acyclic Job Shop Scheduling
U. Feige, C. Scheideler, Combinatorica (2002) 361--399.

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.

Compact, adaptive placement schemes for non-uniform requirements
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.

Algorithms for fault-tolerant routing in circuit switched networks
A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.

Models and Techniques for Communication in Dynamic Networks
C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols
F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.

Simple Routing Strategies for Adversarial Systems
B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE Computer Society, 2001, pp. 158--167.

SIMLAB-A Simulation Environment for Storage Area Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society, 2001, pp. 227--234.

Simple on-line algorithms for the maximum disjoint paths problem
P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.

Efficient Communication Strategies for Ad Hoc Wireless Networks
M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.

Distributed Path Selection for Storage Networks
P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.

Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma
A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.

Efficient, distributed data placement strategies for storage area networks (extended abstract)
A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)
A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.

A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems 
A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.

Simple, Efficient Routing Schemes for All-Optical Networks
M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.

Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.

Simple Competitive Request Scheduling Strategies
P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.

Design of the PRESTO Multimedia Storage Network (Extended Abstract)
P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.

From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.

Universal Continuous Routing Strategies
C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.

Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.

Universal Routing Strategies for Interconnection Networks
C. Scheideler, Universal Routing Strategies for Interconnection Networks, 1998.