Search dblp for Publications

export results for "Weighted k-Server Bounds via Combinatorial Dichotomies"

> Home > Search

download as .bib file

@inproceedings{DBLP:conf/focs/BansalEK17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos},
  editor       = {Chris Umans},
  title        = {Weighted k-Server Bounds via Combinatorial Dichotomies},
  booktitle    = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2017, Berkeley, CA, USA, October 15-17, 2017},
  pages        = {493--504},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/FOCS.2017.52},
  doi          = {10.1109/FOCS.2017.52},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/BansalEK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/BansalEK17,
  author       = {Nikhil Bansal and
                  Marek Eli{\'{a}}s and
                  Grigorios Koumoutsos},
  title        = {Weighted k-Server Bounds via Combinatorial Dichotomies},
  journal      = {CoRR},
  volume       = {abs/1704.03318},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.03318},
  eprinttype    = {arXiv},
  eprint       = {1704.03318},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BansalEK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

a service of

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.