Computing Bits of Algebraic Numbers. - Samir Datta; Rameshwar Pratap (TAMC, 2012)

Testing uniformity of stationary distribution. - Sourav Chakraborty 001; Akshay Kamath; Rameshwar Pratap (CTW, 2013)

Frequent-Itemset Mining Using Locality-Sensitive Hashing. - Debajyoti Bera; Rameshwar Pratap (COCOON, 2016)

Similarity preserving compressions of high dimensional sparse data. - Raghav Kulkarni; Rameshwar Pratap (CoRR, 2016)

Faster coreset construction for subspace and projective clustering. - Rameshwar Pratap; Sandeep Sen (CoRR, 2016)

Testing whether the uniform distribution is a stationary distribution. - Sourav Chakraborty 001; Akshay Kamath; Rameshwar Pratap (Inf. Process. Lett., 2016)

A Faster Sampling Algorithm for Spherical k-means. - Rameshwar Pratap; Anup Anand Deshmukh; Pratheeksha Nair; Tarun Dutt (ACML, 2018)

Efficient Dimensionality Reduction for Sparse Binary Data. - Rameshwar Pratap; Raghav Kulkarni; Ishan Sohony (IEEE BigData, 2018)

Ensemble learning for credit card fraud detection. - Ishan Sohony; Rameshwar Pratap; Ullas Nambiar (COMAD/CODS, 2018)

Faster Coreset Construction for Projective Clustering via Low-Rank Approximation. - Rameshwar Pratap; Sandeep Sen (IWOCA, 2018)

Efficient Compression Technique for Sparse Sets. - Rameshwar Pratap; Ishan Sohony; Raghav Kulkarni (PAKDD (3), 2018)

Helly-Type Theorems in Property Testing. - Sourav Chakraborty 001; Rameshwar Pratap; Sasanka Roy; Shubhangi Saraf (Int. J. Comput. Geom. Appl., 2018)

Efficient Sketching Algorithm for Sparse Binary Data. - Rameshwar Pratap; Debajyoti Bera; Karthik Revanuru (ICDM, 2019)

Scaling up Simhash. - Rameshwar Pratap; Anup Anand Deshmukh; Pratheeksha Nair; Anirudh Ravi (ACML, 2020)

Randomness Efficient Feature Hashing for Sparse Binary Data. - Rameshwar Pratap; Karthik Revanuru; Anirudh Ravi; Raghav Kulkarni (ACML, 2020)

Efficient Compression Algorithm for Multimedia Data. - Rameshwar Pratap; Karthik Revanuru; Anirudh Ravi; Raghav Kulkarni (BigMM, 2020)

Subspace Approximation with Outliers. - Amit Deshpande 001; Rameshwar Pratap (COCOON, 2020)

IHashNet: Iris Hashing Network based on efficient multi-index hashing. - Avantika Singh; Pratyush Gaurav; Chirag Vashist; Aditya Nigam; Rameshwar Pratap (IJCB, 2020)

Robust k-means++. - Amit Deshpande 001; Praneeth Kacham; Rameshwar Pratap (UAI, 2020)

Improving Tug-of-War sketch using Control-Variates method. - Rameshwar Pratap; Bhisham Dev Verma; Raghav Kulkarni (ACDA, 2021)

Improving Hashing Algorithms for Similarity Search extitvia MLE and the Control Variates Trick. - Keegan Kang; Sergey Kushnarev; Wong Wei Pin; Rameshwar Pratap; Haikal Yeo; Yijia Chen (ACML, 2021)

Feature Hashing with Insertion and Deletion of Features. - Rameshwar Pratap; Suryakant Bhardwaj; Hrushikesh Sudam Sarode; Raghav Kulkarni (IEEE BigData, 2021)

Variance reduction in frequency estimators via control variates method. - Rameshwar Pratap; Raghav Kulkarni (UAI, 2021)

On Subspace Approximation and Subset Selection in Fewer Passes by MCMC Sampling. - Amit Deshpande 001; Rameshwar Pratap (CoRR, 2021)

Sampling-based dimension reduction for subspace approximation with outliers. - Amit Deshpande 001; Rameshwar Pratap (Theor. Comput. Sci., 2021)

One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation. - Amit Deshpande 001; Rameshwar Pratap (ICALP, 2022)

Improving sign-random-projection via count sketch. - Punit Pankaj Dubey; Bhisham Dev Verma; Rameshwar Pratap; Keegan Kang (UAI, 2022)

Improving textit{Tug-of-War} sketch using Control-Variates method. - Rameshwar Pratap; Bhisham Dev Verma; Raghav Kulkarni (CoRR, 2022)

Efficient binary embedding of categorical data using BinSketch. - Bhisham Dev Verma; Rameshwar Pratap; Debajyoti Bera (Data Min. Knowl. Discov., 2022)

On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. - Eric Allender; Nikhil Balaji; Samir Datta; Rameshwar Pratap (Electron. Colloquium Comput. Complex., 2022)

Variance reduction in feature hashing using MLE and control variate method. - Bhisham Dev Verma; Rameshwar Pratap; Manoj Thakur (Mach. Learn., 2022)

Towards obtaining SEP via Orthogonality of Projection Matrix in massive MIMO Networks. - Gopal Chamarthi; Adarsh Patel; Rameshwar Pratap (ANTS, 2023)

Minwise-Independent Permutations with Insertion and Deletion of Features. - Rameshwar Pratap; Raghav Kulkarni (SISAP, 2023)

Random Projection Based Efficient Detector in Massive MIMO Communication Networks. - Gopal Chamarthi; Adarsh Patel; Rameshwar Pratap (SPAWC, 2023)

Improved Outlier Robust Seeding for k-means. - Amit Deshpande 001; Rameshwar Pratap (CoRR, 2023)

QUINT: Node Embedding Using Network Hashing. - Debajyoti Bera; Rameshwar Pratap; Bhisham Dev Verma; Biswadeep Sen; Tanmoy Chakraborty 002 (IEEE Trans. Knowl. Data Eng., 2023)

Dimensionality Reduction for Categorical Data. - Debajyoti Bera; Rameshwar Pratap; Bhisham Dev Verma (IEEE Trans. Knowl. Data Eng., 2023)

One-Pass Additive-Error Subset Selection for ℓ p Subspace Approximation and (k, p)-Clustering. - Amit Deshpande 001; Rameshwar Pratap (Algorithmica, 2023)

Sparsifying Count Sketch. - Bhisham Dev Verma; Rameshwar Pratap; Punit Pankaj Dubey (Inf. Process. Lett., 2024)

Unbiased estimation of inner product via higher order count sketch. - Bhisham Dev Verma; Rameshwar Pratap; Manoj Thakur (Inf. Process. Lett., 2024)

Improving compressed matrix multiplication using control variate method. - Bhisham Dev Verma; Punit Pankaj Dubey; Rameshwar Pratap; Manoj Thakur (Inf. Process. Lett., 2025)

Faster and space efficient indexing for locality sensitive hashing. - Bhisham Dev Verma; Rameshwar Pratap (Theor. Comput. Sci., 2025)

Improving LSH via tensorized random projection. - Bhisham Dev Verma; Rameshwar Pratap (Acta Informatica, 2025)