
S. Sen Sarma. Crosstalk minimization on VLSI Circuits Accepted for publication URSI, Ga, New Delhi, India, 2005

S. Sen Sarma. An AI based approach to noise reduction on VLSI circuit – accepted in URSI commission. October 2005.

S. Sen Sarma. In search of a versatile and flexible graph model to implement computer network CODIS, JU, Kolkata, India, pp. 635638, 2004.

S. Sen Sarma. Quantum computing approach to NP completes problems. CODEC, January 13, 2004

S. Sen Sarma. Reduction of Computational Complexity in some hard combinational problem using Artificial Neural Network, CODEC, January 13, 2004

S. Sen Sarma. Soft Computing Approach to benchmark PProblem CODEC, January 13, 2004.

S. Sen Sarma. GA, Scheduling Graph Coloring and VLSI Algorithms, HOT, pp .79. 2003.

S. Sen Sarma. Two Fast and Parallel Shortest path Algorithms, HOT, pp. 213. 2003.

S. Sen Sarma. From Babbage to Von Newman but Feyman to what? , Proceedings of the Richard Feyman Memorial Seminar, IEEE, 2003

S. Sen Sarma. Scheduling viz Bin Packing an approximate algorithm. APORS. 2003.

S. Sen Sarma ( Soumava Das & Rohon Sen). Two fast and parallel shortest path algorithms HOT – 2003.

S.Sen Sarma ,AJ. Pal – G.A., Scheduling, Graph coloring and VLSI algorithms. HOT 2003.

S. Sen Sarma ( with A.J. Pal ). GA, graph coloring and it’s applications. 96 West Bengal State Science & Technology Congress 2002.

S. Sen Sarma( with A.J. Pal & H. Mukhopadhyay). How GA can generate a sequence that optimally paints the nodes of a graph.

S. Sen Sarma. Wire length Minimization in Routing and Performance Ehnancement in VLSI Design, Presented in VDAT, 2000

S.Sen Sarma. How GA can generate a sequence that optimally paints Nodes of Graph”, CSIERC June 1112, 1999.

S. Sen Sarma. In search of some Low Cost Restricted Channel Routing Algorithm and Novelty in Complexity Analysis – Published in Information Technology for Growth and Prosperity – CSI. Tata McGrawHill.,1994.

S. Sen Sarma ( with R. Mondal, A. Seth). Some sequential graph coloripg algorithms INT. J. Electronics vol. 77, pp. 8193, 1994.

S. Sen Sarma. Selection Problem – A different approach, AMSE Review, Vol 11 No 4. pp. 16. 1989.

S. Sen Sarma (S. K. Bandyopadhyay). Some sequential graph wloring algorithms.INT J. Electmnics Vol. 67, pp. 187199, 1989.

S. Sen Sarma. All cycle of a finite Nonoriented Linier net: Accepted for publication in 22nd Midwest Symposium on circuit and system. 1979.

S. Sen Sarma. Cliques by divide and conquer published in the proceeding of a symposium on Computer Control organized by the University of Roorkee, 1978.

S. Sen Sarma. Algorithms for the generation of trees and two trees of a network graph, Proceeding of 20th Midwest symposium on circuit and systems, 1977.