1. Bayardo, R. J. and Miranker, D. P. 1994. An Optimal Backtrack Algorithm for Tree-Structured Constraint Satisfaction Problems. Artificial Intelligence 71(1): 159–181.
2. Bayardo, R. J. and Miranker, D. P. 1995. On the Space-Time Trade-Off in Solving Constraint Satisfaction Problems. In Proc. 14th Intl. Joint Conf. on Artificial Intelligence, 558–562.
3. Bayardo, R. J. and Miranker, D. P. 1996. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proc. of the 13th National Conf. on Artificial Intelligence, 298–304.
4. Bayardo, R. J. and Miranker, D. P. 1996. Processing queries for first few answers. In Proc. of the Fifth International Conference on Information and Knowledge Management, 45–52.
5. Bernstein, P. A. and Chiu, D.-M. W. 1981. Using semijoins to solve relational queries, J. ACM 28(1), 25–30.