References

Bonacic, E., C. Garcia, M. Marin, M. Prieto and F. Tirado, 2008. Exploiting hybrid parallelism in web search engine. Proc. Int. Euro-Par Conf. Parallel Process, 5168: 414-423.
CrossRef  |  Direct Link  |  

Cazenave, T. and N. Jouandeau, 2007. On the parallelization of UCT. Proceedings of the Computer Games Workshop, (CGW`07), University of Maastricht, The Netherlands, pp: 185-192.

Chaslot, G.M., M.H. Winands and H.J. Herik, 2008. Parallel monte carlo tree search. Proceedings of the 6th International Conference on Computer and Games, Sept. 29-Oct. 1, Springer-Verlag, Beijine, China, pp: 25-36.

Cormen, T.H., C.E. Leiserson, R.L. Rivest and C. Stein, 2001. Introduction to Algorithms. 2nd Edn., McGraw-Hill Book Company, Cambridge and New York.

Coulom, R., 2007. Efficient selectivity and backup operations in monte carlo tree search. Proc. Int. Conf. Comput. Games, 4630: 72-83.
CrossRef  |  Direct Link  |  

Digalakis, J. and K. Margaritis, 2003. Parallel evolutionary algorithms on message passing clusters. http://www.it.uom.gr/people/digalakis/digamarg2003.pdf

Gayatri, R.K. and P.K. Baruah, 2008. Parallelizing breadth first search using cell broadband engine. http://www.hipc.org/hipc2008/documents/HiPC-SS08-FinalPapers/1569154967.pdf

Knuth, D., 1997. The Art of Computer Programming Sorting and Searching. 3rd Edn., Vol. 3, Addison Wesley, USA.

Kocsis, L. and C. Szepesvari, 2006. Bandit based monte-carlo planning. Mach. Learn.: ECML., 4212: 282-293.
CrossRef  |  

Koorangi, M. and K. Zamanifar, 2007. Designing optimal binary search tree using parallel genetic algorithm. Int. J. Comput. Sci. Network Secur., 7: 138-146.

Marin, M., J. Vega and R. Mirande, 2003. Comparative study of parallel suffix arrays algorithms. Workshop Chileno Sistemas Distribuidos Paralelismo, 2857: 311-325.
Direct Link  |  

Williams, J.W.J., 1964. Algorithm 232: Heapsort. Commun. ACM., 7: 347-348.