Showing results 1 to 2 of 2
Title | Author(s) | Issue Date | |
---|---|---|---|
On the parallel time complexity of undirected connectivity and minimum spanning trees Proceeding/Conference:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms | 1999 | ||
Trade-offs between speed and processor in hard-deadline scheduling Proceeding/Conference:Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms | 1999 |