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.
25 Publications
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
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: 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
2012 | Mastersthesis | LibreCat-ID: 582
Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012.
LibreCat