Tight cell probe bounds for succinct boolean matrix-Vector multiplication

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

DOI

Original languageEnglish
Title of host publicationSTOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Number of pages10
PublisherAssociation for Computing Machinery
Publication year20 Jun 2018
Pages1297-1306
ISBN (Electronic)9781450355599
DOIs
Publication statusPublished - 20 Jun 2018
Event50th Annual ACM Symposium on Theory of Computing, STOC 2018 - Los Angeles, United States
Duration: 25 Jun 201829 Jun 2018

Conference

Conference50th Annual ACM Symposium on Theory of Computing, STOC 2018
LandUnited States
ByLos Angeles
Periode25/06/201829/06/2018
SponsorACM Special Interest Group on Algorithms and Computation Theory (SIGACT)
SeriesA C M Symposium on the Theory of Computing. Annual Proceedings
Number2018
ISSN0737-8017

    Research areas

  • Boolean matrix-vector multiplication, Cell probe model, Lower bound, Succinct data structure

See relations at Aarhus University Citationformats

ID: 131963911