In this paper we show some important randomized techniques for the parallel processing of discrete problems. In particular, we present a few parallel randomized algorithms frequently used for shortest paths problems, matching problems, depth first search and maximum independent set problems. We also discuss the connection between randomization and approximation, showing how randomization yields approximative solutions and we illustrate this connection by means of network flow problems.