Showing 2024Show all
2 papers · 1 filter
cs.DS2024
I/O complexity and pebble games with partial computations
Aleksandros Sobczyk
Optimizing data movements during program executions is essential for achieving high performance in modern computing systems. This has been classically modeled with the Red-Blue Peb…
cs.DS2024
Deterministic complexity analysis of Hermitian eigenproblems
Aleksandros Sobczyk
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a r…