Tight Bounds on the Message Complexity of Distributed Tree Verification.
Shay KuttenPeter RobinsonMing Ming TanPublished in: OPODIS (2023)
Keyphrases
- tight bounds
- upper bound
- distributed systems
- worst case
- tree structure
- computational complexity
- space complexity
- distributed environment
- index structure
- asynchronous circuits
- communication channels
- spanning tree
- computational cost
- data structure
- multi agent
- mobile agents
- database
- decision problems
- database management systems
- distributed database systems
- multi dimensional
- lower bound
- formal verification