Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-8
|
Results: 8
ACM Symposium on Parallel Algorithms and Architectures - Guest editors' foreword
Authors:
Cormen, T Dehne, F Fraigniaud, P Matias, Y
Citation:
T. Cormen et al., ACM Symposium on Parallel Algorithms and Architectures - Guest editors' foreword, THEOR C SYS, 33(5-6), 2000, pp. 335-335
Context-based space filling curves
Authors:
Dafner, R Cohen-Or, D Matias, Y
Citation:
R. Dafner et al., Context-based space filling curves, COMPUT GR F, 19(3), 2000, pp. C209-C217
Can a shared-memory model serve as a bridging model for parallel computation?
Authors:
Gibbons, PB Matias, Y Ramachandran, V
Citation:
Pb. Gibbons et al., Can a shared-memory model serve as a bridging model for parallel computation?, THEOR C SYS, 32(3), 1999, pp. 327-359
Provably efficient scheduling for languages with fine-grained parallelism
Authors:
Blelloch, GE Gibbons, PB Matias, Y
Citation:
Ge. Blelloch et al., Provably efficient scheduling for languages with fine-grained parallelism, J ACM, 46(2), 1999, pp. 281-321
Modeling parallel bandwidth: Local versus global restrictions
Authors:
Adler, M Gibbons, PB Matias, Y Ramachandran, V
Citation:
M. Adler et al., Modeling parallel bandwidth: Local versus global restrictions, ALGORITHMIC, 24(3-4), 1999, pp. 381-404
An optical simulation of shared memory
Authors:
Goldberg, LA Matias, Y Rao, S
Citation:
La. Goldberg et al., An optical simulation of shared memory, SIAM J COMP, 28(5), 1999, pp. 1829-1847
The space complexity of approximating the frequency moments
Authors:
Alon, N Matias, Y Szegedy, M
Citation:
N. Alon et al., The space complexity of approximating the frequency moments, J COMPUT SY, 58(1), 1999, pp. 137-147
Consistent, yet anonymous, Web access with LPWA
Authors:
Gabber, E Gibbons, PB Kristol, DM Matias, Y Mayer, A
Citation:
E. Gabber et al., Consistent, yet anonymous, Web access with LPWA, COMM ACM, 42(2), 1999, pp. 42-47
Risultati:
1-8
|