The following pages link to Krishnendu Mukhopadhyaya (Q407527):
Displaying 35 items.
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
- Gathering over meeting nodes in infinite grid (Q779225) (← links)
- Reliability analysis of networks using stochastic model (Q1194253) (← links)
- Hamiltonian graphs with minimum number of edges for fault-tolerant topologies (Q1201873) (← links)
- (Q1324411) (redirect page) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- A family of network topologies with multiple loops and logarithmic diameter (Q1392075) (← links)
- Concurrent checkpoint initiation and recovery algorithms on asynchronous ring networks (Q1881304) (← links)
- \(k\)-circle formation by disoriented asynchronous robots (Q2143129) (← links)
- Mutual visibility for asynchronous robots (Q2303299) (← links)
- Mutual visibility by robots with persistent memory (Q2327097) (← links)
- Performance analysis of different checkpointing and recovery schemes using stochastic model (Q2369651) (← links)
- Self-stabilizing algorithm for checkpointing in a distributed system (Q2373890) (← links)
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement (Q2634716) (← links)
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement (Q2803812) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Generalized Bounded Tree Cover of a Graph (Q2971394) (← links)
- Optimum Gathering of Asynchronous Robots (Q2971632) (← links)
- Gathering Asynchronous Robots in the Presence of Obstacles (Q2980916) (← links)
- MEASURING THE QUALITY OF SURVEILLANCE IN A WIRELESS SENSOR NETWORK (Q3016229) (← links)
- MOBILE AGENT BASED CHECKPOINTING WITH CONCURRENT INITIATIONS (Q3065619) (← links)
- (Q4417480) (← links)
- Implementation of four common functions on an LNS co-processor (Q4419618) (← links)
- A new family of bridged and twisted hypercubes (Q4419796) (← links)
- Fault-tolerant routing in distributed loop networks (Q4421137) (← links)
- (Q4893347) (← links)
- (Q4893361) (← links)
- Gathering over Meeting Nodes in Infinite Grid* (Q5044391) (← links)
- Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights (Q5045451) (← links)
- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement (Q5176580) (← links)
- Distributed Computing - IWDC 2003 (Q5191417) (← links)
- Distributed Computing – IWDC 2005 (Q5491775) (← links)
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957) (← links)
- Parking problem by oblivious mobile robots in infinite grids (Q6652442) (← links)
