Stasys Jukna, “Limitations of Incremental Dynamic Programming”, Algorithmica, 69, № 2, 2014, 461
R. Raz, G. Tardos, O. Verbitsky, N. Vereshagin, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247), 1998, 58
S. Jukna, “A nondeterministic space-time tradeoff for linear codes”, Information Processing Letters, 109, № 5, 2009, 286
Stasys Jukna, Georg Schnitger, “Yet harder knapsack problems”, Theoretical Computer Science, 412, № 45, 2011, 6351
Stasys Jukna, “Linear codes are hard for oblivious read-once parity branching programs”, Information Processing Letters, 69, № 6, 1999, 267
Pavol Ďuriš, Juraj Hromkovič, Stasys Jukna, Martin Sauerhoff, Georg Schnitger, “On multi-partition communication complexity”, Information and Computation, 194, № 1, 2004, 49