1. Dimitris Achlioptas & Gregory B. Sorkin (2000). Optimal myopic algorithms for random 3-SAT. In IEEE Symposium on Foundations of Computer Science, 590–600.
2. M. Alekhnovich (2005). Lower bounds for k-DNF Resolution on random 3CNF. In Proceedings of the 37th Symposium on Theory of Computing, 251–256.
3. M. Alekhnovich, E. Hirsch & D. Itsykson (2005). Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Journal of Automated Reasoning 35(1-3), 51–72. Preliminary version appeared in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.
4. M. Alekhnovich & A. Razborov (2001). Lower bounds for the polynomial calculus: non-binomial case. In Proc. 42nd Ann. Symp. on Foundations of Computer Science. IEEE Computer Society.
5. Angelopoulos S., Borodin A. (2004) On the Power of Priority Algorithms for Facility Location and Set Cover. Algorithmica 40(4): 271–291