Achtung:

Sie haben Javascript deaktiviert!
Sie haben versucht eine Funktion zu nutzen, die nur mit Javascript möglich ist. Um sämtliche Funktionalitäten unserer Internetseite zu nutzen, aktivieren Sie bitte Javascript in Ihrem Browser.

Bildinformationen anzeigen

Prof. Dr. Christian Scheideler

Kontakt
Vita
Prof. Dr. Christian Scheideler

Theorie verteilter Systeme

Leiter - Professor

Telefon:
+49 5251 60-6728
Fax:
+49 5251 60-6697
Büro:
F2.326
Sprechzeiten:

Nach Vereinbarung. Bitte kontaktieren Sie das Sekretariat.

Web:
Besucher:
Fürstenallee 11
33102 Paderborn

Sonderforschungsbereich 901

Mitglied - Professor - Teilprojektleiter

Prof. Dr. Christian Scheideler
03/2009 - heute

Professor

Professor im Institut für Informatik, Universität Paderborn

09/2005 - 02/2009

W2-Professor

Technische Universität München

09/2000 - 08/2005

Assistant Professor

Johns Hopkins University

Lehr- und Forschungsschwerpunkte:

  • Verteilte Algorithmen und Datenstrukturen
  • Sicherheit in verteilten Systemen
  • Randomisierte Algorithmen und stochastische Prozesse
  • Netzwerktheorie
    (insbesondere P2P Systeme, mobile ad-hoc Netzwerke und Sensor-Netzwerke)
  • Diskrete Mathematik

Weitere Funktionen

  • General Chair des ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2015-2020
  • Sekretär des ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2007-2015
  • Associate Editor des Journal of the ACM
  • Associate Editor des Journal of Computer and System Sciences
  • Managing Editor des Journal of Interconnection Networks
  • Steering Committee der SIROCCO, 2015-2019, ab 2020
  • PC Chair der SIROCCO 2020
  • Co-PC Chair der SSS 2021 (Track Fault-tolerance, Security, and Privacy)
  • Co-Organisator des Workshops Rapid Reconfiguration of Programmable Matter (co-located with UCNC 2021)
  • PC member von ALGOSENSORS 2020, APoCS 2020, DISC 2020, ICALP 2020, IPDPS 2020, SSS 2020, ICDCS 2021, PODC 2021, SIROCCO 2021, UCNC 2021
  • Stellvertretender Sprecher des Fachbereichs „Grundlagen der Informatik“ in der Gesellschaft für Informatik

Veröffentlichungen (RIS-DB)


Liste im Research Information System öffnen

2011

Competitive and Fair Medium Access Despite Reactive Jamming

A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516

DOI


Towards jamming-resistant and competitive medium access in the SINR model

A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36

DOI


Self-stabilizing leader election for single-hop wireless networks despite jamming

A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, pp. 15

DOI


Re-Chord: a self-stabilizing chord overlay network

S. Kniesburges, A. Koutsopoulos, C. Scheideler, 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

DOI


Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems

S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181

DOI


2010

Algorithmische Grundlagen verteilter Speichersysteme

F. Meyer auf der Heide, C. Scheideler, Informatik Spektrum (2010)(5), pp. 468--474

DOI


Foreword

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

DOI


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

DOI


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

DOI


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

DOI


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

DOI



2009

Foreword

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

DOI


Towards a Scalable and Robust DHT

B. Awerbuch, C. Scheideler, Theory Comput. Syst. (2009)(2), pp. 234--260

DOI


Robust random number generation for peer-to-peer systems

B. Awerbuch, C. Scheideler, Theor. Comput. Sci. (2009)(6-7), pp. 453--466

DOI


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

DOI


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

DOI


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

DOI


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

DOI


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

DOI


2008

Algorithms for Overlay Networks

C. Scheideler, Bulletin of the EATCS (2008), pp. 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

DOI


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

DOI


Broadcasting: Wie verbreite ich schnell Informationen?

C. Scheideler, in: Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236

DOI



2007

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks

A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, SIAM J. Discrete Math. (2007)(1), pp. 141--157

DOI


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

DOI


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

DOI




Overlay Networks for Peer-to-Peer Networks

A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007

DOI


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

We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices.


Can ISPs and P2P users cooperate for improved performance?

V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007)

DOI


2006

Improved bounds for the unsplittable flow problem

P. Kolman, C. Scheideler, J. Algorithms (2006), 61(1), pp. 20--44

DOI


Survivable Monitoring in Dynamic Networks

G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006)(9), pp. 1242--1254

DOI


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)(6), pp. 903--928

DOI


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


2005


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


2004

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem

P. Kolman, C. Scheideler, Algorithmica (2004)(3), pp. 209--233

DOI




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




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


2003

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

The advances in Internet technology have led to tremendous improvements in business, education, and science and have changed the way we think, live, and communicate. Information exchange has become ubiquitous by the possibilities offered through modern technologies. We are able to offer information 24 hours a day through our web sites and can leave messages every time and from anywhere in the world. This change in communication has led to new challenges. Enterprises have to deal with an information amount that doubles every year. The technological foundation to cope with this information explosion is given by Storage Area Networks (SANs), which are able to connect a great number of storage systems over a fast interconnection network. However, to be able to use the benefits of a SAN, an easy-to-use and efficient management support has to be given to the storage administrator. In this paper, we will suggest new storage management concepts and we will introduce a new management environment that is able to significantly reduce management costs and increases the performance and resource utilization of the given SAN infrastructure.


Smoothed Motion Complexity

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

DOI


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


2002

Improved Bounds for Acyclic Job Shop Scheduling

U. Feige, C. Scheideler, Combinatorica (2002)(3), pp. 361--399

DOI


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


2001

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols

F. Meyer auf der Heide, C. Scheideler, Combinatorica (2001), 21(1), pp. 95--138

DOI


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



2000

Efficient Communication Strategies for Ad Hoc Wireless Networks

M. Adler, C. Scheideler, Theory Comput. Syst. (2000), 33(5/6), pp. 337--391

DOI


From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

C. Scheideler, B. Vöcking, SIAM J. Comput. (2000), 30(4), pp. 1126--1155

DOI


Distributed Path Selection for Storage Networks

P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000



Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma

A. Czumaj, C. Scheideler, Random Struct. Algorithms (2000), 17(3-4), pp. 213--237





1999

Simple, Efficient Routing Schemes for All-Optical Networks

M. Flammini, C. Scheideler, Theory Comput. Syst. (1999), 32(3), pp. 387--420

DOI



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



1998

Universal Continuous Routing Strategies

C. Scheideler, B. Vöcking, Theory Comput. Syst. (1998), 31(4), pp. 425--449

DOI




1997

Optimal Wormhole Routing in the (n, d)-Torus

S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer Society, 1997, pp. 326--332


Simple, Efficient Routing Schemes for All-Optical Networks

M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179


1996

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations

F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996)(2), pp. 245--281

DOI


Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols

F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379


Communication in Parallel Systems

F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33


Universal Algorithms for Store-and-Forward and Wormhole Routing

R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365


1995

Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks

F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354


Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)

F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146


Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations

F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278


Liste im Research Information System öffnen

Die Universität der Informationsgesellschaft