StringologyTimes

Data Structures and Algorithms: 2009/1/22-28

1: Computing Rooted and Unrooted Maximum Consistent Supertrees
2: Nuclear norm minimization for the planted clique and biclique problems
3: Homotopy methods for multiplication modulo triangular sets
4: Randomly colouring simple hypergraphs
5: Bid Optimization in Broad-Match Ad auctions
6: Max Edge Coloring of Trees
7: Peer to Peer Optimistic Collaborative Editing on XML-like trees
8: On the bit-complexity of sparse polynomial multiplication
9: ALLSAT compressed with wildcards: All, or all maximum independent sets