1. Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto, Local algorithms in (weakly) coloured graphs, 2010. http://arxiv.org/abs/1002.0125.
2. An O(nM/(M+1)) distributed algorithm for the k-out of-m resources allocation problem;Baldoni,1994
3. A distributed k-mutual exclusion algorithm;Bulgannawar,1995
4. The drinking philosophers problem;Chandy;ACM Trans. Program. Lang. Syst.,1984
5. An extended binary tree quorum strategy for k-mutual exclusion in distributed systems;Chang,1997