1. P. Ashar, A. Ghosh, and S. DevadasBoolean satisfiability and equivalence checking using general Binary Decision Diagrams, Integration, the VLSI journal 13 (1992), 1–16.
2. W. Ahrens, Mathematische unterhaltungen and spiele (ingerman), B.G. Teubner (Publishing Company), Leipzig, 1918–1921.
3. A.V. Aho, J.E. Hoperoft, and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, 1974.
4. B. Aspvall, M.F. Plass, and R.E. TarjanA linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters 8 (1979), no. 3, 121–132.
5. B. Abramson and M. YungDivide and conquer under global constraints: A solution to the n-queens problem, Journal of Parallel and Distributed Computing 6 (1989), 649–662.