The construction of Huffman-equivalent prefix code in NC
ACM SIGACT News
Height restricted optimal binary trees
SIAM Journal on Computing
A subquadratic algorithm for constructing approximately optimal binary search trees
Journal of Algorithms
Fast and efficient parallel solution of sparse linear systems
SIAM Journal on Computing
Graph Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Efficient dynamic programming using quadrangle inequalities
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Coding and Information Theory
Parallel construction of near optimal binary trees
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel searching in generalized Monge arrays with applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel construction of trees with optimal weighted path length
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel construction of optimal alphabetic trees
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Shortest path in complete bipartite digraph problem and its applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
ACM Transactions on Algorithms (TALG)
Parallel variable-length encoding on GPGPUs
Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
| Hi-index | 0.00 |