Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
301 Publications
2019 | Conference (Editor) | LibreCat-ID: 14829
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
| DOI
2019 | Journal Article | LibreCat-ID: 14830
Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 14539
Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” 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
| DOI
2019 | Conference Paper | LibreCat-ID: 13182
Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.” 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
| Files available
| DOI
| arXiv
2019 | Mastersthesis | LibreCat-ID: 10271
N., N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019.
LibreCat
2019 | Conference Paper | LibreCat-ID: 13652
Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 3422
Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.
LibreCat
| Files available
| DOI
2018 | Conference (Editor) | LibreCat-ID: 3874
Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
LibreCat
2018 | Dissertation | LibreCat-ID: 1138
Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 1163
Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
LibreCat
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 1164
Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.
LibreCat
| Files available
| DOI
| arXiv
2018 | Journal Article | LibreCat-ID: 1796
J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
LibreCat
| DOI
2018 | Bachelorsthesis | LibreCat-ID: 18030
N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 18031
N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz. 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 18032
N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles. 2018.
LibreCat
2018 | Bachelorsthesis | LibreCat-ID: 18033
Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.
LibreCat
2018 | Conference Paper | LibreCat-ID: 5764
Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” 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
| DOI
2018 | Working Paper | LibreCat-ID: 5820
Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat
| Files available
2018 | Journal Article | LibreCat-ID: 5984
Scheideler, Christian. “Preface.” Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 5985
Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.” 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
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 5986
Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.” 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
| DOI
2018 | Conference Paper | LibreCat-ID: 4411
Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” 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
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4563
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
| Files available
2018 | Conference Paper | LibreCat-ID: 4565
Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 4351
Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” 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
| Files available
| DOI
| arXiv
2018 | Conference Paper | LibreCat-ID: 4375
Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 5216
Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.” 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
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 5222
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
| Files available
2018 | Bachelorsthesis | LibreCat-ID: 5368
Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.
LibreCat
2017 | Journal Article | LibreCat-ID: 3872
Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.
LibreCat
| DOI
2017 | Bachelorsthesis | LibreCat-ID: 18026
Burkhardt, Michél. Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18027
Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18028
Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.
LibreCat
2017 | Bachelorsthesis | LibreCat-ID: 18029
Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.
LibreCat
2017 | Journal Article | LibreCat-ID: 1812
Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006.
LibreCat
| DOI
2017 | Journal Article | LibreCat-ID: 1813
P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
LibreCat
| DOI
2017 | Journal Article | LibreCat-ID: 1814
Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
LibreCat
| DOI
2017 | Conference Paper | LibreCat-ID: 1815
J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.” 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
| DOI
2017 | Conference (Editor) | LibreCat-ID: 1820
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
| DOI
2017 | Mastersthesis | LibreCat-ID: 81
Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.
LibreCat
2017 | Conference (Editor) | LibreCat-ID: 5980
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. ACM, 2017, doi:10.1145/3087556.
LibreCat
| DOI
2017 | Dissertation | LibreCat-ID: 61
Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-150.
LibreCat
| DOI
2017 | Mastersthesis | LibreCat-ID: 699
Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 700
Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.
LibreCat
2017 | Mastersthesis | LibreCat-ID: 701
Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.
LibreCat
2017 | Conference Paper | LibreCat-ID: 105
Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 125
Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17.
LibreCat
| Files available
| DOI
| arXiv
2016 | Conference Paper | LibreCat-ID: 215
Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
LibreCat
| Files available
| DOI
2016 | Bachelorsthesis | LibreCat-ID: 18025
Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem. 2016.
LibreCat
2016 | Journal Article | LibreCat-ID: 1835
Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.
LibreCat
| DOI