StringologyTimes

Data Structures and Algorithms: 2007/1/01-07

1: Infinite-Alphabet Prefix Codes Optimal for $\beta$-Exponential Penalties
2: $D$-ary Bounded-Length Huffman Coding
3: A nearly optimal and deterministic summary structure for update data streams
4: A Polynomial Time Algorithm for 3-SAT