EDBT 2026 Demo / reviewers in the wild / expert

Paul B. Callahan

dblp:14/4170 · DBLP profile ↗
← Back
8ranked-venue papers
7as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
6 papers
Computational geometry · 55% Algorithms and data structures · 45%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Parallel and multicore computing · 100%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › numerical algorithms
n-body potential fields		 0.031995
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields · J. ACM 1995
Algorithms for Dynamic Closest Pair and n-Body Potential Fields · SODA 1995
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Algorithms and data structures › similarity search › nearest neighbor search
k-nearest neighbors		 0.021995
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields · J. ACM 1995
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Computational geometry › geometric decomposition
well-separated pair decomposition		 0.021995
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields · J. ACM 1995
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Computational geometry
output-sensitive algorithms		 0.011998
Output-Sensitive Generation of Random Events · SODA 1998
Computational geometry
proximity problems		 0.021993
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) · FOCS 1993
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Parallel and multicore computing
parallel algorithms		 0.031995
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) · FOCS 1993
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields · J. ACM 1995
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Algorithms and data structures
dynamic algorithms		 0.011995
Algorithms for Dynamic Closest Pair and n-Body Potential Fields · SODA 1995
Computational geometry › proximity problems
dynamic closest pair		 0.011995
Algorithms for Dynamic Closest Pair and n-Body Potential Fields · SODA 1995
Parallel and multicore computing › parallel algorithms
parallel geometric algorithms		 0.021993
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) · FOCS 1993
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Computational geometry › geometric graph
geometric graph algorithms		 0.011993
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions · SODA 1993
Algorithms and data structures › similarity search
nearest neighbor search		 0.011993
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version) · FOCS 1993
Computational geometry
geometric data structures		 0.011992
A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) · STOC 1992
Computational geometry › proximity problems
closest pair		 0.011995
Algorithms for Dynamic Closest Pair and n-Body Potential Fields · SODA 1995
Computational geometry
geometric graph		 0.011993
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions · SODA 1993

Methods — techniques the papers use, named apart from their topics

parallel algorithm · 0.0well-separated pair decomposition · 0.0
YearPublicationVenuePosition
1998 Output-Sensitive Generation of Random Events
Paul B. Callahan
 SODA1
1995 Algorithms for Dynamic Closest Pair and n-Body Potential Fields
Paul B. Callahan, S. Rao Kosaraju
 SODA1
1995 Topology B-Trees and Their Applications
Paul B. Callahan, Michael T. Goodrich, Kumar Ramaiyer
 WADS1
1995 A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields
abstract
We define the notion of a well-separated pair decomposition of points in d -dimensional space. We then develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k -nearest neighbors and n -body potential fields.
Paul B. Callahan, S. Rao Kosaraju
 J. ACM1
1993 Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)
abstract
We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in R/sup d/. We show how this leads to a deterministic optimal O(log n) time parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parallel algorithms.>
Paul B. Callahan
 FOCS1
1993 Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions
Paul B. Callahan, S. Rao Kosaraju
 SODA1
1992 A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version)
abstract
We define the notion of a well-separated pair decomposition of points in d-dimensional space. We develop efficient sequential and parallel algorithms for computing such a decomposition. We apply the resulting decomposition to the efficient computation of k-nearest neighbors and n-body potential fields.
Paul B. Callahan, S. Rao Kosaraju
 STOC1
1990 P-Complete Geometric Problems
abstract
Article P-complete geometric problems Share on Authors: M. Atallah Dept. of Computer Sciences, Purdue Univ., W. Lafayette, IN Dept. of Computer Sciences, Purdue Univ., W. Lafayette, INView Profile , P. Callahan Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MDView Profile , M. Goodrich Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MDView Profile Authors Info & Claims SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architecturesMay 1990 Pages 317–326https://doi.org/10.1145/97444.97699Online:01 May 1990Publication History 3citation312DownloadsMetricsTotal Citations3Total Downloads312Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich
 SPAA2