| 1998 |
| 9 | | Paul B. Callahan:
Output-Sensitive Generation of Random Events.
SODA 1998: 374-383 |
| 1995 |
| 8 | | Paul B. Callahan,
S. Rao Kosaraju:
Algorithms for Dynamic Closest Pair and n-Body Potential Fields.
SODA 1995: 263-272 |
| 7 | | Paul B. Callahan,
Michael T. Goodrich,
Kumar Ramaiyer:
Topology B-Trees and Their Applications.
WADS 1995: 381-392 |
| 6 | EE | Paul B. Callahan,
S. Rao Kosaraju:
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields.
J. ACM 42(1): 67-90 (1995) |
| 1993 |
| 5 | | Paul B. Callahan:
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)
FOCS 1993: 332-340 |
| 4 | | Paul B. Callahan,
S. Rao Kosaraju:
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions.
SODA 1993: 291-300 |
| 3 | | Mikhail J. Atallah,
Paul B. Callahan,
Michael T. Goodrich:
P-complete geometric problems.
Int. J. Comput. Geometry Appl. 3(4): 443-462 (1993) |
| 1992 |
| 2 | | Paul B. Callahan,
S. Rao Kosaraju:
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version)
STOC 1992: 546-556 |
| 1990 |
| 1 | EE | Mikhail J. Atallah,
Paul B. Callahan,
Michael T. Goodrich:
P-Complete Geometric Problems.
SPAA 1990: 317-326 |