On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources. - Umang Bhaskar; A. R. Sricharan; Rohit Vaish (APPROX-RANDOM, 2021)

Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. - Monika Henzinger; Ami Paz; A. R. Sricharan (ESA, 2022)

Differentially Private Data Structures under Continual Observation for Histograms and Related Queries. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (CoRR, 2023)

Differentially Private Histogram, Predecessor, and Set Cardinality under Continual Observation. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (CoRR, 2023)

Completely Mixed Discounted Bistochastic Games. - Thiruvankatachari Parthasarathy; Gomatam Ravindran; A. R. Sricharan (IGTR, 2023)

Private Counting of Distinct Elements in the Turnstile Model and Extensions. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (APPROX/RANDOM, 2024)

Electrical Flows for Polylogarithmic Competitive Oblivious Routing. - Gramoz Goranci; Monika Henzinger; Harald Räcke; Sushant Sachdeva; A. R. Sricharan (ITCS, 2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph. - Monika Henzinger; A. R. Sricharan; Leqi Zhu (CoRR, 2024)

Differentially Private Continual Release of Histograms and Related Queries. - Monika Henzinger; A. R. Sricharan; Teresa Anna Steiner (AISTATS, 2025)

Incremental Approximate Maximum Flow via Residual Graph Sparsification. - Gramoz Goranci; Monika Henzinger; Harald Räcke; A. R. Sricharan (ICALP, 2025)

Connected equitable cake division via Sperner's lemma. - Umang Bhaskar; A. R. Sricharan; Rohit Vaish (Inf. Process. Lett., 2025)