Harish Chandramouleeswaran
@harish1108.bsky.social
Ph. D. student in computer science at the Chennai Mathematical Institute.
Academic webpage: https://sites.google.com/view/harish-chandramouleeswaran
Academic webpage: https://sites.google.com/view/harish-chandramouleeswaran
Reposted by Harish Chandramouleeswaran
Paul G\"olz, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
Fair Allocation of Indivisible Goods with Variable Groups
https://arxiv.org/abs/2511.06218
Fair Allocation of Indivisible Goods with Variable Groups
https://arxiv.org/abs/2511.06218
November 11, 2025 at 6:30 AM
Paul G\"olz, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
Fair Allocation of Indivisible Goods with Variable Groups
https://arxiv.org/abs/2511.06218
Fair Allocation of Indivisible Goods with Variable Groups
https://arxiv.org/abs/2511.06218
Reposted by Harish Chandramouleeswaran
The SACT group at #USyd 🇦🇺 has a number of postdoc positions available (2+ years) in all areas of TCS, with one focusing on streaming and one on planning and synthesis. Expected start mid- or end 2026.
Excellent candidates are encouraged to contact us by email, or during #FOCS2025 #TCSSky
Excellent candidates are encouraged to contact us by email, or during #FOCS2025 #TCSSky
Sydney Algorithms and Computing Theory (SACT)
usyd-sact.github.io
November 11, 2025 at 12:12 AM
Reposted by Harish Chandramouleeswaran
🎉 Abigail Gentle (PhD student) and Clément Canonne's paper "Uniformity Testing under User-Level Local Privacy" has been accepted at #ITCS2026!
🔗 Paper: www.arxiv.org/abs/2510.18379 (coauthored with Vikrant Singhal (OpenDP and Harvard))
#theory #algorithms #privacy
🔗 Paper: www.arxiv.org/abs/2510.18379 (coauthored with Vikrant Singhal (OpenDP and Harvard))
#theory #algorithms #privacy
November 11, 2025 at 1:18 AM
🎉 Abigail Gentle (PhD student) and Clément Canonne's paper "Uniformity Testing under User-Level Local Privacy" has been accepted at #ITCS2026!
🔗 Paper: www.arxiv.org/abs/2510.18379 (coauthored with Vikrant Singhal (OpenDP and Harvard))
#theory #algorithms #privacy
🔗 Paper: www.arxiv.org/abs/2510.18379 (coauthored with Vikrant Singhal (OpenDP and Harvard))
#theory #algorithms #privacy
Reposted by Harish Chandramouleeswaran
Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
Halfspaces are hard to test with relative error
https://arxiv.org/abs/2511.06171
Halfspaces are hard to test with relative error
https://arxiv.org/abs/2511.06171
November 11, 2025 at 5:19 AM
Xi Chen, Anindya De, Yizhi Huang, Shivam Nadimpalli, Rocco A. Servedio, Tianqi Yang
Halfspaces are hard to test with relative error
https://arxiv.org/abs/2511.06171
Halfspaces are hard to test with relative error
https://arxiv.org/abs/2511.06171
Reposted by Harish Chandramouleeswaran
Gautam Chandrasekaran, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
https://arxiv.org/abs/2511.07244
A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
https://arxiv.org/abs/2511.07244
November 11, 2025 at 5:32 AM
Gautam Chandrasekaran, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
https://arxiv.org/abs/2511.07244
A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
https://arxiv.org/abs/2511.07244
Reposted by Harish Chandramouleeswaran
Hadi Hosseini, Vishwa Prakash HV, Aditi Sethia, Jatin Yadav
The Landscape of Almost Equitable Allocations
https://arxiv.org/abs/2511.07395
The Landscape of Almost Equitable Allocations
https://arxiv.org/abs/2511.07395
November 11, 2025 at 6:25 AM
Hadi Hosseini, Vishwa Prakash HV, Aditi Sethia, Jatin Yadav
The Landscape of Almost Equitable Allocations
https://arxiv.org/abs/2511.07395
The Landscape of Almost Equitable Allocations
https://arxiv.org/abs/2511.07395
Reposted by Harish Chandramouleeswaran
Hadi Hosseini, Sanjukta Roy, Aditi Sethia
Fair Societies: Algorithms for House Allocations
https://arxiv.org/abs/2511.07022
Fair Societies: Algorithms for House Allocations
https://arxiv.org/abs/2511.07022
November 11, 2025 at 6:25 AM
Hadi Hosseini, Sanjukta Roy, Aditi Sethia
Fair Societies: Algorithms for House Allocations
https://arxiv.org/abs/2511.07022
Fair Societies: Algorithms for House Allocations
https://arxiv.org/abs/2511.07022
Reposted by Harish Chandramouleeswaran
Haris Aziz, Xinhang Lu, Simon Mackenzie, Mashbat Suzuki
Fair Division with Indivisible Goods, Chores, and Cake
https://arxiv.org/abs/2511.04891
Fair Division with Indivisible Goods, Chores, and Cake
https://arxiv.org/abs/2511.04891
November 10, 2025 at 5:45 AM
Haris Aziz, Xinhang Lu, Simon Mackenzie, Mashbat Suzuki
Fair Division with Indivisible Goods, Chores, and Cake
https://arxiv.org/abs/2511.04891
Fair Division with Indivisible Goods, Chores, and Cake
https://arxiv.org/abs/2511.04891
Reposted by Harish Chandramouleeswaran
Soham Chatterjee, Prahladh Harsha, Mrinal Kumar: Deterministic list decoding of Reed-Solomon codes https://arxiv.org/abs/2511.05176 https://arxiv.org/pdf/2511.05176 https://arxiv.org/html/2511.05176
November 10, 2025 at 6:29 AM
Soham Chatterjee, Prahladh Harsha, Mrinal Kumar: Deterministic list decoding of Reed-Solomon codes https://arxiv.org/abs/2511.05176 https://arxiv.org/pdf/2511.05176 https://arxiv.org/html/2511.05176
Reposted by Harish Chandramouleeswaran
Qian Li, Xin Lyu: Multi-Pass Streaming Lower Bounds for Uniformity Testing https://arxiv.org/abs/2511.03960 https://arxiv.org/pdf/2511.03960 https://arxiv.org/html/2511.03960
November 7, 2025 at 6:31 AM
Qian Li, Xin Lyu: Multi-Pass Streaming Lower Bounds for Uniformity Testing https://arxiv.org/abs/2511.03960 https://arxiv.org/pdf/2511.03960 https://arxiv.org/html/2511.03960
Reposted by Harish Chandramouleeswaran
Egor Gagushin, Marios Mertzanidis, Alexandros Psomas
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
https://arxiv.org/abs/2511.03810
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
https://arxiv.org/abs/2511.03810
November 7, 2025 at 5:42 AM
Egor Gagushin, Marios Mertzanidis, Alexandros Psomas
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
https://arxiv.org/abs/2511.03810
On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
https://arxiv.org/abs/2511.03810
Reposted by Harish Chandramouleeswaran
Mark Chen, Xi Chen, Hao Cui, William Pires, Jonah Stockwell: Boolean function monotonicity testing requires (almost) $n^(1/2)$ queries https://arxiv.org/abs/2511.04558 https://arxiv.org/pdf/2511.04558 https://arxiv.org/html/2511.04558
November 7, 2025 at 6:29 AM
Mark Chen, Xi Chen, Hao Cui, William Pires, Jonah Stockwell: Boolean function monotonicity testing requires (almost) $n^(1/2)$ queries https://arxiv.org/abs/2511.04558 https://arxiv.org/pdf/2511.04558 https://arxiv.org/html/2511.04558
Reposted by Harish Chandramouleeswaran
Hadi Hosseini, Shraddha Pathak, Yu Zhou
Non-Monotonicity in Fair Division of Graphs
https://arxiv.org/abs/2511.03629
Non-Monotonicity in Fair Division of Graphs
https://arxiv.org/abs/2511.03629
November 6, 2025 at 5:04 AM
Hadi Hosseini, Shraddha Pathak, Yu Zhou
Non-Monotonicity in Fair Division of Graphs
https://arxiv.org/abs/2511.03629
Non-Monotonicity in Fair Division of Graphs
https://arxiv.org/abs/2511.03629
Reposted by Harish Chandramouleeswaran
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard
Ideals, Gr\"obner Bases, and PCPs
https://arxiv.org/abs/2511.03703
Ideals, Gr\"obner Bases, and PCPs
https://arxiv.org/abs/2511.03703
November 6, 2025 at 5:20 AM
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan, Madhu Sudan, Sophus Valentin Willumsgaard
Ideals, Gr\"obner Bases, and PCPs
https://arxiv.org/abs/2511.03703
Ideals, Gr\"obner Bases, and PCPs
https://arxiv.org/abs/2511.03703
Reposted by Harish Chandramouleeswaran
Matija Buci\'c, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak: Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching https://arxiv.org/abs/2511.02214 https://arxiv.org/pdf/2511.02214 https://arxiv.org/html/2511.02214
November 5, 2025 at 6:31 AM
Matija Buci\'c, Zhongtian He, Shang-En Huang, Thatchaphol Saranurak: Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching https://arxiv.org/abs/2511.02214 https://arxiv.org/pdf/2511.02214 https://arxiv.org/html/2511.02214
Reposted by Harish Chandramouleeswaran
Diptajit Roy, Nitin Saxena, Madhavan Venkatesh
Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces
https://arxiv.org/abs/2511.02262
Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces
https://arxiv.org/abs/2511.02262
November 5, 2025 at 6:33 AM
Diptajit Roy, Nitin Saxena, Madhavan Venkatesh
Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces
https://arxiv.org/abs/2511.02262
Complexity of counting points on curves and the factor $P_1(T)$ of the zeta function of surfaces
https://arxiv.org/abs/2511.02262
Reposted by Harish Chandramouleeswaran
i use doi2bib.org. paste in the doi, copy out the bibtex entry.
doi2bibdoi2bib
Easy generation of citations in BibTeX format from digital object identifiers (DOIs).
doi2bib.org
November 4, 2025 at 7:46 AM
i use doi2bib.org. paste in the doi, copy out the bibtex entry.
Reposted by Harish Chandramouleeswaran
Academics in Assyria in the 7th c BC complain that admin is preventing them from doing research and teaching
November 3, 2025 at 10:04 AM
Academics in Assyria in the 7th c BC complain that admin is preventing them from doing research and teaching
Reposted by Harish Chandramouleeswaran
Wiktionary's visual aid to demonstrate what the Swedish word for "funny" means
October 31, 2025 at 8:58 PM
Wiktionary's visual aid to demonstrate what the Swedish word for "funny" means
Reposted by Harish Chandramouleeswaran
Alongside the new bulletin, is the first video on the new EATCS Youtube channel!
We learn about different ways to record your seminar talks.
We learn about different ways to record your seminar talks.
October 30, 2025 at 8:12 PM
Alongside the new bulletin, is the first video on the new EATCS Youtube channel!
We learn about different ways to record your seminar talks.
We learn about different ways to record your seminar talks.
Reposted by Harish Chandramouleeswaran
The new EATCS Bulletin #147 is available!
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
October 30, 2025 at 12:44 PM
The new EATCS Bulletin #147 is available!
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
eatcs.org/images/bulle...
In the TCS on the Web Column, I talked to the maintainers of the TCS Blog Aggregator: Nima Anari, Arnab Bhattacharyya and
Gautam Kamath.
It was a very fun interview!
@gautamkamath.com @schmiste-ch.bsky.social
Reposted by Harish Chandramouleeswaran
Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma: Testing forbidden order-pattern properties on hypergrids https://arxiv.org/abs/2510.22845 https://arxiv.org/pdf/2510.22845 https://arxiv.org/html/2510.22845
October 28, 2025 at 6:31 AM
Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma: Testing forbidden order-pattern properties on hypergrids https://arxiv.org/abs/2510.22845 https://arxiv.org/pdf/2510.22845 https://arxiv.org/html/2510.22845
Reposted by Harish Chandramouleeswaran
A little-known algorithmic process called “differential privacy” helps keep census data anonymous. Conservatives want it gone.
The Republican Plan to Reform the Census Could Put Everyone’s Privacy at Risk
A little-known algorithmic process called “differential privacy” helps keep census data anonymous. Conservatives want it gone.
wrd.cm
October 28, 2025 at 10:05 AM
A little-known algorithmic process called “differential privacy” helps keep census data anonymous. Conservatives want it gone.
Reposted by Harish Chandramouleeswaran
The simplex algorithm is super efficient. 80 years of experience says it runs in linear time. Nobody can explain _why_ it is so fast.
We invented a new algorithm analysis framework to find out.
We invented a new algorithm analysis framework to find out.
Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book
Narrowing the gap between theory and practice is a longstanding goal of the algorithm analysis community. To further progress our understanding of how algorithms work in practice, we propose a new alg...
arxiv.org
October 27, 2025 at 1:43 AM
The simplex algorithm is super efficient. 80 years of experience says it runs in linear time. Nobody can explain _why_ it is so fast.
We invented a new algorithm analysis framework to find out.
We invented a new algorithm analysis framework to find out.
Reposted by Harish Chandramouleeswaran
L\'aszl\'o Kozma, Michal Opler: Compact representations of pattern-avoiding permutations https://arxiv.org/abs/2510.20382 https://arxiv.org/pdf/2510.20382 https://arxiv.org/html/2510.20382
October 24, 2025 at 6:31 AM
L\'aszl\'o Kozma, Michal Opler: Compact representations of pattern-avoiding permutations https://arxiv.org/abs/2510.20382 https://arxiv.org/pdf/2510.20382 https://arxiv.org/html/2510.20382