Publisher
Springer International Publishing
Reference4 articles.
1. Codeforces: On “Mo’s Algorithm”, http://codeforces.com/blog/entry/20032
2. D.E. Knuth, Optimum binary search trees. Acta Inform. 1(1), 14–25 (1971)
3. F.F. Yao, Efficient dynamic programming using quadrangle inequalities, in 12h Annual ACM Symposium on Theory of Computing (1980), pp. 429–435
4. S. Kopeliovich, Offline solution of connectivity and 2-edge-connectivity problems for fully dynamic graphs. M.Sc. thesis, Saint Petersburg State University, 2012