biblio.htm

CLRS-算法导论

<a name="0a29_008d">[140] C. L. Liu. <I>Introduction to Combinatorial Mathematics</I>. McGraw-Hill, 1968.<a name="0a29_008d"><P>
<a name="0a29_008e">[141] L&aacute;szlo Lov&aacute;sz. On the ratio of optimal integral and fractional covers. <I>Discrete Mathematics</I>, 13:383-390, 1975.<a name="0a29_008e"><P>
<a name="0a29_008f">[142] Udi Manber. <I>Introduction to Algorithms: A Creative Approach</I>. Addison-Wesley, 1989.<a name="0a29_008f"><P>
<a name="0a29_0090">[143] William J. Masek and Michael S. Paterson. A faster algorithm computing string edit distances. <I>Journal of Computer and System Sciences</I>, 20(1):18-31, 1980.<a name="0a29_0090"><P>
<a name="0a29_0091">[144] Kurt Mehlhorn. <I>Sorting and Searching, </I>volume 1<I> </I>of<I> Data Structures and Algorithms</I>. Springer-Verlag, 1984.<a name="0a29_0091"><P>
<a name="0a29_0092">[145] Kurt Mehlhorn. <I>Graph Algorithms and NP-Completeness</I>, volume 2 of <I>Data Structures and Algorithms</I>. Springer-Verlag, 1984.<a name="0a29_0092"><P>
<a name="0a29_0093">[146] Kurt Mehlhorn. <I>Multidimensional Searching and Computational Geometry, </I>volume 3 of <I>Data Structures and Algorithms</I>. Springer-Verlag, 1984.<a name="0a29_0093"><P>
<a name="0a29_0094">[147] Gary L. Miller. Riemann's hypothesis and tests for primality. <I>Journal of Computer and System Sciences</I>, 13(3):300-317, 1976.<a name="0a29_0094"><P>
<a name="0a29_0095">[148] Louis Monier. <I>Algorithmes de Factorisation D</I>'<I>Entiers</I>. PhD thesis, L'Universit&eacute; Paris-Sud, Centre D'Orsay, 1980.<a name="0a29_0095"><P>
<a name="0a29_0096">[149] Louis Monier. Evaluation and comparison of two efficient probabilistic primality testing algorithms. <I>Theoretical Computer Science</I>, 12(1): 97-108, 1980.<a name="0a29_0096"><P>
<a name="0a29_0097">[150] Edward F. Moore. The shortest path through a maze. In <I>Proceedings of the International Symposium on the Theory of Switching</I>, pages 285-292. Harvard University Press, 1959.<a name="0a29_0097"><P>
<a name="0a29_0098">[151] Ivan Niven and Herbert S. Zuckerman. <I>An Introduction to the Theory of Numbers</I>. John Wiley &amp; Sons, fourth edition, 1980.<a name="0a29_0098"><P>
<a name="0a29_0099">[152] Yu. Ofman. On the algorithmic complexity of discrete functions. <I>Soviet Physics Doklady</I>, 7(7):589-591, 1963. English translation.<a name="0a29_0099"><P>
<a name="0a29_009a">[153] Alan V. Oppenheim and Alan S. Willsky, with Ian T. Young. <I>Signals and Systems</I>. Prentice-Hall, 1983.<a name="0a29_009a"><P>
<a name="0a29_009b">[154] Christos H. Papadimitriou and Kenneth Steiglitz. <I>Combinatorial Optimization: Algorithms and Complexity</I>. Prentice-Hall, 1982.<a name="0a29_009b"><P>
<a name="0a29_009c">[155] Michael S. Paterson, 1974. Unpublished lecture, Ile de Berder, France.<a name="0a29_009c"><P>
<a name="0a29_009d">[156] J. M. Pollard. A Monte Carlo method for factorization. <I>BIT</I>, 15:331-334, 1975.<a name="0a29_009d"><P>
<a name="0a29_009e">[157] Carl Pomerance. On the distribution of pseudoprimes. <I>Mathematics of Computation</I>, 37(156):587-593, 1981.<a name="0a29_009e"><P>
<a name="0a29_009f">[158] Carl Pomerance. The quadratic sieve factoring algorithm. In T. Beth, N. Cot, and I. Ingemarrson, editors, <I>Advances in Cryptology</I>, volume 209 of <I>Lecture Notes in Computer Science</I>, pages 169-182. Springer-Verlag, 1984.<a name="0a29_009f"><P>
<a name="0a29_00a0">[159] Carl Pomerance, editor. <I>Proceedings of the AMS Symposia in Applied Mathematics: Computational Number Theory and Cryptography</I>. American Mathematical Society, to appear.<a name="0a29_00a0"><P>
<a name="0a29_00a1">[160] Franco P. Preparata and Micheal Ian Shamos. <I>Computational Geometry: An Introduction</I>. Springer-Verlag, 1985.<a name="0a29_00a1"><P>
<a name="0a29_00a2">[161] William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. <I>Numerical Recipes: The Art of Scientific Computing</I>. Cambridge University Press, 1986.<a name="0a29_00a2"><P>
<a name="0a29_00a3">[162] William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. <I>Numerical Recipes in C</I>. Cambridge University Press, 1988.<a name="0a29_00a3"><P>
<a name="0a29_00a4">[163] R. C. Prim. Shortest connection networks and some generalizations. <I>Bell System Technical Journal</I>, 36:1389-1401, 1957.<a name="0a29_00a4"><P>
<a name="0a29_00a5">[164] Paul W. Purdom, Jr., and Cynthia A. Brown. <I>The Analysis of Algorithms</I>. Holt, Rinehart, and Winston, 1985.<a name="0a29_00a5"><P>
<a name="0a29_00a6">[165] Michael O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, <I>Algorithms and Complexity: New Directions and Recent Results</I>, pages 21-39. Academic Press, 1976.<a name="0a29_00a6"><P>
<a name="0a29_00a7">[166] Michael O. Rabin. Probabilistic algorithm for testing primality. <I>Journal of Number Theory</I>, 12:128-138, 1980.<a name="0a29_00a7"><P>
<a name="0a29_00a8">[167] Edward M. Reingold, J&uuml;rg Nievergelt, and Narsingh Deo. <I>Combinatorial Algorithms: Theory and Practice</I>. Prentice-Hall, 1977.<a name="0a29_00a8"><P>
<a name="0a29_00a9">[168] Hans Riesel. <I>Prime Numbers and Computer Methods for Factorization</I>. Progress in Mathematics. Birkh&auml;user, 1985.<a name="0a29_00a9"><P>
<a name="0a29_00aa">[169] Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. <I>Communications of the ACM</I>, 21(2):120-126, 1978. See also U.S. Patent 4,405,829.<a name="0a29_00aa"><P>
<a name="0a29_00ab">[170] D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis. An analysis of several heuristics for the traveling salesman problem. <I>SIAM Journal on Computing</I>, 6:563-581, 1977.<a name="0a29_00ab"><P>
<a name="0a29_00ac">[171] Y. A. Rozanov. <I>Probability Theory: A Concise Course</I>. Dover, 1969.<a name="0a29_00ac"><P>
<a name="0a29_00ad">[172] S. Sahni and T. Gonzalez. P-complete approximation problems. <I>Journal of the ACM</I>, 23:555-565, 1976.<a name="0a29_00ad"><P>
<a name="0a29_00ae">[173] John E. Savage. <I>The Complexity of Computing</I>. John Wiley &amp; Sons, 1976.<a name="0a29_00ae"><P>
<a name="0a29_00af">[174] Robert Sedgewick. Implementing quicksort programs. <I>Communications of the ACM</I>, 21(10):847-857, 1978.<a name="0a29_00af"><P>
<a name="0a29_00b0">[175] Robert Sedgewick. <I>Algorithms</I>. Addison-Wesley, second edition, 1988.<a name="0a29_00b0"><P>
<a name="0a29_00b1">[176] Michael I. Shamos and Dan Hoey. Geometric intersection problems. In <I>Proceedings of the 16th Annual Symposium on Foundations of Computer Science</I>, pages 208-215. IEEE Computer Society, 1975.<a name="0a29_00b1"><P>
<a name="0a29_00b2">[177] Daniel D. Sleator and Robert E. Tarjan. A data structure for dynamic trees. <I>Journal of Computer and System Sciences</I>, 26(3):362-391, 1983.<a name="0a29_00b2"><P>
<a name="0a29_00b3">[178] Daniel D. Sleator and Robert E. Tarjan. Self-adjusting binary search trees. <I>Journal of the ACM</I>, 32(3):652-686, 1985.<a name="0a29_00b3"><P>
<a name="0a29_00b4">[179] Joel Spencer. <I>Ten Lectures on the Probabilistic Method</I>. Regional Conference Series on Applied Mathematics (No. 52). SIAM, 1987.<a name="0a29_00b4"><P>
<a name="0a29_00b5">[180] Staff of the Computation Laboratory. <I>Description of a Relay Calculator</I>, volume XXIV of <I>The Annals of the Computation Laboratory of Harvard University</I>. Harvard University Press, 1949.<a name="0a29_00b5"><P>
<a name="0a29_00b6">[181] Gilbert Strang. <I>Introduction to Applied Mathematics</I>. Wellesley-Cambridge Press, 1986.<a name="0a29_00b6"><P>
<a name="0a29_00b7">[182] Gilbert Strang. <I>Linear Algebra and Its Applications</I>. Harcourt Brace Jovanovich, third edition, 1988.<a name="0a29_00b7"><P>
<a name="0a29_00b8">[183] Volker Strassen. Gaussian elimination is not optimal. <I>Numerische Mathematik</I>, 14(3):354-356, 1969.<a name="0a29_00b8"><P>
<a name="0a29_00b9">[184] T. G. Szymanski. A special case of the maximal common subsequence problem. Technical Report TR-170, Computer Science Laboratory, Princeton University, 1975.<a name="0a29_00b9"><P>
<a name="0a29_00ba">[185] Robert E. Tarjan. Depth first search and linear graph algorithms. <I>SIAM Journal on Computing</I>, 1(2):146-160, 1972.<a name="0a29_00ba"><P>
<a name="0a29_00bb">[186] Robert E. Tarjan. Efficiency of a good but not linear set union algorithm. <I>Journal of the ACM</I>, 22(2):215-225, 1975.<a name="0a29_00bb"><P>
<a name="0a29_00bc">[187] Robert E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. <I>Journal of Computer and System Sciences</I>, 18(2):110-127, 1979.<a name="0a29_00bc"><P>
<a name="0a29_00bd">[188] Robert E. Tarjan. <I>Data Structures and Network Algorithms</I>. Society for Industrial and Applied Mathematics, 1983.<a name="0a29_00bd"><P>
<a name="0a29_00be">[189] Robert E. Tarjan. Amortized computational complexity. <I>SIAM Journal on Algebraic and Discrete Methods</I>, 6(2):306-318, 1985.<a name="0a29_00be"><P>
<a name="0a29_00bf">[190] Robert E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union algorithms. <I>Journal of the ACM</I>, 31(2):245-281, 1984.<a name="0a29_00bf"><P>
<a name="0a29_00c0">[191] Robert E. Tarjan and Uzi Vishkin. An efficient parallel biconnectivity algorithm. <I>SIAM Journal on Computing</I>, 14(4):862-874, 1985.<a name="0a29_00c0"><P>
<a name="0a29_00c1">[192] George B. Thomas, Jr., and Ross L. Finney. <I>Calculus and Analytic Geometry</I>. Addison-Wesley, seventh edition, 1988.<a name="0a29_00c1"><P>
<a name="0a29_00c2">[193] Leslie G. Valiant. Parallelism in comparison problems. <I>SIAM Journal on Computing</I>, 4(3):348-355, 1975.<a name="0a29_00c2"><P>
<a name="0a29_00c3">[194] P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In <I>Proceedings of the 16th Annual Symposium on Foundations of Computer Science</I> pages 75-84. IEEE Computer Society, 1975.<a name="0a29_00c3"><P>
<a name="0a29_00c4">[195] Uzi Vishkin. Implementation of simultaneous memory address access in models that forbid it. <I>Journal of Algorithms</I>, 4(1):45-50, 1983.<a name="0a29_00c4"><P>
<a name="0a29_00c5">[196] Jean Vuillemin. A data structure for manipulating priority queues. <I>Communications of the ACM</I>, 21(4):309-315, 1978.<a name="0a29_00c5"><P>
<a name="0a29_00c6">[197] C. S. Wallace. A suggestion for a fast multiplier. <I>IEEE Transactions on Electronic Computers</I>, EC-13(1):14-17, 1964.<a name="0a29_00c6"><P>
<a name="0a29_00c7">[198] Stephen Warshall. A theorem on boolean matrices. <I>Journal of the ACM</I>, 9(1):11-12, 1962.<a name="0a29_00c7"><P>
<a name="0a29_00c8">[199] A. Weinberger and J. L. Smith. A one-microsecond adder using one-megacycle circuitry. <I>IRE Transactions on Electronic Computers</I>, EC-5(2), 1956.<a name="0a29_00c8"><P>
<a name="0a29_00c9">[200] Hassler Whitney. On the abstract properties of linear dependence. <I>American Journal of Mathematics</I>, 57:509-533, 1935.<a name="0a29_00c9"><P>
<a name="0a29_00ca">[201] Herbert S. Wilf. <I>Algorithms and Complexity</I>. Prentice-Hall, 1986.<a name="0a29_00ca"><P>
<a name="0a29_00cb">[202] J. W. J. Williams. Algorithm 232 (heapsort). <I>Communications of the ACM</I>, 7:347-348, 1964.<a name="0a29_00cb"><P>
<a name="0a29_00cc">[203] S. Winograd. On the algebraic complexity of functions. In <I>Actes du Congr&egrave;s International des Math&egrave;maticiens</I>, volume 3, pages 283-288, 1970.<a name="0a29_00cc"><P>
<a name="0a29_00cd">[204] James C. Wyllie. <I>The Complexity of Parallel Computations</I>. PhD thesis, Department of Computer Science, Cornell University, 1979.<a name="0a29_00cd"><P>
<a name="0a29_00ce">[205] Andrew C.-C. Yao. A lower bound to finding convex hulls. <I>Journal of the ACM</I>, 28(4):780-787, 1981.<a name="0a29_00ce"><P>
<P>
<P>
<center>Back to <a href="toc.htm">Table of Contents</A>
</P>
</center>


</BODY></HTML>