The following pages link to Ajoy K. Datta (Q264565):
Displaying 50 items.
- The expressive power of snap-stabilization (Q264569) (← links)
- Competitive self-stabilizing \(k\)-clustering (Q264580) (← links)
- Self-stabilizing labeling and ranking in ordered trees (Q391998) (← links)
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- An \(O(n)\)-time self-stabilizing leader election algorithm (Q645826) (← links)
- A self-stabilizing \(k\)-clustering algorithm for weighted graphs (Q666253) (← links)
- Self-stabilizing leader election in optimal space under an arbitrary scheduler (Q719296) (← links)
- Self-stabilizing leader election in dynamic networks (Q722199) (← links)
- Linear time distributed swap edge algorithms (Q783711) (← links)
- High-level Petri-net model for a resource-sharing problem (Q918729) (← links)
- Space efficient and time optimal distributed BFS tree construction (Q975469) (← links)
- Stabilizing mobile philosophers (Q1041771) (← links)
- A new algorithm for deadlock avoidance (Q1111010) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- Constant-space self-stabilizing token distribution in trees (Q1713880) (← links)
- Snap-stabilization and PIF in tree networks (Q1954227) (← links)
- Loosely-stabilizing leader election with polylogarithmic convergence time (Q2285158) (← links)
- Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks (Q2485131) (← links)
- Analysis of a memory-efficient self-stabilizing BFS spanning tree construction (Q2697434) (← links)
- SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS (Q2735236) (← links)
- (Q2766877) (← links)
- Self-Stabilizing Prefix Tree Based Overlay Networks (Q2833545) (← links)
- SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS (Q2997926) (← links)
- (Q3026354) (← links)
- On Self-stabilizing Search Trees (Q3524295) (← links)
- Self-stabilizing Space Optimal Synchronization Algorithms on Trees (Q3613662) (← links)
- Synthesis of a Class of Deadlock-Free Petri Nets (Q3766868) (← links)
- (Q3792228) (← links)
- (Q3792295) (← links)
- Two-phase deadlock detection algorithm (Q3809242) (← links)
- (Q4021772) (← links)
- (Q4037413) (← links)
- A self‐stabilizing token‐based <i>k</i>‐out‐of‐ℓ exclusion algorithm (Q4432745) (← links)
- (Q4457223) (← links)
- (Q4457224) (← links)
- (Q4483914) (← links)
- Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge (Q4598937) (← links)
- (Q4621130) (← links)
- (Q4813102) (← links)
- (Q4813138) (← links)
- Linear Time Distributed Swap Edge Algorithms (Q4924643) (← links)
- Self-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs (Q5045430) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- (Q5091108) (← links)
- (Q5091109) (← links)
- Self-stabilizing multi-token rings (Q5136988) (← links)
- Self-stabilizing depth-first token circulation in arbitrary rooted networks (Q5137905) (← links)
- RANDOMIZED MOBILE AGENT BASED ROUTING IN WIRELESS NETWORKS (Q5249264) (← links)
- Snap-Stabilizing Optimal Binary Search Tree (Q5307029) (← links)
- Maximum Matching for Anonymous Trees with Constant Space per Process (Q5363807) (← links)
