Aggarwal, V., Feldmann, A., &; Scheideler, C. (2007). Can ISPs and P users cooperate for improved performance? ACM Computer Commucation Review.https://doi.org/10.1145/1273445.1273449 

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

Awerbuch, B., W. Richa, A., &; Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008 (pp. 45--54). ACM.https://doi.org/10.1145/1400751.1400759 

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

Clouser, T., Nesterenko, M., &; Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings (Vol. 5340, pp. 124--140). Springer.https://doi.org/10.1007/978-3-540-89335-6_12 

Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In Taschenbuch der Algorithmen (pp. 229--236). Springer.https://doi.org/10.1007/978-3-540-76394-9_22 

D. Kleinberg, R., &; Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187.https://doi.org/10.1007/s00224-009-9202-x 

Awerbuch, B., &; Scheideler, C. (2009). Towards a Scalable and Robust DHT. Theory Comput. Syst., (2), 234--260.https://doi.org/10.1007/s00224-008-9099-9 

Awerbuch, B., &; Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466.https://doi.org/10.1016/j.tcs.2008.10.003 

Scheideler, C., &; Schmid, S. (2009). A Distributed and Oblivious Heap. In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp. 571--582). Springer.https://doi.org/10.1007/978-3-642-02930-1_47 

Jacob, R., Ritscher, S., Scheideler, C., &; Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 771--780). Springer.https://doi.org/10.1007/978-3-642-10631-6_78 

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

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

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (Vol. 5873, pp. 781--782). Springer.https://doi.org/10.1007/978-3-642-05118-0_58 

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany.https://doi.org/10.1145/1989493.1989516 

Meyer auf der Heide, F., &; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474.https://doi.org/10.1007/s00287-010-0470-2 

Gavoille, C., Patt-Shamir, B., &; Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810.https://doi.org/10.1007/s00224-010-9284-5 

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034, pp. 294--305). Springer.https://doi.org/10.1007/978-3-642-12200-2_27 

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

Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer.https://doi.org/10.1007/978-3-642-15763-9_17 

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.https://doi.org/10.1007/978-3-642-15763-9_50 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society.https://doi.org/10.1109/ICDCS.2011.8 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM.https://doi.org/10.1145/2030686.2030697 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM.https://doi.org/10.1145/2107502.2107522 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).https://doi.org/10.1145/1989493.1989527 

Kniesburges, S., &; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer.https://doi.org/10.1007/978-3-642-19094-0_18 

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

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

Kolman, P., &; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140).https://doi.org/10.4230/LIPIcs.STACS.2011.129 

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

Richa, A. W., &; Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 416–430).https://doi.org/10.1007/978-3-642-24550-3_31 

Nesterenko, M., Mohd, R., &; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 356--370).https://doi.org/10.1007/978-3-642-24550-3_27 

Dolev, S., &; Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci., 1.https://doi.org/10.1016/j.tcs.2012.07.012 

Monien, B., &; Scheideler, C. (2012). Selfish Distributed Optimization. In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp. 1--2). Springer.https://doi.org/10.1007/978-3-642-32820-6_1 

Jacob, R., Ritscher, S., Scheideler, C., &; Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148.https://doi.org/10.1016/j.tcs.2012.07.029 

Clouser, T., Nesterenko, M., &; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35.https://doi.org/10.1016/j.tcs.2011.12.079 

Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30.https://doi.org/10.1145/2229163.2229174 

Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &; Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).https://doi.org/10.1109/IPDPS.2012.116 

Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300).https://doi.org/10.1145/2332432.2332488 

Schmid, S., Avin, C., Scheideler, C., Häupler, B., &; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440).https://doi.org/10.1007/978-3-642-33651-5_47 

Kniesburges, S., &; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436).https://doi.org/10.1007/978-3-642-33651-5_45 

Kolman, P., &; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810).https://doi.org/10.1137/1.9781611973099.64 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271).https://doi.org/10.1109/IPDPS.2012.115 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2013). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, (3), 159--171.https://doi.org/10.1007/s00446-012-0180-x 

Mohd Nor, R., Nesterenko, M., &; Scheideler, C. (2013). Corona:  A stabilizing deterministic message-passing skip list. Theor. Comput. Sci., 119--129.https://doi.org/10.1016/j.tcs.2012.08.029 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2013). An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans. Netw., (3), 760--771.https://doi.org/10.1109/TNET.2012.2210241 

Kolman, P., &; Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems, (2), 341–363.https://doi.org/10.1007/s00224-013-9454-3 

Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406).https://doi.org/10.1109/IPDPS.2013.40 

