The following pages link to F. Frances Yao (Q914379):
Displaying 15 items.
- Efficient binary space partitions for hidden-surface removal and solid modeling (Q914380) (← links)
- Graph 2-isomorphism is NP-complete (Q1259902) (← links)
- (Q3138883) (← links)
- On Fault-Tolerant Networks for Sorting (Q3221416) (← links)
- Point retrieval for polygons (Q3777466) (← links)
- Partitioning Space for Range Queries (Q3830566) (← links)
- On the Optimality of Linear Merge (Q3891786) (← links)
- Information Bounds Are Weak in the Shortest Distance Problem (Q3930655) (← links)
- On the Average-Case Complexity of Selecting the <i>k</i>th Best (Q3947142) (← links)
- Speed-Up in Dynamic Programming (Q3958292) (← links)
- Optimal binary space partitions for orthogonal objects (Q3990617) (← links)
- Lower Bounds on Merging Networks (Q4102737) (← links)
- (Q4385512) (← links)
- On nearest-neighbor graphs (Q5204336) (← links)
- Finding the convex hull of a simple polygon (Q5896232) (← links)