default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhas Kumar Ghosh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c10]Koushik Sinha, Pratham Majumder, Subhas Kumar Ghosh:
Fully Homomorphic Encryption based Privacy-Preserving Data Acquisition and Computation for Contact Tracing. IEEE ANTS 2020: 1-6
2010 – 2019
- 2011
- [c9]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 - [i4]Esha Ghosh, Subhas Kumar Ghosh, C. Pandu Rangan:
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs. CoRR abs/1109.1706 (2011) - 2010
- [j4]Subhas Kumar Ghosh, Janardan Misra:
A Randomized Algorithm for 3-SAT. Math. Comput. Sci. 3(4): 421-431 (2010) - [j3]Indranil Saha, Lokesh Kumar Sambasivan, Subhas Kumar Ghosh, Ranjeet Kumar Patro:
Distributed fault-tolerant topology control in wireless multi-hop networks. Wirel. Networks 16(6): 1511-1524 (2010) - [c8]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
- [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) - [c7]Subhas Kumar Ghosh, Koushik Sinha:
On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs. FCT 2009: 145-156 - [c6]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 - [i3]Subhas Kumar Ghosh, Koushik Sinha:
Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs. CoRR abs/0905.3812 (2009) - [i2]Subhas Kumar Ghosh, Janardan Misra:
A Randomized Algorithm for 3-SAT. CoRR abs/0906.1849 (2009) - 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) - [c5]Subhas Kumar Ghosh:
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks. CSE 2008: 394-401 - 2007
- [c4]Indranil Saha, Lokesh Kumar Sambasivan, Ranjeet Kumar Patro, Subhas Kumar Ghosh:
Distributed Fault-Tolerant Topology Control in Static and Mobile Wireless Sensor Networks. COMSWARE 2007 - 2006
- [c3]Subhas Kumar Ghosh:
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks. ESAS 2006: 121-135 - [c2]Chandrashekhara Thejaswi P. S., S. Viswanath Ganapathy, Ranjeet Kumar Patro, Manik Raina, Subhas Kumar Ghosh:
An Estimator for Multi-Sensor Data Fusion. SMC 2006: 2690-2694 - [i1]Subhas Kumar Ghosh:
Unique k-SAT is as Hard as k-SAT. Electron. Colloquium Comput. Complex. TR06 (2006) - 2004
- [c1]Subhas Kumar Ghosh, Amitabha Ghosh:
A plan-commit-prove protocol for secure verification of traversal path. ICON 2004: 458-462
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-25 05:50 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:
