Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A parallel BSP algorithm for irregular dynamic programming
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Comparing and aggregating partially resolved trees
Theoretical Computer Science
An efficient reduction from constrained to unconstrained maximum agreement subtree
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A tunable coarse-grained parallel algorithm for irregular dynamic programming applications
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Hi-index | 0.00 |
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ...