Distributed computing and networks
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
14 records · Search and filter
- Math-123 The NC versus P Problem for Efficient Parallel Computation
- Math-451 Li-Li Undirected Multiple-Unicast Network Coding Conjecture
- Math-4523 Randomized Communication Complexity of Distributed Triangle Detection
- Math-4584 LOCAL Coloring Complexity and Constant-Round Decidability on Trees
- Math-4586 Determinacy Methods in LOCAL and Borel Coloring
- Math-4591 Type-II Error Exponents in Distributed Hypothesis Testing
- Math-5008 When frequency selectivity can and cannot improve multi-user capacity
- Math-5009 What is actually exponential in single-carrier equalization?
- Math-5142 A deterministic contract for parallel Macaulay2 core routines
- Math-5165 Robust Radio-Network Planning Under Traffic Misspecification
- Math-5173 Application-Independent Parallel Algorithms for Directed Grid Dependencies
- Math-5278 Open Problems in Local Graph Complexity
- Math-5313 Sensor-Actuator Co-Design and Distributed Controllability Algorithms
- Math-5329 Power of Shared Randomness in Distributed Computation