Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung. 2024.
LibreCat: /record/52318

De Groote, Carsten. A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes. 2024.
LibreCat: /record/53374

Doddegowda, Rajesh. Optimal Drone Strategies For Packet Delivery. 2024.
LibreCat: /record/53373

Thakur, Heena. Evaluating the Implications. 2024.
LibreCat: /record/53372

Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Schweichhart, Jonas. Minimum Edge Cuts in Overlay Networks. 2023.
LibreCat: /record/44735

Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage. 2023.
LibreCat: /record/46053

Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption. 2023.
LibreCat: /record/46087

Ali, Osama. Highly Accurate Deep Compressed Facial Recognition. 2023.
LibreCat: /record/46086

Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation. 2023.
LibreCat: /record/46110

N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks. 2023.
LibreCat: /record/46221

Deppe, Volker. Routing in Hypergraphs. 2023.
LibreCat: /record/47134

Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite. 2023.
LibreCat: /record/48430

Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames. 2023.
LibreCat: /record/49494

Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields. 2023.
LibreCat: /record/49493

Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter. 2023.
LibreCat: /record/49492

Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric. 2023.
LibreCat: /record/52317

Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique. 2022.
LibreCat: /record/30152

Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider. 2022.
LibreCat: /record/30198

Nachtigall, Marcel. Hybrid Routing in Three Dimensions. 2022.
LibreCat: /record/30199

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1089/cmb.2021.0363__J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.
LibreCat: /record/31060
DOI: 10.1089/cmb.2021.0363

Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen. 2022.
LibreCat: /record/31947

Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”10.4230/LIPIcs.DNA.28.8__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.DNA.28.9__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.”10.4230/LIPIcs.SAND.2022.12__1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.”10.1145/3490148.3538556__SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.
LibreCat: /record/33240
DOI: 10.1145/3490148.3538556

Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.SAND.2022.23__1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

Aguiliera, Marcos, et al. “Edsger W. Dijkstra Prize in Distributed Computing.”10.1145/3519270.3538411__PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: /record/33968

Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks. 2022, doi:10.17619/UNIPB/1-1673 .
LibreCat: /record/30239
DOI: 10.17619/UNIPB/1-1673 

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1016/j.ic.2021.104697__Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter. 2021, doi:10.17619/UNIPB/1-1169 .
LibreCat: /record/24887
DOI: 10.17619/UNIPB/1-1169 

Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.
LibreCat: /record/25126

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1007/978-3-030-91081-5‑34__Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5‑34.
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers. 2021.
LibreCat: /record/28998

Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021.
LibreCat: /record/27053

Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021.
LibreCat: /record/27072

Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021.
LibreCat: /record/21084

Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021.
LibreCat: /record/21197

Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model. 2021.
LibreCat: /record/21627

Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113.
LibreCat: /record/21628
DOI: 10.17619/UNIPB/1-1113

Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.”10.4230/LIPIcs.OPODIS.2021.11__25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11.
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks. 2020.
LibreCat: /record/20221

Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, Christian, and Michael Spear, editors. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020, doi:10.1145/3350755.
LibreCat: /record/17839
DOI: 10.1145/3350755

Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks. 2020.
LibreCat: /record/20495

Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”10.4230/LIPIcs.OPODIS.2020.31__Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.
LibreCat: /record/18066

Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020, doi:10.17619/UNIPB/1-1026.
LibreCat: /record/18520
DOI: 10.17619/UNIPB/1-1026

Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.
LibreCat: /record/18648

Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.”10.1145/3397190__ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.
LibreCat: /record/16902
DOI: 10.1145/3397190

Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.”10.1145/3350755.3400246__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020.
LibreCat: /record/15770

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.
LibreCat: /record/15169

N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems. 2019.
LibreCat: /record/17809

