Efficient parallel algorithms can be made robust

Paris C. Kanellakis and Alexander Allister Shvartsman
Distributed Computing 5:201–217, 1992
Tech. report CS-89-35, Brown Univ., Computer Science Dept., Jun 1989

Cites:

[D. Eppstein publications] [Citation database] [Documents]
Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!