📄 biblio.htm
字号:
<HTML><HEAD>
<TITLE>Intro to Algorithms: BIBLIOGRAPHY</TITLE></HEAD><BODY BGCOLOR="#FFFFFF">
<a href="toc.htm"><img align=right src="../../images/toc.gif" alt="Return to Table of Contents" border=0></A>
<a href="chap37.htm"><img align=right src="../../images/prev.gif" alt="Previous Chapter" border=0></A>
<h1><a name="0a29_0001">BIBLIOGRAPHY<a name="0a29_0001"></h1><P>
<a name="0a29_0002">[1] Milton Abramowitz and Irene A. Stegun, editors. <I>Handbook of Mathematical Functions.</I> Dover, 1965.<a name="0a29_0002"><P>
<a name="0a29_0003">[2] G. M. <img src="987_a.gif"> and E. M. Landis. An algorithm for the organization of information. <I>Soviet Mathematics Doklady,</I> 3: 1259-1263, 1962.<a name="0a29_0003"><P>
<a name="0a29_0004">[3] Leonard M. Adleman, Carl Pomerance, and Robert S. Rumely. On distinguishing prime numbers from composite numbers. <I>Annals of Mathematics</I>, 117: 173-206, 1983.<a name="0a29_0004"><P>
<a name="0a29_0005">[4] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. <I>The Design and Analysis of Computer Algorithms</I>. Addison-Wesley, 1974.<a name="0a29_0005"><P>
<a name="0a29_0006">[5] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. <I>Data Structures and Algorithms</I>. Addison-Wesley, 1983.<a name="0a29_0006"><P>
<a name="0a29_0007">[6] Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan. Faster algorithms for the shortest path problem. Technical Report 193, MIT Operations Research Center, 1988.<a name="0a29_0007"><P>
<a name="0a29_0008">[7] Howard H. Aiken and Grace M. Hopper. The automatic sequence controlled calculator. In Brian Randell, editor, <I>The Origins of Digital Computers</I>, pages 203-222. Springer-Verlag, third edition, 1982.<a name="0a29_0008"><P>
<a name="0a29_0009">[8] M. Ajtai, J. Komlós, and E. Szemerédi. An <I>O</I>(<I>n</I> log <I>n</I>) sorting network. In<I>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing</I>, pages 1-9, 1983.<a name="0a29_0009"><P>
<a name="0a29_000a">[9] Selim G. Akl. <I>The Design and Analysis of Parallel Algorithms</I>. Prentice-Hall, 1989.<a name="0a29_000a"><P>
<a name="0a29_000b">[10] Richard J. Anderson and Gary L. Miller. Deterministic parallel list ranking. In John H. Reif, editor, <I>1988</I> <I>Aegean Workshop on Computing</I>, volume 319 of <I>Lecture Notes in Computer Science</I>, pages 81-90. Springer-Verlag, 1988.<a name="0a29_000b"><P>
<a name="0a29_000c">[11] Richard J. Anderson and Gary L. Miller. A simple randomized parallel algorithm for list-ranking. Unpublished manuscript, 1988.<a name="0a29_000c"><P>
<a name="0a29_000d">[12] Tom M. Apostol. <I>Calculus</I>, volume 1. Blaisdell Publishing Company, second edition, 1967.<a name="0a29_000d"><P>
<a name="0a29_000e">[13] A. J. Atrubin. A one-dimensional real-time iterative multiplier. <I>IEEE Transactions on Electronic Computers</I>, EC-14(1):394-399, 1965.<a name="0a29_000e"><P>
<a name="0a29_000f">[14] Sara Baase. <I>Computer Algorithms: Introduction to Design and Analysis</I>. Addison-Wesley, second edition, 1988.<a name="0a29_000f"><P>
<a name="0a29_0010">[15] Eric Bach. Private communication, 1989.<a name="0a29_0010"><P>
<a name="0a29_0011">[16] Eric Bach. Number-theoretic algorithms. In<I> Annual Review of Computer Science</I>, volume 4, pages 119- 172. Annual Reviews, Inc., 1990.<a name="0a29_0011"><P>
<a name="0a29_0012">[17] R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. <I>Acta Informatica</I>, 1:290-306, 1972.<a name="0a29_0012"><P>
<a name="0a29_0013">[18] R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. <I>Acta Informatica</I>, 1(3):173-189, 1972.<a name="0a29_0013"><P>
<a name="0a29_0014">[19] Paul W. Beame, Stephen A. Cook, and H. James Hoover. Log depth circuits for division and related problems. <I>SIAM Journal on Computing</I>, 15(4):994-1003, 1986.<a name="0a29_0014"><P>
<a name="0a29_0015">[20] Pierre Beauchemin, Gilles Brassard, Claude Crépeau, Claude Goutier, and Carl Pomerance. The generation of random numbers that are probably prime. <I>Journal of Cryptology</I>, 1:53-64, 1988.<a name="0a29_0015"><P>
<a name="0a29_0016">[21] Richard Bellman. <I>Dynamic Programming</I>. Princeton University Press, 1957.<a name="0a29_0016"><P>
<a name="0a29_0017">[22] Richard Bellman. On a routing problem. <I>Quarterly of Applied Mathematics</I>, 16(1):87-90, 1958.<a name="0a29_0017"><P>
<a name="0a29_0018">[23] Michael Ben-Or. Lower bounds for algebraic computation trees. In <I>Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing</I>, pages 80-86, 1983.<a name="0a29_0018"><P>
<a name="0a29_0019">[24] Jon L. Bentley. <I>Writing Efficient Programs</I>. Prentice-Hall, 1982.<a name="0a29_0019"><P>
<a name="0a29_001a">[25] Jon L. Bentley. <I>Programming Pearls</I>. Addison-Wesley, 1986.<a name="0a29_001a"><P>
<a name="0a29_001b">[26] Jon L. Bentley, Dorothea Haken, and James B. Saxe. A general method for solving divide-and-conquer recurrences. <I>SIGACT</I> <I>News</I>, 12(3):36-44, 1980.<a name="0a29_001b"><P>
<a name="0a29_001c">[27] William H. Beyer, editor. <I>CRC</I> <I>Standard Mathematical Tables</I>. The Chemical Rubber Company, 1984.<a name="0a29_001c"><P>
<a name="0a29_001d">[28] Patrick Billingsley. <I>Probability and Measure</I>. John Wiley & Sons, second edition, 1986.<a name="0a29_001d"><P>
<a name="0a29_001e">[29] Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan. Time bounds for selection. <I>Journal of Computer and System Sciences</I>, 7(4):448-461, 1973.<a name="0a29_001e"><P>
<a name="0a29_001f">[30] Béla Bollobás. <I>Random Graphs</I>. Academic Press, 1985.<a name="0a29_001f"><P>
<a name="0a29_0020">[31] J. A. Bondy and U. S. R. Murty. <I>Graph Theory with Applications</I>. American Elsevier, 1976.<a name="0a29_0020"><P>
<a name="0a29_0021">[32] Robert S. Boyer and J. Strother Moore. A fast string-searching algorithm. <I>Communications of the ACM</I>, 20(10):762-772, 1977.<a name="0a29_0021"><P>
<a name="0a29_0022">[33] Gilles Brassard and Paul Bratley. <I>Algorithmics: Theory and Practice</I>. Prentice-Hall, 1988.<a name="0a29_0022"><P>
<a name="0a29_0023">[34] Richard P. Brent. The parallel evaluation of general arithmetic expressions. <I>Journal of the ACM</I>, 21(2):201-206, 1974.<a name="0a29_0023"><P>
<a name="0a29_0024">[35] Richard P. Brent. An improved Monte Carlo factorization algorithm. <I>BIT</I>, 20(2):176-184, 1980.<a name="0a29_0024"><P>
<a name="0a29_0025">[36] Mark R. Brown. <I>The Analysis of a Practical and Nearly Optimal Priority Queue</I>. PhD thesis, Computer Science Department, Stanford University, 1977. Technical Report STAN-CS-77-600.<a name="0a29_0025"><P>
<a name="0a29_0026">[37] Mark R. Brown. Implementation and analysis of binomial queue algorithms. <I>SIAM Journal on Computing</I>, 7(3):298-319, 1978.<a name="0a29_0026"><P>
<a name="0a29_0027">[38] Arthur W. Burks, editor. <I>Theory of Self-Reproducing Automata</I>. University of Illinois Press, 1966.<a name="0a29_0027"><P>
<a name="0a29_0028">[39] Joseph J. F. Cavanagh. <I>Digital Computer Arithmetic</I>. McGraw-Hill, 1984.<a name="0a29_0028"><P>
<a name="0a29_0029">[40] H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. <I>Annals of Mathematical Statistics, </I>23:493-507, 1952.<a name="0a29_0029"><P>
<a name="0a29_002a">[41] Kai Lai Chung. <I>Elementary Probability Theory with Stochastic Processes</I>. Springer-Verlag, 1974.<a name="0a29_002a"><P>
<a name="0a29_002b">[42] V. Chvátal. A greedy heuristic for the set-covering problem. <I>Mathematics of Operations Research</I>, 4(3):233-235, 1979.<a name="0a29_002b"><P>
<a name="0a29_002c">[43] V. Chvátal, D. A. Klarner, and D. E. Knuth. Selected combinatorial research problems. Technical Report STAN-CS-72-292, Computer Science Department, Stanford University, 1972.<a name="0a29_002c"><P>
<a name="0a29_002d">[44] Alan Cobham. The intrinsic computational difficulty of functions. In <I>Proceedings of the 1964 Congress for Logic, Methodology, and the Philosophy of Science</I>, pages 24-30. North-Holland, 1964.<a name="0a29_002d"><P>
<a name="0a29_002e">[45] H. Cohen and H. W. Lenstra, Jr. Primality testing and jacobi sums. <I>Mathematics of Computation</I>, 42(165):297-330, 1984.<a name="0a29_002e"><P>
<a name="0a29_002f">[46] Richard Cole. Parallel merge sort. In <I>Proceedings of the 27th Annual Symposium on Foundations of Computer Science</I>, pages 511-516. IEEE Computer Society, 1986.<a name="0a29_002f"><P>
<a name="0a29_0030">[47] Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. <I>Information and Control, 70(1):32-53, 1986.<a name="0a29_0030"></I><P>
<a name="0a29_0031">[48] D. Comer. The ubiquitous B-tree<I>. ACM Computing Surveys</I>, 11(2):121-137, 1979.<a name="0a29_0031"><P>
<a name="0a29_0032">[49] Stephen Cook. The complexity of theorem proving procedures. In <I>Proceedings of the Third Annual ACM Symposium on Theory of Computing</I>, pages 151-158, 1971.<a name="0a29_0032"><P>
<a name="0a29_0033">[50] Stephen Cook, Cynthia Dwork, and Rüdiger Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. <I>SIAM Journal on Computing</I>, 15(1):87-97, 1986.<a name="0a29_0033"><P>
<a name="0a29_0034">[51] James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex Fourier series. <I>Mathematics of Computation</I>, 19(90): 297-301, April 1965.<a name="0a29_0034"><P>
<a name="0a29_0035">[52] Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. In <I>Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing</I>, pages 1-6, 1987.<a name="0a29_0035"><P>
<a name="0a29_0036">[53] George B. Dantzig. <I>Linear Programming and Extensions</I>. Princeton University Press, 1963.<a name="0a29_0036"><P>
<a name="0a29_0037">[54] Whitfield Diffie and Martin E. Hellman. New directions in cryptography. <I>IEEE Transactions on Information Theory</I>, IT-22(6):644-654, 1976.<a name="0a29_0037"><P>
<a name="0a29_0038">[55] E. W. Dijkstra. A note on two problems in connexion with graphs. <I>Numerische Mathematik</I>, 1:269-271, 1959.<a name="0a29_0038"><P>
<a name="0a29_0039">[56] John D. Dixon. Factorization and primality tests. <I>The American Mathematical Monthly</I>, 91(6):333-352, 1984.<a name="0a29_0039"><P>
<a name="0a29_003a">[57] Alvin W. Drake. <I>Fundamentals of Applied Probability Theory</I>. McGrawHill, 1967.<a name="0a29_003a"><P>
<a name="0a29_003b">[58] James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation. <I>Communications of the ACM</I>, 31(11):1343-1354, 1988.<a name="0a29_003b"><P>
<a name="0a29_003c">[59] James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. In <I>Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing</I>, pages 109-121, 1986.<a name="0a29_003c"><P>
<a name="0a29_003d">[60] Herbert Edelsbrunner. <I>Algorithms in Combinatorial Geometry</I>, volume 10 of <I>EATCS Monographs on Theoretical Computer Science</I>. Springer-Verlag, 1987.<a name="0a29_003d"><P>
<a name="0a29_003e">[61] Jack Edmonds. Paths, trees, and flowers. <I>Canadian Journal of Mathematics</I>, 17:449-467, 1965.<a name="0a29_003e"><P>
<a name="0a29_003f">[62] Jack Edmonds. Matroids and the greedy algorithm. <I>Mathematical Programming</I>, 1:126-136, 1971.<a name="0a29_003f"><P>
<a name="0a29_0040">[63] Jack Edmonds and Richard M. Karp. Theoretical improvements in the algorithmic efficiency for network flow problems. <I>Journal of the ACM</I>, 19:248-264, 1972.<a name="0a29_0040"><P>
<a name="0a29_0041">[64] G. Estrin, B. Gilchrist, and J. H. Pomerene. A note on high-speed digital multiplication. <I>IRE Transactions on Electronic Computers</I>, 5(3):140, 1956.<a name="0a29_0041"><P>
<a name="0a29_0042">[65] Shimon Even. <I>Graph Algorithms</I>. Computer Science Press, 1979.<a name="0a29_0042"><P>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -