17 citations · 41 across the 9 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2011★ 9 cited
Formalizing Randomized Matching Algorithms
Dai Tri Man Le, Stephen A. Cook
Using Jeřábek 's framework for probabilistic reasoning, we formalize the correctness of two fundamental RNC^2 algorithms for bipartite perfect matching within the theory VPV for po…
cs.LO2009★ 17 cited
Modelling Concurrency with Comtraces and Generalized Comtraces
Ryszard Janicki, Dai Tri Man Le
Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalize…