| |
| 2005 | ||
|---|---|---|
| 7 | EE | David Pearson: A polynomial-time algorithm for the change-making problem. Oper. Res. Lett. 33(3): 231-234 (2005) |
| 2003 | ||
| 6 | EE | Chip Elliott, David Pearson, Gregory Troxel: Quantum cryptography in practice. SIGCOMM 2003: 227-238 |
| 1995 | ||
| 5 | Benjamin Hao, David Pearson: Instruction Scheduling and Global Register Allocation for SIMD Multiprocessors. IRREGULAR 1995: 81-86 | |
| 1994 | ||
| 4 | Richard Johnson, David Pearson, Keshav Pingali: The Program Structure Tree: Computing Control Regions in Linear Time. PLDI 1994: 171-185 | |
| 1993 | ||
| 3 | David Pearson, Vijay V. Vazirani: Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. J. Algorithms 14(2): 171-179 (1993) | |
| 1990 | ||
| 2 | David Pearson, Vijay V. Vazirani: A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS 1990: 225-231 | |
| 1 | David Pearson, S. Unnikrishna Pillai, YoungJik Lee: An algorithm for near-optimal placement of sensor elements. IEEE Transactions on Information Theory 36(6): 1280-1284 (1990) | |
| 1 | Chip Elliott | [6] |
| 2 | Benjamin Hao | [5] |
| 3 | Richard Johnson | [4] |
| 4 | YoungJik Lee | [1] |
| 5 | S. Unnikrishna Pillai | [1] |
| 6 | Keshav Pingali | [4] |
| 7 | Gregory Troxel | [6] |
| 8 | Vijay V. Vazirani | [2] [3] |