Automatic optimization of communication in compiling out-of-core stencil codes, Proceedings of the 10th international conference on Supercomputing , ICS '96, pp.366-373, 1996. ,
DOI : 10.1145/237578.237638
Practical prefetching via data compression, Proceedings of the 1993 SIGMOD, 1993. ,
DOI : 10.1145/170036.170077
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8858
Parallel run-length encoding (RLE) compression reducing I/O in dynamic environmental simulations, The International Journal of High Performance Computing Applications, vol.12, issue.4, 1998. ,
Algorithm 235: Random permutation, Communications of the ACM, vol.7, issue.7, p.420, 1964. ,
DOI : 10.1145/364520.364540
PRO: A model for the design and analysis of efficient and scalable parallel algorithms, Nordic Journal of Computing, vol.14, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00000899
Efficient Sampling of Random Permutations Journal of Discrete AlgorithmsTo be published as doi:10, 2007. ,
Adaptive online data compression, Proceedings 11th IEEE International Symposium on High Performance Distributed Computing, pp.379-388, 2002. ,
DOI : 10.1109/HPDC.2002.1029938
URL : https://hal.archives-ouvertes.fr/inria-00100877
The Art of Computer Programming Seminumerical Algorithms, 1981. ,
Range encoding: an algorithm for removing redundancy from a digitised message, Presented at the Video & Data Recording Conference, 1979. ,
Tables of Random Permutations, 1963. ,
Software Performance of Universal Hash Functions, Advances in Cryptology -EUROCRYPT 1999, pp.24-41, 1999. ,
DOI : 10.1007/3-540-48910-X_3
A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990. ,
DOI : 10.1145/79173.79181
An efficient compression scheme for bitmap indices, 2004. ,
DOI : 10.2172/841308
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès ,