BibTeX records: Amites Sarkar

download as .bib file

@article{DBLP:journals/jap/RicheyS22,
  author       = {Jacob Richey and
                  Amites Sarkar},
  title        = {Intersections of random sets},
  journal      = {J. Appl. Probab.},
  volume       = {59},
  number       = {1},
  pages        = {131--151},
  year         = {2022},
  url          = {https://doi.org/10.1017/jpr.2021.34},
  doi          = {10.1017/JPR.2021.34},
  timestamp    = {Wed, 27 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jap/RicheyS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DayS21,
  author       = {A. Nicholas Day and
                  Amites Sarkar},
  title        = {On a Conjecture of Nagy on Extremal Densities},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {35},
  number       = {1},
  pages        = {294--306},
  year         = {2021},
  url          = {https://doi.org/10.1137/19M1296525},
  doi          = {10.1137/19M1296525},
  timestamp    = {Thu, 08 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/DayS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FujitaLS18,
  author       = {Shinya Fujita and
                  Henry Liu and
                  Amites Sarkar},
  title        = {Highly connected subgraphs of graphs with given independence number},
  journal      = {Eur. J. Comb.},
  volume       = {70},
  pages        = {212--231},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ejc.2018.01.004},
  doi          = {10.1016/J.EJC.2018.01.004},
  timestamp    = {Sun, 18 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/FujitaLS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JohnstonPS17,
  author       = {Daniel Johnston and
                  Cory Palmer and
                  Amites Sarkar},
  title        = {Rainbow Tur{\'{a}}n Problems for Paths and Forests of Stars},
  journal      = {Electron. J. Comb.},
  volume       = {24},
  number       = {1},
  pages        = {1},
  year         = {2017},
  url          = {https://doi.org/10.37236/6430},
  doi          = {10.37236/6430},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/JohnstonPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsnet/BalisterBHSW17,
  author       = {Paul Balister and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Martin Haenggi and
                  Amites Sarkar and
                  Mark Walters},
  title        = {Sentry selection in sensor networks: theory and algorithms},
  journal      = {Int. J. Sens. Networks},
  volume       = {24},
  number       = {3},
  pages        = {139--148},
  year         = {2017},
  url          = {https://doi.org/10.1504/IJSNET.2015.10001255},
  doi          = {10.1504/IJSNET.2015.10001255},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijsnet/BalisterBHSW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FujitaLS16,
  author       = {Shinya Fujita and
                  Henry Liu and
                  Amites Sarkar},
  title        = {Highly Connected Subgraphs of Graphs with Given Independence Number
                  (Extended Abstract)},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {54},
  pages        = {103--108},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.endm.2016.09.019},
  doi          = {10.1016/J.ENDM.2016.09.019},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/FujitaLS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BalisterBS16,
  author       = {Paul Balister and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Amites Sarkar},
  title        = {Barrier Coverage},
  journal      = {Random Struct. Algorithms},
  volume       = {49},
  number       = {3},
  pages        = {429--478},
  year         = {2016},
  url          = {https://doi.org/10.1002/rsa.20656},
  doi          = {10.1002/RSA.20656},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/BalisterBS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HaenggiS16,
  author       = {Martin Haenggi and
                  Amites Sarkar},
  title        = {Unique coverage in Boolean models},
  journal      = {CoRR},
  volume       = {abs/1608.02032},
  year         = {2016},
  url          = {http://arxiv.org/abs/1608.02032},
  eprinttype    = {arXiv},
  eprint       = {1608.02032},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/HaenggiS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/Sarkar14,
  author       = {Amites Sarkar},
  title        = {Secrecy coverage in two dimensions},
  booktitle    = {2014 Information Theory and Applications Workshop, {ITA} 2014, San
                  Diego, CA, USA, February 9-14, 2014},
  pages        = {1--6},
  publisher    = {{IEEE}},
  year         = {2014},
  url          = {https://doi.org/10.1109/ITA.2014.6804272},
  doi          = {10.1109/ITA.2014.6804272},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/ita/Sarkar14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SarkarH13,
  author       = {Amites Sarkar and
                  Martin Haenggi},
  title        = {Percolation in the secrecy graph},
  journal      = {Discret. Appl. Math.},
  volume       = {161},
  number       = {13-14},
  pages        = {2120--2132},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.dam.2013.03.022},
  doi          = {10.1016/J.DAM.2013.03.022},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/SarkarH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/SarkarH13,
  author       = {Amites Sarkar and
                  Martin Haenggi},
  title        = {Secrecy Coverage},
  journal      = {Internet Math.},
  volume       = {9},
  number       = {2-3},
  pages        = {199--216},
  year         = {2013},
  url          = {https://doi.org/10.1080/15427951.2012.673333},
  doi          = {10.1080/15427951.2012.673333},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/im/SarkarH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ita/SarkarH11,
  author       = {Amites Sarkar and
                  Martin Haenggi},
  title        = {Percolation in the secrecy graph},
  booktitle    = {Information Theory and Applications Workshop, {ITA} 2011, San Diego,
                  California, USA, February 6-11, 2011},
  pages        = {140--145},
  publisher    = {{IEEE}},
  year         = {2011},
  url          = {https://doi.org/10.1109/ITA.2011.5743576},
  doi          = {10.1109/ITA.2011.5743576},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/ita/SarkarH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itw/SarkarH11,
  author       = {Amites Sarkar and
                  Martin Haenggi},
  title        = {Percolation in the secrecy graph: Bounds on the critical probability
                  and impact of power constraints},
  booktitle    = {2011 {IEEE} Information Theory Workshop, {ITW} 2011, Paraty, Brazil,
                  October 16-20, 2011},
  pages        = {673--677},
  publisher    = {{IEEE}},
  year         = {2011},
  url          = {https://doi.org/10.1109/ITW.2011.6089582},
  doi          = {10.1109/ITW.2011.6089582},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/itw/SarkarH11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-4613,
  author       = {Amites Sarkar and
                  Martin Haenggi},
  title        = {Percolation in the Secrecy Graph},
  journal      = {CoRR},
  volume       = {abs/1107.4613},
  year         = {2011},
  url          = {http://arxiv.org/abs/1107.4613},
  eprinttype    = {arXiv},
  eprint       = {1107.4613},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1107-4613.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalisterKS10,
  author       = {Paul Balister and
                  Steve Kalikow and
                  Amites Sarkar},
  title        = {The Linus Sequence},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {21--46},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990198},
  doi          = {10.1017/S0963548309990198},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BalisterKS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BalisterBSW09,
  author       = {Paul N. Balister and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Amites Sarkar and
                  Mark Walters},
  title        = {Highly connected random geometric graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {157},
  number       = {2},
  pages        = {309--320},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.dam.2008.03.001},
  doi          = {10.1016/J.DAM.2008.03.001},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BalisterBSW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijahuc/BalisterBSW08,
  author       = {Paul N. Balister and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Amites Sarkar and
                  Mark Walters},
  title        = {Connectivity of a Gaussian network},
  journal      = {Int. J. Ad Hoc Ubiquitous Comput.},
  volume       = {3},
  number       = {3},
  pages        = {204--213},
  year         = {2008},
  url          = {https://doi.org/10.1504/IJAHUC.2008.018407},
  doi          = {10.1504/IJAHUC.2008.018407},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijahuc/BalisterBSW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mobicom/BalisterBSK07,
  author       = {Paul Balister and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Amites Sarkar and
                  Santosh Kumar},
  editor       = {Evangelos Kranakis and
                  Jennifer C. Hou and
                  Ram Ramanathan},
  title        = {Reliable density estimates for coverage and connectivity in thin strips
                  of finite length},
  booktitle    = {Proceedings of the 13th Annual International Conference on Mobile
                  Computing and Networking, {MOBICOM} 2007, Montr{\'{e}}al, Qu{\'{e}}bec,
                  Canada, September 9-14, 2007},
  pages        = {75--86},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1287853.1287863},
  doi          = {10.1145/1287853.1287863},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/mobicom/BalisterBSK07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BollobasS03,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Amites Sarkar},
  title        = {Paths of length four},
  journal      = {Discret. Math.},
  volume       = {265},
  number       = {1-3},
  pages        = {357--363},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0012-365X(02)00878-6},
  doi          = {10.1016/S0012-365X(02)00878-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BollobasS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BollobasES99,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  Paul Erd{\"{o}}s and
                  Amites Sarkar},
  title        = {Extremal graphs for weights},
  journal      = {Discret. Math.},
  volume       = {200},
  number       = {1-3},
  pages        = {5--19},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0012-365X(98)00320-3},
  doi          = {10.1016/S0012-365X(98)00320-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BollobasES99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics