Secured Distributed Algorithms without Hardness Assumptions.
Leonid BarenboimHarel LevinPublished in: CoRR (2020)
Keyphrases
- theoretical analysis
- learning algorithm
- data structure
- computational complexity
- worst case
- distributed computation
- orders of magnitude
- bayesian networks
- multi agent
- significant improvement
- computational efficiency
- distributed environment
- distributed systems
- distributed database systems
- graph theory
- recently developed
- lightweight
- databases
- genetic algorithm