1: Simplified, stable parallel merging
2: Sublinear Time Approximate Sum via Uniform Random Sampling
3: Deterministic parameterized connected vertex cover
4: How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?
5: Label Cover instances with large girth and the hardness of approximating basic k-spanner
6: A rearrangement step with potential uses in priority queues
7: Secure Multi-Party Computation in Large Networks
8: Conducting Truthful Surveys, Cheaply
9: Algorithms for Wireless Capacity
10: Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring
11: Learning DNF Expressions from Fourier Spectrum
12: An Exploratory Study of Critical Factors Affecting the Efficiency of Sorting Techniques (Shell, Heap and Treap)
13: Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis
14: Faster Parameterized Algorithms using Linear Programming
15: On the asymptotic and practical complexity of solving bivariate systems over the reals
16: Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
17: Dynamic Packet Scheduling in Wireless Networks