1 citations · 1 across the 4 of their papers we have counts for
7 papers · 1 filter
Local Distributed Computation under Crash Failures
Diana Ghinea, Fabian Kuhn, Chen-Da Liu-Zhang +1
We study deterministic algorithms for locally checkable graph problems in the synchronous LOCAL model with crash failures, where a crashing node may send messages to only some neig…
General Convex Agreement with Near-Optimal Communication
Marc Dufay, Diana Ghinea, Anton Paramonov
Byzantine Agreement (BA) considers a setting of parties out of which up to can be byzantine (malicious), and requires the honest parties to agree on an input subject to a c…
Byzantine Stable Matching
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who…
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
Marc Fuchs, Diana Ghinea, Zahra Parsaeian +1
Approximate Agreement () is a fundamental primitive that, even in the presence of Byzantine faults, allows honest parties to obtain close (but not necessarily identic…
Validity in Network-Agnostic Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
Byzantine Agreement (BA) considers a setting of parties, out of which up to can exhibit byzantine (malicious) behavior. Honest parties must decide on a common value (agreem…
Unifying Partial Synchrony
Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski +1
The distributed computing literature considers multiple options for modeling communication. Most simply, communication is categorized as either synchronous or asynchronous. Synchro…
A Fair and Resilient Decentralized Clock Network for Transaction Ordering
Andrei Constantinescu, Diana Ghinea, Lioba Heimbach +2
Traditional blockchain design gives miners or validators full control over transaction ordering, i.e., they can freely choose which transactions to include or exclude, as well as i…