The following pages link to Anamitra R. Choudhury (Q693073):
Displaying 11 items.
- Efficient decentralized algorithms for the distributed trigger counting problem (Q693074) (← links)
- Improved algorithms for resource allocation under varying capacity (Q1617284) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- Rejecting jobs to minimize load and maximum flow-time (Q2409575) (← links)
- A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints (Q2908848) (← links)
- Improved Algorithms for Resource Allocation under Varying Capacity (Q2921407) (← links)
- Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers (Q2963918) (← links)
- Knapsack Cover Subject to a Matroid Constraint (Q2963920) (← links)
- Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. (Q5278307) (← links)
- Rejecting jobs to Minimize Load and Maximum Flow-time (Q5363003) (← links)