Somenath Biswas

29 papers A* 1A 4B 2C 2Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2022 J jnl
Various proofs of the Fundamental Theorem of Markov Chains.
CoRR
Somenath Biswas
2020 J jnl
Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces.
IEEE Trans. Evol. Comput.
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
2017 J jnl
A note on faithful coupling of Markov chains.
CoRR
Debojyoti Dey, Pranjal Dutta, Somenath Biswas
2014 A conf
Performance of metropolis algorithm for the minimum weight code word problem.
GECCO
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
2012 J jnl
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm.
Inf. Process. Lett.
Apurv Nakade, Somenath Biswas
2011 C conf
Metropolis algorithm for solving shortest lattice vector problem (SVP).
HIS
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
2010 A conf
Necessary and sufficient conditions for success of the metropolis algorithm for optimization.
GECCO
Swagato Sanyal, Raja S, Somenath Biswas
2009 A conf
Computing single source shortest paths using single-objective fitness.
FOGA
Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
2007 J jnl
RAM Simulation of BGS Model of Abstract-state Machines.
Fundam. Informaticae
Seshadhri Comandur, Anil Seth, Somenath Biswas
2007 C conf
Universality for Nondeterministic Logspace.
LATA
Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas
2005 — conf
RAM Simulation of BGS Model of Abstract State Machines.
Abstract State Machines
Seshadhri Comandur, Anil Seth, Somenath Biswas
2004 B conf
Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets.
ICONIP
Ranjith Vasireddy, Somenath Biswas
2003 J jnl
Primality and identity testing via Chinese remaindering.
J. ACM
Manindra Agrawal, Somenath Biswas
1999 B conf
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules.
WADS
Samarjit Chakraborty, Somenath Biswas
1999 A* conf
Primality and Identity Testing via Chinese Remaindering.
FOCS
Manindra Agrawal, Somenath Biswas
1999 J jnl
Reducing Randomness via Chinese Remaindering
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Somenath Biswas
1996 J jnl
NP-Creative Sets: A New Class of Creative Sets in NP.
Math. Syst. Theory
Manindra Agrawal, Somenath Biswas
1996 J jnl
Polynomial-Time Isomorphism of 1-L-Complete Sets.
J. Comput. Syst. Sci.
Manindra Agrawal, Somenath Biswas
1993 — conf
Polynomial Isomorphism of 1-L-Complete Sets.
SCT
Manindra Agrawal, Somenath Biswas
1992 — conf
Universal Relations.
SCT
Manindra Agrawal, Somenath Biswas
1991 J jnl
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties.
Int. J. Found. Comput. Sci.
Vikraman Arvind, Somenath Biswas
1991 — ed.
Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings
FSTTCS
Somenath Biswas, Kesav V. Nori
1991 J jnl
Padding, Commitment and Self-Reducibility.
Theor. Comput. Sci.
Sanjeev N. Khadilkar, Somenath Biswas
1989 J jnl
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas.
Theor. Comput. Sci.
Vikraman Arvind, Somenath Biswas
1987 J jnl
An Algorithm to Decide Feasibility of Linear Integer Constraints Occurring in Decision Tables.
IEEE Trans. Software Eng.
Somenath Biswas, V. Rajaraman
1987 J jnl
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences.
Inf. Process. Lett.
Vikraman Arvind, Somenath Biswas
1987 A conf
Expressibility of First Order Logic with a Nondeterministic Inductive Operator.
STACS
Vikraman Arvind, Somenath Biswas
1987 — conf
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas.
FSTTCS
Vikraman Arvind, Somenath Biswas
1979 J jnl
The generalized towers of Hanoi.
SIGACT News
M. S. Krishnamoorthy, Somenath Biswas