Rate My Professor Ankur Gupta

His research focuses on designing algorithms that compress large volumes of data while enabling efficient search operations, with relevance to Big Data and search technologies. Gupta has also pursued work on Artificial Wisdom, exploring the concept from a computational perspective with funding from the John Templeton Foundation. His expertise spans C++, data compression, Big Data, data science, Linux, algorithms, parallel programming, game design, discrete mathematics, artificial intelligence, genetic algorithms, and statistical analysis. Prominent publications include "High-order entropy-compressed text indexes" (Grossi, Gupta, Vitter, 2003), "When indexing equals compression: experiments with compressing suffix arrays and applications" (Grossi, Gupta, Vitter, 2004), "Compressed data structures: Dictionaries and data-aware measures" (Gupta, Hon, Shah, Vitter, 2007), "On the size of succinct indices" (Golynski, Grossi, Gupta, Raman, Rao, 2007), and "Near-optimal online multiselection in internal and external memory" (Barbay, Gupta, Satti, Sorenson, Rao, 2016). These contributions have significantly influenced the field of theoretical computer science, particularly in succinct data structures and compressed indexing, as reflected in their high citation counts.