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.

194 Publications


2014 | Journal Article | LibreCat-ID: 1858
Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 1863
Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.” 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222, doi:10.1145/2612669.2612712.
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 446
Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 459
Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.” Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
LibreCat | Files available | DOI
 

2014 | Journal Article | LibreCat-ID: 464
Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 393
Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
LibreCat | Files available | DOI
 

2014 | Conference Paper | LibreCat-ID: 397
Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
LibreCat | Files available
 

2014 | Conference Paper | LibreCat-ID: 412
Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.
LibreCat | Files available | DOI | arXiv
 

2015 | Journal Article | LibreCat-ID: 284
Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3, ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 241
Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.” Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 242
Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
LibreCat | Files available | DOI
 

2015 | Journal Article | LibreCat-ID: 327
Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 1850
Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.” DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8.
LibreCat | DOI
 

2015 | Conference Paper | LibreCat-ID: 1851
Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.” 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, doi:10.1145/2800795.2800829.
LibreCat | DOI
 

2015 | Conference Paper | LibreCat-ID: 1852
Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.” 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, doi:10.1145/2767386.2767451.
LibreCat | DOI
 

2015 | Conference Paper | LibreCat-ID: 1853
Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” 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, doi:10.1145/2755573.2755614.
LibreCat | DOI
 

2015 | Conference (Editor) | LibreCat-ID: 1854
Scheideler, Christian, editor. Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings. 2015, doi:10.1007/978-3-319-25258-2.
LibreCat | DOI
 

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

2016 | Conference Paper | LibreCat-ID: 1836
Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016, pp. 148--164, doi:10.1007/978-3-319-43994-5_10.
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 1837
Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” 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, doi:10.1145/2935764.2935784.
LibreCat | DOI
 

2016 | Conference (Editor) | LibreCat-ID: 1844
Scheideler, Christian, and Seth Gilbert, editors. 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, doi:10.1145/2935764.
LibreCat | DOI
 

2016 | Book Chapter | LibreCat-ID: 1845
W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” Encyclopedia of Algorithms, 2016, pp. 999--1002, doi:10.1007/978-1-4939-2864-4_593.
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 155
Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20.
LibreCat | Files available | DOI
 

2016 | Conference Paper | LibreCat-ID: 142
Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
LibreCat | Files available | DOI
 

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

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 | 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 | 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: 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
 

2019 | Conference Paper | LibreCat-ID: 7636
Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.
LibreCat | Files available
 

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

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

2019 | Book Chapter | LibreCat-ID: 9599
Daymude, Joshua J., et al. “Computing by Programmable Particles.” Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–81, doi:https://doi.org/10.1007/978-3-030-11072-7_22.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 6976
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 | Files available
 

2019 | Conference Paper | LibreCat-ID: 10586
Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” 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 | Files available | DOI
 

2019 | Conference Paper | LibreCat-ID: 12944
Götte, Thorsten, et al. “Faster Construction of Overlay Networks.” Structural Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 15627
Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–99, doi:10.1137/1.9781611975994.78.
LibreCat | DOI
 

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

2020 | Conference Paper | LibreCat-ID: 27051
Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99, doi:10.1137/1.9781611975994.78.
LibreCat | DOI
 

2020 | Journal Article | LibreCat-ID: 17808
Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Nat. Comput., vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2.
LibreCat | DOI
 

2020 | Conference (Editor) | LibreCat-ID: 17836
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 | DOI
 

2020 | Conference (Editor) | LibreCat-ID: 17839
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 | DOI
 

2020 | Conference Paper | LibreCat-ID: 20755
Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” 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 | Files available | DOI | arXiv
 

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

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

2020 | Conference Paper | LibreCat-ID: 15169
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
 

2020 | Conference Paper | LibreCat-ID: 16346
Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.” Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, doi:10.1145/3369740.3372916.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 25105
Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 28917
Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” 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 | DOI
 

2021 | Conference Paper | LibreCat-ID: 27048
Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.” NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 27050
J. Daymude, Joshua, et al. “The Canonical Amoebot Model: Algorithms and Concurrency Control.” 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth Gilbert, vol. 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 22283
Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat | Files available | DOI
 

2021 | Conference Paper | LibreCat-ID: 30217
Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.” 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 | DOI
 

2021 | Book Chapter | LibreCat-ID: 26888
Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.
LibreCat | DOI
 

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

2022 | Conference Paper | LibreCat-ID: 32602
Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” 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 | DOI
 

2022 | Conference Paper | LibreCat-ID: 32603
Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” 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 | DOI
 

2022 | Conference Paper | LibreCat-ID: 33230
Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” 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 | DOI
 

2022 | Conference Paper | LibreCat-ID: 33240
Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” 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 | DOI
 

2022 | Conference Paper | LibreCat-ID: 30987
Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” 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 | DOI
 

2022 | Conference Paper | LibreCat-ID: 33967
Aguiliera, Marcos, et al. “2022 Edsger W. Dijkstra Prize in Distributed Computing.” 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 | DOI
 

2022 | Conference (Editor) | LibreCat-ID: 33968
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
 

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

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

2023 | Conference Paper | LibreCat-ID: 45188
Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.
LibreCat | DOI
 

2023 | Conference Paper | LibreCat-ID: 45193
Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.
LibreCat
 

2023 | Journal Article | LibreCat-ID: 45192
Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.
LibreCat | DOI
 

2023 | Book Chapter | LibreCat-ID: 45875 | OA
Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.
LibreCat | Files available | DOI
 

2023 | Book Chapter | LibreCat-ID: 45891 | OA
Blömer, Johannes, et al. “Robustness and Security.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.
LibreCat | Files available | DOI
 

Filters and Search Terms

(person=20792) AND (type=conference_editor OR type=conference OR type=dissertation OR type=mastersthesis OR type=journal_article OR type=journal_editor OR type=preprint OR type=report OR type=working_paper OR type=book_chapter OR type=book_editor OR type=bachelorsthesis OR type=conference_abstract OR type=newspaper_article)

year<=2030 AND year>=2002

status=public

Search

Filter Publications

Display / Sort

Sorted by: Publishing Year
Citation Style: MLA

Export / Embed