activity
20032019
most citedA Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms

32 citations · 78 across the 16 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2003★ 3 cited

The First Order Definability of Graphs: Upper Bounds for Quantifier Rank

Oleg Pikhurko, Helmut Veith, Oleg Verbitsky

We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the mi…