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 - Ehemaliger - Teilprojektleiter

Prof. Dr. Christian Scheideler
Sonstiges
Seit 03/2009

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

Seit 03/2009

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

  • Leiter des Instituts für Informatik
  • Advisory Committee der SPAA
  • 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 DISC
  • Steering Committee der SIROCCO
  • Steering Committee der ALGOSENSORS
  • Sprecher des Fachbereichs „Grundlagen der Informatik“ in der Gesellschaft für Informatik
  • PC Mitglied von SOFSEM 23, UCNC 23, Euro-Par 23
  • Local Arrangements Co-Chair der ICALP 2023
  • Mitglied des „PODC Doctoral Dissertation Award“ Komitees 2023
  • Co-Organisator des „Special Models of Computation” Workshops der SIROCCO 2023

Vergangene Funktionen

  • Secretary der SPAA 2004-2015
  • Steering Committee Member der SPAA 2019-2020
  • General Chair SSS 2014 und SPAA 2015-2020
  • Organisator des “NSF Workshop on Self-organizing Particle Systems” (SOPS 2014)
  • Co-Organisator des Workshop"Foundations of Network Science” (ICALP 2013)
  • Co-Organisator der Dagstuhl Seminare 14051, 16271 und 18331, der Bertinoro Workshops in 2007, 2009, 2019 und 2022 und eines NSF Workshop co-located mit der SODA 2014
  • Co-Organisator des Workshops Rapid Reconfiguration of Programmable Matter (co-located UCNC 2021)
  • Leiter des internationalen Dijkstra Preis Komitees 2022
  • Local arrangements chair: SIROCCO 2022 (chair), SIROCCO 2020 (chair), SSS 2014 (chair), INFORMATIK 2008 (co-chair), SPAA 2008 (chair), STOC 2005 (chair), ICALP 1998 (member)
  • PC Chair von DISC 2022, SIROCCO 2015 + 2020, ALGOSENSORS 2010 + 2019, SSS 2012 + 2013 + 2021, IPDPS 2009, SPAA 2007, DCOSS 2007
  • Co-PC Chair der SSS 2021
  • PC Mitglied von
    ALGOSENSORS 2020, 2016, 2012, 2008, 2007
    APoCS 2020
    CAAN 2006
    CDCS 2022
    DCOSS 2017, 2014, 2013, 2012, 2008, 2006, 2005
    DISC 2020, 2017
    DIAL-M 2004, 2003
    ESA 2018, 2004
    Euro-Par 2016
    FOMC 2014, 2013
    Gekko 2009
    Globecom 2007
    HiPC 2005, 2004, 2003
    ICALP 2020, 2018, 2017, 2014, 2013, 2011, 2010, 2008
    ICDCN 2017, 2016, 2012
    ICDCS 2022, 2021, 2010, 2004
    ICPADS 2009, 2006
    IPDPS 2020, 2019, 2018, 2017, 2015, 2010, 2006
    IPSN 2008
    IPTPS 2007
    I-SPAN 2005
    IZS 2004
    MFCS 2018, 2014, 2011, 2006
    NetSciCom 2014, 2013, 2012, 2011, 2010, 2009
    NetEcon 2006
    OPODIS 2019, 2017, 2011
    P2P 2014
    PASA 2006
    PDCN 2005, 2004
    PODC 2021, 2019, 2015, 2012, 2006
    RC-Education 2006
    SAGA 2007, 2005, 2003, 2001
    SAND 2022
    SEA 2012
    SIROCCO 2021, 2011
    SODA 2015
    SOFSEM 2006
    SPAA 2014, 2006, 2003
    SSS 2020, 2019, 2018, 2017, 2016, 2015, 2009
    STACS 2022, 2007
    UCNC 2021

Veröffentlichungen (RIS-DB)

