Optimal Multilevel Slashing for Blockchains
Fuente:
arXiv
Saved in:
| Main Authors: | Wood, Kenan, Mendes, Hammurabi, Pulaj, Jonad |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Distributed Agreement in the Arrovian Framework
by: Wood, Kenan, et al.
Published: (2024)
by: Wood, Kenan, et al.
Published: (2024)
Expiring Assets in Automated Market Makers
by: Wood, Kenan, et al.
Published: (2024)
by: Wood, Kenan, et al.
Published: (2024)
Jet: Multilevel Graph Partitioning on Graphics Processing Units
by: Gilbert, Michael S., et al.
Published: (2023)
by: Gilbert, Michael S., et al.
Published: (2023)
Optimal Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2022)
by: Di Luna, Giuseppe A., et al.
Published: (2022)
A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)
by: Olesker-Taylor, Sam
Published: (2025)
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
by: Li, Xiaorui, et al.
Published: (2024)
by: Li, Xiaorui, et al.
Published: (2024)
Efficient Approximation of Centrality Measures in Uncertain Graphs
by: Ketels, Daniel
Published: (2024)
by: Ketels, Daniel
Published: (2024)
Asynchronous 3-Majority Dynamics with Many Opinions
by: Cooper, Colin, et al.
Published: (2024)
by: Cooper, Colin, et al.
Published: (2024)
Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
by: Chalopin, Jérémie, et al.
Published: (2026)
by: Chalopin, Jérémie, et al.
Published: (2026)
Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
by: Döring, Michelle
Published: (2025)
by: Döring, Michelle
Published: (2025)
SPHERE: Spherical partitioning for large-scale routing optimization
by: Lindermann, Robert Fabian, et al.
Published: (2025)
by: Lindermann, Robert Fabian, et al.
Published: (2025)
Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, et al.
Published: (2025)
by: Bonamy, Marthe, et al.
Published: (2025)
Improved Distributed Algorithms for Random Colorings
by: Carlson, Charlie, et al.
Published: (2023)
by: Carlson, Charlie, et al.
Published: (2023)
Lower bound for constant-size local certification
by: Martínez, Virgina Ardévol, et al.
Published: (2022)
by: Martínez, Virgina Ardévol, et al.
Published: (2022)
Convergence Sans Synchronization
by: Gupta, Arya Tanmay
Published: (2025)
by: Gupta, Arya Tanmay
Published: (2025)
Efficient Computation in Congested Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2023)
by: Di Luna, Giuseppe A., et al.
Published: (2023)
Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
by: Accorsi, Luca, et al.
Published: (2025)
by: Accorsi, Luca, et al.
Published: (2025)
3-Majority and 2-Choices with Many Opinions
by: Shimizu, Nobutaka, et al.
Published: (2025)
by: Shimizu, Nobutaka, et al.
Published: (2025)
Learning-Based Approaches for Job Shop Scheduling Problems: A Review
by: Rihane, Karima, et al.
Published: (2025)
by: Rihane, Karima, et al.
Published: (2025)
Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
by: Balbi, Pedro Paulo, et al.
Published: (2026)
by: Balbi, Pedro Paulo, et al.
Published: (2026)
Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
by: Gao, Chuanchao, et al.
Published: (2025)
by: Gao, Chuanchao, et al.
Published: (2025)
Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
by: Doger, Mustafa, et al.
Published: (2024)
by: Doger, Mustafa, et al.
Published: (2024)
An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
by: Doger, Mustafa, et al.
Published: (2025)
by: Doger, Mustafa, et al.
Published: (2025)
When Should Selfish Miners Double-Spend?
by: Doger, Mustafa, et al.
Published: (2025)
by: Doger, Mustafa, et al.
Published: (2025)
Transaction Capacity, Security and Latency in Blockchains
by: Doger, Mustafa, et al.
Published: (2024)
by: Doger, Mustafa, et al.
Published: (2024)
Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments
by: Guo, Longkun, et al.
Published: (2024)
by: Guo, Longkun, et al.
Published: (2024)
Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
by: Fuchs, Marc, et al.
Published: (2025)
by: Fuchs, Marc, et al.
Published: (2025)
Causal Graph Dynamics and Kan Extensions
by: Maignan, Luidnel, et al.
Published: (2024)
by: Maignan, Luidnel, et al.
Published: (2024)
SUperman: Efficient Permanent Computation on GPUs
by: Elbek, Deniz, et al.
Published: (2025)
by: Elbek, Deniz, et al.
Published: (2025)
Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
by: Cantaloube, Théo, et al.
Published: (2026)
by: Cantaloube, Théo, et al.
Published: (2026)
Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
by: Yu, Leilei, et al.
Published: (2023)
by: Yu, Leilei, et al.
Published: (2023)
Network Centrality as a New Perspective on Microservice Architecture
by: Bakhtin, Alexander, et al.
Published: (2025)
by: Bakhtin, Alexander, et al.
Published: (2025)
A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs
by: Zhu, Hongyu, et al.
Published: (2022)
by: Zhu, Hongyu, et al.
Published: (2022)
Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
by: Elbek, Deniz, et al.
Published: (2025)
by: Elbek, Deniz, et al.
Published: (2025)
Local certification of geometric graph classes
by: Defrain, Oscar, et al.
Published: (2023)
by: Defrain, Oscar, et al.
Published: (2023)
Renaming in distributed certification
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
Local certification of forbidden subgraphs
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
A subquadratic certification scheme for P5-free graphs
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
by: Fuchs, Marc, et al.
Published: (2024)
by: Fuchs, Marc, et al.
Published: (2024)
Error Bounds for the Network Scale-Up Method
by: Díaz-Aranda, Sergio, et al.
Published: (2024)
by: Díaz-Aranda, Sergio, et al.
Published: (2024)
Similar Items
-
Distributed Agreement in the Arrovian Framework
by: Wood, Kenan, et al.
Published: (2024) -
Expiring Assets in Automated Market Makers
by: Wood, Kenan, et al.
Published: (2024) -
Jet: Multilevel Graph Partitioning on Graphics Processing Units
by: Gilbert, Michael S., et al.
Published: (2023) -
Optimal Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2022) -
A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)