Equivalences between triangle and range query problems

DOI10.1137/1.9781611975994.3MaRDI QIDQ5146763zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• scientific article; zbMATH DE number 1555970 (Why is no real title available?)
• scientific article; zbMATH DE number 7765381 (Why is no real title available?)
• Towards optimal set-disjointness and set-intersection data structures
• Double-ended palindromic trees in linear time
• Deterministic 3SUM-hardness
• Counting simplices in hypergraph streams
• Algorithms and hardness for multidimensional range updates and queries

This page was built for publication: Equivalences between triangle and range query problems

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