1. Bertsekas, D.P., Özveren, C., Stamoulis, G.D., Tsitsiklis, J.N. (1991) Optimal communication algorithms for hypercubes. J. Parallel Distributed Comput. 11: 263-275
2. Bloom, G.S., Golomb, S.W. (1977) Applications of numbered, undirected graphs. Proceedings of the IEEE 65(4): 562-571
3. Chabridon, S., Gelenbe, E. (1995) Failure detection algorithms for a reliable execution of parallel programs. 14th Symposium on Reliable Distributed Systems SRDS?14, Bad Neuenahr, Germany, September 1995, Proceedings
4. Chinchani, R., Upadhyaya, S., Kwiat, K. (2003) A tamper-resistant framework for unambiguous detection of attacks in user space using process monitors. First IEEE International Workshop on Information Assurance IWIA?03, March 24-24, 2003, Darmstadt, Germany, Proceedings, pp 25-36
5. Dimitromanolakis, A (2002) Analysis of the golomb ruler and the sidon set problems, and determination of large, near-optimal golomb rulers. Dept. of Electronic and Computer Engineering Technical University of Crete