Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
  • Professor of Computer Science
  • Chair of Computer Science
  • Professor of Mathematics (Secondary)
  • Faculty Network Member of The Energy Initiative
  • Bass Fellow
External address: D315 Lev Sci Res Ctr, Durham, NC 27708
Internal office address: Box 90129, Durham, NC 27708-0129
Phone: (919) 660-6548

Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.

Education & Training
  • Ph.D., New York University 1989

  • M.S., University of California at Santa Cruz 1986

  • B.S.E.E., Indian Institute of Technology (India) 1982

Govindarajan, S., et al. “CRB-tree: An efficient indexing scheme for range-aggregate queries.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2572, Dec. 2003, pp. 143–57.

Procopiuc, O., et al. “Bkd-tree: A dynamic scalable kd-tree.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2750, Dec. 2003, pp. 46–65.

Agarwal, P. K., et al. “Streaming geometric optimization using graphics hardware.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832, Dec. 2003, pp. 544–55.

Agarwal, P. K., et al. “I/O-efficient structures for orthogonal range-max and stabbing-max queries.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832, Dec. 2003, pp. 7–18.

Agarwal, P. K., et al. “A (1+ε)-approximation algorithm for 2-line-center.” Computational Geometry: Theory and Applications, vol. 26, no. 2, Oct. 2003, pp. 119–28. Scopus, doi:10.1016/S0925-7721(03)00017-8. Full Text

Agarwal, P. K., et al. “Cache-oblivious data structures for orthogonal range searching.” Proceedings of the Annual Symposium on Computational Geometry, July 2003, pp. 237–45.

Agarwal, P. K., et al. “Hausdorff distance under translation for points and balls.” Proceedings of the Annual Symposium on Computational Geometry, July 2003, pp. 282–91.

Agarwal, P. K., et al. “Indexing moving points.” Journal of Computer and System Sciences, vol. 66, no. 1, July 2003, pp. 207–43. Scopus, doi:10.1016/S0022-0000(02)00035-1. Full Text

Agarwal, P. K., and L. Arge. “Editorial.” Computational Geometry: Theory and Applications, vol. 24, no. 2, Feb. 2003. Scopus, doi:10.1016/S0925-7721(02)00090-1. Full Text

Agarwal, P. K., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Journal of Algorithms, vol. 46, no. 2, Jan. 2003, pp. 115–39. Scopus, doi:10.1016/S0196-6774(02)00295-X. Full Text

Pages