Space Efficient Data Structures for Nearest Larger Neighbor. - Varunkumar Jayapaul; Seungbum Jo; Venkatesh Raman 001; Srinivasa Rao Satti (IWOCA, 2014)

Sorting and Selection with Equality Comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; Srinivasa Rao Satti (WADS, 2015)

Finding Mode Using Equality Comparisons. - Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (WALCOM, 2016)

Space efficient data structures for nearest larger neighbor. - Varunkumar Jayapaul; Seungbum Jo; Rajeev Raman; Venkatesh Raman 001; Srinivasa Rao Satti (J. Discrete Algorithms, 2016)

Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001 (CALDAM, 2017)

The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (FAW, 2017)

Finding modes with equality comparisons. - Varunkumar Jayapaul; J. Ian Munro; Venkatesh Raman 001; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2017)

Minimum Transactions Problem. - Niranka Banerjee; Varunkumar Jayapaul; Srinivasa Rao Satti (COCOON, 2018)

Locality. - John Iacono; Varunkumar Jayapaul; Ben Karsin (CoRR, 2019)

Elusiveness of finding degrees. - Dishant Goyal; Varunkumar Jayapaul; Venkatesh Raman 001 (Discret. Appl. Math., 2020)

Locality-of-Reference Optimality of Cache-Oblivious Algorithms. - Peyman Afshani; John Iacono; Varunkumar Jayapaul; Ben Karsin; Nodari Sitchinava (APOCS, 2022)

Finding kings in tournaments. - Arindam Biswas 001; Varunkumar Jayapaul; Venkatesh Raman 001; Srinivasa Rao Satti (Discret. Appl. Math., 2022)

Energy efficient sorting, selection and searching. - Varunkumar Jayapaul; Seungbum Jo; Krishna V. Palem; Srinivasa Rao Satti (Theor. Comput. Sci., 2024)