In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth first search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomization and approximation, showing how randomization yields approximate solutions and we illustrate this connection by means of network flow problems.