The following pages link to Lata Narayanan (Q385053):
Displaying 50 items.
- (Q172549) (redirect page) (← links)
- A tight characterization of strategic games with a unique equilibrium (Q385055) (← links)
- Optimal sensor networks for area monitoring using rotating and beam sensors (Q489751) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q518925) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- On synchronization and orientation in distributed barrier coverage with relocatable sensors (Q820528) (← links)
- Strong connectivity of sensor networks with double antennae (Q896697) (← links)
- Wavelength routing of uniform instances in all-optical rings (Q1019297) (← links)
- Upper and lower bounds for selection on the mesh (Q1386351) (← links)
- Priority evacuation from a disk using mobile robots (extended abstract) (Q1713933) (← links)
- Worst-case analysis of a dynamic channel assignment strategy (Q1827841) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Evacuating equilateral triangles and squares in the face-to-face model (Q2206722) (← links)
- The bike sharing problem (Q2232233) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Whom to befriend to influence people (Q2292915) (← links)
- Satisfying neighbor preferences on a circle (Q2294731) (← links)
- Weak coverage of a rectangular barrier (Q2300721) (← links)
- Distributed pattern formation in a ring (Q2303291) (← links)
- Editing graphs to satisfy diversity requirements (Q2327109) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Games to induce specified equilibria (Q2378513) (← links)
- Strong Connectivity of Sensor Networks with Double Antennae (Q2913213) (← links)
- Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations (Q3066467) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- God save the queen (Q3305734) (← links)
- (Q3386625) (← links)
- Balancing Traffic Load Using One-Turn Rectilinear Routing (Q3502670) (← links)
- Maximum Interference of Random Sensors on a Line (Q3569126) (← links)
- Interval Routing onk-Trees (Q4386452) (← links)
- (Q4471372) (← links)
- Distributed Online Frequency Assignment in Cellular Networks (Q4500850) (← links)
- (Q4511237) (← links)
- (Q4536364) (← links)
- Partial characterizations of networks supporting shortest path interval labeling schemes (Q4540069) (← links)
- Search on a Line by Byzantine Robots (Q4636509) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- (Q4942230) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q5176117) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Structural Information and Communication Complexity (Q5315243) (← links)
- Search on a Line with Faulty Robots (Q5361963) (← links)
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
- Distributed Barrier Coverage with Relocatable Sensors (Q5496162) (← links)
- How to choose friends strategically (Q5916004) (← links)
- Time-energy tradeoffs for evacuation by two robots in the wireless model (Q5919064) (← links)
