|
||||
| 1 |
Parallel digital halftoning by error-diffusion
Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
June 2003
|
|
| 2 |
"Of course it's true; I saw it on the Internet!":critical thinking in the Internet era
Communications of the ACM
May 2003
Volume 46 Issue 5 |
|
| 3 |
Automatic methods for hiding latency in parallel and distributed computation
SIAM Journal on Computing
October 1999
Volume 29 Issue 2 |
|
| 4 |
The art and science of multimedia
ACM SIGGRAPH 98 Conference abstracts and applications
July 1998
|
|
| 5 |
A note on parallel algorithms for optimal h-v drawings of binary trees
Computational Geometry: Theory and Applications
February 1998
Volume 9 Issue 3 |
|
| 6 |
Connected components in
Journal of Computer and System Sciences
April 1997
Volume 54 Issue 2 |
|
| 7 |
Automatic methods for hiding latency in high bandwidth networks (extended abstract)
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
July 1996
|
|
| 8 |
Improved methods for hiding latency in high bandwidth networks (extended abstract)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
June 1996
|
|
| 9 |
Toward multimedia conference proceedings
Communications of the ACM
January 1996
Volume 39 Issue 1 |
|
| 10 |
A parallel algorithm for computing minimum spanning trees
Journal of Algorithms
November 1995
Volume 19 Issue 3 |
|
| 11 |
Fundamental ideas for a parallel computing course
ACM Computing Surveys (CSUR)
June 1995
Volume 27 Issue 2 |
|
| 12 |
Interactive multimedia conference proceedings
Conference companion on Human factors in computing systems
May 1995
|
|
| 13 |
A parallel algorithm for computing minimum spanning trees
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
June 1992
|
|
| 14 |
Parallel algorithms for graph problems
Dartmouth College
January 1992
|
|
| 15 |
Connected components in
Proceedings of the 32nd annual symposium on Foundations of computer science
September 1991
|
|