Turing machines with two-level memory: a deep look into the input/output complexity

DOI10.1007/978-3-031-22105-7_18arXiv2208.09803OpenAlexW4313351092MaRDI QIDQ6113843

Hengzhao Ma, Tianpeng Gao, Xiang-Yu Gao, Jian-Zhong Li

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

computational modelcomputational theoryinput/output complexity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Turing machines with two-level memory: a deep look into the input/output complexity

Cites Work

• Fundamentals of parameterized complexity
• The uniform memory hierarchy model of computation
• The input/output complexity of transitive closure
• The log-structured merge-tree (LSM-tree)
• The Input/Output Complexity of Sparse Matrix Multiplication
• Recognizing the tractability in big data computing
• Turing machines with two-level memory: a deep look into the input/output complexity
• Unnamed Item

This page was built for publication: Turing machines with two-level memory: a deep look into the input/output complexity