BibTeX records: S. Haldar

download as .bib file

@article{DBLP:journals/jal/Haldar97,
  author    = {S. Haldar},
  title     = {An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n{\({^2}\)}
               Messages},
  journal   = {J. Algorithms},
  volume    = {24},
  number    = {1},
  pages     = {20--36},
  year      = {1997},
  url       = {https://doi.org/10.1006/jagm.1996.0842},
  doi       = {10.1006/jagm.1996.0842},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/Haldar97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Haldar93,
  author    = {S. Haldar},
  editor    = {Jan van Leeuwen},
  title     = {An 'All Pairs Shortest Path' Distributed Algorithm Using 2n{\({^2}\)}
               Messages},
  booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
               {WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {790},
  pages     = {350--363},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-57899-4\_65},
  doi       = {10.1007/3-540-57899-4\_65},
  timestamp = {Tue, 14 May 2019 10:00:40 +0200},
  biburl    = {https://dblp.org/rec/conf/wg/Haldar93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics