1. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Clifford, J., Lindsay, B., Maier, D. (eds.) 1989 ACM SIGMOD, pp. 253–262. ACM, New York (1989)
2. Ait-Kaci, H., Boyer, R., Lincoln, P., Nasr, R.: Efficient implementation of lattice operations. ACM Trans. Program. Lang. Syst. 11(1), 115–146 (1989)
3. Alavi, H.S., Gilbert, S., Guerraoui, R.: Extensible encoding of type hierarchies. In: 35th Ann. ACM SIGPLAN-SIGACT Symp. Principles of Programming Languages, pp. 349–358 (2008)
4. Baehni, S., Barreto, J., Eugster, P., Guerraoui, R.: Efficient distributed subtyping tests. In: 2007 Inaugural Int’l Conf. on Distributed Event-Based Systems, vol. 233, pp. 214–225. ACM, New York (2007)
5. Bender, M.A., Pemmasani, G., Skiena, S., Sumazin, P.: Finding least common ancestors in directed acyclic graphs. In: 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 845–854. SIAM, Philadelphia (2001)