Author:
Herley Kieran T.,Pietracaprina Andrea,Pucci Geppino
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. B. Aiello, T. Leighton, Coding theory, hypercube embeddings and fault-tolerance, Proc. of 3rd ACM Symp. on Parallel Algorithms and Architectures, Hi Hon Head, South Carolina, 1991, pp. 125–136.
2. S.N. Bhatt, D. Greenberg, F.T. Leighton, P. Liu, Tight bounds for on-line tree embeddings, Proc. of the 2nd ACM-SIAM Symp. On Discrete Algorithms, San Francisco, California, January 1991, pp. 344–350.
3. A.Z. Broder, A.M. Frieze, E. Shamir, E. Upfal, Near-perfect token distribution, Proc. of the 19th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, July 1992, pp. 308–317.
4. Approximate parallel scheduling. Part I;Cole;SIAM J. Comput.,1988
5. T. Goldberg, U. Zwick, Optimal deterministic approximate parallel prefix sums and their applications, Proc. of the 4th Israel Symp. on Theory of Computing and Systems, Tel Aviv, Israel, 1995, pp. 220–228.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献