Dynamic Rank-Maximal Matchings. - Prajakta Nimbhorkar; V Arvind Rameshwar 001 (COCOON, 2017)

On Maximally Recoverable Codes for Product Topologies. - D. Shivakrishna; V Arvind Rameshwar 001; V. Lalitha 001; Birenjith Sasidharan (CoRR, 2018)

Achieving Secrecy Capacity of Minimum Storage Regenerating Codes for all Feasible (n, k, d) Parameter Values. - V Arvind Rameshwar 001; Navin Kashyap (NCC, 2019)

Dynamic rank-maximal and popular matchings. - Prajakta Nimbhorkar; V Arvind Rameshwar 001 (J. Comb. Optim., 2019)

Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2020)

On the Capacity of the Flash Memory Channel with Feedback. - V Arvind Rameshwar 001; Aryabhatt M. Reghu; Navin Kashyap (ISITA, 2020)

Bounds on the Feedback Capacity of the ($d, infty$)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2021)

Bounds on the Feedback Capacity of the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (CoRR, 2021)

On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2022)

Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels. - V Arvind Rameshwar 001; Navin Kashyap (ITW, 2022)

A Feedback Capacity-Achieving Coding Scheme for the (d, ∞)-RLL Input-Constrained Binary Erasure Channel. - V Arvind Rameshwar 001; Navin Kashyap (SPCOM, 2022)

A Version of Delsarte's Linear Program for Constrained Systems. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2023)

Counting Constrained Codewords in Binary Linear Codes via Fourier Expansions. - V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2023)

Estimating the Sizes of Binary Error-Correcting Constrained Codes. - V Arvind Rameshwar 001; Navin Kashyap (IEEE J. Sel. Areas Inf. Theory, 2023)

Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels. - V Arvind Rameshwar 001; Navin Kashyap (IEEE Trans. Inf. Theory, 2023)

Estimating the Weight Enumerators of Reed-Muller Codes via Sampling. - Shreyas Jain; V Arvind Rameshwar 001; Navin Kashyap (ISIT, 2024)

Information Rates Over DMCs with Many Independent Views. - V Arvind Rameshwar 001; Nir Weinberger (ISIT, 2024)

On the Expected Number of Views Required for Fixed-Error Sequence Reconstruction. - Vivian Papadopoulou; V Arvind Rameshwar 001; Antonia Wachter-Zeh (ITW, 2024)

Sampling-Based Estimates of the Sizes of Constrained Subcodes of Reed-Muller Codes. - V Arvind Rameshwar 001; Shreyas Jain; Navin Kashyap (NCC, 2024)

Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets. - Prajjwal Gupta; V Arvind Rameshwar 001; Anshoo Tandon; Novoneel Chakraborty (SPCOM, 2024)

Mean Estimation with User-Level Privacy for Spatio-Temporal IoT Datasets. - V Arvind Rameshwar 001; Anshoo Tandon; Prajjwal Gupta; Novoneel Chakraborty; Abhay Sharma (CoRR, 2024)

Improving the Privacy Loss Under User-Level DP Composition for Fixed Estimation Error. - V Arvind Rameshwar 001; Anshoo Tandon (CoRR, 2024)

An Upper Bound on the Error Probability of RPA Decoding of Reed-Muller Codes Over the BSC. - V Arvind Rameshwar 001; V. Lalitha 001 (CoRR, 2024)

Optimal Tree-Based Mechanisms for Differentially Private Approximate CDFs. - V Arvind Rameshwar 001; Anshoo Tandon; Abhay Sharma (COMSNETS, 2025)

On Achievable Rates Over Noisy Nanopore Channels. - V Arvind Rameshwar 001; Nir Weinberger (CoRR, 2025)

Bounding User Contributions for User-Level Differentially Private Mean Estimation. - V Arvind Rameshwar 001; Anshoo Tandon (CoRR, 2025)

Information Rates Over Multi-View Channels. - V Arvind Rameshwar 001; Nir Weinberger (IEEE Trans. Inf. Theory, 2025)

(ℓ,δ)-Diversity: Linkage-Robustness via a Composition Theorem. - V Arvind Rameshwar 001; Anshoo Tandon (CoRR, 2025)