1: An Improved Move-To-Front(IMTF) Off-line Algorithm for the List Accessing Problem
2: Online Assignment Algorithms for Dynamic Bipartite Graphs
3: Derandomization of Online Assignment Algorithms for Dynamic Graphs
4: Improved Low-rank Matrix Decompositions via the Subsampled Randomized Hadamard Transform
5: The parameterized complexity of k-edge induced subgraphs
6: Faster Gossiping in Bidirectional Radio Networks with Large Labels
7: A simpler and more efficient algorithm for the next-to-shortest path problem
8: Biochemical network decomposition reveals absolute concentration robustness
9: Uncovering the Temporal Dynamics of Diffusion Networks
10: Topics in Matrix Sampling Algorithms
11: Connecting a Set of Circles with Minimum Sum of Radii
12: A New Family of Practical Non-Malleable Diffie-Hellman Protocols
13: On a conjecture of compatibility of multi-states characters
14: Interpreting Graph Cuts as a Max-Product Algorithm
15: Pruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts
16: A Framework for the Evaluation of Worst-Case System Efficiency
17: Testing Odd-Cycle-Freeness in Boolean Functions