Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks

Sushil K. Prasad. Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks. J. Parallel Distrib. Comput., 18(4):524-530, 1993.

@article{Prasad93:2,
  title = {Efficient and Scalable PRAM Algorithms for Discrete-Event Simulation of Bounded Degree Networks},
  author = {Sushil K. Prasad},
  year = {1993},
  researchr = {https://researchr.org/publication/Prasad93%3A2},
  cites = {0},
  citedby = {0},
  journal = {J. Parallel Distrib. Comput.},
  volume = {18},
  number = {4},
  pages = {524-530},
}