default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrikanth K. Iyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]Rahul Vaze
, Srikanth K. Iyer:
Capacity of Cellular Wireless Networks. IEEE Trans. Wirel. Commun. 18(3): 1490-1503 (2019)- 2018
- [j7]Srikanth K. Iyer:
The random connection model: Connectivity, edge lengths, and degree distributions. Random Struct. Algorithms 52(2): 283-300 (2018) - 2017
- [c5]Rahul Vaze, Srikanth K. Iyer:
Capacity of cellular wireless network. WiOpt 2017: 1-8 - [i4]Rahul Vaze, Srikanth K. Iyer:
Capacity of Cellular Wireless Network. CoRR abs/1704.05186 (2017) - 2015
- [c4]Srikanth K. Iyer, Rahul Vaze:
Achieving non-zero information velocity in wireless networks. WiOpt 2015: 584-590 - [i3]Srikanth K. Iyer, Rahul Vaze:
Achieving Non-Zero Information Velocity in Wireless Networks. CoRR abs/1501.00381 (2015) - 2014
- [j6]Rahul Vaze, Srikanth K. Iyer:
Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph. J. Appl. Probab. 51(4): 910-920 (2014) - [c3]Rahul Vaze, Srikanth K. Iyer:
Percolation on the information theoretic secure SINR graph: Upper and lower bounds. WiOpt 2014: 620-627 - [i2]Srikanth K. Iyer, Rahul Vaze, Dheeraj Narasimha:
Autoregressive Cascades on Random Networks. CoRR abs/1411.3796 (2014) - 2013
- [i1]Rahul Vaze, Srikanth K. Iyer:
Percolation on the Information-Theoretically Secure Signal to Interference Ratio Graph. CoRR abs/1308.3155 (2013) - 2011
- [j5]Srikanth K. Iyer, D. Manjunath, Rajesh Sundaresan:
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs. IEEE Trans. Mob. Comput. 10(1): 146-155 (2011)
2000 – 2009
- 2009
- [j4]Amogh Deshpande, Srikanth K. Iyer:
The credit risk+ model with general sector correlations. Central Eur. J. Oper. Res. 17(2): 219-228 (2009) - 2008
- [j3]Bhupendra Gupta, Srikanth K. Iyer, D. Manjunath:
Topological properties of the one dimensional exponential random geometric graph. Random Struct. Algorithms 32(2): 181-204 (2008) - 2007
- [j2]S. Sundhar Ram, D. Manjunath, Srikanth K. Iyer, D. Yogeshwaran:
On the Path Coverage Properties of Random Sensor Networks. IEEE Trans. Mob. Comput. 6(5): 494-506 (2007) - 2006
- [c2]Nikhil Karamchandani, D. Manjunath, D. Yogeshwaran, Srikanth K. Iyer:
Evolving random geometric graph models for mobile wireless networks. WiOpt 2006: 299-305 - 2005
- [c1]Nikhil Karamchandani, D. Manjunath, Srikanth K. Iyer:
On the Clustering Properties of Exponential Random Networks. WOWMOM 2005: 177-182 - 2004
- [j1]Srikanth K. Iyer, Barkha Saxena:
Improved genetic algorithm for the permutation flowshop scheduling problem. Comput. Oper. Res. 31(4): 593-606 (2004)
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-24 23:13 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:
