Author:
Herley Kieran T.,Pietracaprina Andrea,Pucci Geppino
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. B. Aiello and T. Leighton. Coding theory, hypercube embeddings and faulttolerance. In Proceedings of 3rd ACM Symposium on Parallel Algorithms and Architectures, pages 125–136, 1991.
2. A.Z. Broder, A.M. Frieze, E. Shamir, and E. Upfal. Near-perfect token distribution. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming, pages 308–317, July 1992.
3. S.N. Bhatt, D. Greenberg, F.T. Leighton, and P. Liu. Tight bounds for online tree embeddings. In Proceedings of the 2nd ACM-SIAM Symposium On Discrete Algorithms, pages 344–350, January 1991.
4. R. Cole and U. Vishkin. Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing, 17(1):128–142, 1988.
5. T. Goldberg and U. Zwick. Optimal deterministic approximate parallel prefix sums and their applications. In Proceedings of 3th Israel Symposium on Theory and Computing Systems, 1994.