BibTeX records: Asher Walkover

• > Home > Persons > Asher Walkover

@article{DBLP:journals/siamdm/LinRTW11,
  author       = {Henry C. Lin and
                  Tim Roughgarden and
                  {\'{E}}va Tardos and
                  Asher Walkover},
  title        = {Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish
                  Routing},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {25},
  number       = {4},
  pages        = {1667--1686},
  year         = {2011},
  url          = {https://doi.org/10.1137/090769600},
  doi          = {10.1137/090769600},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/LinRTW11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/LinRTW05,
  author       = {Henry C. Lin and
                  Tim Roughgarden and
                  {\'{E}}va Tardos and
                  Asher Walkover},
  editor       = {Lu{\'{\i}}s Caires and
                  Giuseppe F. Italiano and
                  Lu{\'{\i}}s Monteiro and
                  Catuscia Palamidessi and
                  Moti Yung},
  title        = {Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability},
  booktitle    = {Automata, Languages and Programming, 32nd International Colloquium,
                  {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3580},
  pages        = {497--512},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11523468\_41},
  doi          = {10.1007/11523468\_41},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LinRTW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}