Beep-and-Sleep: Message and Energy Efficient Set Cover
T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.
Routing Schemes for Hybrid Communication Networks
J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.
Time-Optimal Construction of Overlays
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).
Capabilities and Limitations of Local Strategies in Dynamic Networks
T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.
Robustness and Security
J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 145–164.
Coordinating Amoebots via Reconfigurable Circuits
M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.
The Structural Power of Reconfigurable Circuits in the Amoebot Model
A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.
Fault-Tolerant Shape Formation in the Amoebot Model
I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.
Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion
T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.
Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model
I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.
2022 Edsger W. Dijkstra Prize in Distributed Computing
M. Aguiliera, A.W. Richa, A.A. Schwarzmann, A. Panconesi, C. Scheideler, P. Woelfel, in: A. Milani, P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, ACM, 2022, p. 1.
36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA
C. Scheideler, ed., 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
A self-stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, Information and Computation (2022).
Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization
S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM, 2021, p. 30:1-30:2.
Coordinating Amoebots via Reconfigurable Circuits
M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, in: C. Johnen, E. Michael Schiller, S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, Springer, 2021, pp. 484–488.
Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization
S. Dolev, R. Prasadh Narayanan, C. Scheideler, C. Schindelhauer, in: L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, ACM, 2021, p. 30:1-30:2.
The Canonical Amoebot Model: Algorithms and Concurrency Control
J. J. Daymude, A. W. Richa, C. Scheideler, in: S. Gilbert (Ed.), 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19.
Time-Optimal Construction of Overlays
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.
Near-Shortest Path Routing in Hybrid Communication Networks
S. Coy, A. Czumaj, M. Feldmann, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, M. Struijs, in: Q. Bramas, V. Gramoli, A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23.
Beep-And-Sleep: Message and Energy Efficient Set Cover
T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.
Shortest Paths in a Hybrid Network Model
J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.
Forming tile shapes with simple robots
R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T. Strothmann, Nat. Comput. 19 (2020) 375–390.
Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings
A. Werneck Richa, C. Scheideler, eds., Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings, Springer, 2020.
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020
C. Scheideler, M. Spear, eds., SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, ACM, 2020.
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
Survey on Algorithms for Self-Stabilizing Overlay Networks
M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.
Convex Hull Formation for Programmable Matter
J.J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, A.W. Richa, in: Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020.
MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability
L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.
Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities
M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.
Distributed Computation in Node-Capacitated Networks
J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.
Computing by Programmable Particles
J.J. Daymude, K. Hinnenthal, A.W. Richa, C. Scheideler, in: Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.
Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary
T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE, n.d.
On the Complexity of Local Graph Transformations
C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.
Faster Construction of Overlay Networks
T. Götte, K. Hinnenthal, C. Scheideler, in: Structural Information and Communication Complexity, Cham, 2019.
Shortest Paths in a Hybrid Network Model
J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019
C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, ACM, 2019.
Self-Stabilizing Metric Graphs
R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–348.
A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–164.
Fast Distributed Algorithms for LP-Type Problems of Low Dimension
K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium on Distributed Computing (DISC 2019), 2019.
Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary
P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, ACM, 2018.
Self-Stabilizing Supervised Publish-Subscribe Systems
M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.
Skueue: A Scalable and Sequentially Consistent Distributed Queue
M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.
On the runtime of universal coating for programmable matter
J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, Natural Computing (2018) 81--96.
Forming Tile Shapes with Simple Robots
R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T.F. Strothmann, in: Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–138.
Provably Anonymous Communication Based on Trusted Execution Environments
J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.
Preface
C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
Relays: Towards a Link Layer for Robust and Secure Fog Computing
C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 2018, pp. 1–2.
Shape Recognition by a Finite Automaton Robot
R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, in: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15.
A Self-Stabilizing Hashed Patricia Trie
T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018.
Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
Brief Announcement: Competitive Routing in Hybrid Communication Networks
D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018.
Self-stabilizing Overlays for high-dimensional Monotonic Searchability
M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31.
Relays: A New Approach for the Finite Departure Problem in Overlay Networks
C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.
On Underlay-Aware Self-Stabilizing Overlay Networks
T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Springer, 2018, pp. 50–64.
Sade: competitive MAC under adversarial SINR
A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254.
Towards a universal approach for the finite departure problem in overlay networks
A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.
Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.
Universal coating for programmable matter
Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor. Comput. Sci. (2017) 56--68.
Improved Leader Election for Self-organizing Programmable Matter
J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017
C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017
C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, ACM, 2017.
Distributed Monitoring of Network Properties: The Power of Hybrid Networks
R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.
A Self-Stabilizing General De Bruijn Graph
M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2017, pp. 250–264.
Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
SplayNet: Towards Locally Self-Adjusting Networks
S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433.
On the Runtime of Universal Coating for Programmable Matter
Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, in: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.
Universal Shape Formation for Programmable Matter
Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016
C. Scheideler, S. Gilbert, eds., Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016.
Jamming-Resistant MAC Protocols for Wireless Networks
A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.
Self-stabilizing Metric Graphs
R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.
Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks
C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84.
IRIS: A Robust Information System Against Insider DoS Attacks
M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015.
Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–216.
A deterministic worst-case message complexity optimal solution for resource discovery
S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.
Leader Election and Shape Formation with Self-organizing Programmable Matter
Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, 2015, pp. 117--132.
An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems
Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2.
Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter
Z. Derakhshandeh, R. Gmyr, T.F. Strothmann, R. A. Bazzi, A. W. Richa, C. Scheideler, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti{\’{a}}n, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69.
Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79.
Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings
C. Scheideler, ed., Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings, 2015.
RoBuSt: A Crash-Failure-Resistant Distributed Storage System
C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.
Re-Chord: A Self-stabilizing Chord Overlay Network
S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.
Principles of Robust Medium Access and an Application to Leader Election
B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).
SKIP*: A Self-Stabilizing Skip Graph
R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, J. ACM (2014) 36:1--36:26.
Brief announcement: amoebot - a new model for programmable matter
Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.
Competitive MAC under adversarial SINR
A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
Algorithmic Aspects of Resource Management in the Cloud
S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in: Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13.
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory of Computing Systems (2014) 110–135.
On Stabilizing Departures in Overlay Networks
D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann, in: Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62.
Minimum Linear Arrangement of Series-Parallel Graphs
C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths
M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.
Competitive throughput in multi-hop wireless networks despite adaptive jamming
A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013) 159--171.
Corona: A stabilizing deterministic message-passing skip list
R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129.
An Efficient and Fair MAC Protocol Robust to Reactive Interference
A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, IEEE/ACM Trans. Netw. (2013) 760--771.
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.
Locally Self-Adjusting Tree Networks
C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.
IRIS: A Robust Information System Against Insider DoS-Attacks
M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.
CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system
S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.
A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery
S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.
Editorial for Algorithmic Aspects of Wireless Sensor Networks
S. Dolev, C. Scheideler, Theor. Comput. Sci. (2012) 1.
Selfish Distributed Optimization
B. Monien, C. Scheideler, in: Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, Springer, 2012, pp. 1--2.
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science (2012) 137–148.
Tiara: A self-stabilizing deterministic skip list and skip graph
T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.
Stabilization, Safety, and Security of Distributed Systems
A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.
Smoothed analysis of left-to-right maxima with applications
V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
Self-Organizing Particle Systems
M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.
Competitive and fair throughput for co-existing networks under adversarial interference
A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures
S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.
Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems
S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.
Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.
A Self-Stabilization Process for Small-World Networks
S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.
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.
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.
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, p. 15.
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.
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.
Programming for Distributed Computing: From Physical to Logical Networks
C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.
Broadcasting - How Can I Quickly Disseminate Information?
C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.
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.
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.
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.
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.
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.
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 P2P 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.
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.
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.
Alle Publikationen anzeigen