Miltersen, P. B., Rajasekaran, S. (Ed.), Pardalos, P. M. (Ed.), Reif, J. H. (Ed.) & Rolim, J. D. P. (Ed.) (2001).
Derandomizing complexity classes. In
Handbook on Randomized Computing: Combinatorial Optimization, Vol. 9 (chapter 19 ed., Vol. II, chapter 19, pp. 843-935). Kluwer Academic Publishers (Springer).
Miltersen, P. B., Radhakrishnan, J. & Wegener, I. (2003).
On converting CNF to DNF. In B. Rovan & P. Vojtás (Eds.),
Mathematical Foundations of Computer Science 2003: 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings (pp. 612-621). Springer.
https://doi.org/10.1007/978-3-540-45138-9_55
Miltersen, P. B., Vinodchandran, N. V. & Watanabe, O. (1999).
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. In T. Asano, H. Imai, D. T. Lee, S. Nakano & T. Tokuyama (Eds.),
Computing and Combinatorics: 5th Annual International Conference, COCOON'99 Tokyo, Japan, July 26-28, 1999 Proceedings (pp. 210-220). Springer.
https://doi.org/10.1007/3-540-48686-0_21
Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A.
, Branzei, S., Wooldridge, M. & Jennings , N. (2014).
Implementation and Computation of a Value for Generalized Characteristic Function Games.
A C M Transactions on Economics and Computation,
2(4), Article 16.
https://doi.org/10.1145/2665007