5 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.DS2021
Online k-Way Matching with Delays and the H-Metric
Darya Melnyk, Yuyi Wang, Roger Wattenhofer
In this paper, we study -Way Min-cost Perfect Matching with Delays - the -MPMD problem. This problem considers a metric space with nodes. Requests arrive at these nodes i…
quant-ph2020★ 5 cited
Space Complexity of Streaming Algorithms on Universal Quantum Computers
Yanglin Hu, Darya Melnyk, Yuyi Wang +1
Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which…
cs.DC2018
Byzantine Preferential Voting
Darya Melnyk, Yuyi Wang, Roger Wattenhofer
In the Byzantine agreement problem, n nodes with possibly different input values aim to reach agreement on a common value in the presence of t < n/3 Byzantine nodes which represent…