Greedy can also beat pure dynamic programming. - Stasys Jukna; Hannes Seiwert (Electron. Colloquium Comput. Complex., 2018)

Approximation Limitations of Tropical Circuits. - Stasys Jukna; Hannes Seiwert (Electron. Colloquium Comput. Complex., 2018)

Greedy can beat pure dynamic programming. - Stasys Jukna; Hannes Seiwert (Inf. Process. Lett., 2019)

Operational Complexity of Straight Line Programs for Regular Languages. - Hannes Seiwert (DCFS, 2020)

Reciprocal Inputs in Arithmetic and Tropical Circuits. - Stasys Jukna; Hannes Seiwert; Igor Sergeev (Electron. Colloquium Comput. Complex., 2020)

Sorting can exponentially speed up pure dynamic programming. - Stasys Jukna; Hannes Seiwert (Inf. Process. Lett., 2020)

Approximation Limitations of Pure Dynamic Programming. - Stasys Jukna; Hannes Seiwert (SIAM J. Comput., 2020)

Tropical Kirchhoff's formula and postoptimality in matroid optimization. - Stasys Jukna; Hannes Seiwert (Discret. Appl. Math., 2021)

Regular expression length via arithmetic formula complexity. - Ehud Cseresnyes; Hannes Seiwert (J. Comput. Syst. Sci., 2022)