The following pages link to Bala Kalyanasundaram (Q230555):
Displaying 47 items.
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- A near optimal periodic transmission schedule in bounded degree wireless sensor network (Q693076) (← links)
- Unlocking the advantages of dynamic service selection and pricing (Q814916) (← links)
- Taming teams with mind changes (Q927869) (← links)
- On the power of white pebbles (Q1180416) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Scheduling broadcasts in wireless networks (Q1348738) (← links)
- An optimal deterministic algorithm for online \(b\)-matching (Q1575950) (← links)
- (Q1587775) (redirect page) (← links)
- Errata: A new algorithm for scheduling periodic, real-time tasks (Q1587777) (← links)
- Dynamic spectrum allocation: the impotency of duration notification. (Q1588057) (← links)
- Caching for web searching (Q1601026) (← links)
- Rounds versus time for the two person pebble game (Q2641235) (← links)
- Eliminating Migration in Multi-processor Scheduling (Q2709789) (← links)
- (Q2721975) (← links)
- (Q2753944) (← links)
- Fault-tolerant scheduling (Q2817601) (← links)
- Learning Behaviors of Functions with Teams (Q2841949) (← links)
- On-Line Load Balancing of Temporary Tasks (Q3125220) (← links)
- (Q3138958) (← links)
- (Q3416084) (← links)
- Minimizing flow time nonclairvoyantly (Q3452502) (← links)
- Learning Behaviors of Functions (Q3560555) (← links)
- (Q4010311) (← links)
- (Q4010316) (← links)
- The Probabilistic Communication Complexity of Set Intersection (Q4030193) (← links)
- (Q4252326) (← links)
- (Q4252706) (← links)
- Speed is as powerful as clairvoyance (Q4406304) (← links)
- (Q4437496) (← links)
- (Q4472464) (← links)
- The Online Transportation Problem (Q4490792) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- Online Weighted Matching (Q4696653) (← links)
- Maximizing job completions online (Q4820905) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- Rounds versus time for the two person pebble game (Q5096183) (← links)
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (Q5096778) (← links)
- Fault-Tolerant Scheduling (Q5317170) (← links)
- Automata, Languages and Programming (Q5466516) (← links)
- Fault-tolerant real-time scheduling (Q5896856) (← links)
- Algorithms - ESA 2003 (Q5897256) (← links)
- Fault-tolerant real-time scheduling (Q5915408) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- A randomized algorithm for online metric b-matching (Q6556181) (← links)
- An optimal deterministic algorithm for online b-matching (Q6567768) (← links)
