Bibliography [1] G. M. Adel’son-Vel’ski˘ıand E. M. Landis. An algorithm for the or- ganization of information. Soviet Mathematics Doklady, 3:1259–1263, 1962. [2] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974. [3] Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Prin- ciples, Techniques, and Tools. Addison Wesley, 1986. [4] Martin Aigner. Combinatorial Search. Wiley-Teubner, 1988. [5] Arne Andersson. Balanced search trees made simple. In Proceedings of the Third Workshop on Algorithms and Data Structures, number 709 in Lecture Notes in Computer Science, pages 60–71. Springer-Verlag, 1993. [6] K. R. Apt and E.-R. Olderog. Verification of Sequential and Concur- rent Programs. Springer-Verlag, 1991. [7] Paul G. H. Bachmann. Analytische Zahlentheorie, Bd 2: Die Analy- sische Zahlentheorie. Teubner, Leipzig, Germany, 1894. [8] R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1:290–306, 1972. [9] R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1:173–189, 1972. [10] Richard E. Bellman. Dynamic Programming. Princeton University Press, 1957. [11] Jon L. Bentley. Multidimensional divide-and-conquer. Communica- tions of the ACM, 23:214–229, 1980. 588 BIBLIOGRAPHY 589 [12] Jon L. Bentley. Programming Pearls. Addison-Wesley, Reading, MA, 1986. [13] Jon L. Bentley and M. Douglas McIlroy. Engineering a sort function. Software — Practice and Experience, 23:1249–1265, 1993. [14] C. Berge. Two theorems in graph theory. Proceedings of the National Academy of Sciences, 43:842–844, 1957. [15] Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, and Robert E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7:448–461, 1972. [16] Otokar Bor ˙uvka. O jist´em probl´emu minim´alnim. Pr´ace Moravsk´e Pˇr´ırodovˇed Spolecnosti, 3:37–58, 1926. [17] Gilles Brassard. Crusade for a better notation. ACM SIGACT News, 17:60–64, 1985. [18] Gilles Brassard and Paul Bratley. Fundamentals of Algorithmics. Pren- tice Hall, 1996. [19] Christoph Burnikel and Joachim Ziegler. Fast recursive division. Re- search Report MPI-I-98-1-022, Max-Planck-Institut f¨ur Informatik, 1998. [20] J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143–154, 1979. [21] David Cheriton and Robert E. Tarjan. Finding minimum spanning trees. SIAM Journal on Computing, 5:724–742, 1976. [22] V. Chvatal, D. A. Klarner, and D. E. Knuth. Selected combinato- rial research problems. Technical Report STAN-CS-72-292, Stanford University, 1972. [23] Steven A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Com- puting, pages 151–158, 1971. [24] James W. Cooley and John W. Tukey. An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation, 19:297–301, 1965. BIBLIOGRAPHY 590 [25] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clif- ford Stein. Introduction to Algorithms. McGraw-Hill, 2nd edition, 2001. [26] C. A. Crane. Linear lists and priority queues as balanced binary trees. Technical Report STAN-CS-72-259, Computer Science Department, Stanford University, Stanford, CA, 1972. [27] Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959. [28] Edsger W. Dijkstra. The structure of “THE”-multiprogramming sys- tem. Communications of the ACM, 11:341–346, 1968. [29] Edsger W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976. [30] E. A. Dinic. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Mathematics Doklady, 11:1277–1280, 1970. [31] Arnold I. Dumey. Indexing for rapid random access memory systems. Computers and Automation, 5:6–9, 1956. [32] J. P. Eckert and J. W. Mauchly. Progress report on the edvac, Septem- ber 1945. [33] Jack Edmonds. Paths, trees, and flowers. Canadian Journal of Math- ematics, 17:449–467, 1965. [34] Jack Edmonds. Matroids and the greedy algorithm. Mathematical Programming, 1:127–136, 1971. [35] Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19:248–264, 1972. [36] Leohard Euler. Solutio problematis ad geometriam situs pertinentis. Commetarii Academiae Scientiarum Imperialis Petropolitanae, 8:128– 140, 1736. [37] Shimon Even. Graph Algorithms. Computer Science Press, 1979. [38] Robert W. Floyd. Algorithm 97: Shortest path. Communications of hte ACM, 5:345, 1962. BIBLIOGRAPHY 591 [39] Robert W. Floyd. Algorithm 245: Treesort. Communications of the ACM, 7:701, 1964. [40] L. R. Ford and D. R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399–404, 1956. [41] L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton Uni- versity Press, 1962. [42] N. Francez. Program Verification. Addison-Wesley, 1992. [43] Michael L. Fredman, J´anos Koml´os, and Endre Szermer´edi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31:538–544, 1984. [44] Michael L. Fredman and Robert E. Tarjan. Fibonacci heaps and their use in improved network optimization algorithms. Journal of the ACM, 34:596–615, 1987. [45] Bernard A. Galler and Michael J. Fisher. An improved equivalence algorithm. Communications of the ACM, 7:301–303, 1964. [46] Anna Gambin and Adam Malinowski. Randomized meldable priority queues. In Conference on Current Trends in Theory and Practice of Informatics, pages 344–349, 1998. [47] M. R. Garey, R. L. Graham, D. S. Johnson, and A. C. Yao. Resource constrained scheduling as generalized bin packing. Journal of Combi- natorial Theory, Series A, 21:257–298, 1976. [48] Michael R. Garey, R. L. Graham, and J. D. Ullman. Worst-case anal- ysis of memory allocation algorithms. In Proceedings of the Fourth ACM Symposium on Theory of Computing, pages 143–150, 1972. [49] Michael R. Garey and David S. Johnson. Complexity results for mul- tiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4:397–411, 1975. [50] Michael R. Garey and David S. Johnson. Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6:416– 426, 1977. [51] Michael R. Garey and David S. Johnson. “Strong” NP-Completeness results: Motivation, examples, and implications. Journal of the ACM, 25:499–508, 1978. BIBLIOGRAPHY 592 [52] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979. [53] Edgard N. Gilbert and Edward F. Moore. Variable length encodings. Bell System Technical Journal, 38:933–968, 1959. [54] Sadashiva S. Godbole. On efficient computation of matrix chain prod- ucts. IEEE Transactions on Computers, C-22:864–866, 1973. [55] Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45:783–797, 1998. [56] Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison-Wesley, Reading, Massachusetts, 2nd edition, 1994. [57] Leo J. Gubias and Robert Sedgewick. A dichromatic framework for balanced trees. In Porceedings of the 19th Annual Symposium on Foun- dations of Computer Science, pages 8–21. IEEE Computer Society, 1978. [58] Machael T. Heideman, Don H. Johnson, and C. Sidney Burrus. Gauss and the history of the Fast Fourier Transform. IEEE ASSP Magazine, pages 14–21, 1984. [59] C. A. R. Hoare. Quicksort. Computer Journal, 5:10–15, 1962. [60] C. A. R. Hoare. An axiomatic basis for computer programming. Com- munications of the ACM, 12:576–580, 1969. [61] John E. Hopcroft and Richard M. Karp. An n5/2 algorithm for max- imum matchings in bipartite graphs. SIAM Journal on Computing, 2:225–231, 1973. [62] John E. Hopcroft and Robert E. Tarjan. Efficient algorithms for graph manipulation. Communications of the ACM, 16:372–378, 1973. [63] John E. Hopcroft and Jeffrey D. Ullman. Set merging algorithms. SIAM Journal on Computing, 2:294–303, 1973. [64] Rodney R. Howell. On asymptotic notation with multiple variables. Technical Report 2007-4, Kansas State University, 2007. http:// people.cis.ksu.edu/∼rhowell/asymptotic.pdf. BIBLIOGRAPHY 593 [65] David A. Huffman. A method for the construction of minimum- redundancy codes. Proceedings of the IRE, 40:1098–1101, 1952. [66] Oscar H. Ibarra and Chul E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the Association for Computing Machinery, 22:463–468, 1975. [67] V. Jarn´ık. O jist´em probl´emu minim´alnim. Pr´ace Moravsk´ePˇr´ırodovˇed Spolecnosti, 6:57–63, 1930. [68] D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3:299–325, 1974. [69] David S. Johnson. Near-Optimal Bin Packing Algorithms. Doctoral thesis, dept. of mathematics, Massachusetts Institute of Technology, Cambridge, MA, 1973. [70] David S. Johnson. Approximation algorithms for combinatorial prob- lems. Journal of Computer and System Sciences, 9:256–278, 1974. [71] Donald B. Johnson. Priority queues with update and finding minimum spanning trees. Information Processing Letters, 4:53–57, 1975. [72] Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24:1–13, 1977. [73] Anatoli˘ı A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Doklady Akademii Nauk SSSR, 145:293–294, 1962. [74] Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, 1972. [75] D. G. Kirkpatrick and P. Hell. On the complexity of a generalized matching problem. In Proceedings of the 10th Annual ACM Sympo- sium on Theory of Computing, pages 240–245.