共 30 条
- [1] A note on parallel algorithms for optimal h-v drawings of binary trees COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 9 (03): : 145 - 158
- [3] Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 36 - 41
- [7] PARALLEL ALGORITHMS FOR BALANCING THREADED BINARY SEARCH-TREES EIGHTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS: 1989 CONFERENCE PROCEEDINGS, 1989, : 286 - 290
- [8] Optimal Parallel Algorithms in the Binary-Forking Model PROCEEDINGS OF THE 32ND ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES (SPAA '20), 2020, : 89 - 102
- [9] On a sublinear time parallel construction of optimal binary search trees Parallel Processing Letters, 1998, 8 (03): : 387 - 397