Linear-Space Data Structures for Range Mode Query in Arrays-Reference-Cited by-同舟云学术

Linear-Space Data Structures for Range Mode Query in Arrays

Published:2013-03-08 Issue:4 Volume:55 Page:719-741
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Chan Timothy M.,Durocher Stephane,Larsen Kasper Green,Morrison Jason,Wilkinson Bryan T.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-013-9455-2.pdf

Reference62 articles.

1. Agarwal, P.K.: Range searching. In: Goodman, J., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 809–837. CRC Press, New York (2004)

2. Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report 71/87, Tel-Aviv University (1987)

3. Lecture Notes in Computer Science;A. Amir,2007

4. Bansal, N., Williams, R.: Regularity lemmas and combinatorial algorithms. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 745–754 (2009)

5. Lecture Notes in Computer Science;M.A. Bender,2000

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Algorithms for Range Mode Queries in the Big Data Era;Information;2024-07-30

2. Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Efficient Evaluation of Arbitrarily-Framed Holistic SQL Aggregates and Window Functions;Proceedings of the 2022 International Conference on Management of Data;2022-06-10

4. Tight dynamic problem lower bounds from generalized BMM and OMv;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Range Majorities and Minorities in Arrays;Algorithmica;2021-03-19