all author orderings were once revealed to me in a dream.
Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
Electrical Flows for Polylogarithmic Competitive Oblivious Routing
Completely Mixed Discounted Bistochastic Games
with T Parthasarathy and G Ravindran
Differentially Private Data Structures under Continual Observation for Histograms and Related Queries
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Completely Mixed Bimatrix Games
with T Parthasarathy and Vasudha Sharma