Publisher
Springer International Publishing
Reference38 articles.
1. Ben-Amram, A.M., Galil, Z.: A generalization of a lower bound technique due to Fredman and Saks. Algorithmica 30(1), 34–66 (2001)
2. Ben-Amram, A.M., Galil, Z.: Lower bounds for dynamic data structures on algebraic RAMs. Algorithmica 32(3), 364–395 (2002)
3. Bille, P., et al.: Dynamic relative compression, dynamic partial sums, and substring concatenation. Algorithmica 80(11), 3207–3224 (2018). Announced at ISAAC 2016
4. Lecture Notes in Computer Science;P Bille,2017
5. Blelloch, G.E.: Prefix sums and their applications. In: Synthesis of Parallel Algorithms (1990)