ERC Starting Grant · 2021
The Complexity of Dynamic Matrix Problems
Modern data analysis and optimization rely on our ability to efficiently process very high-dimensional dynamic datasets, where data is rapidly evolving. Dynamic data structures enable fast information-retrieval on these huge databases by maintaining implicit information on the underlying data. Understanding the power and limitations of dynamic algorithms is therefore a fundamental question in theory and practice. Despite decades of successful research on data structures, there are still very basic dynamic problems whose complexity is (exponentially) far from understood -- Bridging this gap is one of the centerpieces of this research proposal. The second objective of this proposal is…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.