George S. Lueker
- AHO 74 AHO, ALFRED, HOPCROFT, JOHN, AND ULL- MAN, JEFFREY The design and analys~s of computer algorithms, Addison-Wesley, Reading, Mass., 1974. Google Scholar
- BELL62 BELLMAN, R.E. "Dynamic programming treatment of the travelling salesman problem," J. ACM 9 (1962), 61-63. Google Scholar
- BEND74 BENDER, E.A. "Asymptotic methods m enumeration," SIAM ReD. 16, 4 (Oct. 1974), 485-515.Google Scholar
- BUCK78 BUCK, R.C. Advanced calculus, 3rd ed., McGraw-Hill, New York, 1978.Google Scholar
- CHUR60 CHURCHILL, R. V. Complex varmbles and apphcations, McGraw-Hill, New York, 1960.Google Scholar
- DONA69 DONATH, W.E. "Algorithm and averagevalue bounds for assignment problems," IBM J. Res. Dev. 13 (july 1969), 380-386.Google Scholar
- FADE64 FADELL, ALBERT G. Calculus with analytw geometry, Van Nostrand, Princeton, N.J., 1964.Google Scholar
- FADE68 FADELL, ALBERT G. Vector calculus and differentml equations, Van Nostrand, Princeton, N.J., 1968.Google Scholar
- FELL68 FELLER, W. An introduction to probabdtry theory and ~ts apphcat~ons, Vol. I, 3rd ed., Wiley, New York, 1968.Google Scholar
- FLAJ80a FLAJOLET, P., FRAN~ON, J., AND VUILLE- MIN, J. "Sequence of operations analysis for dynamic data structures," J. Algorith. 1(1980), 111-141.Google Scholar
- FLAJ80b FLAJOLET, P., AND ODLYZKO, A. "Exploring binary trees and other simple trees," in 21st IEEE Symp. Foundations of Computer Science, Syracuse, N.Y., Oct. 1980, pp. 207-216.Google Scholar
- GONN78 GONNET, GASTON H. "Notes on the derivation of asymptotic expressions from summations," Inf. Process. Lett. 7, 4 (June 1978), 165-169.Google Scholar
- GONN79 GONNET, GASTON H., AND MUNRO, J. IA~ "Efficient ordering of hash tables," SIAM J. Comput. 8, 3 (Aug. 1979), 463- 478.Google Scholar
- HALL67 HALL, MARSHALL Combinatorial theory, Biaisdell, Waltham, Mass., 1967.Google Scholar
- HARA73 HARARY, F., AND PALMER, S. S. Graphical enumeration, Academic Press, New York, 1973.Google Scholar
- HELD62 HELD, M., AND KARP, R.M. "A dynamic programming approach to sequencing problems," SIAM J. 10 {1962), 196-210.Google Scholar
- HERS64 HERSTEIN, I.N. Topics in algebra, Blaisdell, Waltham, Mass., 1964.Google Scholar
- ISAA56 ISAAC, E. J., AND SINGLETON, R. C. "Sorting by address calculation," J. A CM 3 (1956), 169-174. Google Scholar
- KARP77 KARP, R. M. "Probabilistic analysis of partitioning algorithms for the travelingsalesman problem in the plane," Math. Oper. Res 2, 3 (1977), 209-224.Google Scholar
- KNUT68 KNUTH, DONALD The art of computer programming. Vol. 1: Fundamental algorithms, Addison-Wesley, Reading, Mass., 1968. Google Scholar
- KNUT73 KNUTH, I)ONALD The art of computer programming. Vol. 3: Sorting and searching, Addison-Wesley, Reading, Mass., 1973. Google Scholar
- LEVY61 LEVY, H., AND LESSMAN, F. Finite d~ffer. ence equations, Macmillan, New York, 1961.Google Scholar
- LIU68 LIu, C.L. Introduction to combinatorial mathematics, McGraw-Hill, New York, 1968.Google Scholar
- MILN60 MILNE-THOMSON, L. M. The calculus of finite differences, Macmillan, London, 1960.Google Scholar
- REIN77 REINGOLD, EDWARD M., NIEVERGELT, JURG, AND DEO, NARSINGH Combinatorial algorithms: Theory and practice, Prentice-Hall, Englewood Cliffs, N.J., 1977. Google Scholar
- RIOR58 RIORDA~, J. An introduction to combi. natorml analysis, Wiley, New York, 1958.Google Scholar
- RIOR68 RIORDAN, J. Combinatorial identities, Wiley, New York, 1968.Google Scholar
- SCHO71 SCHONHAGE, A., AND STRASSEN, V "Schnelle Multiplikation Grosser Zahlen," Computing 7 (1971), 28i-292.Google Scholar
- SEDG75 SEDGEWICK, ROBERT "Quicksort," Rep. STAN-CS-75-492, Computer Science Dept., Stanford Univ., Stanford, Calif,, May 1975.Google Scholar
- SLOA73 SLOANE, N. J. A. A handbook of integer sequences, Academic Press, New York, 1973.Google Scholar
- STAN78 STANLEY, R.P. "Generating functions," m MAA studies in mathematics. Vol. 17: Studies m combinatorws, Gian.Carlo Rota (Ed.), The Mathematical Association of America, 1978, pages 100-141.Google Scholar
- STAN80 STANDISH, T. A. Data structure techniques, Addison-Wesley, Reading, Mass., 1980. Google Scholar
- SZEG59 SZEGO, G. Orthogonal polynomials, American Mathematical Society Colloquium Publications, Vol. 23, American Mathematical Society, Washington, D.C., 1959.Google Scholar
- WALK79 WALKUP, D.W. "On the expected value of a random assignment problem," SIAM J. Comput. 8, 3 (Aug. 1979), 440-442.Google Scholar
Recommendations
Solving multivariate linear recurrences in wedges (abstract only)
Many problems of combinatorial enumeration can be reduced to solving multivariate linear recurrences with constant coefficients in wedge-like domains. We survey some results on existence and uniqueness of solutions to such recurrences, on the algebraic ...
Low complexity algorithms for linear recurrences
ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computationWe consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are hypergeometric over ...
Verified solving and asymptotics of linear recurrences
CPP 2019: Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and ProofsLinear recurrences with constant coefficients are an interesting class of recurrence equations that can be solved explicitly. The most famous example are certainly the Fibonacci numbers with the equation f(n) = f(n−1) + f(n−2) and the quite non-obvious ...
Comments