BibTeX records: Deepanjan Kesh

download as .bib file

@article{DBLP:journals/dam/BaigKS22,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  title        = {Storing four elements in the two query bitprobe model},
  journal      = {Discret. Appl. Math.},
  volume       = {319},
  pages        = {121--131},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.dam.2021.05.008},
  doi          = {10.1016/J.DAM.2021.05.008},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BaigKS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/KeshS22,
  author       = {Deepanjan Kesh and
                  Vidya Sagar Sharma},
  title        = {On the bitprobe complexity of two probe adaptive schemes},
  journal      = {Discret. Appl. Math.},
  volume       = {319},
  pages        = {132--140},
  year         = {2022},
  url          = {https://doi.org/10.1016/j.dam.2021.07.021},
  doi          = {10.1016/J.DAM.2021.07.021},
  timestamp    = {Thu, 25 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/KeshS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/AggarwalKS22,
  author       = {Sreshth Aggarwal and
                  Deepanjan Kesh and
                  Divyam Singal},
  editor       = {Cristina Bazgan and
                  Henning Fernau},
  title        = {Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model},
  booktitle    = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
                  Trier, Germany, June 7-9, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13270},
  pages        = {31--45},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-06678-8\_3},
  doi          = {10.1007/978-3-031-06678-8\_3},
  timestamp    = {Wed, 01 Jun 2022 15:43:39 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/AggarwalKS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2204-03266,
  author       = {Sreshth Aggarwal and
                  Deepanjan Kesh and
                  Divyam Singal},
  title        = {Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model},
  journal      = {CoRR},
  volume       = {abs/2204.03266},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.03266},
  doi          = {10.48550/ARXIV.2204.03266},
  eprinttype    = {arXiv},
  eprint       = {2204.03266},
  timestamp    = {Tue, 12 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-03266.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BaigK20,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh},
  title        = {Two improved schemes in the bitprobe model},
  journal      = {Theor. Comput. Sci.},
  volume       = {806},
  pages        = {543--552},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2019.08.033},
  doi          = {10.1016/J.TCS.2019.08.033},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BaigK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BaigK20a,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh},
  title        = {Improved bounds for two query adaptive bitprobe schemes storing five
                  elements},
  journal      = {Theor. Comput. Sci.},
  volume       = {838},
  pages        = {208--230},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.tcs.2020.07.036},
  doi          = {10.1016/J.TCS.2020.07.036},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BaigK20a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/caldam/KeshS19,
  author       = {Deepanjan Kesh and
                  Vidya Sagar Sharma},
  editor       = {Sudebkumar Prasant Pal and
                  Ambat Vijayakumar},
  title        = {On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two
                  Elements},
  booktitle    = {Algorithms and Discrete Applied Mathematics - 5th International Conference,
                  {CALDAM} 2019, Kharagpur, India, February 14-16, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11394},
  pages        = {53--64},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-11509-8\_5},
  doi          = {10.1007/978-3-030-11509-8\_5},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/caldam/KeshS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/BaigK19,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh},
  editor       = {Yingshu Li and
                  Mihaela Cardei and
                  Yan Huang},
  title        = {Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five
                  Elements},
  booktitle    = {Combinatorial Optimization and Applications - 13th International Conference,
                  {COCOA} 2019, Xiamen, China, December 13-15, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11949},
  pages        = {13--25},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-36412-0\_2},
  doi          = {10.1007/978-3-030-36412-0\_2},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/BaigK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/BaigKS19,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  editor       = {Charles J. Colbourn and
                  Roberto Grossi and
                  Nadia Pisanti},
  title        = {An Improved Scheme in the Two Query Adaptive Bitprobe Model},
  booktitle    = {Combinatorial Algorithms - 30th International Workshop, {IWOCA} 2019,
                  Pisa, Italy, July 23-25, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11638},
  pages        = {22--34},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-25005-8\_3},
  doi          = {10.1007/978-3-030-25005-8\_3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/BaigKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/walcom/BaigKS19,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  editor       = {Gautam K. Das and
                  Partha Sarathi Mandal and
                  Krishnendu Mukhopadhyaya and
                  Shin{-}Ichi Nakano},
  title        = {A Two Query Adaptive Bitprobe Scheme Storing Five Elements},
  booktitle    = {{WALCOM:} Algorithms and Computation - 13th International Conference,
                  {WALCOM} 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11355},
  pages        = {317--328},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-10564-8\_25},
  doi          = {10.1007/978-3-030-10564-8\_25},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/BaigKS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1910-03651,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh},
  title        = {Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five
                  Elements},
  journal      = {CoRR},
  volume       = {abs/1910.03651},
  year         = {2019},
  url          = {http://arxiv.org/abs/1910.03651},
  eprinttype    = {arXiv},
  eprint       = {1910.03651},
  timestamp    = {Wed, 16 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1910-03651.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/Kesh18,
  author       = {Deepanjan Kesh},
  editor       = {Sumit Ganguly and
                  Paritosh K. Pandya},
  title        = {Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements},
  booktitle    = {38th {IARCS} Annual Conference on Foundations of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
                  Ahmedabad, India},
  series       = {LIPIcs},
  volume       = {122},
  pages        = {12:1--12:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.12},
  doi          = {10.4230/LIPICS.FSTTCS.2018.12},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/Kesh18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/walcom/BaigK18,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh},
  editor       = {M. Sohel Rahman and
                  Wing{-}Kin Sung and
                  Ryuhei Uehara},
  title        = {Two New Schemes in the Bitprobe Model},
  booktitle    = {{WALCOM:} Algorithms and Computation - 12th International Conference,
                  {WALCOM} 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10755},
  pages        = {68--79},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-75172-6\_7},
  doi          = {10.1007/978-3-319-75172-6\_7},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/walcom/BaigK18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1810-13331,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  title        = {A Two Query Adaptive Bitprobe Scheme Storing Five Elements},
  journal      = {CoRR},
  volume       = {abs/1810.13331},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.13331},
  eprinttype    = {arXiv},
  eprint       = {1810.13331},
  timestamp    = {Thu, 08 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-13331.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1812-04802,
  author       = {Mirza Galib Anwarul Husain Baig and
                  Deepanjan Kesh and
                  Chirag Sodani},
  title        = {An Improved Scheme in the Two Query Adaptive Bitprobe Model},
  journal      = {CoRR},
  volume       = {abs/1812.04802},
  year         = {2018},
  url          = {http://arxiv.org/abs/1812.04802},
  eprinttype    = {arXiv},
  eprint       = {1812.04802},
  timestamp    = {Tue, 01 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1812-04802.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/Kesh17,
  author       = {Deepanjan Kesh},
  editor       = {Xiaofeng Gao and
                  Hongwei Du and
                  Meng Han},
  title        = {On Adaptive Bitprobe Schemes for Storing Two Elements},
  booktitle    = {Combinatorial Optimization and Applications - 11th International Conference,
                  {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
                  Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10627},
  pages        = {471--479},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-71150-8\_39},
  doi          = {10.1007/978-3-319-71150-8\_39},
  timestamp    = {Tue, 14 Jun 2022 14:15:49 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/Kesh17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/KeshM14,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  editor       = {Alberto Pardo and
                  Alfredo Viola},
  title        = {A Divide and Conquer Method to Compute Binomial Ideals},
  booktitle    = {{LATIN} 2014: Theoretical Informatics - 11th Latin American Symposium,
                  Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8392},
  pages        = {648--659},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-642-54423-1\_56},
  doi          = {10.1007/978-3-642-54423-1\_56},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/KeshM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cca/KeshM11,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  title        = {A saturation algorithm for homogeneous binomial ideals},
  journal      = {{ACM} Commun. Comput. Algebra},
  volume       = {45},
  number       = {1/2},
  pages        = {121--122},
  year         = {2011},
  url          = {https://doi.org/10.1145/2016567.2016586},
  doi          = {10.1145/2016567.2016586},
  timestamp    = {Wed, 04 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cca/KeshM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoa/KeshM11,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  editor       = {Weifan Wang and
                  Xuding Zhu and
                  Ding{-}Zhu Du},
  title        = {A Saturation Algorithm for Homogeneous Binomial Ideals},
  booktitle    = {Combinatorial Optimization and Applications - 5th International Conference,
                  {COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6831},
  pages        = {357--371},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22616-8\_28},
  doi          = {10.1007/978-3-642-22616-8\_28},
  timestamp    = {Tue, 28 Apr 2020 17:58:14 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/KeshM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dmaa/KeshM10,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  title        = {Generalized Reduction to Compute toric ideals},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {2},
  number       = {1},
  pages        = {45--60},
  year         = {2010},
  url          = {https://doi.org/10.1142/S1793830910000462},
  doi          = {10.1142/S1793830910000462},
  timestamp    = {Wed, 12 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dmaa/KeshM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/KeshM09,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  editor       = {Yingfei Dong and
                  Ding{-}Zhu Du and
                  Oscar H. Ibarra},
  title        = {Generalized Reduction to Compute Toric Ideals},
  booktitle    = {Algorithms and Computation, 20th International Symposium, {ISAAC}
                  2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5878},
  pages        = {483--492},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-10631-6\_50},
  doi          = {10.1007/978-3-642-10631-6\_50},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/KeshM09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cccg/KeshM08,
  author       = {Deepanjan Kesh and
                  Shashank K. Mehta},
  title        = {Polynomial irreducibility testing through Minkowski summand computation},
  booktitle    = {Proceedings of the 20th Annual Canadian Conference on Computational
                  Geometry, Montr{\'{e}}al, Canada, August 13-15, 2008},
  year         = {2008},
  timestamp    = {Wed, 12 May 2021 14:19:37 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/KeshM08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BhuvanagiriGKS06,
  author       = {Lakshminath Bhuvanagiri and
                  Sumit Ganguly and
                  Deepanjan Kesh and
                  Chandan Saha},
  title        = {Simpler algorithm for estimating frequency moments of data streams},
  booktitle    = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages        = {708--713},
  publisher    = {{ACM} Press},
  year         = {2006},
  url          = {http://dl.acm.org/citation.cfm?id=1109557.1109634},
  timestamp    = {Thu, 03 Nov 2016 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BhuvanagiriGKS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fsttcs/GangulyKS05,
  author       = {Sumit Ganguly and
                  Deepanjan Kesh and
                  Chandan Saha},
  editor       = {Ramaswamy Ramanujam and
                  Sandeep Sen},
  title        = {Practical Algorithms for Tracking Database Join Sizes},
  booktitle    = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
                  Computer Science, 25th International Conference, Hyderabad, India,
                  December 15-18, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3821},
  pages        = {297--309},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11590156\_24},
  doi          = {10.1007/11590156\_24},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/fsttcs/GangulyKS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.