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.

Show image information

Conference Publications

To appear

M. Feldmann, C. Scheideler:
A Self-Stabilizing General De Bruijn Graph
In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS).

2017

R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler:
Distributed Monitoring of Network Properties: The Power of Hybrid Networks
In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017.

A. Koutsopoulos, C. Scheideler, T. Strothmann:
Towards a universal approach for the finite departure problem in overlay networks
Information and Computation, 2017

2016

C. Scheideler, A. Setzer, T. Strothmann
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
30th International Symposium on Distributed Computing (DISC), 2016.

R. Gmyr, J. Lefevre, C. Scheideler
Self-stabilizing Metric Graphs
In Stabilization, Safety, and Security of Distributed Systems - 18th International Symposium (SSS), 2016.

Z. Derakhshandeh, R. Gmyr, A. Porter, A.W. Richa, C. Scheideler, T. Strothmann
On the Runtime of Universal Coating for Programmable Matter
DNA Computing and Molecular Programming - 22st International Conference (DNA), 2016.

M. Drees, R. Gmyr, C. Scheideler
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.

Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T. Strothmann
Universal Shape Formation for Programmable Matter
28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016.

2015

C. Scheideler, A. Setzer and T. Strothmann
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
19th International Conference on Principles of Distributed Systems (OPODIS), 2015.

A. Koutsopoulos, C. Scheideler, T. Strothmann
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
17th International Symposium on Stabilization, Safety & Security in Distributed Systems (SSS), 2015.

Z. Derakhshandeh, R. Gmyr, T. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler
Leader Election and Shape Formation with Self-organizing Programmable Matter
21st International Conference on DNA Computing and Molecular Programming (DNA), 2015.

Z. Derakhshandeh, R. Gmyr, T. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler 
Brief Announcement: On the Feasability of Leader Election and Shape Formation with Self-Organizing Programmable Matter
2015 ACM Symposium on Principles of Distributed Computing 
(PODC) 2015.

A. Koutsopoulos, C. Scheideler, T. Strothmann
Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
27th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2015.

2014

M. Eikel, C. Scheideler and A.Setzer
RoBuSt: A Crash-Failure-Resistant Distributed Storage System
18th International Conference on Principles of Distributed Systems (OPODIS), 2014.

M. Eikel, C. Scheideler, A. Setzer
Minimum Linear Arrangement of Series-Parallel Graphs
12th Workshop on Approximation and Online Algorithms (WAOA), 2014.

S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler
Algorithmic Aspects of Resource Management in the Cloud
21th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2014.

B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, J. Zhang
Principles of Robust Medium Access and an Application to Leader Election
ACM Transactions on Algorithms, 2014.

D. Foreback, A. Koutsopoulos,  M. Nesterenko, C. Scheideler and T. Strothmann
On Stabilizing Departures in Overlay Networks
16th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS), 2014.

M. Feldotto, C. Scheideler and K. Graffi
HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths
In: Proceedings of the 14-th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014.

Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler and T. Strothmann
Brief announcement: Amoebot - a new model for programmable matter
27th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2014.

A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid and J.Zhang
Competitive MAC under adversarial SINR
In Proc. of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014.

2013

S. Kniesburges, A. Koutsopoulos and C.Scheideler
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) 2013.

S. Kniesburges, A. Koutsopoulos and C. Scheideler
CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system
27th International Symposium on Distributed Computing (DISC), 2013.

S. Dolev, R. Gmyr, A. Richa and C. Scheideler
Ameba-inspired Self-organizing Particle Systems
1st Workshop on Biological Distributed Algorithms (BDA), 2013.

A. Richa, C. Scheideler, S. Schmid and J. Zhang
An Efficient and Fair MAC Protocol Robust to Reactive Interference
IEEE/ACM Transactions on Networking Vol. 21(3), 2013.

C. Avin, B. Haeupler, Zvi Lotker, C. Scheideler and S. Schmid
Locally Self-Adjusting Tree Networks
In the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013.

M. Eikel and C. Scheideler.
IRIS: A Robust Information System Against Insider DoS-Attacks
In the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013.

2012

S. Kniesburges and C. Scheideler.
Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems
In the 26th International Symposium on DIStributed Computing (DISC), 2012.

