6 citations · 7 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012★ 1 cited
Order-preserving Renaming in Synchronous Message Passing Systems with Byzantine Faults
Oksana Denysyuk, Luis Rodrigues
Renaming is a fundamental problem in distributed computing, which consists of a set of processes picking distinct names from a given namespace. The paper presents algorithms that s…
cs.DS2011★ 6 cited
Random Walk on Directed Dynamic Graphs
Oksana Denysyuk, Luis Rodrigues
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re…