Matthew T. Maat

Orcid: 0009-0004-7361-8538

According to our database¹, Matthew T. Maat authored at least 5 papers between 2021 and 2026.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of four.

Timeline

Legend:

Book In proceedings Article PhD thesis Dataset Other

Bibliography

2026

Lower Bounds for Ranking-Based Pivot Rules.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Strategy Improvement, the Simplex Algorithm and Lopsidedness.

[BibT_eX]

[DOI]

Matthew T. Maat

CoRR, September, 2025

Cycle Patterns and Mean Payoff Games.

[BibT_eX]

[DOI]

Georg Loho

Matthew T. Maat

Mateusz Skomra

CoRR, March, 2025

2024

The Worst-Case Complexity of Symmetric Strategy Improvement.

[BibT_eX]

[DOI]

Tom van Dijk

Georg Loho

Matthew T. Maat

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2021

A better lower bound for Lower-Left Anchored Rectangle Packing.

[BibT_eX]

[DOI]

Ruben Hoeksma

Matthew T. Maat

CoRR, 2021

Matthew T. Maat

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...