F. Frances Yao
From MaRDI portal
Person:914379
Available identifiers
zbMath Open yao.foong-francesWikidataQ16497 ScholiaQ16497MaRDI QIDQ914379
List of research outcomes
| Publication | Date of Publication | Type |
|---|---|---|
| On nearest-neighbor graphs | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385512 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138883 | 1994-01-02 | Paper |
| Optimal binary space partitions for orthogonal objects | 1992-06-28 | Paper |
| Efficient binary space partitions for hidden-surface removal and solid modeling | 1990-01-01 | Paper |
| Partitioning Space for Range Queries | 1989-01-01 | Paper |
| Point retrieval for polygons | 1986-01-01 | Paper |
| On Fault-Tolerant Networks for Sorting | 1985-01-01 | Paper |
| Finding the convex hull of a simple polygon | 1983-01-01 | Paper |
| On the Average-Case Complexity of Selecting the kth Best | 1982-01-01 | Paper |
| Speed-Up in Dynamic Programming | 1982-01-01 | Paper |
| On the Optimality of Linear Merge | 1980-01-01 | Paper |
| Information Bounds Are Weak in the Shortest Distance Problem | 1980-01-01 | Paper |
| Graph 2-isomorphism is NP-complete | 1979-01-01 | Paper |
| Lower Bounds on Merging Networks | 1976-01-01 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
| Property | Value |
|---|---|
| MaRDI profile type | MaRDI person profile |
| instance of | human |
This page was built for person: F. Frances Yao
