Throughput of random arbitration for approximate matchings. Chen, L. Y. & Chrysos, N. In Lin, B., Mogul, J. C., & Iyer, R. R., editors, Proceedings of the 2010 ACM/IEEE Symposium on Architecture for Networking and Communications Systems, ANCS 2010, San Diego, California, USA, October 25-26, 2010, pages 16, 2010. ACM.
Throughput of random arbitration for approximate matchings [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/ancs/ChenC10,
  author       = {Lydia Y. Chen and
                  Nikos Chrysos},
  editor       = {Bill Lin and
                  Jeffrey C. Mogul and
                  Ravishankar R. Iyer},
  title        = {Throughput of random arbitration for approximate matchings},
  booktitle    = {Proceedings of the 2010 {ACM/IEEE} Symposium on Architecture for Networking
                  and Communications Systems, {ANCS} 2010, San Diego, California, USA,
                  October 25-26, 2010},
  pages        = {16},
  publisher    = {{ACM}},
  year         = {2010},
  url          = {https://doi.org/10.1145/1872007.1872026},
  doi          = {10.1145/1872007.1872026},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ancs/ChenC10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0