StringologyTimes

Data Structures and Algorithms: 1999/3/08-14

1: Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method
2: A class of problems of NP to be worth to search an efficient solving algorithm
3: A complete anytime algorithm for balanced number partitioning