Brief announcement: efficient graph algorithms without synchronization

Johannes Schneider, Roger Wattenhofer. Brief announcement: efficient graph algorithms without synchronization. In Andréa W. Richa, Rachid Guerraoui, editors, Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010. pages 289-290, ACM, 2010. [doi]

@inproceedings{SchneiderW10b,
  title = {Brief announcement: efficient graph algorithms without synchronization},
  author = {Johannes Schneider and Roger Wattenhofer},
  year = {2010},
  doi = {10.1145/1835698.1835769},
  url = {http://doi.acm.org/10.1145/1835698.1835769},
  tags = {synchronization, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/SchneiderW10b},
  cites = {0},
  citedby = {0},
  pages = {289-290},
  booktitle = {Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010},
  editor = {Andréa W. Richa and Rachid Guerraoui},
  publisher = {ACM},
  isbn = {978-1-60558-888-9},
}