- References
**N. Alon, J. H. Spencer, and Paul Erdos**,.*The Probabilistic Method***John Wiley**, 1992.**B. Bollobas**,.*Random Graphs***Academic Press**, 1985.**W. Feller**,.*An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd ed***John Wiley**, 1968.**S. Karlin and H. M. Taylor**,.*A Second Course in Stochastic Processes***Academic Press**, 1981.**M. J. Kearns and U. V. Vazirani**,.*An Introduction to Computational Learning Theory***MIT Press**, 1994.**M. Luby**,.*Pseudorandomness and Cryptographic Applications***Princeton University Press**, 1996.-
**R. Motwani and P. Raghavan**,.*Randomized Algorithms***Cambridge University Press**, 1995. **C. H. Papadimitriou**,.*Computational Complexity***Addison-Wesley**, 1994.**Errata**.-
**S. R. Pliska**,.*Introduction to Mathematical Finance: Discrete-Time Models***Blackwell**, 1997.

- Lecture notes 2001.2.27
- Lecture notes 2001.3.6
- Lecture notes 2001.3.13
- Lecture notes 2001.3.20
- Lecture notes 2001.3.27
- Lecture notes 2001.4.17
- Lecture notes 2001.4.24
- Lecture notes 2001.5.1
- Lecture notes 2001.5.8
- Lecture notes 2001.5.22