Round compression for parallel matching algorithms. Czumaj, A., Lacki, J., Madry, A., Mitrovic, S., Onak, K., & Sankowski, P. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 471–484, 2018.
Round compression for parallel matching algorithms [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/stoc/CzumajLMMOS18,
  author    = {Artur Czumaj and
               Jakub Lacki and
               Aleksander Madry and
               Slobodan Mitrovic and
               Krzysztof Onak and
               Piotr Sankowski},
  title     = {Round compression for parallel matching algorithms},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {471--484},
  year      = {2018},
  crossref  = {DBLP:conf/stoc/2018},
  url       = {https://doi.org/10.1145/3188745.3188764},
  doi       = {10.1145/3188745.3188764},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/CzumajLMMOS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0