References

  1. Aragon, C.R. and Seidel, R. (1989). Randomized search trees. In Proc. 30th Symp. Foundations of Computer Science (FOCS 1989). IEEE Computer Society Press, Washington, DC.
  2. Donald, K. (1998). Art of Computer Programming, Vol. III. 2nd edition. Addison-Wesley Professional, Reading, MA.
  3. Garey, M.R. and David, S.J. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
  4. Hoare, C.A.R. (1962). Quick sort. The Computer Journal, 5(1), 10–16.
  5. Knuth, D.E. (1973). The Art of Computer Programming, Volume 1: Fundamental Algorithms. 2nd edition. Addison-Wesley, Reading, MA.
  6. Malik, S. and Lintao, Z. (2009). Boolean satisfiability, from theoretical hardness to practical success. Communications of the ACM, 52(8), 76–82.
  7. Perlis, A.J. and Thornton, C. (1960). Symbol manipulation by threaded lists. Communications of the ACM, 3(4), 195–204.
  8. Pugh, W. (1990). Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 668–676.
  9. Shell, D.L. (1959). A high-speed sorting procedure. Communications of the ACM, 2(7), 30–32.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset