1. Adve, S.V., Pai, V.S., Ranganathan, P.: Recent advances in memory consistency models for hardware shared-memory systems. In: Proceedings of the IEEE, special issue on distributed shared-memory, pp. 445–455 (1999)
2. Aloupis, G., Bose, P., Demaine, E.D., Langerman, S., Meijer, H., Overmars, M., Toussaint, G.T.: Computing signed permutations of polygons. In: Proc. of the 14th Canadian Conf. on Computational Geometry (CCCG), Lethbridge, Alberta, Canada, pp. 68–71 (August 2002)
3. Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, Mexico (April 2004)
4. Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proc. 18th Int’l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, New Mexico (2004)
5. Brinkhuis, M., Meijer, G.A., van Diest, P.J., Schuurmans, L.T., Baak, J.P.: Minimum spanning tree analysis in advanced ovarian carcinoma. Anal. Quant. Cytol. Histol. 19(3), 194–201 (1997)