Browse by Author

Conference Paper

Patil, V and Nair, V and Ghalme, G and Khan, A (2023) Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits. In: International Joint Conference on Artificial Intelligence, IJCAI 2023, 19 - 25 August 2023, Macao, pp. 4100-4108.

Ghalme, G and Nair, V and Patil, V and Zhou, Y (2022) Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, 9 - 13 May 2022, Virtual, Online at Auckland, pp. 525-533.

Murthy, J and Nair, V and Saha, C (2020) Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, 25-26 August 2020, Prague; Czech Republic.

Patil, V and Ghalme, G and Nair, V and Narahari, Y (2020) Achieving fairness in the stochastic multi-armed bandit problem. In: 34th AAAI Conference on Artificial Intelligence, AAAI 2020, 7 February - 12 February 2020, pp. 5379-5386.

Journal Article

Kayal, N and Nair, V and Saha, C (2020) Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth-three circuits. In: ACM Transactions on Computation Theory, 12 (1).

Kayal, N and Nair, V and Saha, C and Tavenas, S (2018) Reconstruction of full rank algebraic branching programs. In: ACM Transactions on Computation Theory, 11 (1).

Kayal, N and Nair, V and Saha, C and Tavenas, S (2017) Reconstruction of full rank algebraic branching programs. In: Leibniz International Proceedings in Informatics, LIPIcs, 79 (1).