@inproceedings{718740caefb44eb8b48115e71c4dddd9,
title = "The APRAM: Incorporating asynchrony into the PRAM model",
abstract = "The APRAM model is introduced and a complexity measure is defined. Algorithms for several basic problems are presented, including a non-Trivial algorithm for graph connectivity.",
author = "Richard Cole and Ofer Zajicek",
note = "Funding Information: *The work was supported in part by NSF grant CCR-8702271, ONR grant N00014-85-K-0046, and by a John Simon Guggenheim Memorial Foundation Fellowship. The Computer Science Laboratory, LIENS, at Ecole Norrnale Sup6rieure is associated with and supported by CNRS as URA 1327. Publisher Copyright: {\textcopyright} 1989 ACM.; 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 ; Conference date: 18-06-1989 Through 21-06-1989",
year = "1989",
month = mar,
day = "1",
doi = "10.1145/72935.72954",
language = "English (US)",
series = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",
publisher = "Association for Computing Machinery, Inc",
pages = "169--178",
editor = "F.T. Leighton",
booktitle = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",
}