default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatyajit Banerjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Hitkul Jangra
, Abinaya K, Soham Saha, Satyajit Banerjee, Muthusamy Chelliah, Ponnurangam Kumaraguru:
Social Re-Identification Assisted RTO Detection for E-Commerce. WWW (Companion Volume) 2023: 854-858
2010 – 2019
- 2015
- [c8]Satyajit Banerjee, Debapriyay Mukhopadhyay, Suman Roy:
A New Threshold Certification Scheme Based Defense Against Sybil Attack for Sensor Networks. ICISS 2015: 562-572 - 2013
- [j5]Satyajit Banerjee:
An Efficient NC Algorithm for Approximate Maximum Weight Matching. Discret. Math. Algorithms Appl. 5(3) (2013) - 2011
- [c7]Satyajit Banerjee, Atish Datta Chowdhury, Koushik Sinha, Subhas Kumar Ghosh:
Contention-Free Many-to-Many Communication Scheduling for High Performance Clusters. ICDCIT 2011: 150-161 - 2010
- [j4]Satyajit Banerjee:
On the Lower Bound of the Competitive Ratio for the Weighted Online Roommates Problem. Discret. Math. Algorithms Appl. 2(2): 257-262 (2010) - [c6]Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh:
Video Surveillance with PTZ Cameras: The Problem of Maximizing Effective Monitoring Time. ICDCN 2010: 341-352
2000 – 2009
- 2009
- [j3]Susmita Sur-Kolay, Satyajit Banerjee, Srabani Mukhopadhyaya, C. A. Murthy:
The Double Digest Problem: finding all solutions. Int. J. Bioinform. Res. Appl. 5(5): 570-592 (2009) - [j2]Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh:
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs. Inf. Process. Lett. 109(14): 790-794 (2009) - [c5]Koushik Sinha, Atish Datta Chowdhury, Subhas Kumar Ghosh, Satyajit Banerjee:
Efficient Load Balancing on a Cluster for Large Scale Online Video Surveillance. ICDCN 2009: 450-455 - 2008
- [j1]Satyajit Banerjee, Atish Datta Chowdhury, Subhas Kumar Ghosh:
Efficient Algorithms for Variants of Weighted Matching and Assignment Problems. Math. Comput. Sci. 1(4): 673-688 (2008) - 2006
- [c4]Satyajit Banerjee, Debapriyay Mukhopadhyay:
Symmetric key based authenticated querying in wireless sensor networks. InterSense 2006: 22 - [c3]Indranil Saha, Debapriyay Mukhopadhyay, Satyajit Banerjee:
Designing Reliable Architecture for Stateful Fault Tolerance. PDCAT 2006: 545-551 - 2005
- [c2]Susmita Sur-Kolay, Satyajit Banerjee, Srabani Mukhopadhyaya, C. A. Murthy:
Genetic Algorithm for Double Digest Problem. PReMI 2005: 623-629 - 2003
- [c1]Susmita Sur-Kolay, Satyajit Banerjee, C. A. Murthy:
Flavours of Traveling Salesman Problem in VLSI Design. IICAI 2003: 656-667
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-04-24 22:59 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:
