The use of randomness and probabilistic arguments is one of the exciting developments in mathematics in the recent decades. This method has been impressively successful in Graph Theory, Combinatorics, Number Theory and Theoretical Computer Science. Some of the recent interesting results in combinatorics has been based on this method and no combinatorial argument is in sight for proving these results. This conference will have leading experts in this area speak on the current trends in applying randomness to solve combinatorial problems, study of random combinatorial objects and the application of randomness to the design and analysis of efficient algorithms.