S. Schmid, C. Avin, C. Scheideler, B. Haeupler and Z. Lotker.
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures
In the 26th International Symposium on DIStributed Computing (DISC), 2012.

A. W. Richa, C. Scheideler, S. Schmid and J. Zhang.
Competitive and fair troughput for co-existing networks under adversarial interference
In the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012.

S. Kniesburges, A. Koutsopoulos and C. Scheideler.
A Self-Stabilization Process for Small-World Networks
In the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012.

M. Drees, M. Hüllmann, A. Koutsopoulos and C. Scheideler.
Self-organizing Particle Systems
In the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012.

P. Kolman and C. Scheideler.
Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
In the 23th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012.

2011

R. M. Nor, M. Nesterenko and C. Scheideler.
Corona: A Stabilizing Deterministic Message-Passing Skip List
In the 23th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011.

A. W. Richa, C. Scheideler and Phillip Stevens.
Self-Stabilizing DeBruijn Networks
In the 23th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011.

A. W. Richa, C. Scheideler, S. Schmid and J. Zhang.
Competetive and Fair Medium Access Despite Reactive Jamming
In the 31st International Conference on Distributed Computing Systems (ICDCS), 2011.

B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald and C. Scheideler.
Stabilizing Consensus with the Power of Two Choices
In the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011.

S. Kniesburges, A. Koutsopoulos and C. Scheideler.
Re-Chord: a self-stabilizing chord overlay network
In the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011.

P. Kolman and C. Scheideler.
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
In the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), 2011.

S. Kniesburges and C. Scheideler.
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
In the 5th International Workshop on Algorithms and Computation (WALCOM), 2011.

2010

A. W. Richa, C. Scheideler, S. Schmid and Jin Zhang.
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
In the 24th International Symposium on Distributed Computing (DISC), 2010.

B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald and C. Scheideler.
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In the 24th International Symposium on Distributed Computing (DISC), 2010.

D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig.
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
In the 9th Latin American Symposium on Theoretical Informatics (LATIN), 2010.

A. W. Richa, J. Zhang, C. Scheideler and S. Schmid.
Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks
In the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2010.

2009

R. Jacob, S. Ritscher, C. Scheideler and S. Schmid.
A self-stabilizing local Delaunay graph construction

In the 20th Intl. Symp. on Algorithms and Computation (ISAAC), 2009.

R. Jacob, A. Richa, C. Scheideler, S. Schmid and H. Täubig.
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
In the 28th ACM Symp. on Principles of Distributed Computing (PODC), 2009.

M. Baumgart, C. Scheideler and S. Schmid.
A DoS-resilient information system for dynamic data management
In the 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), 2009.

C. Scheideler and S. Schmid.
A distributed and oblivious heap
In the 36th Intl. Colloquium on Automata, Languages and Programming (ICALP), 2009.

2008

T. Clouser, M. Nesterenko and C. Scheideler.
Tiara: A self-stabilizing deterministic skip list
In the 10th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS), 2008.

B. Awerbuch, A. Richa and C. Scheideler.
A jamming-resistant MAC protocol for single-hop wireless networks
In the 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.

C. Scheideler, A. Richa and P. Santi.
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
In the 9th ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), 2008.

M. Mense and C. Scheideler.
SPREAD: An adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
In the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008.

2007

B. Awerbuch and C. Scheideler.
A denial-of-service resistant DHT

In 21st International Symposium on Distributed Computing (DISC), 2007. A brief announcement also appeared in the 26th ACM Symposium on Principles of Distributed Computing (PODC), 2007.

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

B. Awerbuch and C. Scheideler.
Towards scalable and robust overlay networks
In the 6th Intl. Workshop on Peer-to-Peer Szstems (IPTPS), 2007.

M. Onus, A. Richa and C. Scheideler.
Linearization: Locally self-stabilizing sorting in graphs
To appear in the Workshop on Algorithm Engineering and Experiments (ALENEX), 2007.

2006

B. Awerbuch and C. Scheideler.
Robust random number generation for peer-to-peer systems
To appear in 10th Int. Conference On Principles of Distributed Systems (OPODIS), 2006.

B. Awerbuch and C. Scheideler.
Towards a scalable and robust DHT
In 18th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), 2006.

