BibTeX record conf/stoc/Bernstein13

download as .bib file

@inproceedings{DBLP:conf/stoc/Bernstein13,
  author       = {Aaron Bernstein},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {Maintaining shortest paths under deletions in weighted directed graphs:
                  [extended abstract]},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {725--734},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488701},
  doi          = {10.1145/2488608.2488701},
  timestamp    = {Tue, 06 Nov 2018 11:07:04 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Bernstein13.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.