Ordering transactions with bounded unfairness: definitions, complexity and constructions
From MaRDI portal
Publication:6637324
DOI10.1007/978-3-031-58734-4_2MaRDI QIDQ6637324FDOQ6637324
Yu Shen, Nikos Leonardos, Aggelos Kiayias
Publication date: 13 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on exact algorithms for vertex ordering problems on graphs
- Security and composition of multiparty cryptographic protocols
- The Voting Problem
- The NP-completeness of the bandwidth minimization problem
- The bandwidth problem for graphs and matrices—a survey
- Hardness results for approximating the bandwidth
- Faster Exact Bandwidth
- Voting paradoxes and digraphs realizations
- The Bitcoin Backbone Protocol: Analysis and Applications
- Exact and Approximate Digraph Bandwidth
- SoK: a consensus taxonomy in the blockchain era
- Universally Composable Synchronous Computation
- Analysis of the Blockchain Protocol in Asynchronous Networks
- The Bitcoin backbone protocol with chains of variable difficulty
- FruitChains
- Order-fairness for Byzantine consensus
- Quick order fairness
Cited In (1)
This page was built for publication: Ordering transactions with bounded unfairness: definitions, complexity and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637324)