StringologyTimes

Data Structures and Algorithms: 2012/11/22-28

1: On Top-$k$ Weighted SUM Aggregate Nearest and Farthest Neighbors in the $L_1$ Plane
2: The Rightmost Equal-Cost Position Problem
3: Faster Random Walks By Rewiring Online Social Networks On-The-Fly
4: Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression
5: Faster Compact Top-k Document Retrieval
6: Algorithms for Computing Abelian Periods of Words
7: Analysis of a randomized approximation scheme for matrix multiplication
8: Approximate pattern matching with k-mismatches in packed text
9: Online Vector Scheduling and Generalized Load Balancing
10: Interval Deletion is Fixed-Parameter Tractable
11: A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets
12: Time-Darts: A Data Structure for Verification of Closed Timed Automata
13: Dual techniques for scheduling on a machine with varying speed
14: Non-Interference and Local Correctness in Transactional Memory
15: Certifying 3-Edge-Connectivity