The following pages link to Shyan S. Akmal (Q497461):
Displaying 12 items.
- On a convex set with nondifferentiable metric projection (Q497462) (← links)
- (Q2046020) (redirect page) (← links)
- Quantifying controllability in temporal networks with uncertainty (Q2046026) (← links)
- (Q6126224) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- An Efficient Algorithm for All-Pairs Bounded Edge Connectivity (Q6492091) (← links)
- An enumerative perspective on connectivity (Q6545114) (← links)
- Near-optimal quantum algorithms for string problems (Q6575184) (← links)
- An efficient algorithm for all-pairs bounded edge connectivity (Q6638002) (← links)
- Faster detours in undirected graphs (Q6656945) (← links)
- A local-to-global theorem for congested shortest paths (Q6656946) (← links)
