Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal amortized distributed consensus

From MaRDI portal
Publication:1898481
Jump to:navigation, search

DOI10.1006/inco.1995.1101zbMath0939.68943OpenAlexW1972328077MaRDI QIDQ1898481

Tiko Kameda, Xiaothie Deng, Amotz Bar-Noy, Juan A. Garay

Publication date: 29 October 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1101



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)


Related Items (8)

Total ordering algorithms for asynchronous Byzantine systems ⋮ Stability of long-lived consensus. ⋮ Fine structure constant, domain walls, and generalized uncertainty principle in the universe ⋮ Computer science and decision theory ⋮ Stability of Multi-Valued Continuous Consensus11Preliminary Version, Some proofs are omitted from this version. ⋮ Correctness of Tendermint-Core Blockchains ⋮ From Passive to Covert Security at Low Cost ⋮ Byzantine-resistant total ordering algorithms.







This page was built for publication: Optimal amortized distributed consensus

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1898481&oldid=14307457"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 13:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki