Citation: Pb. Gibbons et al., THE QUEUE-READ QUEUE-WRITE PRAM MODEL - ACCOUNTING FOR CONTENTION IN PARALLEL ALGORITHMS, SIAM journal on computing (Print), 28(2), 1999, pp. 733-769
Citation: O. Berkman et al., TRIPLY-LOGARITHMIC PARALLEL UPPER AND LOWER BOUNDS FOR MINIMUM AND RANGE MINIMA OVER SMALL DOMAINS, Journal of algorithms (Print), 28(2), 1998, pp. 197-215
Citation: Ge. Blelloch et al., ACCOUNTING FOR MEMORY BANK CONTENTION AND DELAY IN HIGH-BANDWIDTH MULTIPROCESSORS, IEEE transactions on parallel and distributed systems, 8(9), 1997, pp. 943-958
Citation: J. Gil et Y. Matias, AN EFFECTIVE LOAD BALANCING POLICY FOR GEOMETRIC-DECAYING ALGORITHMS, Journal of parallel and distributed computing, 36(2), 1996, pp. 185-188
Citation: S. Khuller et Y. Matias, A SIMPLE RANDOMIZED SIEVE ALGORITHM FOR THE CLOSEST-PAIR PROBLEM, Information and computation, 118(1), 1995, pp. 34-37
Citation: J. Gil et Y. Matias, FAST AND EFFICIENT SIMULATIONS AMONG CRCW PRAMS, Journal of parallel and distributed computing, 23(2), 1994, pp. 135-148
Citation: J. Gil et Y. Matias, FAST AND EFFICIENT SIMULATIONS AMONG CRCW PRAMS, Journal of parallel and distributed computing, 23(2), 1994, pp. 135-148