K. Kothapalli, M. Onus, C. Scheideler and C. Schindelhauer.
Distributed coloring in O(sqrt{log n}) bit rounds
In IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006.

C. Scheideler.
Towards a paradigm for robust distributed algorithms and data structures
In 6th Int. HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.
(Here is also the talk, last updated 09/01/06. Also a header file for the Subjects simulation environment and an example program are available for C++.)

2005

C. Scheideler.
Overlay networks for wireless ad hoc networks
In the Proceedings of the IMA Workshop on Wirless Communications, 2005.

K. Kothapalli, M. Onus, A. Richa and C. Scheideler.
Efficient broadcasting and gathering in wireless ad-hoc networks
In Proc. of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pp. 346-351, 2005.

K. Kothapalli and C. Scheideler.
Supervised peer-to-peer systems
In Proc. of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pp. 188-193, 2005.

M. Korzeniowski and C. Scheideler.
Transparent data structures, or how to make search trees robust in a distributed environment
In Proc. of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pp. 182--187, 2005.

K. Kothapalli, M. Onus, A. Richa and C. Scheideler.
Constant density spanners for wireless ad-hoc networks
In Proc. 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2005.

C. Scheideler.
How to spread adversarial nodes? Rotate!
In Proc. 37th ACM Symposium on Theory of Computing (STOC), 2005.

2004

B. Awerbuch and C. Scheideler.
Group Spreading: A protocol for provably secure distributed name service
In Proc. 31st Int. Colloquium on Automata, Languages, and Programming (ICALP), 2004.

A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler.
The effects of faults on network expansion
In Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004.

A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober.
Pagoda: A dynamic overlay network for routing, data management, and multicasting
In Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004.

B. Awerbuch and C. Scheideler.
Consistent and compact data management in distributed storage systems
In Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2004.

C. Riley and C. Scheideler
A distributed hash table for computational grids
In IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2004.

G. Ateniese, C. Riley, and C. Scheideler
Survivable monitoring in dynamic networks
In 2nd IEEE International Information Assurance Workshop, 2004.

C. Riley and C. Scheideler
Local load balancing in distributed hash tables
Unpublished manuscript, Johns Hopkins University, February 2004.

B. Awerbuch and C. Scheideler
Robust distributed name service
In 3rd Internation Workshop on Peer-to-Peer Systems (IPTPS), 2004.

C. Scheideler and A. Terzis
PALATIN: A platform for interactive algorithms
In 2004 International Zurich Seminar on Communications.

C. Riley and C. Scheideler
Guaranteed broadcasting using SPON: Supervised P2P overlay network
In 2004 International Zurich Seminar on Communications.

B. Awerbuch and C. Scheideler
The Hyperring: A low-congestion deterministic data structure for distributed environments
In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.

2003

V. Damerov, F. Meyer auf der Heide, H. Raecke, C. Scheideler, and C. Sohler
Smoothed motion complexity
In Proc. 11th European Symposium on Algorithms (ESA), 2003.

A. Czumaj, C. Riley, and C. Scheideler
Perfectly balanced allocation
In RANDOM 2003.

B. Awerbuch and C. Scheideler
Peer-to-peer systems for prefix search
In Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2003.

B. Awerbuch and C. Scheideler
Chord++: Low-congestion routing in Chord
Unpublished manuscript, Johns Hopkins University, June 2003.

B. Awerbuch, A. Brinkmann, and C. Scheideler
Anycasting in adversarial systems: Routing and admission control
In 30th International Colloquium on Automata, Languages, and Programming (ICALP), 2003.

K. Kothapalli and C. Scheideler
Information gathering in adversarial systems: Lines and cycles
In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003.

L. Jia, R. Rajaraman, and C. Scheideler
On local algorithms for topology control and routing in ad hoc networks
In Proc. 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2003.

2002

B. Awerbuch, A. Brinkmann, and C. Scheideler
Anycasting and Multicasting in Adversarial Systems: Routing and Admission Control
Unpublished manuscript, Johns Hopkins University, March 2002.

A. Bagchi, A. Chaudhari, P. Kolman, and C. Scheideler
Algorithms for Fault-Tolerant Routing in Circuit Switched Networks
In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 265--274, 2002.

