94 citations · 328 across the 28 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 15 cited
Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
George H. L. Fletcher, Marc Gyssens, Dirk Leinders +3
Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some o…
cs.DB2012★ 2 cited
External memory bisimulation reduction of big graphs
Yongming Luo, George H. L. Fletcher, Jan Hidders +2
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintena…