$5
[1] Milton Abramowitz and Irene A. Stegun, editors. Handbook of Mathematical Functions. Dover, 1965.
[2] An algorithm for the organization of information. Soviet Mathematics Doklady, 1259–1263, 1962.
[3] On distinguishing prime numbers from composite numbers. Annals of Mathematics, 173–206, 1983.
[4] The input/output complexity of sorting and related problems. Communications of the ACM, (9): 1116–1127, 1988.
[5] The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
[6] Data Structures and Algorithms. Addison-Wesley, 1983.
[7] Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[8] Faster algorithms for the shortest path problem. Journal of the ACM, 213–223, 1990.
[9] A fast and simple algorithm for the maximum flow problem. Operations Research, (5): 748–759, 1989.
[10] Improved time bounds for the maximum flow problem. SIAM Journal on Computing, (5): 939–954, 1989.
[11] Sorting in c log n parallel steps. Combinatorica, 1–19, 1983.
[12] Improved algorithms and analysis for secretary problems and generalizations. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 473–482, 1995.
[13] On the solution of linear recurrence equations. Computational Optimization and Applications, (2): 195–210, 1998.
[14] Generating pseudo-random permutations and maximum flow algorithms. Information Processing Letters, 201–204, 1990.
[15] Balanced search trees made simple. In Proceedings of the Third Workshop on Algorithms and Data Structures, in Lecture Notes in Computer Science, pages 60–71. Springer-Verlag, 1993.
[16] Faster deterministic sorting and searching in linear space. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pages 135–141, 1996.
[17] Sorting in linear time? Journal of Computer and System Sciences, 74–93, 1998.
[18] Calculus, Blaisdell Publishing Company, second edition, 1967.
[19] Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California, Berkeley, 1994.
[20] Theapproximability of NP-hard problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 337–348, 1998.
[21] Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM, (5): 753–782, 1998.
[22] Hardness of approximations. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 399–446. PWS Publishing Company, 1997.
[23] A simple bound on the expected height of a randomly built binary search tree. Technical Report TR2001-387, Dartmouth College Department of Computer Science, 2001.
[24] Mikhail J. Atallah, editor. Algorithms and Theory of Computation Handbook. CRC Press, 1999.
[25] Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, 1999.
[26] Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, third edition, 2000.
[27] Private communication, 1989.
[28] Number-theoretic algorithms. In Annual Review of Computer Science, pages 119–172. Annual Reviews, Inc., 1990.
[29] Algorithmic Number Theory—Volume I: Efficient Algorithms. The MIT Press, 1996.
[30] Using Strassen's algorithm to accelerate the solution of linear systems. The Journal of Supercomputing, (4): 357–371, 1990.
[31] Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 290–306, 1972.
[32] Organization and maintenance of large ordered indexes. Acta Informatica, (3): 173–189, 1972.
[33] The generation of random numbers that are probably prime. Journal of Cryptology, 53–64, 1988.
[34] Dynamic Programming. Princeton University Press, 1957.
[35] On a routing problem. Quarterly of Applied Mathematics, (1): 87–90, 1958.
[36] Lower bounds for algebraic computation trees. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 80–86, 1983.
[37] Cache-oblivious B-trees. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 399–409, 2000.
[38] Finding the median requires 2n comparisons. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 213–216, 1985.
[39] Writing Efficient Programs. Prentice-Hall, 1982.
[40] Programming Pearls. Addison-Wesley, 1986.
[41] A general method for solving divide-and-conquer recurrences. SIGACT News, (3): 36–44, 1980.
[42] Probability and Measure. John Wiley & Sons, second edition, 1986.
[43] Time bounds for selection. Journal of Computer and System Sciences, (4): 448–461, 1973.
[44] Random Graphs. Academic Press,1985.
[45] Graph Theory with Applications. American Elsevier, 1976.
[46] Algorithmics: Theory and Practice. Prentice-Hall,1988.
[47] Fundamentals of Algorithmics. Prentice Hall, 1996.
[48] An improved Monte Carlo factorization algorithm. BIT, (2): 176–184, 1980.
[49] The Analysis of a Practical and Nearly Optimal Priority Queue. PhD thesis, Computer Science Department, Stanford University, 1977. Technical Report STAN-CS-77-600.
[50] Implementation and analysis of binomial queue algorithms. SIAM Journal on Computing, (3): 298–319, 1978.
[51] Factoring integers with the number field sieve. In A. K. Lenstra and H. W. Lenstra, Jr., editors, The Development of the Number Field Sieve, of Lecture Notes in Mathematics, pages 50–94. Springer-Verlag, 1993.
[52] Universal classes of hash functions. Journal of Computer and System Sciences, (2): 143–154, 1979.
[53] A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM, (6): 1028–1047, 2000.
[54] A randomized maximum-flow algorithm. SIAM Journal on Computing, (2): 203–226, 1995.
[55] Analysis of preflow push algorithms for maximum network flow. SIAM Journal on Computing, (6): 1057–1086, 1989.
[56] On implementing the push-relabel method for the maximum flow problem. Algorithmica, (4): 390–410, 1997.
[57] Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, (2): 129–174, 1996.
[58] Buckets, heaps, lists and monotone priority queues. SIAM Journal on Computing, (4): 1326–1346, 1999.
[59] A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 493–507, 1952.
[60] Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974.
[61] A greedy heuristic for the set-covering problem. Mathematics of Operations Research, (3): 233–235, 1979.
[62] Linear Programming. W. H. Freeman and Company, 1983.
[63] Selected combinatorial research problems. Technical Report STAN-CS-72-292, Computer Science Department, Stanford University, 1972.
[64] The intrinsic computational difficulty of functions. In Proceedings of the 1964 Congress for Logic, Methodology, and the Philosophy of Science, pages 24–30. North-Holland, 1964.
[65] Primality testing and Jacobi sums. Mathematics of Computation, (165): 297–330, 1984.
[66] The ubiquitous B-tree. ACM Computing Surveys, (2): 121–137, 1979.
[67] The complexity of theorem proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, pages 151–158, 1971.[68] An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, (90): 297–301, 1965.
[69] Modifications to the number field sieve. Journal of Cryptology, 169–180, 1993.
[70] Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, (3): 251–280, 1990.
[71] Virtual Memory for Data-Parallel Computing. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, 1992.
[72] Shortest-route methods: 1. Reaching, pruning, and buckets. Operations Research, (1): 161–186, 1979.
[73] Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, (4): 738–761, 1994.
[74] New directions in cryptography. IEEE Transactions on Information Theory, (6): 644–654, 1976.
[75] A note on two problems in connexion with graphs. Numerische Mathematik, 269–271, 1959.
[76] Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady, (5): 1277–1280, 1970.
[77] Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing, (6): 1184–1192, 1992.
[78] Factorization and primality tests. The American Mathematical Monthly, (6): 333–352, 1984.
[79] Selecting the median. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pages 28–37, 1995.
[80] Fundamentals of Applied Probability Theory. McGraw-Hill, 1967.
[81] Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, (11): 1343–1354, 1988.
[82] Making data structures persistent. Journal of Computer and System Sciences, 86–124, 1989.
[83] Algorithms in Combinatorial Geometry, of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.
[84] Paths, trees, and flowers. Canadian Journal of Mathematics, 449–467, 1965.
[85] Matroids and the greedy algorithm. Mathematical Programming, 126–136, 1971.
[86] Theoretical improvements in the algorithmic efficiency for network flow problems. Journal of the ACM, 248–264, 1972.
[87] Graph Algorithms. Computer Science Press, 1979.
[88] An Introduction to Probability Theory and Its Applications. John Wiley & Sons, third edition, 1968.
[89] Algorithm 97 (SHORTEST PATH). Communications of the ACM, (6): 345, 1962.
[90] Algorithm 245 (TREESORT). Communications of the ACM, 701, 1964.
[91] Permuting information in idealized two-level storage. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations, pages 105–109. Plenum Press, 1972.
[92] Expected time bounds for selection. Communications of the ACM, (3): 165–172, 1975.
[93] Flows in Networks. Princeton University Press, 1962.
[94] A tournament problem. The American Mathematical Monthly, 387–389, 1959.
[95] New bounds on the complexity of the shortest path problem. SIAM Journal on Computing, (1): 83–89, 1976.
[96] Storing a sparse table with O(1) worst case access time. Journal of the ACM, (3): 538–544, 1984.
[97] The cell probe complexity of dynamic data structures. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, 1989.
[98] Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, (3): 596–615, 1987.
[99] Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 424–436, 1993.
[100] Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, (3): 533–551, 1994.
[101] Path-based depth-first search for strong and biconnected components. Information Processing Letters, 107–114, 2000.
[102] Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, (2): 109–122, 1986.
[103] A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, (2): 209–221, 1985.
[104] Faster scaling algorithms for network problems. SIAM Journal on Computing, (5): 1013–1036, 1989.
[105] All pairs shortest distances for graphs with small integer length edges. Information and Computation, (2): 103–139, 1997.
[106] All pairs shortest paths for graphs with small integer length edges. Journal of Computer and System Sciences, (2): 243–254, 1997.
[107] Time-space-optimal string matching. Journal of Computer and System Sciences, (3): 280–294, 1983.
[108] Scapegoat trees. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, pages 165–174, 1993.
[109] Worst-case analyis of memory allocation algorithms. In Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pages 143–150, 1972.
[110] Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[111] Linear Programming: Methods and Applications. International Thomson Publishing, fourth edition, 1975.
[112] Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, (2): 180–187, 1972.
[113] Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981.
[114] Variable-length binary encodings. Bell System Technical Journal, (4): 933–967, 1959.
[115] Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, (6): 1115–1145, 1995.
[116] The primal-dual method for approximation algorithms and its application to network design problems. In Dorit Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 144–191. PWS Publishing Company, 1997.
[117] Efficient Graph Algorithms for Sequential and Parallel Computers. PhD thesis, Department of Electrical Engineering and Computer Science, MIT, 1987.
[118] Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, (3): 494–504, 1995.
[119] Network flow algorithms. In Bernhard Korte, Lszl Lovsz, Hans Jrgen Prmel, and Alexander Schrijver, editors, Paths, Flows, and VLSI-Layout, pages 101–164. Springer-Verlag, 1990.
[120] Beyond the flow decomposition barrier. Journal of the ACM, 783–797, 1998.
[121] A new approach to the maximum flow problem. Journal of the ACM, 921–940, 1988.
[122] Linear programming. In G. L. Nemhauser, A. H. G. Rinnooy-Kan, and M. J. Todd, editors, Handbook in Operations Research and Management Science, Vol. 1, Optimization, pages 73–170. Elsevier Science Publishers, 1989.
[123] Probabilistic encryption. Journal of Computer and System Sciences, (2): 270–299, 1984.
[124] A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, (2): 281–308, 1988.
[125] Matrix Computations. The Johns Hopkins University Press, third edition, 1996.
[126] Handbook of Algorithms and Data Structures. Addison-Wesley, 1984.
[127] Digital Image Processing. Addison-Wesley, 1992.
[128] Data Structures and Algorithms in Java. John Wiley & Sons, 1998.
[129] Bounds for certain multiprocessor anomalies. Bell Systems Technical Journal, 1563–1581, 1966.
[130] An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 132–133, 1972.
[131] On the history of the minimum spanning tree problem. Annals of the History of Computing, (1): 43–57, 1985.
[132] Concrete Mathematics. Addison-Wesley, second edition, 1994.
[133] The Science of Programming. Springer-Verlag, 1981.
[134] Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1988.
[135] A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pages 8–21. IEEE Computer Society, 1978.
[136] Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
[137] Improved fast integer sorting in linear space. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 793–796, 2001.
[138] Graph Theory. Addison-Wesley, 1969.
[139] A potential-based amortized analysis of the union-find data structure. SIGACT News, (3): 86–95, 2000.
[140] On the computational complexity of algorithms. Transactions of the American Mathematical Society, 285–306, 1965.
[141] Gauss and the history of the Fast Fourier Transform. IEEE ASSP Magazine, pages 14–21, 1984.
[142] Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 664–672, 1995.
[143] Randomized fully dynamic graph algorithms with polylogarithmic time per operation. Journal of the ACM, (4): 502–516, 1999.
[144] Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms, (2): 222–250, 2000.
[145] Exploiting fast matrix multiplication within the level 3 BLAS. ACM Transactions on Mathematical Software, (4): 352–368, 1990.
[146] Algorithm 63 (PARTITION) and algorithm 65 (FIND). Communications of the ACM, (7): 321–322, 1961.
[147] Quicksort. Computer Journal, (1): 10–15, 1962.
[148] Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Math, 243–254, 1983.
[149] Dorit S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1997.
[150] On the distribution of the number of successes in independent trials. Annals of Mathematical Statistics, 713–721, 1956.
[151] Probabilistic Analysis of Algorithms. Springer-Verlag, 1987.
[152] An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, (4): 225–231, 1973.
[153] Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, second edition, 2001.
[154] Efficient algorithms for graph manipulation. Communications of the ACM, (6): 372–378, 1973.
[155] Set merging algorithms. SIAM Journal on Computing, (4): 294–303, 1973.
[156] Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
[157] Fundamentals of Computer Algorithms. Computer Science Press, 1978.
[158] Computer Algorithms. Computer Science Press, 1998.
[159] Computation of matrix chain products. Part I. SIAM Journal on Computing, (2): 362–373, 1982.
[160] Computation of matrix chain products. Part II. SIAM Journal on Computing, (2): 228–251, 1984.
[161] Optimal computer search trees and variable-length alphabetic codes. SIAM Journal on Applied Mathematics, (4): 514–532, 1971.
[162] A method for the construction of minimum-redundancy codes. Proceedings of the IRE, (9): 1098–1101, 1952.
[163] Implementation of Strassen's algorithm for matrix multiplication. In SC96 Technical Papers, 1996.
[164] Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, (4): 463–468, 1975.
[165] On the identification of the convex hull of a finite set of points in the plane. Information Processing Letters, 18–21, 1973.
[166] Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 256–278, 1974.
[167] The NP-completeness column: An ongoing guide—the tale of the second prover. Journal of Algorithms, (3): 502–524, 1992.
[168] Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, (1): 1–13, 1977.
[169] A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, (2): 321–328, 1995.
[170] Finding the hidden path: time bounds for all-pairs shortest paths. SIAM Journal on Computing, (6): 1199–1217, 1993.
[171] Linear Programming. Birkuser, 1991.
[172] A new polynomial-time algorithm for linear programming. Combinatorica, (4): 373–395, 1984.
[173] Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, 1972.
[174] An introduction to randomized algorithms. Discrete Applied Mathematics, 165–201, 1991.
[175] Efficient randomized pattern-matching algorithms. Technical Report TR-31-81, Aiken Computation Laboratory, Harvard University, 1981.
[176] Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady, 434–437, 1974.
[177] A simpler minimum spanning tree verification algorithm. Algorithmica, (2): 263–270, 1997.
[178] A faster deterministic maximum flow algorithm. Journal of Algorithms, 447–474, 1994.
[179] Algorithms and Data Structures: Design, Correctness, Analysis. Addison-Wesley, 1990.
[180] The ultimate planar convex hull algorithm? SIAM Journal on Computing, (2): 287–299, 1986.
[181] Approximation algorithms for NP-hard optimization problems. In CRC Handbook on Algorithms, pages 34-1–34-19. CRC Press, 1999.
[182] Fundamental Algorithms, of The Art of Computer Programming. Addison-Wesley, 1968. Second edition, 1973.
[183] Seminumerical Algorithms, of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981.
[184] Optimum binary search trees. Acta Informatica, 14–25, 1971.
[185] Sorting and Searching, of The Art of Computer Programming. Addison-Wesley, 1973.
[186] Big omicron and big omega and big theta. ACM SIGACT News, (2): 18–23, 1976.
[187] Fast pattern matching in strings. SIAM Journal on Computing, (2): 323–350, 1977.
[188] Linear verification for spanning trees. Combinatorica, (1): 57–65, 1985.
[189] . Mathematical structures underlying greedy algorithms. In F. Gecseg, editor, Fundamentals of Computation Theory, in Lecture Notes in Computer Science, pages 205–209. Springer-Verlag, 1981.
[190] Structural properties of greedoids. Combinatorica, 359–374, 1983.
[191] Greedoids—a structural framework for the greedy algorithm. In W. Pulleybank, editor, Progress in Combinatorial Optimization, pages 221–243. Academic Press, 1984.
[192] Greedoids and linear objective functions. SIAM Journal on Algebraic and Discrete Methods, (2): 229–238, 1984.
[193] The Design and Analysis of Algorithms. Springer-Verlag, 1992.
[194] Gossiping in minimal time. SIAM Journal on Computing, (1): 111–139, 1992.
[195] On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 48–50, 1956.
[196] Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976.
[197] Eugene L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons, 1985.
[198] An algorithm for path connection and its applications. IRE Transactions on Electronic Computers, (3): 346–365, 1961.
[199] An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422–431, 1988.
[200] Data compression. ACM Computing Surveys, (3): 261–296, 1987.
[201] The number field sieve. In A. K. Lenstra and H. W. Lenstra, Jr., editors, The Development of the Number Field Sieve, of Lecture Notes in Mathematics, pages 11–42. Springer-Verlag, 1993.
[202] Factoring integers with elliptic curves. Annals of Mathematics, 649–673, 1987.
[203] Universal sorting problems. Problemy Peredachi Informatsii, (3): 265–266, 1973. In Russian.
[204] Elements of the Theory of Computation. Prentice-Hall, second edition, 1998.
[205] Introduction to Combinatorial Mathematics. McGraw-Hill, 1968.
[206] On the ratio of optimal integral and fractional covers. Discrete Mathematics, 383–390, 1975.
[207] Matching Theory, of Annals of Discrete Mathematics. North Holland, 1986.
[208] Minimum-cost spanning tree as a path-finding problem. Information Processing Letters, (6): 291–293, 1988.
[209] Data Structures and Other Objects Using Java. Addison-Wesley, 1999.
[210] Introduction to Algorithms: A Creative Approach. Addison-Wesley, 1989.
[211] Randomized binary search trees. Journal of the ACM, (2): 288–323, 1998.
[212] A faster algorithm computing string edit distances. Journal of Computer and System Sciences, (1): 18–31, 1980.
[213] Implementing dictionaries using binary trees of very small height. Information Processing Letters, (1): 11–14, 1976.
[214] Ernst W. Mayr, Hans Jrgen Prmel, and Angelika Steger, editors. Lectures on Proof Verification and Approximation Algorithms. in Lecture Notes in Computer Science. Springer-Verlag, 1998.
[215] All pairs shortest paths and the essential subgraph. Algorithmica, (5): 426–441, 1995.
[216] A killer adversary for quicksort. Software—Practice and Experience, (4): 341–344, 1999.
[217] Sorting and Searching, of Data Structures and Algorithms. Springer-Verlag, 1984.
[218] Graph Algorithms and NP-Completeness, of Data Structures and Algorithms. Springer-Verlag, 1984.
[219] Multidimensional Searching and Computational Geometry, of Data Structures and Algorithms. Springer-Verlag, 1984.
[220] Handbook of Applied Cryptography. CRC Press, 1997.
[221] Riemann's hypothesis and tests for primality. Journal of Computer and System Sciences, (3): 300–317, 1976.
[222] Foundations for Programming Languages. MIT Press, 1996.
[223] Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, (4): 1298–1309, 1999.
[224] Algorithmes de Factorisation D'Entiers. PhD thesis, L'Universit Paris-Sud, 1980.
[225] Evaluation and comparison of two efficient probabilistic primality testing algorithms. Theoretical Computer Science, (1): 97–108, 1980.
[226] The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pages 285–292. Harvard University Press, 1959.
[227] Randomized approximation algorithms in combinatorial optimization. In Dorit Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 447–481. PWS Publishing Company, 1997.
[228] Randomized Algorithms. Cambridge Unveristy Press, 1995.
[229] Fast stable in-place sorting with O (n) data moves. Algorithmica, (2): 151–160, 1996.
[230] Binary search trees of bounded balance. SIAM Journal on Computing, (1): 33–43, 1973.
[231] An Introduction to the Theory of Numbers. John Wiley & Sons, fourth edition, 1980.
[232] Discrete-Time Signal Processing. Prentice-Hall, second edition, 1998.
[233] Signals and Systems. Prentice-Hall, second edition, 1997.
[234] A polynomial time primal network simplex algorithm for minimum cost flows. Mathematical Programming, (1): 109–129, 1997.
[235] Computational Geometry in C. Cambridge University Press, 1993.
[236] Computational Complexity. Addison-Wesley, 1994.
[237] Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
[238] 1974. Unpublished lecture Ile de Berder, France.
[239] Progress in selection. In Proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, pages 368–379, 1996.
[240] Computational Molecular Biology: An Algorithmic Approach. The MIT Press, 2000.
[241] Online load balancing and network flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 402–411, 1993.
[242] A Monte Carlo method for factorization. BIT, 331–334, 1975.
[243] Factoring with cubic integers. In A. K. Lenstra and H. W. Lenstra, Jr., editors, The Development of the Number Field Sieve, of Lecture Notes in Mathematics, pages 4–10. Springer, 1993.
[244] On the distribution of pseudoprimes. Mathematics of Computation, (156): 587–593, 1981.
[245] Carl Pomerance, editor. Proceedings of the AMS Symposia in Applied Mathematics: Computational Number Theory and Cryptography. American Mathematical Society, 1990.
[246] Digital Image Processing. John Wiley & Sons, second edition, 1991.
[247] Computational Geometry: An Introduction. Springer-Verlag, 1985.
[248] Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, 1986.
[249] Numerical Recipes in C. Cambridge University Press, 1988.
[250] Shortest connection networks and some generalizations. Bell System Technical Journal, 1389–1401, 1957.
[251] Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, (6): 668–676, 1990.
[252] The Analysis of Algorithms. Holt, Rinehart, and Winston, 1985.
[253] Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 21–39. Academic Press, 1976.
[254] Probabilistic algorithm for testing primality. Journal of Number Theory, (1): 128–138, 1980.
[255] Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 365–374, 1987.
[256] Recent results on the single-source shortest paths problem. SIGACT News, (2): 81–87, 1997.
[257] Combinatorial Algorithms: Theory and Practice. Prentice-Hall, 1977.
[258] Prime Numbers and Computer Methods for Factorization. Progress in Mathematics. Birkhuser, 1985.
[259] A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, (2): 120–126, 1978. See also U.S. Patent 4,405,829.
[260] A remark on Stirling's formula. American Mathematical Monthly, (1): 26–29, 1955.
[261] An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 563–581, 1977.
[262] An improved master theorem for divide-and-conquer recurrences. In Proceedings of Automata, Languages and Programming, 24th International Colloquium, ICALP'97, pages 449–459, 1997.
[263] Probability Theory: A Concise Course. Dover, 1969.
[264] P-complete approximation problems. Journal of the ACM, 555–565, 1976.
[265] Finding the median. Journal of Computer and System Sciences, (2): 184–199, 1976.
[266] Theory of linear and integer programming. John Wiley & Sons, 1986.
[267] Paths and flows—a historical survey. CWI Quarterly, 169–183, 1993.
[268] Implementing quicksort programs. Communications of the ACM, (10): 847–857, 1978.
[269] Algorithms. Addison-Wesley, second edition, 1988.
[270] On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences, (3): 400–403, 1995.
[271] Randomized search trees. Algorithmica, 464–497, 1996.
[272] Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
[273] A Practical Introduction to Data Structures and Algorithm Analysis. Prentice Hall, second edition, 2001.
[274] Origins of the analysis of the Euclidean algorithm. Historia Mathematica, (4): 401–419, 1994.
[275] Geometric intersection problems. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pages 208–215, 1976.
[276] A strong-connectivity algorithm and its applications in data flow analysis. Computers and Mathematics with Applications, 67–72, 1981.
[277] Computing near-optimal solutions to combinatorial optimization problems. In William Cook, Lszl Lovsz, and Paul Seymour, editors, Combinatorial Optimization, of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.
[278] All pairs shortest paths in undirected graphs with integer weights. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 605–614, 1999.
[279] Introduction to the Theory of Computation. PWS Publishing Company, 1997.
[280] The Algorithm Design Manual. Springer-Verlag, 1998.
[281] A data structure for dynamic trees. Journal of Computer and System Sciences, (3): 362–391, 1983.
[282] Self-adjusting binary search trees. Journal of the ACM, (3): 652–686, 1985.
[283] Ten Lectures on the Probabilistic Method. Regional Conference Series on Applied Mathematics SIAM, 1987.
[284] The simplex algorithm usually takes a polynomial number of steps. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001.
[285] Introduction to Applied Mathematics. Wellesley-Cambridge Press, 1986.
[286] Linear Algebra and Its Applications. Harcourt Brace Jovanovich, third edition, 1988.
[287] Gaussian elimination is not optimal. Numerische Mathematik, (3): 354–356, 1969.
[288] A special case of the maximal common subsequence problem. Technical Report TR-170, Computer Science Laboratory, Princeton University, 1975.
[289] Depth first search and linear graph algorithms. SIAM Journal on Computing, (2): 146–160, 1972.
[290] Efficiency of a good but not linear set union algorithm. Journal of the ACM, (2): 215–225, 1975.
[291] A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, (2): 110–127, 1979.
[292] Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983.
[293] Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, (2): 306–318, 1985.
[294] Class notes: Disjoint set union. COS 423, Princeton University, 1999.
[295] Worst-case analysis of set union algorithms. Journal of the ACM, (2): 245–281, 1984.
[296] Calculus and Analytic Geometry. Addison-Wesley, seventh edition, 1988.
[297] Faster determinstic sorting and priority queues in linear space. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 550–555, 1998.
[298] Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, (3): 362–394, 1999.
[299] On RAM priority queues. SIAM Journal on Computing, (1): 86–109, 2000.
[300] Mathematics of Multidimensional Fourier Transform Algorithms. Springer-Verlag, second edition, 1997.
[301] Preserving order in a forest in less than logarithmic time. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pages 75–84. IEEE Computer Society, 1975.
[302] Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier Science Publishers and The MIT Press, 1990.
[303] Computational Frameworks for the Fast Fourier Transform. Society for Industrial and Applied Mathematics, 1992.
[304] Linear Programming: Foundations and Extensions. Kluwer Academic Publishers, 1996.
[305] Approximation Algorithms. Springer-Verlag, 2001.
[306] General techniques for analyzing recursive algorithms with applications. SIAM Journal on Computing, (2): 568–581, 1997.
[307] A data structure for manipulating priority queues. Communications of the ACM, (4): 309–315, 1978.
[308] A theorem on boolean matrices. Journal of the ACM, (1): 11–12, 1962.
[309] Introduction to Computational Biology, Maps, Sequences and Genomes. Chapman & Hall, 1995.
[310] Data Structures and Algorithm Analysis in C++. Addison-Wesley, 1994.
[311] Algorithms, Data Structures and Problem Solving with C++. Addison-Wesley, 1996.
[312] Data Structures and Problem Solving Using Java. Addison-Wesley, 1998.
[313] Data Structures and Algorithm Analysis in Java. Addison-Wesley, 1999.
[314] On the abstract properties of linear dependence. American Journal of Mathematics, 509–533, 1935.
[315] Algorithms and Complexity. Prentice-Hall, 1986.
[316] Algorithm 232 (HEAPSORT). Communications of the ACM, 347–348, 1964.
[317] On the algebraic complexity of functions. In Actes du Congrs International des Mathmaticiens, pages 283–288, 1970.
[318] A lower bound to finding convex hulls. Journal of the ACM, (4): 780–787, 1981.
[319] Interior Point Algorithms: Theory and Analysis. John Wiley & Sons, 1997.
[320] Daniel Zwillinger, editor. CRC Standard Mathematical Tables and Formulae. CRC Press, 30th edition, 1996.