2002 - ACM Fellow For contributions to computational geometry and for building and strengthening links between this area and many of its applications.
1996 - Fellow of Alfred P. Sloan Foundation
Pankaj K. Agarwal mainly investigates Combinatorics, Discrete mathematics, Algorithm, Computational geometry and Set. Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Plane. His studies deal with areas such as Rectangle, Ball, Interval, Euclidean geometry and Point as well as Discrete mathematics.
Pankaj K. Agarwal interconnects Experimental data, Extrapolation, Data structure and Consistency in the investigation of issues within Algorithm. His study in Set is interdisciplinary in nature, drawing from both Data mining and Index. His Heuristics research includes themes of Genetics and Computational biology.
His primary scientific interests are in Combinatorics, Discrete mathematics, Set, Algorithm and Data structure. His Combinatorics study frequently draws parallels with other fields, such as Plane. His studies in Discrete mathematics integrate themes in fields like Rectangle and Constant.
He combines subjects such as Range, Point and Space with his study of Set. The Data structure study combines topics in areas such as Computational geometry and Theoretical computer science. Pankaj K. Agarwal performs multidisciplinary study on Randomized algorithm and Running time in his works.
The scientist’s investigation covers issues in Combinatorics, Set, Data structure, Point and Time complexity. His research on Combinatorics frequently links to adjacent areas such as Kinetic data structure. His Set research is multidisciplinary, relying on both Range, Algorithm, Tuple and Cluster analysis.
His Data structure study combines topics from a wide range of disciplines, such as Computational geometry and Terrain. His Point study incorporates themes from Discrete mathematics, Dynamic time warping, Shortest path problem, k-nearest neighbors algorithm and Rectangle. His Time complexity research incorporates elements of Complement and Metric space.
Pankaj K. Agarwal spends much of his time researching Combinatorics, Set, Algorithm, Approximation algorithm and Data structure. Pankaj K. Agarwal has included themes like Rectangle, Upper and lower bounds and Metric in his Combinatorics study. The study incorporates disciplines such as Cluster analysis, Data mining and Greedy algorithm in addition to Set.
The concepts of his Algorithm study are interwoven with issues in Prior probability and Markov chain. The study incorporates disciplines such as Probability distribution and Theory of computation in addition to Approximation algorithm. Pankaj K. Agarwal focuses mostly in the field of Data structure, narrowing it down to matters related to Computational geometry and, in some cases, Simplex, Series and Family of sets.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Initial sequencing and comparative analysis of the mouse genome.
Robert H. Waterston;Kerstin Lindblad-Toh;Ewan Birney;Jane Rogers.
Nature (2002)
Davenport-Schinzel sequences and their geometric applications
Micha Sharir;Pankaj K. Agarwal.
(1995)
Simplification envelopes
Jonathan Cohen;Amitabh Varshney;Dinesh Manocha;Greg Turk.
international conference on computer graphics and interactive techniques (1996)
Geometric Range Searching and Its Relatives
Pankaj K. Agarwal;Je Erickson.
(2007)
Exact and Approximation Algorithms for Clustering
P. K. Agarwal;C. M. Procopiuc.
Algorithmica (2002)
A Monte Carlo algorithm for fast projective clustering
Cecilia M. Procopiuc;Michael Jones;Pankaj K. Agarwal;T. M. Murali.
international conference on management of data (2002)
The resilience of WDM networks to probabilistic geographical failures
Pankaj K. Agarwal;Alon Efrat;Shashidhara K. Ganjugunte;David Hay.
IEEE ACM Transactions on Networking (2013)
Indexing moving points
Pankaj K. Agarwal;Lars Arge;Jeff Erickson.
Journal of Computer and System Sciences (2003)
Geometric Approximation via Coresets
P. K. Agarwal;S. Har-Peled;K. Varadarajan.
Combinatorial and Computational Geometry, 2007, ISBN 0-521-84862-8, págs. 1-30 (2007)
Ray shooting and parametric search
Pankaj K. Agarwal;Jiří Matoušek.
SIAM Journal on Computing (1993)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Tel Aviv University
New York University
Aarhus University
University of Illinois at Urbana-Champaign
University of California, Santa Barbara
Duke University
University of Iowa
Stanford University
Tel Aviv University
University of California, San Diego
University of Glasgow
Friedrich Schiller University Jena
South China University of Technology
Kansas State University
University of La Frontera
University of Geneva
Complutense University of Madrid
James Cook University
California Institute of Technology
University of Queensland
Stony Brook University
East Tennessee State University
University of Melbourne
Université Paris Cité
University of Western Ontario
Royal Holloway University of London