1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
Sunny Atalig, Alexander Hickerson, Arrdya Srivastav +2
We consider the classical single-source shortest path problem in directed weighted graphs. D.~Eppstein proved recently an lower bound for oblivious algorithms that use rel…
On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps
Emily Clark, Chloe Georgiou, Katelyn Poon +1
In his 2018 paper, Herlihy introduced an atomic protocol for multi-party asset swaps across different blockchains. His model represents an asset swap by a directed graph whose node…
On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
Jordan Kuschner, Yugarshi Shashwat, Sarthak Yadav +1
Selective families of sets, or selectors, are combinatorial tools used to "isolate" individual members of sets from some set family. Given a set and an element , to iso…