Hannes Seiwert

Orcid: 0000-0002-2293-6542

According to our database1, Hannes Seiwert authored at least 9 papers between 2018 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Regular expression length via arithmetic formula complexity.
J. Comput. Syst. Sci., 2022

2021
Tropical Kirchhoff's formula and postoptimality in matroid optimization.
Discret. Appl. Math., 2021

2020
Approximation Limitations of Pure Dynamic Programming.
SIAM J. Comput., 2020

Sorting can exponentially speed up pure dynamic programming.
Inf. Process. Lett., 2020

Reciprocal Inputs in Arithmetic and Tropical Circuits.
Electron. Colloquium Comput. Complex., 2020

Operational Complexity of Straight Line Programs for Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019
Greedy can beat pure dynamic programming.
Inf. Process. Lett., 2019

2018
Approximation Limitations of Tropical Circuits.
Electron. Colloquium Comput. Complex., 2018

Greedy can also beat pure dynamic programming.
Electron. Colloquium Comput. Complex., 2018


  Loading...