6 citations · 8 across the 2 of their papers we have counts for
2 papers
cs.DM2013★ 2 cited
Canonical Labelling of Site Graphs
Nicolas Oury, Michael Pedersen, Rasmus Petersen
We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of can…
cs.LO2010★ 6 cited
Equilibrium and Termination
Vincent Danos, Nicolas Oury
We present a reduction of the termination problem for a Turing machine (in the simplified form of the Post correspondence problem) to the problem of determining whether a continuou…