@InProceedings{lau_et_al:LIPIcs.ITCS.2021.35,
author = {Lau, Joshua and Ritossa, Angus},
title = {{Algorithms and Hardness for Multidimensional Range Updates and Queries}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.35},
URN = {urn:nbn:de:0030-drops-135742},
doi = {10.4230/LIPIcs.ITCS.2021.35},
annote = {Keywords: Orthogonal range, Range updates, Online and Dynamic Data Structures, Fine-grained complexity, Cycle counting}
}