|
Parallel and Distributed Computing/Architectures
Min Quyang, M. Toulouse, K. Thulasiraman, F. Glover, and J. S. Deogun, “MultiLevel Cooperative Search for the Circuit/Hypergraph Partitioning Problem”, IEEE Trans. on CAD of Integrated Circuits and Systems, vol.21, June 2002, pp. 685-693. See also M. Toulouse, K. Thulasiraman and F. Glover, “Multi-Level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning", International European Parallel Processing Conference, Vol. 1685, Lecture Notes in Computer Science, 1999, pp. 533-542
K. Thulasiraman, and A. Das, “Networked Computing for the Max-Flow Problem”, World Multiconference on Systematics, Cybernetics and Informatics, Venezuela, July 1997.
R. P. Chalasani and K. Thulasiraman, “Parallel Computing for Network Optimization: A Cluster Based Approach for the Dual Transshipment Problem”, Proc. Seventh IEEE Symposium on Parallel and Distributed Processing, San Antonio, 1995. pp. 66-73.
K. Thulasiraman, R. P. Chalasani and M. A. Comeau, “Parallel Network Dual Simplex Method on a Shared Memory Multiprocessor”, Proc. 5th IEEE Symp. on Parallel and Distributed Processing, Dallas, December 1993, pp. 408-415.
S. Srinivas, K. Thulasiraman and M.N.S. Swamy, “A MIN-based Reconfigurable Architecture for de Bruijn Structures”, International Journal of High Speed Electronics, Vol. 3, 1992, pp. 279-296.
Y. Zhao, L. Tao, K. Thulasiraman and M.N.S. Swamy, “Simulated Annealing and Tabu Search Algorithms for Multiway Graph Partition”, Journal of Circuits, Systems and Computers, Vol. 2, No. 2, 1992, pp. 159-185.
Y. Kajitani, H. Miyayo, S. Ueno, and K. Thulasiraman, "On the Optimal Synchronizer for Asynchronous Distributed Networks", Proc. Tech. Group on CAS, IEICE, Nov 1988.
K. B. Lakshmanan, N. Meenakshi and K. Thulasiraman, “A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First Search”, Information Processing Letters, Vol. 25, No. 2, May 1987, pp. 103-109.
M. A. Comeau, K. Thulasiraman and K. B. Lakshmanan, “An Efficient Asynchronous Distributed Protocol to Test Feasibility of the Dual Transshipment Problem”, 25th Allerton Conference on Communication, Control and Computing, University of Illinois, Urbana- Campaign, September 1987.
K. B. Lakshmanan and K. Thulasiraman, "On the Use of Synchronizers for Asynchronous Communication Networks", Workshop on Distributed Algorithms, Amsterdam July 1987
K. B. Lakshmanan, K. Thulasiraman and M. Comeau, “An Efficient Distributed Protocol for the Single Source Shortest Path Problem In Networks with Negative Weights”, IEEE Trans. on Software Engineering, Vol. 15, May 1989, pp. 639-644.