Sublinear-time reductions for big data computing

DOI10.1016/j.tcs.2022.07.038OpenAlexW3217418186MaRDI QIDQ5970839

Xiang-Yu Gao, Dongjing Miao, Jian-Zhong Li

Publication date: 16 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.07.038

zbMATH Keywords

completenessreduction techniquesbig data computingsublinear-time tractability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first search is inherently sequential
• Sorted Range Reporting
• Range searching on uncertain data
• Fine-Grained Complexity Theory (Tutorial)
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Recognizing the tractability in big data computing

This page was built for publication: Sublinear-time reductions for big data computing