Search the dblp DataBase
Somenath Biswas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Manindra Agrawal, Somenath Biswas
Universal Relations. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1992, pp:207-220 [Conf] - Manindra Agrawal, Somenath Biswas
Polynomial Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1993, pp:75-80 [Conf] - Manindra Agrawal, Somenath Biswas
Primality and Identity Testing via Chinese Remaindering. [Citation Graph (0, 0)][DBLP]
FOCS, 1999, pp:202-209 [Conf] - Vikraman Arvind, Somenath Biswas
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. [Citation Graph (0, 0)][DBLP]
FSTTCS, 1987, pp:456-469 [Conf] - Ranjith Vasireddy, Somenath Biswas
Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. [Citation Graph (0, 0)][DBLP]
ICONIP, 2004, pp:1310-1315 [Conf] - Vikraman Arvind, Somenath Biswas
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. [Citation Graph (0, 0)][DBLP]
STACS, 1987, pp:323-335 [Conf] - Samarjit Chakraborty, Somenath Biswas
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. [Citation Graph (0, 0)][DBLP]
WADS, 1999, pp:253-264 [Conf] - Vikraman Arvind, Somenath Biswas
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. [Citation Graph (0, 0)][DBLP]
Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:83-99 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1987, v:24, n:1, pp:67-69 [Journal] - Manindra Agrawal, Somenath Biswas
Primality and identity testing via Chinese remaindering. [Citation Graph (0, 0)][DBLP]
J. ACM, 2003, v:50, n:4, pp:429-443 [Journal] - Manindra Agrawal, Somenath Biswas
Polynomial-Time Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1996, v:53, n:2, pp:155-160 [Journal] - Manindra Agrawal, Somenath Biswas
NP-Creative Sets: A New Class of Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1996, v:29, n:5, pp:487-505 [Journal] - Vikraman Arvind, Somenath Biswas
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1989, v:68, n:2, pp:123-134 [Journal] - Sanjeev N. Khadilkar, Somenath Biswas
Padding, Commitment and Self-Reducibility. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1991, v:81, n:2, pp:189-199 [Journal] - Seshadhri Comandur, Anil Seth, Somenath Biswas
RAM Simulation of BGS Model of Abstract State Machines. [Citation Graph (0, 0)][DBLP]
Abstract State Machines, 2005, pp:377-386 [Conf] - Seshadhri Comandur, Anil Seth, Somenath Biswas
RAM Simulation of BGS Model of Abstract-state Machines. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 2007, v:77, n:1-2, pp:175-185 [Journal]
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002