Paul B. Callahan

According to our database, Paul B. Callahan authored at least 9 papers between 1992 and 1998.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1998

Tight Bounds on Periodic Cell Configurations in Life.

David Buckingham, Paul B. Callahan

Exp. Math., 1998

Output-Sensitive Generation of Random Events.

Paul B. Callahan

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1995

A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields.

Paul B. Callahan, S. Rao Kosaraju

J. ACM, 1995

Topology B-Trees and Their Applications.

Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Algorithms for Dynamic Closest Pair and n-Body Potential Fields.

Paul B. Callahan, S. Rao Kosaraju

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1993

P-complete geometric problems.

Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich

Int. J. Comput. Geom. Appl., 1993

Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions.

Paul B. Callahan, S. Rao Kosaraju

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)

Paul B. Callahan

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version)

Paul B. Callahan, S. Rao Kosaraju

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992