8 citations · 54 across the 13 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014★ 4 cited
Acyclic edge colourings of graphs with large girth
Xing Shi Cai, Guillem Perarnau, Bruce Reed +1
An edge colouring of a graph is called acyclic if it is proper and every cycle contains at least three colours. We show that for every , there exists a $g=g(\var…
cs.DS2014★ 7 cited
The Analysis of Kademlia for random IDs
Xing Shi Cai, Luc Devroye
Kademlia is the de facto standard searching algorithm for P2P (peer-to-peer) networks on the Internet. In our earlier work, we introduced two slightly different models for Kademlia…