Searching for "Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended
by Z. M. Kedem, K. V. Palem, A. Raghunathan, P. G. Spirakis, Arithmetic Expressions, Cdr S. Cook, C. Dwork, R. Reischuk, Siam J. Computing, Cgm W. Cellary, E. Gelenbe, T. Morzy, Cz R. Cole, O. Zajicek, The Apram, E Cient, Ks P. Kanellakis, Ks P. Kanellakis, A. Shvartsman, A. Shvartsman, On E — 1991
… time Bounds for Parallel Random Access Machines without Simultaneous Writes," SIAM J. Computing, vol…
Cited by 21 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB