On the bit-complexity of sparse polynomial multiplication
On the Border Length Minimization Problem (BLMP) on a Square Array
On the Complexity of Approximate Sum of Sorted List
On the Complexity of Searching in Trees: Average-case Minimization
On the Complexity of Spill Everywhere under SSA Form
On the Complexity of Submodular Function Minimisation on Diamonds
On the Continuous CNN Problem
On the Efficiency of Influence-and-Exploit Strategies for Revenue Maximization under Positive Externalities
On the hardness of distance oracle for sparse graph
On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
On the Hopcroft's minimization algorithm
On the Insertion Time of Cuckoo Hashing
On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree
On the Integrality Gap of the Subtour LP for the 1,2-TSP
On the maximal number of highly periodic runs in a string
On the Monotonicity of Work Function in k-Server Conjecture
On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms
On the Power of Adaptivity in Sparse Recovery
On the Sample Complexity of Compressed Counting
On the Self-stabilization of Mobile Robots in Graphs