Algorithm analysis - Data Structures and Problem Solving Using Java - page 228

J. L. Bentley, More Programming Pearls , Addison-Wesley, Reading,
MA, 1988.

6.

R. A. Brualdi, Introductory Combinatorics , North-Holland, New York,
1977.

7.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction
to Algorithms , 3rd ed., MIT Press, Cambridge, MA, 2010.

8.

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics ,
Addison-Wesley, Reading, MA, 1989.

9.

D. E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental
Algorithms , 3rd ed., Addison-Wesley, Reading, MA, 1997.

10.

D. E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical
Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1997.

11.

D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and
Searching , 2nd ed., Addison-Wesley, Reading, MA, 1998.

12.

Y. Pearl, A. Itai, and H. Avni, “Interpolation Search - A log log N
Search,” Communications of the ACM 21 (1978), 550-554.

13.

W. W. Peterson, “Addressing for Random Storage,” IBM Journal of
Research and Development 1 (1957), 131-132.

14.

F. S. Roberts, Applied Combinatorics , Prentice Hall, Englewood Cliffs,
NJ, 1984.

15.

A. Tucker, Applied Combinatorics , 2nd ed., John Wiley & Sons, New
York, 1984.

16.

M. A. Weiss, Data Structures and Algorithm Analysis in Java , 2nd ed.,
Addison-Wesley, Reading, MA, 2007.

17.