Journal of the ACM Bibliography

Selected papers that cite this one

• Peter van Beek and Rina Dechter. On the minimality and global consistency of row-convex constraint networks. Journal of the ACM, 42(3):543-561, May 1995.

• Catriel Beeri and Moshe Y. Vardi. On acyclic database decompositions. Information and Control, 61(2):75-84, May 1984.

• J. R. S. Blair and B. W. Peyton. On finding minimum-diameter clique trees. Nordic Journal of Computing, 1(2):173-201, Summer 1994.

• Rina Dechter and Peter van Beek. Local and global relational consistency. Theoretical Computer Science, 173(1):283-308, 20 February 1997.

• Xiufeng Du, Weili Wu, and Dean F. Kelley. Approximations for subset interconnection designs. Theoretical Computer Science, 207(1):171-180, 28 October 1998.

• 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.

• Philip N. Klein. Efficient parallel algorithms for chordal graphs. SIAM Journal on Computing, 25(4):797-827, August 1996.

• F. M. Malvestuto. A complete axiomatization of full cyclic join dependencies. Information Processing Letters, 68(3):133-139, 15 November 1998.

• 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.

• Wai Yin Mok and David W. Embley. On improving dependency implication algorithms. Information Processing Letters, 64(3):135-141, 14 November 1997.

• Shinichi Morishita. Avoiding Cartesian products for multiple joins. Journal of the ACM, 44(1):57-85, January 1997.

• Y. C. Tay. On the optimality of strategies for multiple joins. Journal of the ACM, 40(5):1067-1086, November 1993.

• P. Thanisch, G. Loizou, and J. Nummenmaa. Finding compact scheme forests in nested normal form is NP-hard. Information and Computation, 110(1):19-41, April 1994.

Shortcuts: