activity
20112024
most citedA simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems

23 citations · 54 across the 12 of their papers we have counts for

collaborators
Showing 2012 · cs.LOShow all

Nothing from them under that filter.

Their other years and fields are still on the left.