Briest, P., &; Raupach, C. (2011). The car sharing problem. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989518 
LibreCat: /record/19026
DOI: 10.1145/1989493.1989518

Rajaraman, R., &; Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493 
LibreCat: /record/16428
DOI: 10.1145/1989493

Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., &; Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989515 
LibreCat: /record/16453
DOI: 10.1145/1989493.1989515

Kling, P., &; Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11.https://doi.org/10.1145/1989493.1989517 
LibreCat: /record/16454
DOI: 10.1145/1989493.1989517