Somenath Biswas

Publication Activity (10 Years)

Years Active: 1979-2022
Publications (10 Years): 3

Top Topics

Monte Carlo Method

Markov Processes

Transition Matrix

Top Venues

IEEE Trans. Evol. Comput.

Publications

Somenath Biswas
Various proofs of the Fundamental Theorem of Markov Chains. CoRR (2022)
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces. IEEE Trans. Evol. Comput. 24 (4) (2020)
Debojyoti Dey, Pranjal Dutta, Somenath Biswas
A note on faithful coupling of Markov chains. CoRR (2017)
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Performance of metropolis algorithm for the minimum weight code word problem. GECCO (2014)
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) (2012)
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS (2011)
Swagato Sanyal, Raja S, Somenath Biswas
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO (2010)
Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
Computing single source shortest paths using single-objective fitness. FOGA (2009)
Seshadhri Comandur, Anil Seth, Somenath Biswas
RAM Simulation of BGS Model of Abstract-state Machines. Fundam. Informaticae 77 (1-2) (2007)
Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas
Universality for Nondeterministic Logspace. LATA (2007)
Seshadhri Comandur, Anil Seth, Somenath Biswas
RAM Simulation of BGS Model of Abstract State Machines. Abstract State Machines (2005)
Ranjith Vasireddy, Somenath Biswas
Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. ICONIP (2004)
Manindra Agrawal, Somenath Biswas
Primality and identity testing via Chinese remaindering. J. ACM 50 (4) (2003)
Manindra Agrawal, Somenath Biswas
Reducing Randomness via Chinese Remaindering Electron. Colloquium Comput. Complex. 6 (18) (1999)
Samarjit Chakraborty, Somenath Biswas
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. WADS (1999)
Manindra Agrawal, Somenath Biswas
Primality and Identity Testing via Chinese Remaindering. FOCS (1999)
Manindra Agrawal, Somenath Biswas
Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53 (2) (1996)
Manindra Agrawal, Somenath Biswas
NP-Creative Sets: A New Class of Creative Sets in NP. Math. Syst. Theory 29 (5) (1996)
Manindra Agrawal, Somenath Biswas
Polynomial Isomorphism of 1-L-Complete Sets. Computational Complexity Conference (1993)
Manindra Agrawal, Somenath Biswas
Universal Relations. Computational Complexity Conference (1992)
Vikraman Arvind, Somenath Biswas
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. Int. J. Found. Comput. Sci. 2 (2) (1991)
Sanjeev N. Khadilkar, Somenath Biswas
Padding, Commitment and Self-Reducibility. Theor. Comput. Sci. 81 (2) (1991)
Vikraman Arvind, Somenath Biswas
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. Theor. Comput. Sci. 68 (2) (1989)
Vikraman Arvind, Somenath Biswas
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS (1987)
Somenath Biswas, V. Rajaraman
An Algorithm to Decide Feasibility of Linear Integer Constraints Occurring in Decision Tables. IEEE Trans. Software Eng. 13 (12) (1987)
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) (1987)
Vikraman Arvind, Somenath Biswas
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. STACS (1987)
M. S. Krishnamoorthy, Somenath Biswas
The generalized towers of Hanoi. SIGACT News 10 (3) (1979)