default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGhurumuruhan Ganesan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Ghurumuruhan Ganesan:
Classification and Regression Error Bounds for Inhomogenous Data With Applications to Wireless Networks. CoRR abs/2404.02262 (2024)- 2023
- [i15]Ghurumuruhan Ganesan:
Redundancy of Codes with Graph Constraints. CoRR abs/2301.04808 (2023) - [i14]Ghurumuruhan Ganesan:
Linear Codes with Prescribed Hull Dimension and Minimum Distance. CoRR abs/2305.07140 (2023) - [i13]Ghurumuruhan Ganesan:
Probabilistic Bounds for Data Storage with Feature Selection and Undersampling. CoRR abs/2309.13653 (2023) - [i12]Ghurumuruhan Ganesan:
A Probabilistic Model for Data Redundancy in the Feature Domain. CoRR abs/2309.13657 (2023) - 2021
- [j12]Ghurumuruhan Ganesan:
Linear recurrences over a finite field with exactly two periods. Adv. Appl. Math. 127: 102180 (2021) - [j11]Ghurumuruhan Ganesan:
Asymptotically optimal matrix codes with Hamming and rank distances. Adv. Appl. Math. 131: 102264 (2021) - [j10]Ghurumuruhan Ganesan:
Constrained Minimum Passage Time in Random Geometric Graphs. Algorithmica 83(2): 576-588 (2021) - [j9]Ghurumuruhan Ganesan:
Strong identification codes for graphs. Discret. Math. 344(9): 112475 (2021) - [c13]Ghurumuruhan Ganesan:
Recursive Methods for Some Problems in Coding and Random Permutations. CALDAM 2021: 373-384 - [c12]Ghurumuruhan Ganesan:
Achieving Positive Rates with Predetermined Dictionaries. CALDAM 2021: 385-396 - [c11]Ghurumuruhan Ganesan:
Robust Paths in Random Geometric Graphs with Applications to Mobile Networks. COMSNETS 2021: 119-123 - [c10]Ghurumuruhan Ganesan:
Real-Time Error Correction Codes for Deletable Errors. ICMC 2021: 769-788 - [c9]Ghurumuruhan Ganesan:
Computing Prices for Target Profits in Contracts. ICMC 2021: 1061-1074 - [i11]Ghurumuruhan Ganesan:
Real-time error correction codes for deletable errors. CoRR abs/2103.00758 (2021) - [i10]Ghurumuruhan Ganesan:
Computing Prices for Target Profits in Contracts. CoRR abs/2103.00766 (2021) - [i9]Ghurumuruhan Ganesan:
Linear Recurrences over a Finite Field with Exactly Two Periods. CoRR abs/2103.00827 (2021) - [i8]Ghurumuruhan Ganesan:
Approximate MDS Property of Linear Codes. CoRR abs/2108.07651 (2021) - 2020
- [j8]Ghurumuruhan Ganesan:
Linearized decomposition codes and finite integer set coverings. Discret. Math. 343(11): 112069 (2020) - [i7]Ghurumuruhan Ganesan:
Recursive methods for some problems in coding and random permutations. CoRR abs/2012.10896 (2020) - [i6]Ghurumuruhan Ganesan:
Achieving positive rates with predetermined dictionaries. CoRR abs/2012.10897 (2020)
2010 – 2019
- 2019
- [j7]Ghurumuruhan Ganesan:
Graph extensions, edit number and regular graphs. Discret. Appl. Math. 258: 269-275 (2019) - [j6]Ghurumuruhan Ganesan:
Random access networks with separable schemes. IET Networks 8(4): 233-238 (2019) - 2018
- [j5]Ghurumuruhan Ganesan:
Stretch and Diameter in Random Geometric Graphs. Algorithmica 80(1): 300-330 (2018) - [i5]Ghurumuruhan Ganesan:
Construction and redundancy of codes for correcting deletable errors. CoRR abs/1805.00776 (2018) - [i4]Ghurumuruhan Ganesan:
Correcting an ordered deletion-erasure. CoRR abs/1806.07848 (2018) - 2017
- [c8]Ghurumuruhan Ganesan:
Detection capacity of multidetector networks with applications to cognitive radio. PIMRC 2017: 1-7 - [i3]Ghurumuruhan Ganesan:
Randomized detection and detection capacity of multidetector networks. CoRR abs/1704.04600 (2017) - [i2]Ghurumuruhan Ganesan:
Rates of linear codes with low decoding error probability. CoRR abs/1709.03538 (2017) - [i1]Ghurumuruhan Ganesan:
Recurrence region of multiuser Aloha. CoRR abs/1709.03785 (2017) - 2011
- [c7]Ghurumuruhan Ganesan:
Capacity of fading channels with imperfect CSI and mismatched decoding at the receiver. ISWCS 2011: 71-75
2000 – 2009
- 2008
- [j4]Ghurumuruhan Ganesan, Geoffrey Ye Li, Benny Bing, Shaoqian Li:
Spatiotemporal Sensing in Cognitive Radio Networks. IEEE J. Sel. Areas Commun. 26(1): 5-12 (2008) - 2007
- [b1]Ghurumuruhan Ganesan:
Multicarrier Diversity in Random Access Networks. Georgia Institute of Technology, Atlanta, GA, USA, 2007 - [j3]Ghurumuruhan Ganesan, Geoffrey Ye Li, Frederick W. Vook:
Stability Region of Multicarrier Channel Aware Aloha. IEEE Trans. Inf. Theory 53(9): 3212-3218 (2007) - [j2]Ghurumuruhan Ganesan, Geoffrey Ye Li:
Cooperative Spectrum Sensing in Cognitive Radio, Part I: Two User Networks. IEEE Trans. Wirel. Commun. 6(6): 2204-2213 (2007) - [j1]Ghurumuruhan Ganesan, Geoffrey Ye Li:
Cooperative Spectrum Sensing in Cognitive Radio, Part II: Multiuser Networks. IEEE Trans. Wirel. Commun. 6(6): 2214-2222 (2007) - [c6]Ghurumuruhan Ganesan, Ye (Geoffrey) Li:
A Simple Reservation Scheme for Multicarrier Channel Aware Aloha. GLOBECOM 2007: 1451-1455 - [c5]Ghurumuruhan Ganesan, Geoffrey Ye Li, Shaoqian Li:
Spatiotemporal Sensing in Cognitive Radio Networks. PIMRC 2007: 1-5 - [c4]Ghurumuruhan Ganesan, Geoffrey Ye Li, Frederick W. Vook:
Stability Region of Multicarrier Channel Aware Aloha. WCNC 2007: 2221-2225 - 2006
- [c3]Ghurumuruhan Ganesan, Ye (Geoffrey) Li, Ananthram Swami:
Channel Aware Aloha with Imperfect CSI. GLOBECOM 2006 - 2005
- [c2]Ghurumuruhan Ganesan, Geoffrey Ye Li:
Agility improvement through cooperative diversity in cognitive radio. GLOBECOM 2005: 5 - [c1]Ghurumuruhan Ganesan, Guocong Song, Ye (Geoffrey) Li:
Asymptotic throughput analysis of distributed multichannel random access schemes. ICC 2005: 3637-3641
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-14 21:20 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:
