StringologyTimes

Data Structures and Algorithms: 2010/1/08-14

1: Spatial search in a honeycomb network
2: Pure Parsimony Xor Haplotyping
3: New Constructive Aspects of the Lovasz Local Lemma
4: The Serializability of Network Codes
5: Efficient Upload Bandwidth Estimation and Communication Resource Allocation Techniques
6: Multidimensional Data Structures and Techniques for Efficient Decision Making
7: A New Approximation Technique for Resource-Allocation Problems
8: A Reduced Offset Based Method for Fast Computation of the Prime Implicants Covering a Given Cube
9: Algorithmic Differentiation of Linear Algebra Functions with Application in Optimum Experimental Design (Extended Version)
10: Random Access to Grammar Compressed Strings
11: Combinatorial Auctions with Budgets
12: Divide & Concur and Difference-Map BP Decoders for LDPC Codes
13: Genealogical Information Search by Using Parent Bidirectional Breadth Algorithm and Rule Based Relationship
14: Sampled Longest Common Prefix Array