Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco 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

Agarwal, PK, Cormode, G, Huang, Z, Phillips, J, Wei, Z, and Yi, K. "Mergeable summaries." Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems (June 26, 2012): 23-34. Full Text

Agarwal, PK, Cheng, S-W, and Yi, K. "Range searching on uncertain data." ACM Transactions on Algorithms 8.4 (2012). Full Text

Agarwal, PK, Ezra, E, and Sharir, M. "Near-linear approximation algorithms for geometric hitting sets." Algorithmica 63.1-2 (2012): 1-25. Full Text

Yu, A, Agarwal, PK, and Yang, J. "Subscriber assignment for wide-area content-based publish/subscribe." IEEE Transactions on Knowledge and Data Engineering 24.10 (2012): 1833-1847. Full Text

Yu, A, Agarwal, PK, and Yang, J. "Processing and notifying range top-k subscriptions." Proceedings - International Conference on Data Engineering (2012): 810-821. Full Text

Yu, A, Agarwal, PK, and Yang, J. "Processing a large number of continuous preference top-k queries." Proceedings of the ACM SIGMOD International Conference on Management of Data (2012): 397-408. Full Text

Sharathkumar, R, and Agarwal, PK. "A near-linear time ε-approximation algorithm for geometric bipartite matching." Proceedings of the Annual ACM Symposium on Theory of Computing (2012): 385-394. Full Text

Agarwal, PK, Efrat, A, Sankararaman, S, and Zhang, W. "Nearest-neighbor searching under uncertainty." Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2012): 225-236. Full Text

Agarwal, PK, Arge, L, Kaplan, H, Molad, E, Tarjan, RE, and Yi, K. "An optimal dynamic data structure for stabbing-semigroup queries." SIAM Journal on Computing 41.1 (2012): 104-127. Full Text

Sharathkumar, R, and Agarwal, PK. "Algorithms for the transportation problem in geometric settings." Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2012): 306-317.

Pages

Agarwal, PK, Arge, L, and Vahrenhold, J. "Time Responsive External Data Structures for Moving Points." Springer, 2001. Full Text

Agarwal, PK, Berg, MD, Har-Peled, S, Overmars, MH, Sharir, M, and Vahrenhold, J. "Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions." Springer, 2001. Full Text

Agarwal, PK, Guibas, LJ, Har-Peled, S, Rabinovitch, A, and Sharir, M. "Computing the penetration depth of two convex polytopes in 3d." January 1, 2000. Full Text

Agarwal, PK, Flato, E, and Halperin, D. "Polygon Decomposition for Efficient Construction of Minkowski Sums." Springer, 2000. Full Text

Agarwal, PK, Bhattacharya, BK, and Sen, S. "Output-sensitive algorithms for uniform partitions of points." January 1, 1999. Full Text

Murali, TM, Agarwal, PK, and Vitter, JS. "Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice." Springer, 1998. Full Text

Agarwal, PK, Guibas, LJ, Hershberger, J, and Veach, E. "Maintaining the Extent of a Moving Point Set." Springer, 1997. Full Text

Agarwal, PK, Berg, MD, Halperin, D, and Sharir, M. "Efficient Generation of k-Directional Assembly Sequences." ACM/SIAM, 1996.

Pages