The following pages link to Algorithms and Data Structures (Q5900759):
Displaying 14 items.
- Around the circular law (Q431517) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- On realistic terrains (Q934023) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- Smooth discrimination analysis (Q1583889) (← links)
- Smoothed analysis of binary search trees (Q2371805) (← links)
- Smoothed complexity of convex hulls by witnesses and collectors (Q2970468) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- On percolation and ‐hardness (Q4633317) (← links)
- The Complexity of Problems in P Given Correlated Instances (Q4638062) (← links)
- The diameter of randomly perturbed digraphs and some applications (Q5297137) (← links)
- Smoothed complexity theory (Q5890963) (← links)