StringologyTimes

Data Structures and Algorithms: 2013/9/08-14

1: The Swap Matching Problem Revisited
2: Submodular Maximization Meets Streaming: Matchings, Matroids, and More
3: TRANS outperforms MTF for two special types of request sequences without locality of reference
4: Max-Flows on Sparse and Dense Networks
5: Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds
6: Decision Trees for Function Evaluation - Simultaneous Optimization of Worst and Expected Cost
7: O-notation in algorithm analysis
8: Partitioning into Expanders
9: Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs
10: A Parallel Data Distribution Management Algorithm
11: Improved Parallel Algorithms for Spanners and Hopsets
12: Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling