Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)

Piotr Berman, Janos Simon. Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). In 24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA. pages 304-311, IEEE, 1983.

@inproceedings{BermanS83,
  title = {Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)},
  author = {Piotr Berman and Janos Simon},
  year = {1983},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BermanS83},
  cites = {0},
  citedby = {0},
  pages = {304-311},
  booktitle = {24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA},
  publisher = {IEEE},
}