default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhashis Majumder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Sabyasachee Banerjee
, Subhashis Majumder, Bhargab B. Bhattacharya, Debesh K. Das:
Power-aware partitioning and test time reduction for 3D-SoC. Innov. Syst. Softw. Eng. 20(3): 485-498 (2024)- [c37]Tathagata Bhattacharya, Vivek Tanniru, Subhashis Majumder, Saiteja Veeramalla:
Enhancing the Energy Efficiency with DURGA, a Novel Geographical Load Balancer. CCGridW 2024: 180-190 - [c36]Sabyasachee Banerjee, Subhashis Majumder, Bhargab B. Bhattacharya:
On Managing Test-Time, Power, and Layer Assignment in 3D SoCs with Built-In-Self-Repair Modules. VLSID 2024: 684-689 - 2023
- [c35]Nilanjana G. Basu, Subhashis Majumder, Partha Bhowmick:
On Density Extrema for Digital '1-Balls in 2D and 3D. CCCG 2023: 313-319 - 2022
- [c34]Reshmi Maulik, Subhajit Datta, Subhashis Majumder:
Litmus Test for Linus' Law: A Structural Equation Modeling Based Approach. EASE 2022: 237-242 - [c33]Nilanjana G. Basu, Partha Bhowmick, Subhashis Majumder:
On Density Extrema for Digital Discs. IWCIA 2022: 56-70 - 2021
- [j22]Joydeep Das, Subhashis Majumder, Kalyani Mali:
Clustering Techniques to Improve Scalability and Accuracy of Recommender Systems. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 29(4): 621-651 (2021) - [j21]Sabyasachee Banerjee, Subhashis Majumder, Debesh K. Das, Bhargab B. Bhattacharya:
Fast algorithms for test optimization of core based 3D SoC. Integr. 77: 70-88 (2021) - [j20]Joydeep Das, Subhashis Majumder, Prosenjit Gupta, Suman Datta:
Scalable recommendations using decomposition techniques based on Voronoi diagrams. Inf. Process. Manag. 58(4): 102566 (2021) - [j19]Sabyasachee Banerjee, Soumendu Ghorui, Subhashis Majumder:
Designing balanced wrapper chains in 3D SoC under constrained TSVs. Innov. Syst. Softw. Eng. 17(3): 219-230 (2021) - [j18]Subhajit Datta, Reshma Roychoudhuri, Subhashis Majumder:
Understanding the relation between repeat developer interactions and bug resolution times in large open source ecosystems: A multisystem study. J. Softw. Evol. Process. 33(4) (2021) - [j17]Nilina Bera, Subhashis Majumder, Sutirtha Das, Sweta Mukherjee, Neha Aryani, Bhargab B. Bhattacharya:
SIMOP: A SIMulation-Guided OPtimization Mechanism for Sample Preparation with Digital Microfluidic Biochip. SN Comput. Sci. 2(2): 84 (2021) - [c32]Ishita Bardhan, Subhajit Datta, Subhashis Majumder:
Degree doesn't Matter: Identifying the Drivers of Interaction in Software Development Ecosystems. APSEC 2021: 410-420 - [c31]Subhajit Datta, Amrita Bhattacharjee, Subhashis Majumder:
Links do Matter: Understanding the Drivers of Developer Interactions in Software Ecosystems. ICSME 2021: 619-623 - [i2]Biswajit Sanyal, Subhashis Majumder, Priya Ranjan Sinha Mahapatra:
Efficient Reporting of Top-k Subset Sums. CoRR abs/2105.11250 (2021) - 2020
- [j16]Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon, Prosenjit Gupta:
Efficient meta-data structure in top-k queries of combinations and multi-item procurement auctions. Theor. Comput. Sci. 814: 210-222 (2020)
2010 – 2019
- 2019
- [j15]Joydeep Das, Subhashis Majumder, Prosenjit Gupta, Kalyani Mali:
Collaborative Recommendations using Hierarchical Clustering based on K-d Trees and Quadtrees. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 27(4): 637-668 (2019) - [j14]Partha Basuchowdhuri, Satyaki Sikdar, Varsha Nagarajan, Khusbu Mishra, Surabhi Gupta, Subhashis Majumder:
Fast detection of community structures using graph traversal in social networks. Knowl. Inf. Syst. 59(1): 1-31 (2019) - [c30]Anindita Kundu, Shaunak Mukherjee, Ashmi Banerjee, Subhashis Majumder:
End-User Position-Driven Small Base Station Placement for Indoor Communication. ACSS (1) 2019: 13-25 - [c29]Sambo Dutta, Soumita Das, Joydeep Das, Subhashis Majumder:
Tag-Cloud Based Recommendation for Movies. CISIM 2019: 324-336 - [c28]Joydeep Das, Madhurima Banerjee, Kalyani Mali, Subhashis Majumder:
Scalable Recommendations Using Clustering Based Collaborative Filtering. ICIT 2019: 279-284 - [c27]Soumendu Ghorui, Sabyasachee Banerjee, Subhashis Majumder:
A Deterministic Multi-layered Partitioning Tool for Wire-Length Reduction of Monolithic 3D-IC. HiPC 2019: 44-51 - 2018
- [j13]Anindita Kundu, Subhashis Majumder, Iti Saha Misra, Salil Kumar Sanyal:
Distributed heuristic adaptive power control algorithms in femto cellular networks for improved performance. Trans. Emerg. Telecommun. Technol. 29(5) (2018) - [c26]Sabyasachee Banerjee, Subhashis Majumder, Bhargab B. Bhattacharya:
Test-Time Reduction for Power-Aware 3D-SoC. VLSID 2018: 103-108 - 2017
- [j12]Nilanjana G. Basu, Subhashis Majumder, Wing-Kai Hon:
On Finding the Maximum and Minimum Density Axes-parallel Regions in IRd. Fundam. Informaticae 152(1): 1-12 (2017) - [j11]Subhajit Datta, Partha Basuchowdhuri, Surajit Acharya, Subhashis Majumder:
The Habits of Highly Effective Researchers: An Empirical Study. IEEE Trans. Big Data 3(1): 3-17 (2017) - [c25]Sabyasachee Banerjee, Subhashis Majumder, Abhishek Varma, Debesh K. Das:
A placement optimization technique for 3D IC. ISED 2017: 1-5 - [i1]Partha Basuchowdhuri, Varsha Nagarajan, Khusbu Mishra, Satyaki Sikdar, Surabhi Gupta, Subhashis Majumder:
Fast Detection of Community Structures using Graph Traversal in Social Networks. CoRR abs/1707.04459 (2017) - 2016
- [j10]Nilina Bera, Subhashis Majumder, Bhargab B. Bhattacharya:
Simulation-based method for optimum microfluidic sample dilution using weighted mix-split of droplets. IET Comput. Digit. Tech. 10(3): 119-127 (2016) - [j9]Sukhamay Kundu, Subhashis Majumder:
A linear time algorithm for optimal k-hop dominating set of a tree. Inf. Process. Lett. 116(2): 197-202 (2016) - [c24]Partha Basuchowdhuri, Satyaki Sikdar, Sonu Shreshtha, Subhashis Majumder:
Detecting Community Structures in Social Networks by Graph Sparsification. CODS 2016: 5:1-5:9 - [c23]Anindita Kundu, Subhashis Majumder, Iti Saha Misra, Salil Kumar Sanyal:
A heuristic approach towards minimizing resource allocation for femto base station deployment. EuCNC 2016: 330-334 - [c22]Sabyasachee Banerjee, Subhashis Majumder, Bhargab B. Bhattacharya:
Power-aware test optimization for core-based 3D-SOCs under TSV-constraints. VLSI-SoC 2016: 1-6 - [c21]Biswajit Sanyal, Subhashis Majumder, Wing-Kai Hon:
Efficient Generation of Top-k Procurements in a Multi-item Auction. WALCOM 2016: 181-193 - 2015
- [j8]Partha Basuchowdhuri, V. K. Lakshan Prabhu, Mithun Roy, Subhashis Majumder, Sanjoy Kumar Saha:
Unified scheme for finding disjoint and overlapping communities in social networks using strength of ties. Int. J. Soc. Netw. Min. 2(2): 173-202 (2015) - [j7]Partha Basuchowdhuri, Riya Roy, Siddhartha Anand, Diksha Roy Srivastava, Subhashis Majumder, Sanjoy Kumar Saha:
Spanning tree-based fast community detection methods in social networks. Innov. Syst. Softw. Eng. 11(3): 177-186 (2015) - [c20]Joydeep Das, Subhashis Majumder, Debarshi Dutta, Prosenjit Gupta:
Iterative Use of Weighted Voronoi Diagrams to Improve Scalability in Recommender Systems. PAKDD (1) 2015: 605-617 - [c19]Sabyasachee Banerjee, Subhashis Majumder, Debesh K. Das:
Partitioning-based test time reduction for core-based 3DICs. VDAT 2015: 1-5 - 2014
- [c18]Subhashis Majumder, Biswajit Sanyal, Prosenjit Gupta, Soumik Sinha, Shiladitya Pande, Wing-Kai Hon:
Top - K Query Retrieval of Combinations with Sum-of-Subsets Ranking. COCOA 2014: 490-505 - [c17]Nilina Bera, Subhashis Majumder, Bhargab B. Bhattacharya:
Analysis of Concentration Errors in Sample Dilution Algorithms on a Digital Microfluidic Biochip. ICAA 2014: 89-100 - [c16]Partha Basuchowdhuri, Subhashis Majumder:
Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set. ICAA 2014: 137-151 - [c15]Sabyasachee Banerjee, Subhashis Majumder, Bhargab B. Bhattacharya:
A Graph-Based 3D IC Partitioning Technique. ISVLSI 2014: 613-618 - [c14]Subhajit Datta, Proshanta Sarkar, Subhashis Majumder:
Developer involvement considered harmful?: an empirical examination of Android bug resolution times. SSE@SIGSOFT FSE 2014: 45-48 - [c13]Sabyasachee Banerjee, Subhashis Majumder:
A thermal aware 3D IC partitioning technique. VDAT 2014: 1-6 - [c12]Subhajit Datta, Proshanta Sarkar, Sutirtha Das, Sonu Sreshtha, Prasanth Lade, Subhashis Majumder:
How Many Eyeballs Does a Bug Need? An Empirical Validation of Linus' Law. XP 2014: 242-250 - 2013
- [j6]Biswajit Sanyal, Prosenjit Gupta, Subhashis Majumder:
Colored top-K range-aggregate queries. Inf. Process. Lett. 113(19-21): 777-784 (2013) - 2012
- [c11]Arpan Chaudhury, Partha Basuchowdhuri, Subhashis Majumder:
Spread of Information in a Social Network Using Influential Nodes. PAKDD (2) 2012: 121-132 - 2010
- [j5]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
Separating Multi-Color Points on a Plane with Fewest Axis-Parallel Lines. Fundam. Informaticae 99(3): 315-324 (2010)
2000 – 2009
- 2008
- [j4]Subhashis Majumder, Bhargab B. Bhattacharya:
On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips. Inf. Process. Lett. 107(5): 177-182 (2008) - [c10]Ramesh Bharadwaj, Supratik Mukhopadhyay, Manuel Peralta, Krishna Shenai, Subhashis Majumder:
Cognitive Distributed Networks in Environmental e-Science. FTDCS 2008: 192-198 - 2007
- [j3]Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Swarup Kumar Das:
Hierarchical partitioning of VLSI floorplans by staircases. ACM Trans. Design Autom. Electr. Syst. 12(1): 7:1-7:19 (2007) - 2006
- [c9]Subhashis Majumder, Bhargab B. Bhattacharya:
Solving Thermal Problems of Hot Chips Using Voronoi Diagrams. VLSI Design 2006: 545-548 - 2005
- [c8]Subhashis Majumder, Bhargab B. Bhattacharya:
Density or Discrepancy: A VLSI Designer's Dilemma in Hot Spot Analysis. CCCG 2005: 167-170 - [c7]Subhashis Majumder, Susmita Sur-Kolay, Subhas C. Nandy, Bhargab B. Bhattacharya, B. Chakraborty:
Hot Spots and Zones in a Chip: A Geometrician's View. VLSI Design 2005: 691-696 - 2004
- [j2]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan. J. Circuits Syst. Comput. 13(5): 1019-1038 (2004) - [j1]Subhashis Majumder, Bhargab B. Bhattacharya, Vishwani D. Agrawal, Michael L. Bushnell:
A New Classification of Path-Delay Fault Testability in Terms of Stuck-at Faults. J. Comput. Sci. Technol. 19(6): 955-964 (2004) - 2001
- [c6]Subhashis Majumder, Susmita Sur-Kolay, Bhargab B. Bhattacharya, Subhas C. Nandy:
Area(number)-balanced hierarchy of staircase channels with minimum crossing nets. ISCAS (5) 2001: 395-398 - 2000
- [c5]Swarup Bhunia, Subhashis Majumder, Ayan Sircar, Susmita Sur-Kolay, Bhargab B. Bhattacharya:
Topological Routing Amidst Polygonal Obstacles. VLSI Design 2000: 274-279
1990 – 1999
- 1999
- [c4]Subhashis Majumder, Bhargab B. Bhattacharya, Vishwani D. Agrawal, Michael L. Bushnell:
A Complete Characterization of Path Delay Faults through Stuck-at Faults. VLSI Design 1999: 492-497 - 1998
- [c3]Subhashis Majumder, Subhas C. Nandy, Bhargab B. Bhattacharya:
Partitioning VLSI Floorplans by Staircase Channels for Global Routing. VLSI Design 1998: 59-64 - [c2]Subhashis Majumder, Michael L. Bushnell, Vishwani D. Agrawal:
Path Delay Testing: Variable-Clock Versus Rated-Clock. VLSI Design 1998: 470-475 - [c1]Subhashis Majumder, Vishwani D. Agrawal, Michael L. Bushnell:
On Delay-Untestable Paths and Stuck-Fault Redundancy. VTS 1998: 194-199
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-10-23 21:26 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:
