Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: B. Santhana Krishnan
@inproceedings{DBLP:conf/pimrc/ShaverdianKR16, author = {Ararat Shaverdian and B. Santhana Krishnan and Catherine Rosenberg}, title = {Almost blank subframes versus partially shared deployment in heterogeneous networks}, booktitle = {27th {IEEE} Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, {PIMRC} 2016, Valencia, Spain, September 4-8, 2016}, pages = {1--6}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/PIMRC.2016.7794811}, doi = {10.1109/PIMRC.2016.7794811}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/pimrc/ShaverdianKR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ncc/KrishnanVM14, author = {B. Santhana Krishnan and Rahul Vaze and D. Manjunath}, title = {On white-space detection, localization and coverage}, booktitle = {Twentieth National Conference on Communications, {NCC} 2014, Kanpur, India, February 28 - March 2, 2014}, pages = {1--6}, publisher = {{IEEE}}, year = {2014}, url = {https://doi.org/10.1109/NCC.2014.6811305}, doi = {10.1109/NCC.2014.6811305}, timestamp = {Wed, 16 Oct 2019 14:14:56 +0200}, biburl = {https://dblp.org/rec/conf/ncc/KrishnanVM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/KrishnanGM13, author = {B. Santhana Krishnan and Ayalvadi Ganesh and D. Manjunath}, title = {On connectivity thresholds in superposition of random key graphs on random geometric graphs}, booktitle = {Proceedings of the 2013 {IEEE} International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013}, pages = {2389--2393}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/ISIT.2013.6620654}, doi = {10.1109/ISIT.2013.6620654}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isit/KrishnanGM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1301-6422, author = {B. Santhana Krishnan and Ayalvadi Ganesh and D. Manjunath}, title = {On Connectivity Thresholds in Superposition of Random Key Graphs on Random Geometric Graphs}, journal = {CoRR}, volume = {abs/1301.6422}, year = {2013}, url = {http://arxiv.org/abs/1301.6422}, eprinttype = {arXiv}, eprint = {1301.6422}, timestamp = {Wed, 01 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1301-6422.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1211-4441, author = {B. Santhana Krishnan and Animesh Kumar and D. Manjunath and Bikash Kumar Dey}, title = {On the Separability of Targets Using Binary Proximity Sensors}, journal = {CoRR}, volume = {abs/1211.4441}, year = {2012}, url = {http://arxiv.org/abs/1211.4441}, eprinttype = {arXiv}, eprint = {1211.4441}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1211-4441.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/comsnets/Krishnan11, author = {B. Santhana Krishnan}, editor = {David B. Johnson and Anurag Kumar}, title = {Separating event points by Binary Proximity Sensors: An asymptotic analysis}, booktitle = {Third International Conference on Communication Systems and Networks, {COMSNETS} 2011, Bangalore, India, January 4-8, 2011}, pages = {1--8}, publisher = {{IEEE}}, year = {2011}, url = {https://doi.org/10.1109/COMSNETS.2011.5716479}, doi = {10.1109/COMSNETS.2011.5716479}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/comsnets/Krishnan11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.