scientific article; zbMATH DE number 7650383

DOI10.4230/LIPICS.ITCS.2020.35MaRDI QIDQ5875733zbMATH OpenFDO

Authors R. Natarajan, Cyrus Rashtchian

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1910.11921

zbMATH Keywords

cell probe modelcommunication complexitymatrix rigiditysystematic linear data structures

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(5)

• Polynomial data structure lower bounds in the group model
• Static data structure lower bounds imply rigidity
• Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems
• Equivalence of Systematic Linear Data Structures and Matrix Rigidity
• Kronecker products, low-depth circuits, and matrix rigidity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875733)