• The classification of meteor trail reflections by a rule-based system, S.W. Melville, J.D. Larsen, R.Y. Letschert, and wg. Trans. SA IEE, 80:104-116, 1989.
• Throughput capacity of meteor burst communications, J.D. Larsen, S.W. Melville, R. Mawrey, R.Y. Letschert, and wg. Trans. SA IEE, 81:20-30, 1990.
• On the convergence of a nonlinear transform, wg, D.J. Kleitman, and D. Sturtevant. Congr. Numer., 82:179-185, 1991.
• Hierarchical cluster routing in mobile ad hoc networks, M. Denko and wg. UNISWA Research Journal of Agriculture, Science and Technology, 6:81-90, 2002. Preliminary version in proceedings of the 5th International Conference on Communication systems (AFRICOM 2001), Cape Town, South Africa, May 2001.
• Limited flooding protocol for mobile ad hoc networks, M. Denko and wg. South African Computer Journal, 19:49-57, 2002.
• A self-stabilizing distributed algorithm for minimal total domination in an arbitrary system graph, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. In Proceedings of 8th IPDPS Workshop on Formal Methods for Parallel Programming, Nice, page 240, 2003.
• Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. In Proceedings of 5th IPDPS Workshop on Advances in Parallel and Distributed Computational Models, Nice, page 162, 2003.
• A robust distributed generalized matching protocol that stabilizes in linear time, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. In Proceedings of ICDCS Workshop on Mobile Distributed Computing (MDC03), Rhode Island, pages 461-465, 2003.
• Deploying mobile agents to solve the distributed buying problem, K. Reddy, J. Kinyua, and wg. In Proceedings of ICAAI'03, 2003.
• Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. In HiPC, volume 2913 of LNCS, pages 66-73. Springer, 2003.
• A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph, Z. Xu, S.T. Hedetniemi, wg, and P.K. Srimani. In IWDC, volume 2918 of LNCS, pages 26-32. Springer, 2003.
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees, Z. Shi, wg, and S.T. Hedetniemi. Inform. Process. Lett., 91:77-83, 2004.
• Self-stabilizing maximal $k$-dependent sets in linear time, M. Gairing, wg, S.T. Hedetniemi, and D.P. Jacobs. Parallel Process. Lett., 14:75-82, 2004.
• Distance-two information in self-stabilizing algorithms, M. Gairing, wg, S.T. Hedetniemi, P. Kristiansen, and A.A. McRae. Parallel Processing Letters, 14:387-398, 2004.
• Self-stabilizing algorithms for orderings and colorings, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. Internat. J. Found. Comput. Sci., 16:19-36, 2005. Also in APDCM'04.
• Self-stabilizing global optimization algorithms for large network graphs, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. International Journal of Distributed Sensor Networks, 1:329-344, 2005.
• Distance-$k$ Information in Self-stabilizing Algorithms., wg, S.T. Hedetniemi, D.P. Jacobs, and V. Trevisan. In Paola Flocchini and Leszek Gasieniec, editors, Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, volume 4056 of LNCS, pages 349-356. Springer, 2006.
• An anonymous self-stabilizing algorithm for 1-maximal matching in trees, wg, S.T. Hedetniemi, and Z. Shi. In Proceedings of PDPTA'06, volume II, pages 797-803, 2006.
• Anonymous daemon conversion in celf-stabilizing algorithms by randomization in constant space, wg, S.T. Hedetniemi, D.P. Jacobs, and P.K. Srimani. In S. Rao et al., editor, Distributed Computing and Networking, 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, volume 4904 of LNCS, pages 182-190. Springer, 2008.
• Self-stabilizing graph protocols, wg, S.T. Hedetniemi, D.P. Jacobs, P.K. Srimani, and Z. Xu. Parallel Process. Lett., 18:189-199, 2008.
• Distance-$k$ knowledge in self-stabilizing algorithms, wg, S.T. Hedetniemi, D.P. Jacobs, and V. Trevisan. Theor. Comput. Sci., 399:118-127, 2008.
• Anonymous self-stabilizing distributed algorithms for connected dominating set in a network graph, wg and P.K. Srimani. In Proceedings of The International Multi-Conference on Complexity, Informatics and Cybernetics: IMCIC 2010, 2010.
• Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size, wg and P.K. Srimani. In 24th IEEE International Symposium on Parallel and Distributed Processing, APDMCM Workshop Proceedings, pages 1-8. IEEE, 2010.
• Self-stabilizing master-slave token circulation and efficient topology computation in a tree of arbitrary size, wg and P.K. Srimani. In 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May 2011 - Workshop Proceedings, pages 618-625. IEEE, 2011.
• Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size, wg and P.K. Srimani. Internat. J. Found. Comput. Sci., 23:763-777, 2012. Also in APDCM'10.
• Daemon conversions in distributed self-stabilizing algorithms, wg and P.K. Srimani. In WALCOM: Algorithms and computation, pages 146-157. Springer, 2013.