A. Aggarwal, S. Vitter, and J. , The input/output complexity of sorting and related problems, Communications of the ACM, vol.31, issue.9, pp.1116-1127, 1988.
DOI : 10.1145/48529.48535
URL : https://hal.archives-ouvertes.fr/inria-00075827

M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P, Annals of Mathematics, vol.160, issue.2, pp.781-793, 2004.
DOI : 10.4007/annals.2004.160.781

L. Arge, The Buffer Tree: A Technique for Designing Batched External Data Structures, Algorithmica, vol.37, issue.1, pp.1-24, 2003.
DOI : 10.1007/s00453-003-1021-x

L. Arge, M. A. Bender, E. D. Demaine, B. Holland-minkley, and J. I. Munro, Cacheoblivious priority queue and graph algorithm applications, Proc. of the 34th Annual Symposium on Theory of Computing, pp.268-276, 2002.

L. Arge and M. Thorup, RAM-Efficient External Memory Sorting, Algorithms and Computation, pp.491-501
DOI : 10.1007/s00453-015-0032-8

A. Atkin and D. Bernstein, Prime sieves using binary quadratic forms, Mathematics of Computation, vol.73, issue.246, pp.1023-1030, 2004.
DOI : 10.1090/S0025-5718-03-01501-1

C. Bays and R. H. Hudson, The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012, BIT, vol.17, issue.2, pp.121-127, 1977.
DOI : 10.1007/BF01932283

S. Bengelloun, An incremental primal sieve, Acta Informatica, vol.24, issue.2, pp.119-125, 1986.
DOI : 10.1007/BF00289493

R. P. Brent, The first occurrence of large gaps between successive primes, Mathematics of Computation, vol.27, issue.124, pp.959-963, 1973.
DOI : 10.1090/S0025-5718-1973-0330021-0

D. A. Cox, Primes of the form x 2 + ny 2 : Fermat, Class Field Theory, and Complex Multiplication, 1989.

B. Dunten, J. Jones, and J. Sorenson, A space-efficient fast prime number sieve, Information Processing Letters, vol.59, issue.2, pp.79-84, 1996.
DOI : 10.1016/0020-0190(96)00099-3

M. Farach-colton and M. Tsai, On the Complexity of Computing Prime Tables, Algorithms and Computation -26th International Symposium, ISAAC'15, 2015.
DOI : 10.1007/978-3-662-48971-0_57

R. Gale and V. Pratt, CGOL?an algebraic notation for MACLISP users, 1977.

W. F. Galway, Dissecting a Sieve to Cut Its Need for Space, Algorithmic Number Theory, pp.297-312, 2000.
DOI : 10.1007/10722028_17

D. Gries and J. Misra, A linear sieve algorithm for finding prime numbers, Communications of the ACM, vol.21, issue.12, pp.999-1003, 1978.
DOI : 10.1145/359657.359660

G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1979.
DOI : 10.1090/S0002-9904-1929-04793-1

S. Horsley, . Ko?kinon-epato??enoy?, and . Or, The Sieve of Eratosthenes Being an Account of His Method of Finding All the Prime Numbers, by the Rev, FRS. Philosophical Transactions, pp.327-347

H. W. Lenstra-jr and C. Pomerance, Primality Testing with Gaussian Periods, Lecture Notes in Computer Science, pp.1-1, 2002.
DOI : 10.1007/3-540-36206-1_1

H. G. Mairson, Some new upper bounds on the generation of prime numbers, Communications of the ACM, vol.20, issue.9, pp.664-669, 1977.
DOI : 10.1145/359810.359838

F. Mertens, Ein beitrag zur analytischen zahlentheorie, Journal fr die reine und angewandte Mathematik, pp.46-62, 1874.

F. News, World's largest prime number discovered ? all 17 million digits. https: //web.archive.org/web, 2013.

M. Patrascu and M. Thorup, Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp.166-175, 2014.
DOI : 10.1109/FOCS.2014.26

C. Pomerance, J. L. Selfridge, and S. S. Wagstaff, The pseudoprimes to 25·10 9, Mathematics of Computation, vol.35, issue.151, pp.1003-1026, 1980.

C. Pomerance and I. E. Shparlinski, On pseudosquares and pseudopowers. Combinatorial number theory, pp.171-184, 2009.

P. Pritchard, A sublinear additive sieve for finding prime number, Communications of the ACM, vol.24, issue.1, pp.18-23, 1981.
DOI : 10.1145/358527.358540

P. Pritchard, Explaining the wheel sieve, Acta Informatica, vol.17, issue.4, pp.477-485, 1982.
DOI : 10.1007/BF00264164

P. Pritchard, Linear prime-number sieves: A family tree, Science of Computer Programming, vol.9, issue.1, pp.17-35, 1987.
DOI : 10.1016/0167-6423(87)90024-4

A. Schönhage, A. Grotefeld, and E. Vetter, Fast algorithms: a multitape Turing machine implementation. B.I. Wissenschaftsverlag, 1994.

R. C. Singleton, Algorithm 357: an efficient prime number generator [A1], Communications of the ACM, pp.563-564, 1969.
DOI : 10.1145/363235.363247

J. Sorenson, An introduction to prime number sieves, 1990.

J. P. Sorenson, The Pseudosquares Prime Sieve, Algorithmic number theory, pp.193-207, 2006.
DOI : 10.1007/11792086_15

M. B. Villarino, Mertens' proof of mertens' theorem. arXiv:math/0504289, 2005.

J. S. Vitter, External memory algorithms and data structures: dealing with massive data, ACM Computing Surveys, vol.33, issue.2, pp.209-271, 2001.
DOI : 10.1145/384192.384193

H. C. Williams, Edouard Lucas and primality testing, Canadian Mathematics Society Series of Monographs and Advanced Texts, issue.22, 1998.