default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShibsankar Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Shikha Rai, Shibsankar Das
:
On Nirmala Indices of Some Hex-derived Networks of Type Three and Their Subdivision Networks. Sci. Ann. Comput. Sci. 33(2): 193-242 (2023)- [c10]Shibsankar Das, Adrish Banerjee:
New Quaternary Cross Z-Complementary Sets with Flexible Sequence Lengths. ANTS 2023: 414-419 - [c9]Shibsankar Das, Adrish Banerjee, Udaya Parampalli:
Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs. ISIT 2023: 880-885 - [i7]Shibsankar Das, Adrish Banerjee, Zilong Liu:
Root Cross Z-Complementary Pairs with Large ZCZ Width. CoRR abs/2308.06687 (2023) - [i6]Shibsankar Das, Adrish Banerjee, Udaya Parampalli:
Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs. CoRR abs/2308.06690 (2023) - 2022
- [j10]Shibsankar Das, Shikha Rai:
Degree-based topological descriptors of type 3 rectangular hex-derived networks. Bull. ICA 95: 21-37 (2022) - [c8]Shibsankar Das, Adrish Banerjee, Zi Long Liu:
New Family of Cross Z-Complementary Sequences With Large ZCZ Width. ISIT 2022: 522-527 - [c7]Shibsankar Das, Krishna Gopal Benerjee, Adrish Banerjee:
On DNA Codes Over the Non-Chain Ring ℤ4 +uℤ4 +u2ℤ4 with u3 =1. ITW 2022: 660-665 - [i5]Shibsankar Das, Krishna Gopal Benerjee, Adrish Banerjee:
On DNA Codes Over the Non-Chain Ring Z4+uZ4+u2Z4 with u3=1. CoRR abs/2211.13925 (2022) - 2021
- [j9]Shibsankar Das, Shikha Rai:
Topological Characterization of the Third Type of Triangular Hex-derived Networks. Sci. Ann. Comput. Sci. 31(2): 145-161 (2021) - [i4]Suhas Ranganath, Shibsankar Das, Sanjay Thilaivasan, Shipra Agarwal, Varun Shrivastava:
Grouping Search Results with Product Graphs in E-commerce Platforms. CoRR abs/2109.09349 (2021) - 2020
- [j8]Shibsankar Das:
An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs. Sci. Ann. Comput. Sci. 30(1): 25-37 (2020) - [j7]Shibsankar Das:
A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation. Sci. Ann. Comput. Sci. 30(1): 39-67 (2020) - [j6]Shibsankar Das, Sudhan Majhi:
Two-Dimensional $Z$-Complementary Array Code Sets Based on Matrices of Generating Polynomials. IEEE Trans. Signal Process. 68: 5519-5532 (2020) - [j5]Shibsankar Das, Udaya Parampalli, Sudhan Majhi, Zi Long Liu, Srdjan Z. Budisin:
New Optimal $Z$-Complementary Code Sets Based on Generalized Paraunitary Matrices. IEEE Trans. Signal Process. 68: 5546-5558 (2020)
2010 – 2019
- 2019
- [j4]Shibsankar Das, Sudhan Majhi, Srdjan Z. Budisin, Zi Long Liu:
A New Construction Framework for Polyphase Complete Complementary Codes With Various Lengths. IEEE Trans. Signal Process. 67(10): 2639-2648 (2019) - [c6]Shibsankar Das, Udaya Parampalli, Sudhan Majhi, Zilong Liu:
Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices. ISIT 2019: 2284-2288 - [c5]Shibsankar Das, Udaya Parampalli, Sudhan Majhi, Zilong Liu:
Construction of New Optimal Z-Complementary Code Sets from Z-Paraunitary Matrices. IWSDA 2019: 1-5 - [i3]Shibsankar Das, Udaya Parampalli, Sudhan Majhi, Zilong Liu:
New Optimal Z-Complementary Code Sets from Matrices of Polynomials. CoRR abs/1906.09542 (2019) - 2018
- [j3]Shibsankar Das, Sudhan Majhi, Zi Long Liu:
A Novel Class of Complete Complementary Codes and Their Applications for APU Matrices. IEEE Signal Process. Lett. 25(9): 1300-1304 (2018) - [j2]Shibsankar Das, Srdjan Z. Budisin, Sudhan Majhi, Zi Long Liu, Yong Liang Guan:
A Multiplier-Free Generator for Polyphase Complete Complementary Codes. IEEE Trans. Signal Process. 66(5): 1184-1196 (2018) - [c4]Shibsankar Das:
A Filtering Technique for All Pairs Approximate Parameterized String Matching. ICMC 2018: 97-109 - 2017
- [j1]Shibsankar Das, Kalpesh Kapoor:
Weighted approximate parameterized string matching. AKCE Int. J. Graphs Comb. 14(1): 1-12 (2017) - [c3]Shibsankar Das, Sudhan Majhi, Srdjan Z. Budisin, Zi Long Liu, Yong Liang Guan:
A novel multiplier-free generator for complete complementary codes. APCC 2017: 1-6 - 2016
- [i2]Shibsankar Das, Kalpesh Kapoor:
A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs. CoRR abs/1605.00406 (2016) - [i1]Shibsankar Das, Rahul Kadyan:
Experimental Evaluation of Modified Decomposition Algorithm for Maximum Weight Bipartite Matching. CoRR abs/1605.06989 (2016) - 2014
- [c2]Shibsankar Das, Kalpesh Kapoor:
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching. TAMC 2014: 312-322
2000 – 2009
- 2006
- [c1]Shibsankar Das, Jussi Kangasharju:
Evaluation of network impact of content distribution mechanisms. Infoscale 2006: 35
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:01 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:
