[Hr] Hromkovic, Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics , 2nd edition, Springer (2010)
[MM] Andrew Mc-Gregor and S. Muthukrishnan, Data Stream Algorithms and Sketches. Draft at http://people.cs.umass.edu/∼mcgregor/book/book.html. Password is on Thore Husfeldt’s office door. Do not distribute without permission of the authors.
[MR] Motwani and Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
[MU] Mitzenmacher and Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press (2005)
[Ka] David R. Karger: Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) 1993: 21-30
[KS] David R. Karger, Clifford Stein: An O~(n2) algorithm for minimum cuts. STOC 1993: 757-765
[Hu11] Thore Husfeldt Invitation to Algorithmic Uses of Inclusion-Exclusion, Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zürich, Switzerland, July 4-8, 2011, Part II, Springer LNCS 6756, 2011, pages 42-59. arxiv.org/abs/1105.2942
[Da+] Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning: A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. Theor. Comput. Sci. 289(1): 69-83 (2002)[PDF]
