default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShubhransh Singhvi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Ashirwad Sinha, Shubhransh Singhvi, Praful D. Mankar, Harpreet S. Dhillon:
Peak Age of Information under Tandem of Queues. ISIT 2024: 951-956- [c6]Shubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi:
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes. ISIT 2024: 2832-2837 - [i9]Shubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi:
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes. CoRR abs/2403.07754 (2024) - [i8]Shubhransh Singhvi, Charchit Gupta, Avital Boruchovsky, Yuval Goldberg, Han Mao Kiah, Eitan Yaakobi:
Permutation Recovery Problem against Deletion Errors for DNA Data Storage. CoRR abs/2403.15827 (2024) - [i7]Ashirwad Sinha, Shubhransh Singhvi, Praful D. Mankar, Harpreet S. Dhillon:
Peak Age of Information under Tandem of Queues. CoRR abs/2405.02705 (2024) - [i6]Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev, Eitan Yaakobi:
Conditional Entropies of k-Deletion/Insertion Channels. CoRR abs/2407.10026 (2024) - 2023
- [c5]Shubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah, Eitan Yaakobi:
Data-Driven Bee Identification for DNA Strands. ISIT 2023: 797-802 - [c4]Stanislav Kruglik
, Gaojun Luo, Wilton Kim, Shubhransh Singhvi, Han Mao Kiah, San Ling, Huaxiong Wang:
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes. ISIT 2023: 1003-1008 - [c3]Shubhransh Singhvi, Praful D. Mankar:
Coding Gain for Age of Information in a Multi-source System with Erasure Channel. ITW 2023: 451-456 - [i5]Stanislav Kruglik, Gaojun Luo, Wilton Kim, Shubhransh Singhvi, Han Mao Kiah, San Ling, Huaxiong Wang:
Repair of Reed-Solomon Codes in the Presence of Erroneous Nodes. CoRR abs/2305.03442 (2023) - [i4]Shubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah, Eitan Yaakobi:
Data-Driven Bee Identification for DNA Strands. CoRR abs/2305.04597 (2023) - 2022
- [c2]Shubhransh Singhvi, Gayathri R., P. Vijay Kumar:
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. ISIT 2022: 1957-1962 - [c1]Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev, Eitan Yaakobi:
The Input and Output Entropies of the k-Deletion/Insertion Channel with Small Radii. ITW 2022: 564-569 - [i3]Shubhransh Singhvi, Omer Sabary, Daniella Bar-Lev, Eitan Yaakobi:
The Input and Output Entropies of the k-Deletion/Insertion Channel. CoRR abs/2202.03024 (2022) - [i2]Shubhransh Singhvi, Gayathri R., P. Vijay Kumar:
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. CoRR abs/2207.04025 (2022) - [i1]Shubhransh Singhvi, Praful D. Mankar:
Coding Gain for Age of Information in a Multi-source System with Erasure Channel. CoRR abs/2212.11489 (2022)
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-12 23:02 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:
