Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Callahan, Paul B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Output-sensitive generation of random events
Paul B. Callahan
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 374-383
A decomposition of multidimensional point sets with applications to
k
-nearest-neighbors and
n
-body potential fields
Paul B. Callahan
,
S. Rao Kosaraju
Journal of the ACM
42
(1), 1995, pp. 67-90
Algorithms for dynamic closest pair and
n
-body potential fields
Paul B. Callahan
,
S. Rao Kosaraju
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 263-272
Faster algorithms for some geometric graph problems in higher dimensions
Paul B. Callahan
,
S. Rao Kosaraju
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 291-300
Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
Paul B. Callahan
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 332-340
A decomposition of multi-dimensional point-sets with applications to
k
-nearest-neighbors and
n
-body potential fields
Paul B. Callahan
,
S. Rao Kosaraju
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 546-556