The I/O Complexity of Computing Prime Tables

DOI10.1007/978-3-662-49529-2_15zbMath1417.68060OpenAlexW2413414340MaRDI QIDQ2802940

Shikha Singh, Samuel McCauley, Bertrand Simon, Alexander Conway, Rob Johnson, Martín Farach-Colton, Pramod Ganapathi, Michael A. Bender, Rezaul Alam Chowdhury

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01326317/file/sieve.pdf

zbMATH Keywords

sortingpriority queuesexternal-memory algorithmsprime tables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Searching and sorting (68P10) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Primality (11Y11)

Related Items (1)

The red-blue pebble game on trees and DAGs with large input

This page was built for publication: The I/O Complexity of Computing Prime Tables