1

Paul Bachmann, Die Analytische Zahlentheorie. Zahlentheorie, pt. 2 (Leipzig: B. G. Teubner, 1894).

2

Paul du Bois-Reymond, "Sur la grandeur relative des infinis des fonctions," Annali di Mat. pura ed applic. (2), 4 (1871), 338--353.

3

G. H. Hardy, "Orders of Infinity," Cambridge Tracts in Math. and Math. Physics, 12 (1910; Second edition, 1924).

4

G. H. Hardy and J. E. Littlewood, "Some problems of Diophantine approximation," Acta Mathematica 37 (1914), 155--238.

5

G. H. Hardy and J. E. Littlewood, "Contributions to the theory of the Riemann zeta function and the theory of the distribution of primes," Acta Mathematica 41 (1918), 119--196.

6

Edmund Landau, Handbuch der Lehre von der Verteilung der Primzahlen, 2 vols. (Leipzig: B. G. Teubner, 1909).

7

Karl Prachar, Primzahlverteilung (Berlin: Springer, 1957).

8

E. C. Titchmarsh, The Theory of the Riemann Zeta-Function (Oxford: Clarendon Press, 1951).

9

I. M. Vinogradov, The Method of Trigonometrical Sums in the Theory of Numbers, translated from the 1947 Russian edition by K. F. Roth and Anne Davenport (London: Interscience, no date).

Allan Gottlieb , Clyde P. Kruskal, Complexity Results for Permuting Data and Other Computations on Parallel Processors, Journal of the ACM (JACM), v.31 n.2, p.193-209, April 1984

John H. Reif , Harry R. Lewis, Symbolic evaluation and the global value graph, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.104-118, January 17-19, 1977, Los Angeles, California

M. Cosnard , P. Fraigniaud, Analysis of Asynchronous Polynomial Root Finding Methods on a Distributed Memory Multicomputer, IEEE Transactions on Parallel and Distributed Systems, v.5 n.6, p.639-648, June 1994

Peter Bloniarz, A shortest-path algorithm with expected time O(n2 log n log* n), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.378-384, April 28-30, 1980, Los Angeles, California, United States

Bruce Weide, A Survey of Analysis Techniques for Discrete Algorithms, ACM Computing Surveys (CSUR), v.9 n.4, p.291-313, Dec. 1977

E. G. Coffman, Jr. , C. Courcoubetis , M. R. Garey , D. S. Johnson , L. A. McGeoch , P. W. Shor , R. R. Weber , M. Yannakakis, Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.230-240, May 05-08, 1991, New Orleans, Louisiana, United States

Hanspeter Bieri, Teaching algorithms and data structures: 10 personal observations, Computer science in perspective, Springer-Verlag New York, Inc., New York, NY, 2003

Mark R. Brown , Robert E. Tarjan, A representation for linear lists with movable fingers, Proceedings of the tenth annual ACM symposium on Theory of computing, p.19-29, May 01-03, 1978, San Diego, California, United States

Zvi Galil , Giuseppe F. Italiano, Data structures and algorithms for disjoint set union problems, ACM Computing Surveys (CSUR), v.23 n.3, p.319-344, Sept. 1991

Kenneth J. Supowit , Eric A. Slutz, Placement algorithms for custom VLSI, Proceedings of the 20th conference on Design automation, p.164-170, June 27-29, 1983, Miami Beach, Florida, United States

David B. Skillicorn , Domenico Talia, Models and languages for parallel computation, ACM Computing Surveys (CSUR), v.30 n.2, p.123-169, June 1998

Kenneth J. Supowit, A minimum-impact routing algorithm, Proceedings of the 19th conference on Design automation, p.104-112, January 1982

D. A. Grove , P. D. Coddington, Modeling message-passing programs with a Performance Evaluating Virtual Parallel Machine, Performance Evaluation, v.60 n.1-4, p.165-187, May 2005

Ambuj Goyal , Perwez Shahabuddin , Philip Heidelberger , Victor F. Nicola , Peter W. Glynn, A Unified Framework for Simulating Markovian Models of Highly Dependable Systems, IEEE Transactions on Computers, v.41 n.1, p.36-51, January 1992

Mark R. Brown , Robert E. Tarjan, A Fast Merging Algorithm, Journal of the ACM (JACM), v.26 n.2, p.211-226, April 1979

Leo Geurts , Lambert Meertens, Remarks on Abstracto, ALGOL Bulletin

Gillea Brassard, Crusade for a better notation, ACM SIGACT News, v.17 n.1, p.60-64, June 1985

Y Gurevich, What does O(n) mean, ACM SIGACT News, v.17 n.4, p.61-63, Spring 1986

Ricardo Fabbri , Luciano Da F. Costa , Julio C. Torelli , Odemir M. Bruno, 2D Euclidean distance transform algorithms: A comparative survey, ACM Computing Surveys (CSUR), v.40 n.1, p.1-44, February 2008

Donald E. Knuth: colleagues