1. E. Allender, D. Barrington, T. Chakraborty, S. Datta, S. Roy, Grid graph reachability problems, in: Proc. 21st Annual IEEE Conference on Computational Complexity, pp. 299–313, 2006
2. On uniformity within NC1;Barrington;Journal of Computer and System Sciences,1990
3. An optimal parallel algorithm for formula evaluation;Buss;SIAM Journal on Computing,1992
4. Complexity results for standard benchmark domains in planning;Helmert;Artificial Intelligence,2003
5. I. Gent, C. Jefferson, I. Lynce, I. Miguel, P. Nightingale, B. Smith, A. Tarim, Search in the Patience Game “Black Hole”, in: AI Communications, ISSN: 0921-7126, IOS Press, pp. 1–15