Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.
Byzantine agreement with interval validity
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Duon eliminates TLB shootdown and cache invalidation costs during page migration in flat-address hybrid memory systems by updating mappings in-place, delivering 3.87% IPC gains over prior methods.
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.
citing papers explorer
-
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.
-
Efficient Page Migration in Hybrid Memory Systems
Duon eliminates TLB shootdown and cache invalidation costs during page migration in flat-address hybrid memory systems by updating mappings in-place, delivering 3.87% IPC gains over prior methods.
-
Threshold Signatures for Central Bank Digital Currencies
Evaluates ECDSA-based threshold signatures on the Filia CBDC platform and reports that they improve security with acceptable computational and communication overhead for real deployments.