| Space efficient data structures for nearest larger neighbor V Jayapaul, S Jo, R Raman, V Raman, SR Satti Journal of Discrete Algorithms 36, 63-75, 2016 | 11 | 2016 |
| Elusiveness of finding degrees D Goyal, V Jayapaul, V Raman Discrete Applied Mathematics 286, 128-139, 2020 | 10 | 2020 |
| Improved bounds for poset sorting in the forbidden-comparison regime A Biswas, V Jayapaul, V Raman Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 10 | 2017 |
| Sorting and selection with equality comparisons V Jayapaul, JI Munro, V Raman, SR Satti Workshop on Algorithms and Data Structures, 434-445, 2015 | 8 | 2015 |
| Finding kings in tournaments A Biswas, V Jayapaul, V Raman, SR Satti Discrete Applied Mathematics 322, 240-252, 2022 | 5 | 2022 |
| The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments A Biswas, V Jayapaul, V Raman, SR Satti International Workshop on Frontiers in Algorithmics, 22-33, 2017 | 4 | 2017 |
| Finding mode using equality comparisons V Jayapaul, V Raman, SR Satti WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016 …, 2016 | 2 | 2016 |
| Energy efficient sorting, selection and searching V Jayapaul, S Jo, KV Palem, SR Satti Theoretical Computer Science 1002, 114592, 2024 | | 2024 |
| Minimum Transactions Problem N Banerjee, V Jayapaul, SR Satti International Computing and Combinatorics Conference, 650-661, 2018 | | 2018 |
| SORTING AND SELECTION IN RESTRICTED MODELS V Jayapaul Chennai Mathematical Institute, 2017 | | 2017 |