BibTeX record conf/sigcomm/XuL02

download as .bib file

@inproceedings{DBLP:conf/sigcomm/XuL02,
  author    = {Jun (Jim) Xu and
               Richard J. Lipton},
  title     = {On fundamental tradeoffs between delay bounds and computational complexity
               in packet scheduling algorithms},
  booktitle = {Proceedings of the {ACM} {SIGCOMM} 2002 Conference on Applications,
               Technologies, Architectures, and Protocols for Computer Communication,
               August 19-23, 2002, Pittsburgh, PA, {USA}},
  pages     = {279--292},
  year      = {2002},
  crossref  = {DBLP:conf/sigcomm/2002},
  url       = {https://doi.org/10.1145/633025.633052},
  doi       = {10.1145/633025.633052},
  timestamp = {Tue, 06 Nov 2018 11:07:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigcomm/XuL02},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sigcomm/2002,
  editor    = {Matthew Mathis and
               Peter Steenkiste and
               Hari Balakrishnan and
               Vern Paxson},
  title     = {Proceedings of the {ACM} {SIGCOMM} 2002 Conference on Applications,
               Technologies, Architectures, and Protocols for Computer Communication,
               August 19-23, 2002, Pittsburgh, PA, {USA}},
  publisher = {{ACM}},
  year      = {2002},
  url       = {https://doi.org/10.1145/633025},
  doi       = {10.1145/633025},
  isbn      = {1-58113-570-X},
  timestamp = {Tue, 06 Nov 2018 11:07:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigcomm/2002},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics