The following pages link to Ravi Sundaram (Q210282):
Displayed 38 items.
- A note on optical routing on trees (Q287098) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Symmetric alternation captures BPP (Q1272661) (← links)
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- Plane gossip: approximating rumor spread in planar graphs (Q2294719) (← links)
- Cache me if you can: capacitated selfish replication games in networks (Q2300628) (← links)
- Meet and merge: approximation algorithms for confluent flows (Q2495396) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Cache Me If You Can: Capacitated Selfish Replication Games (Q2894485) (← links)
- (Q3128917) (← links)
- (Q3129923) (← links)
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows (Q3546347) (← links)
- (Almost) tight bounds and existence theorems for confluent flows (Q3581008) (← links)
- Meet and merge (Q3581299) (← links)
- Universal approximations for TSP, Steiner tree, and set cover (Q3581400) (← links)
- On Completing Latin Squares (Q3590962) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Treewidth of Circular-Arc Graphs (Q4317710) (← links)
- (Q4395332) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- Markovian Hitters and the Complexity of Blind Rendezvous (Q4575623) (← links)
- Spanning Trees—Short or Small (Q4881285) (← links)
- Improving Minimum Cost Spanning Trees by Upgrading Nodes (Q4939607) (← links)
- (Q5002612) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- (Q5091228) (← links)
- Reducibility among Fractional Stability Problems (Q5171181) (← links)
- (Q5275393) (← links)
- (Q5351912) (← links)
- Reducibility among Fractional Stability Problems (Q5408759) (← links)
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (Q5891999) (← links)
- Realization problems on reachability sequences (Q5918252) (← links)
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budget (Q5920341) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- Alternation in interaction (Q5946704) (← links)
- Approximating latin square extensions (Q6184673) (← links)
- Small-Support Uncertainty Principles on $\mathbb{Z}/p$ over Finite Fields (Q6320398) (← links)