default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSomenath Biswas
Person information
- affiliation: Indian Institute of Technology Kanpur, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i3]Somenath Biswas:
Various proofs of the Fundamental Theorem of Markov Chains. CoRR abs/2204.00784 (2022)- 2020
- [j12]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): 664-678 (2020)
2010 – 2019
- 2017
- [i2]Debojyoti Dey, Pranjal Dutta, Somenath Biswas:
A note on faithful coupling of Markov chains. CoRR abs/1710.10026 (2017) - 2014
- [c13]Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur:
Performance of metropolis algorithm for the minimum weight code word problem. GECCO 2014: 485-492 - 2012
- [j11]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) - 2011
- [c12]Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur:
Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS 2011: 442-447 - 2010
- [c11]Swagato Sanyal, Raja S, Somenath Biswas:
Necessary and sufficient conditions for success of the metropolis algorithm for optimization. GECCO 2010: 1417-1424
2000 – 2009
- 2009
- [c10]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 - 2007
- [j10]Seshadhri Comandur, Anil Seth, Somenath Biswas:
RAM Simulation of BGS Model of Abstract-state Machines. Fundam. Informaticae 77(1-2): 175-185 (2007) - [c9]Vinay Choudhary, Anand Kumar Sinha, Somenath Biswas:
Universality for Nondeterministic Logspace. LATA 2007: 103-114 - 2005
- [c8]Seshadhri Comandur, Anil Seth, Somenath Biswas:
RAM Simulation of BGS Model of Abstract State Machines. Abstract State Machines 2005: 377-386 - 2004
- [c7]Ranjith Vasireddy, Somenath Biswas:
Modeling Gene Regulatory Network in Fission Yeast Cell Cycle Using Hybrid Petri Nets. ICONIP 2004: 1310-1315 - 2003
- [j9]Manindra Agrawal, Somenath Biswas:
Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003)
1990 – 1999
- 1999
- [c6]Manindra Agrawal, Somenath Biswas:
Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209 - [c5]Samarjit Chakraborty, Somenath Biswas:
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. WADS 1999: 253-264 - [i1]Manindra Agrawal, Somenath Biswas:
Reducing Randomness via Chinese Remaindering. Electron. Colloquium Comput. Complex. TR99 (1999) - 1996
- [j8]Manindra Agrawal, Somenath Biswas:
Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53(2): 155-160 (1996) - [j7]Manindra Agrawal, Somenath Biswas:
NP-Creative Sets: A New Class of Creative Sets in NP. Math. Syst. Theory 29(5): 487-505 (1996) - 1993
- [c4]Manindra Agrawal, Somenath Biswas:
Polynomial Isomorphism of 1-L-Complete Sets. SCT 1993: 75-80 - 1992
- [c3]Manindra Agrawal, Somenath Biswas:
Universal Relations. SCT 1992: 207-220 - 1991
- [j6]Vikraman Arvind, Somenath Biswas:
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. Int. J. Found. Comput. Sci. 2(2): 83-99 (1991) - [j5]Sanjeev N. Khadilkar, Somenath Biswas:
Padding, Commitment and Self-Reducibility. Theor. Comput. Sci. 81(2): 189-199 (1991) - [e1]Somenath Biswas, Kesav V. Nori:
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 [contents]
1980 – 1989
- 1989
- [j4]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) - 1987
- [j3]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) - [j2]Somenath Biswas, V. Rajaraman:
An Algorithm to Decide Feasibility of Linear Integer Constraints Occurring in Decision Tables. IEEE Trans. Software Eng. 13(12): 1340-1347 (1987) - [c2]Vikraman Arvind, Somenath Biswas:
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS 1987: 456-469 - [c1]Vikraman Arvind, Somenath Biswas:
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. STACS 1987: 323-335
1970 – 1979
- 1979
- [j1]M. S. Krishnamoorthy, Somenath Biswas:
The generalized towers of Hanoi. SIGACT News 10(3): 49 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
