1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Rigidity of complements of bounded-degree graphs
John Haslegrave, Peleg Michaeli, Anthony Nixon
Maxwell observed that the graph of any rigid generic framework in on vertices has at least edges. In this article we prove that graphs whose…
cs.DC2026
A parallel wakeup problem and multi-room light switch strategies
John Haslegrave, Paul A. Russell, Mark Walters
The wakeup problem in distributed computing asks for a symmetric protocol that enables one of several processors to eventually guarantee that all (or, in a more general setting, en…