Pankaj K. Agarwal

Pankaj Kumar Agarwal is an Indian computer scientist and mathematician researching algorithms in computational geometry and related areas. He is the RJR Nabisco Professor of Computer Science and Mathematics at Duke University, where he has been chair of the computer science department since 2004.[1] He obtained his Doctor of Philosophy (Ph.D.) in computer science in 1989 from the Courant Institute of Mathematical Sciences, New York University, under the supervision of Micha Sharir.[2]

Professor

Pankaj Kumar Agarwal

Ph.D.
EducationPh.D., Courant Institute (1989)
AwardsFellow, Association for Computing Machinery, 2002
Scientific career
FieldsComputer science
Mathematics
InstitutionsDuke University
Doctoral advisorMicha Sharir
InfluencesMicha Sharir

Books

Agarwal is the author or co-author of:

  • Intersection and Decomposition Algorithms for Planar Arrangements (Cambridge University Press, 1991, ISBN 978-0-521-40446-4). The topics of this book are algorithms for, and the combinatorial geometry of, arrangements of lines and arrangements of more general types of curves in the Euclidean plane and the real projective plane. The topics covered in this monograph include Davenport–Schinzel sequences and their application to the complexity of single cells in arrangements, levels in arrangements, algorithms for building arrangements in part or in whole, and ray shooting in arrangements.[3]
  • Davenport–Schinzel Sequences and Their Geometric Applications (with Micha Sharir, Cambridge University Press, 1995, ISBN 978-0-521-47025-4). This book concerns Davenport–Schinzel sequences, sequences of symbols drawn from a given alphabet with the property that no subsequence of more than some finite length consists of two alternating symbols. As the book discusses, these sequences and combinatorial bounds on their length have many applications in combinatorial and computational geometry, including bounds on lower envelopes of sets of functions, single cells in arrangements, shortest paths, and dynamically-changing geometric structures.[4]
  • Combinatorial Geometry (with János Pach, Wiley, 1995, ISBN 978-0-471-58890-0). This book, less specialized than the prior two, is split into two sections. The first, on packing and covering problems, includes topics such as Minkowski's theorem, sphere packing, the representation of planar graphs by tangent circles, the planar separator theorem. The second section, although mainly concerning arrangements, also includes topics from extremal graph theory, Vapnik–Chervonenkis dimension, and discrepancy theory.[5]

Awards and honors

Agarwal was elected as a fellow of the Association for Computing Machinery in 2002.[6] He is also former Duke Bass Fellow[7] and an Alfred P. Sloan Fellow. He was the recipient of a National Young Investigator Award in 1993. Before holding the RJR Nabisco Professorship, he was the Earl D. Mclean Jr. Professor of Computer Science at Duke.[7]

gollark: ++link apionet #a
gollark: Thusly, none are safe.
gollark: We are now switching over to AutoBotRobotous systems.
gollark: Only 700 at most.
gollark: Amazing!

References
  1. "Pankaj Agarwal: New Chair of the Computer Science Department", Duke Computer Science Enews, September 2004.
  2. Pankaj Kumar Agarwal at the Mathematics Genealogy Project.
  3. Review of Intersection and Decomposition Algorithms for Planar Arrangements by Franz Aurenhammer, 1992, MR1118839.
  4. Review of Davenport–Schinzel Sequences and their Geometric Applications by Igor Rivin, 1996, MR1329734.
  5. Review of Combinatorial Geometry by Martin Henk, 1996, MR1354145.
  6. ACM Fellows Award: Pankaj K. Agarwal, ACM, retrieved 2011-01-16.
  7. "Seats of Learning", Duke University Alumni Magazine, 28, May–June 2000.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.