Feldmann, Michael, and Christian Scheideler. “Skeap &; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.”10.1145/3323165.3323193__Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”10.1145/3323165.3323195__Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE.
LibreCat: /record/6976

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”10.4230/LIPICS.ICALP.2019.150__Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019, doi:10.1145/3323165.
LibreCat: /record/14829
DOI: 10.1145/3323165

Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.”10.1007/s00224-017-9823-4__Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
LibreCat: /record/14830
DOI: 10.1007/s00224-017-9823-4

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”10.1007/978-3-030-24922-9‑26__Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9‑26.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”https://doi.org/10.1007/978-3-030-34992-9_13__Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13.
LibreCat: /record/13182
DOI: https://doi.org/10.1007/978-3-030-34992-9_13
arXiv: 1909.04544

N., N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019.
LibreCat: /record/10271

Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.”10.4230/LIPICS.DISC.2019.23__33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

Robinson, Peter, et al. “Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary.”10.1145/3210377.3210399__Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.
LibreCat: /record/3422
DOI: 10.1145/3210377.3210399

Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
LibreCat: /record/3874

Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
LibreCat: /record/1138
DOI: 10.17619/UNIPB/1-265

Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”10.1109/IPDPS.2018.00114__Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
LibreCat: /record/1163
DOI: 10.1109/IPDPS.2018.00114
arXiv: 1710.08128

Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.”10.1109/IPDPS.2018.00113__Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.
LibreCat: /record/1164
DOI: 10.1109/IPDPS.2018.00113
arXiv: 1802.07504

J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.”10.1007/s11047-017-9658-6__Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
LibreCat: /record/1796
DOI: 10.1007/s11047-017-9658-6

N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat: /record/18030

N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz. 2018.
LibreCat: /record/18031

N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles. 2018.
LibreCat: /record/18032

Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.
LibreCat: /record/18033

Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.”10.1007/978-3-030-00030-1_8__Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.
LibreCat: /record/5764
DOI: 10.1007/978-3-030-00030-1_8

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

Scheideler, Christian. “Preface.”10.1016/j.tcs.2018.11.004__Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004.
LibreCat: /record/5984
DOI: 10.1016/j.tcs.2018.11.004

Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.”10.1145/3229774.3229781__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, doi:10.1145/3229774.3229781.
LibreCat: /record/5985
DOI: 10.1145/3229774.3229781

Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.”10.4230/LIPIcs.MFCS.2018.52__43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52.
LibreCat: /record/5986
DOI: 10.4230/LIPIcs.MFCS.2018.52

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1007/978-3-030-03232-6_1__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat: /record/4563

Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”10.1145/3210377.3210663__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.”10.1007/978-3-030-03232-6_2__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.
LibreCat: /record/4351
DOI: 10.1007/978-3-030-03232-6_2
arXiv: 1808.10300

Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”10.1007/978-3-030-19759-9_4__Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.”10.1007/978-3-030-03232-6_16__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018, doi:10.1007/978-3-030-03232-6_16.
LibreCat: /record/5216
DOI: 10.1007/978-3-030-03232-6_16

Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64.
LibreCat: /record/5222

Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat: /record/5368

Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.”10.1007/s00446-017-0307-1__Distributed Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.
LibreCat: /record/3872
DOI: 10.1007/s00446-017-0307-1

Burkhardt, Michél. Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017.
LibreCat: /record/18026

Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn, 2017.
LibreCat: /record/18027

Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.
LibreCat: /record/18028

Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.
LibreCat: /record/18029

Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1016/j.ic.2016.12.006__Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006.
LibreCat: /record/1812
DOI: 10.1016/j.ic.2016.12.006

P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.”10.1145/3106700.3106713__SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
LibreCat: /record/1813
DOI: 10.1145/3106700.3106713

Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.”10.1016/j.tcs.2016.02.039__Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
LibreCat: /record/1814
DOI: 10.1016/j.tcs.2016.02.039

J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.”10.1007/978-3-319-72751-6_10__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, doi:10.1007/978-3-319-72751-6_10.
LibreCat: /record/1815
DOI: 10.1007/978-3-319-72751-6_10

Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. 2017, doi:10.1145/3087556.
LibreCat: /record/1820
DOI: 10.1145/3087556

Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.
LibreCat: /record/81