A. Brinkmann, K. Salzwedel, and C. Scheideler.
Compact, Adaptive Placement Strategies for Non-Uniform Capacities
In Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 53--62, 2002.

C. Scheideler.
Models and Techniques for Communication in Dynamic Networks
In Proc. 19th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 27--49, 2002.
(Here is also the talk).

P. Kolman, C. Scheideler.
Improved Bounds for the Unsplittable Flow Problem (Full Version)
In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.

2001

B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler.
Simple Routing Strategies for Adversarial Systems (Full Version)
In Proc. 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 158-167, 2001.

P. Kolman, C. Scheideler.
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem (Full Version)
In Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 38-47, 2001.

2000

P. Berenbrink, A. Brinkmann, C. Scheideler.
SimLab - A Simulation Environment for Storage Area Networks (Extended Abstract)
In 9th Euromicro Workshop on Parallel and Distributed Processing (PDP), 2000.

A. Brinkmann, K. Salzwedel, C. Scheideler.
Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract)
In Proc. 12th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2000.

A. Czumaj, C. Scheideler.
A New Algorithmic Approach to the General Lovasz Local Lemma with Applications to Schedulung and Satisfiability Problems (Full Version)
In Proc. 32nd ACM Symposium on Theory of Computing (STOC) , pp. 38-47, 2000.

A. Czumaj, C. Scheideler.
Coloring Non-uniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma (Full Version)
In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 30-39, 2000.

1999

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

P. Berenbrink, M. Riedel, C. Scheideler.
Simple Competitive Request Scheduling Strategies (Extended Abstract)
In Proc. 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 33-42, 1999.

C. Scheideler, B. Vöcking.
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols (Full Version)
Extended Abstract appeared in: Proc. 31 ACM Symposium on Theory of Computing (STOC), pp. 215-224, 1999.

P. Berenbrink, C. Scheideler.
Locally Efficient On-Line Strategies for Routing Packets along Fixed Paths (Preliminary Version)
In Proc. 10th ACM-SIAM Symposium on Discrete ALgorithms (SODA), pp. 112-121, 1999.

1998

M. Adler, C. Scheideler.
Efficient Communication Strategies for Ad-Hoc Wireless Networks (Full Version)
Extended Abstract appeared in: Proc. 10th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 259-268, 1998.

U. Feige, C. Scheideler.
Improved Bounds for Acyclic Job Shop Scheduling (Full Version)
Extended abstract appeared in: Proc. 28th ACM Symposium on Theory of Computing (STOC), pp. 624-233, 1998.

1997

M. Flammini, C. Scheideler.
Simple, Efficient Routing Schemes for All-Optical Networks (Full Version)
Extended abstract appeared in: Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 170-179, 1997.

S. Bock, F. Meyer auf der Heide, C. Scheideler.
Optimal Wormhole Routing in the (n,d)-Torus (Full Version)
In Proc. 11th International Parallel Processing Symposium (IPPS), 1997.

1996

F.. Meyer auf der Heide, C. Scheideler.
Communication in Parallel Systems (Full Version)
In 23rd Conference on Current Trends in Theory and Practice of Informatics (SOFSEM) '96, pp. 16-33, 1996.

F. Meyer auf der Heide, C. Scheideler.
Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols (Full Version)
Extended abstract appeared in: Proc. 37th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 370-379, 1996.

C. Scheideler, B. Vöcking.
Universal Continuous Routing Strategies (Full Version)
Extended abstract appeared in: Proc. 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 142-151, 1996.

R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking.
Universal Algorithms for Store-and-Forward and Wormhole Routing (Extended Abstract)
In Proc. 26th ACM Symposium on Theory of Computing (STOC), pp. 356-365, 1996.

1995

F. Meyer auf der Heide, C. Scheideler.
Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks (Extended Abstract)
In Proc. 3rd European Symposium on Algorithms (ESA), pp. 341-354, 1995.

F. Meyer auf der Heide, C. Scheideler.
Space-Efficient Routing in Vertex-Symmetric Networks (Full Version)
Extended abstract appeared in: Proc. 7th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 137-146, 1995.

F. Meyer auf der Heide, C. Scheideler, V. Stemann.
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations (Full Version)
Extended abstract appeared in: Proc. 12th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 267-278, 1995.

The University for the Information Society