Improving Raft When There Are Failures. - Christian Fluri; Darya Melnyk; Roger Wattenhofer (LADC, 2018)

Byzantine Agreement with Interval Validity. - Darya Melnyk; Roger Wattenhofer (SRDS, 2018)

Byzantine Preferential Voting. - Darya Melnyk; Yuyi Wang 001; Roger Wattenhofer (WINE, 2018)

Swimming style recognition and lap counting using a smartwatch and deep learning. - Gino Brunner; Darya Melnyk; Birkir Sigfússon; Roger Wattenhofer (UbiComp, 2019)

The k-Server Problem with Delays on the Uniform Metric Space. - Predrag Krnetic; Darya Melnyk; Yuyi Wang 001; Roger Wattenhofer (ISAAC, 2020)

The Append Memory Model: Why BlockDAGs Excel Blockchains. - Darya Melnyk; Roger Wattenhofer (SPAA, 2020)

Space Complexity of Streaming Algorithms on Universal Quantum Computers. - Yanglin Hu; Darya Melnyk; Yuyi Wang 001; Roger Wattenhofer (TAMC, 2020)

Byzantine Agreement on Representative Input Values Over Public Channels. - Darya Melnyk (2020)

Online Algorithms with Lookaround. - Amirreza Akbari; Henrik Lievonen; Darya Melnyk; Joona Särkijärvi; Jukka Suomela (CoRR, 2021)

Online k-Way Matching with Delays and the H-Metric. - Darya Melnyk; Yuyi Wang 001; Roger Wattenhofer (CoRR, 2021)

Mending Partial Solutions with Few Changes. - Darya Melnyk; Jukka Suomela; Neven Villani (OPODIS, 2022)

Local Mending. - Alkida Balliu; Juho Hirvonen; Darya Melnyk; Dennis Olivetti; Joel Rybicki; Jukka Suomela (SIROCCO, 2022)

Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms. - Amirreza Akbari; Navid Eslami; Henrik Lievonen; Darya Melnyk; Joona Särkijärvi; Jukka Suomela (ICALP, 2023)

Improved Solutions for Multidimensional Approximate Agreement via Centroid Computation. - Mélanie Cambus; Darya Melnyk (CoRR, 2023)

DecentPeeR: A Self-Incentivised & Inclusive Decentralized Peer Review System. - Johannes Gruendler; Darya Melnyk; Arash Pourdamghani; Stefan Schmid 001 (ICBC, 2024)

Learning Minimum Linear Arrangement of Cliques and Lines. - Julien Dallot; Maciej Pacut; Marcin Bienkowski; Darya Melnyk; Stefan Schmid 001 (ICDCS, 2024)

Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. - Aleksander Figiel; Darya Melnyk; André Nichterlein; Arash Pourdamghani; Stefan Schmid 001 (SPAA, 2024)

SpiderDAN: Matching Augmentation in Demand-Aware Networks. - Aleksander Figiel; Darya Melnyk; André Nichterlein; Arash Pourdamghani; Stefan Schmid 001 (CoRR, 2024)

Distributed Construction of Demand-Aware Datacenter Networks. - Aleksander Figiel; Darya Melnyk; Tijana Milentijevic; Stefan Schmid 001 (IPDPS, 2025)

Approximate Agreement Algorithms for Byzantine Collaborative Learning. - Mélanie Cambus; Darya Melnyk; Tijana Milentijevic; Stefan Schmid 001 (SPAA, 2025)

Online Locality Meets Distributed Quantum Computing. - Amirreza Akbari; Xavier Coiteux-Roy; Francesco D'Amore 001; François Le Gall; Henrik Lievonen; Darya Melnyk; Augusto Modanese; Shreyas Pai; Marc-Olivier Renou; Václav Rozhon; Jukka Suomela (STOC, 2025)

Centroid Approximation for Byzantine-Tolerant Federated Learning. - Mélanie Cambus; Darya Melnyk; Tijana Milentijevic; Stefan Schmid 001 (CoRR, 2025)