Somenath Biswas

Apurv Nakade, Somenath Biswas: Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm. Inf. Process. Lett. 112(23): 922-927 (2012)

Shenoy K. B. Ajitha, Somenath Biswas, Piyush P. Kurur: Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS 2011: 442-447

Swagato Sanyal, Raja S, Somenath Biswas: Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO 2010: 1417-1424

Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66

Seshadhri Comandur, Anil Seth, Somenath Biswas: RAM Simulation of BGS Model of Abstract-state Machines. Fundam. Inform. 77(1-2): 175-185 (2007)

Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas: Universality for Nondeterministic Logspace. LATA 2007: 103-114

Seshadhri Comandur, Anil Seth, Somenath Biswas: RAM Simulation of BGS Model of Abstract State Machines. Abstract State Machines 2005: 377-386

Ranjith Vasireddy, Somenath Biswas: Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. ICONIP 2004: 1310-1315

Manindra Agrawal, Somenath Biswas: Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003)

Manindra Agrawal, Somenath Biswas: Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209

Samarjit Chakraborty, Somenath Biswas: Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. WADS 1999: 253-264

Manindra Agrawal, Somenath Biswas: Reducing Randomness via Chinese Remaindering. Electronic Colloquium on Computational Complexity (ECCC) 6(18) (1999)

Manindra Agrawal, Somenath Biswas: Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53(2): 155-160 (1996)

Manindra Agrawal, Somenath Biswas: NP-Creative Sets: A New Class of Creative Sets in NP. Mathematical Systems Theory 29(5): 487-505 (1996)

Manindra Agrawal, Somenath Biswas: Polynomial Isomorphism of 1-L-Complete Sets. Structure in Complexity Theory Conference 1993: 75-80

Manindra Agrawal, Somenath Biswas: Universal Relations. Structure in Complexity Theory Conference 1992: 207-220

Vikraman Arvind, Somenath Biswas: Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. Int. J. Found. Comput. Sci. 2(2): 83-99 (1991)

Sanjeev N. Khadilkar, Somenath Biswas: Padding, Commitment and Self-Reducibility. Theor. Comput. Sci. 81(2): 189-199 (1991)

Somenath Biswas, Kesav V. Nori (Eds.): Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings. Lecture Notes in Computer Science 560, Springer 1991, isbn 3-540-54967-6

Vikraman Arvind, Somenath Biswas: On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. Theor. Comput. Sci. 68(2): 123-134 (1989)

Vikraman Arvind, Somenath Biswas: An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. Inf. Process. Lett. 24(1): 67-69 (1987)

Vikraman Arvind, Somenath Biswas: On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS 1987: 456-469

Vikraman Arvind, Somenath Biswas: Expressibility of First Order Logic with a Nondeterministic Inductive Operator. STACS 1987: 323-335