Post-mortem black-box correctness tests for basic parallel data structures
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Upper and lower bounds on constructing alphabetic binary trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal integer alphabetic trees in linear time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 5.23 |