共 50 条
- [32] A SUBQUADRATIC ALGORITHM FOR CONSTRUCTING APPROXIMATELY OPTIMAL BINARY SEARCH-TREES JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1987, 8 (04): : 579 - 591
- [33] Linear-time construction of optimal context trees DCC '98 - DATA COMPRESSION CONFERENCE, 1998, : 369 - 377
- [35] Beyond binary search: parallel in-place construction of implicit search tree layouts 2018 32ND IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2018, : 1070 - 1079
- [39] Parallel Binary Search Trees for Rapid IP Lookup using Graphic Processors 2013 2ND INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT IN THE KNOWLEDGE ECONOMY (IMKE), 2013, : 176 - 179