Scheideler, C., &; Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM.https://doi.org/10.1145/3323165 

Gmyr, R., Lefevre, J., &; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199.https://doi.org/10.1007/s00224-017-9823-4 

Castenow, J., Kolb, C., &; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy.https://doi.org/10.1007/978-3-030-24922-9‑26 

Feldmann, M., Götte, T., &; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 149–164). Springer, Cham.https://doi.org/10.1007/978-3-030-34992-9_13 

N., N. (2019). Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn.

Hinnenthal, K., Scheideler, C., &; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019).https://doi.org/10.4230/LIPICS.DISC.2019.23 

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 

Scheideler, C., &; Fineman, J. T. (Eds.). (2018). Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. Vienna, Austria: ACM.

Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-265 

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 

N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.

N., N. (2018). Gathering Strategien für mobile Roboterschwärme im Gitternetz.

N., N. (2018). Decontaminating Planar Regions with Finite Automaton Robots and Tiles.

Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn.

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 

Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki.https://doi.org/10.1007/978-3-030-19759-9_4 

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.

Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.

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 

Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.

Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn.

Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn.

Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn.

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 

Scheideler, C., &; Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017.https://doi.org/10.1145/3087556 

Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn.

Scheideler, C., &; Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM.https://doi.org/10.1145/3087556 

Strothmann, T. F. (2017). Self-* Algorithms for Distributed Systems. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-150 

Sundermeier, J. (2017). Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn.

Knollmann, T. (2017). A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn.

Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn.

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 

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 

Heuchler, S. (2016). Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem.

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 

Scheideler, C., &; Gilbert, S. (Eds.). (2016). 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.https://doi.org/10.1145/2935764 

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 

Hinnenthal, K. (2016). Aggregation in Overlay Networks. Universität Paderborn.

Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. Journal of Graph Algorithms and Applications, 20(1), 79–100.https://doi.org/10.7155/jgaa.00385 

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 

Feldotto, M., &; Graffi, K. (2016). Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurrency and Computation: Practice and Experience, 28(5), 1655–1677.https://doi.org/10.1002/cpe.3716 

Eikel, M. (2016). Insider-resistent Distributed Storage Systems. Universität Paderborn.

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 

Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM) (pp. 175--186).https://doi.org/10.1007/978-3-319-15612-5_16 

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 

Koutsopoulos, A. (2015). Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn.

Kniesburges, S. (2015). Distributed Data Structures and the Power of topological Self-Stabilization. Universität Paderborn.

Feldmann, M. (2015). Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs. Universität Paderborn.

Götte, T. (2015). Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot. Universität Paderborn.

Isenberg, D. (2015). 3D-Nesting in der SLM-Technologie.

Korfmacher, C. (2015). Implementierung und Analyse von Cone-DHT. Universität Paderborn.

Sundermeier, J. (2015). Implementierung eines selbststabilisierenden verteilten Stacks. Universität Paderborn.

Knollmann, T. (2015). Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix. Universität Paderborn.

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 

Scheideler, C. (Ed.). (2015). Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings.https://doi.org/10.1007/978-3-319-25258-2 

Janiuk, J., Mäcker, A., &; Graffi, K. (2014). Secure Distributed Data Structures for Peer-to-Peer-based Social Networks. In Proceedings of the International Conference on Collaboration Technologies and Systems (CTS) (pp. 396–405).https://doi.org/10.1109/CTS.2014.6867595 

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 

Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen. Universität Paderborn.

Hinnenthal, K. (2014). Formbildung selbstorganisierender Partikelsysteme.

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 

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 

Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität Paderborn.

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 

Graffi, K., &; Bremer, L. (2013). Symbiotic Coupling of P and Cloud Systems: The Wikipedia Case. In Proceedings of the International Conference on Communications (ICC’13) (pp. 3444–3449).https://doi.org/10.1109/ICC.2013.6655082 

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