Distributed computing and networks
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. 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
- CS-25 The NC versus P Problem for Efficient Parallel Computation
- CS-81 Li-Li Undirected Multiple-Unicast Network Coding Conjecture
- CS-334 Randomized Communication Complexity of Distributed Triangle Detection
- CS-395 LOCAL Coloring Complexity and Constant-Round Decidability on Trees
- CS-397 Determinacy Methods in LOCAL and Borel Coloring
- CS-402 Type-II Error Exponents in Distributed Hypothesis Testing
- CS-473 When frequency selectivity can and cannot improve multi-user capacity
- CS-474 What is actually exponential in single-carrier equalization?
- CS-607 A deterministic contract for parallel Macaulay2 core routines
- CS-630 Robust Radio-Network Planning Under Traffic Misspecification
- CS-638 Application-Independent Parallel Algorithms for Directed Grid Dependencies
- CS-743 Open Problems in Local Graph Complexity
- CS-778 Sensor-Actuator Co-Design and Distributed Controllability Algorithms
- CS-794 Power of Shared Randomness in Distributed Computation