1: Priority Queue Based on Multilevel Prefix Tree
2: Fast evaluation of union-intersection expressions
3: Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks
4: Relative-Error CUR Matrix Decompositions