Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds

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

Original languageEnglish
Title of host publicationProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
Number of pages12
Place of publicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Publication year20 Jun 2018
ISBN (print)978-1-4503-5559-9
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


Conference50th Annual ACM Symposium on Theory of Computing, STOC 2018
LandUnited States
ByLos Angeles
SponsorACM Special Interest Group on Algorithms and Computation Theory (SIGACT)
SeriesA C M. S I G A C T - S I G M O D - S I G A R T Symposium on Principles of Database Systems. Proceedings

See relations at Aarhus University Citationformats

ID: 132363655