Eikel, M., &; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129).https://doi.org/10.1145/2486159.2486186 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549).https://doi.org/10.1007/978-3-642-41527-2_37 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) (pp. 165–176).https://doi.org/10.1007/978-3-319-03578-9_14 

Scheideler, C., Setzer, A., &; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS) (pp. 107--122).https://doi.org/10.1007/978-3-319-14472-6_8 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. Theory of Computing Systems, (3), 591–612.https://doi.org/10.1007/s00224-012-9431-2 

Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. Transactions on Algorithms, (4).https://doi.org/10.1145/2635818 

Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2014). SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26.https://doi.org/10.1145/2629695 

Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM.https://doi.org/10.1145/2612669.2612712 

Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2014). Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).https://doi.org/10.1109/INFOCOM.2014.6848224 

Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13).https://doi.org/10.1007/978-3-319-09620-9_1 

Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &; Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems, (1), 110–135.https://doi.org/10.1007/s00224-013-9504-x 

Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (pp. 48--62).https://doi.org/10.1007/978-3-319-11764-5_4 

Scheideler, C., Eikel, M., &; Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) (pp. 168--180).

Feldotto, M., Scheideler, C., &; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P) (pp. 1–10).https://doi.org/10.1109/P2P.2014.6934300 

Eikel, M., &; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.https://doi.org/10.1145/2809806 

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS).https://doi.org/10.4230/LIPIcs.OPODIS.2015.24 

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 201–216).https://doi.org/10.1007/978-3-319-21741-3_14 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79.https://doi.org/10.1016/j.tcs.2014.11.027 

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 117--132).https://doi.org/10.1007/978-3-319-21999-8_8 

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015 (pp. 21:1--21:2). ACM.https://doi.org/10.1145/2800795.2800829 

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015 (pp. 67--69). ACM.https://doi.org/10.1145/2767386.2767451 

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79). ACM.https://doi.org/10.1145/2755573.2755614 

Drees, M., Gmyr, R., &; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).https://doi.org/10.1145/2935764.2935783 

Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &; Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433.https://doi.org/10.1109/TNET.2015.2410313 

Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164).https://doi.org/10.1007/978-3-319-43994-5_10 

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. 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 (pp. 289--299). ACM.https://doi.org/10.1145/2935764.2935784 

W. Richa, A., &; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002).https://doi.org/10.1007/978-1-4939-2864-4_593 

Gmyr, R., Lefèvre, J., &; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 248--262).https://doi.org/10.1007/978-3-319-49259-9_20 

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In Proceedings of the 30th International Symposium on Distributed Computing (DISC) (pp. 71--84).https://doi.org/10.1007/978-3-662-53426-7_6 

Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3), 241–254.https://doi.org/10.1007/s00446-017-0307-1 

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424.https://doi.org/10.1016/j.ic.2016.12.006 

P. Fekete, S., W. Richa, A., Römer, K., &; Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94.https://doi.org/10.1145/3106700.3106713 

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68.https://doi.org/10.1016/j.tcs.2016.02.039 

J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. 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 (pp. 127--140).https://doi.org/10.1007/978-3-319-72751-6_10 

Gmyr, R., Hinnenthal, K., Scheideler, C., &; Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 137:1--137:15).https://doi.org/10.4230/LIPIcs.ICALP.2017.137 

Feldmann, M., &; Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham.https://doi.org/10.1007/978-3-319-69084-1_17 

Robinson, P., Scheideler, C., &; Setzer, A. (n.d.). Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.https://doi.org/10.1145/3210377.3210399 

Feldmann, M., Kolb, C., Scheideler, C., &; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). Vancouver: IEEE.https://doi.org/10.1109/IPDPS.2018.00114 

Feldmann, M., Scheideler, C., &; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). Vancouver: IEEE.https://doi.org/10.1109/IPDPS.2018.00113 

J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96.https://doi.org/10.1007/s11047-017-9658-6 

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing.https://doi.org/10.1007/978-3-030-00030-1_8 

Blömer, J., Bobolz, J., Scheideler, C., &; Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.

Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.https://doi.org/10.1016/j.tcs.2018.11.004 

Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. 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 (pp. 1–2).https://doi.org/10.1145/3229774.3229781 

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &; Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15).https://doi.org/10.4230/LIPIcs.MFCS.2018.52 

Knollmann, T., &; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &; P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_1 

Jung, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.

Jung, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press.https://doi.org/10.1145/3210377.3210663 

Feldmann, M., Kolb, C., &; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_2 

Scheideler, C., &; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan.https://doi.org/10.1007/978-3-030-03232-6_16 

Götte, T., Scheideler, C., &; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.

Luo, L., Scheideler, C., &; Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil.