The following pages link to Aniket Murhekar (Q2151239):
Displaying 5 items.
- Automated recurrence analysis for almost-linear expected-runtime bounds (Q2151240) (← links)
- Computing fair and efficient allocations with few utility values (Q2670939) (← links)
- Near-Optimal Complexity Bounds for Fragments of the Skolem Problem (Q5874310) (← links)
- (Q6146250) (← links)
- Computing fair and efficient allocations with few utility values (Q6159026) (← links)