An Approximation of the Processing Time for Random Graph Model of Parallel Computation

Erol Gelenbe, Randolph D. Nelson, Thomas K. Philips, Asser N. Tantawi. An Approximation of the Processing Time for Random Graph Model of Parallel Computation. In Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA. pages 691-697, IEEE Computer Society, 1986.

@inproceedings{GelenbeNPT86,
  title = {An Approximation of the Processing Time for Random Graph Model of Parallel Computation},
  author = {Erol Gelenbe and Randolph D. Nelson and Thomas K. Philips and Asser N. Tantawi},
  year = {1986},
  tags = {graph-rewriting, rewriting, process modeling},
  researchr = {https://researchr.org/publication/GelenbeNPT86},
  cites = {0},
  citedby = {0},
  pages = {691-697},
  booktitle = {Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-0743-2},
}