Selected papers that cite this one
- Sanjeev Arora and Ronald Fagin. On winning strategies in Ehrenfeucht-Fraïssé games. Theoretical Computer Science, 174(1-2):97-121, 15 March 1997.
- J. R. S. Blair and B. W. Peyton. On finding minimum-diameter clique trees. Nordic Journal of Computing, 1(2):173-201, Summer 1994.
- Thomas Eiter and Georg Gottlob. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6):1278-1304, December 1995.
- Francesco Mario Malvestuto and Marina Moscarini. A fast algorithm for query optimization in universal-relation databases. Journal of Computer and System Sciences, 56(3):299-309, April 1998.
- Y. C. Tay. On the optimality of strategies for multiple joins. Journal of the ACM, 40(5):1067-1086, November 1993.