Parents
Sign in to add mentor| Donald Ford Stanat | grad student | 1976 | UNC Chapel Hill | |
| (Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bentley JL, Fernandez MF, Kernighan BW, et al. (1993) Template-driven interfaces for numerical subroutines Acm Transactions On Mathematical Software. 19: 265-287 |
| Bentley J. (1987) Programming pearls: profilers Communications of the Acm. 30: 587-592 |
| Bentley J. (1985) Programming pearls: selection Communications of the Acm. 28: 1121-1127 |
| Bentley J. (1985) Programming pearls: confessions of a coder Communications of the Acm. 28: 671-679 |
| Bentley J. (1985) Programming pearls: associative arrays Communications of the Acm. 28: 570-576 |
| Bentley J. (1985) Programming pearls: a spelling checker Communications of the Acm. 28: 456-462 |
| Bentley J. (1985) Programming pearls: thanks, heaps Communications of the Acm. 28: 245-250 |
| Bentley J. (1985) Programming pearls: tricks of the trade Communications of the Acm. 28: 138-141 |
| Bentley JL. (1984) Programming Perls Communications of the Acm. 27: 12-13 |
| Bentley J. (1984) Programming pearls: algorithm design techniques Communications of the Acm. 27: 865-873 |