Amit Rajaraman

Orcid: 0000-0001-9460-0725

According to our database1, Amit Rajaraman authored at least 8 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Markov Chains Approximate Message Passing.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
Faster MAX-CUT on Bounded Threshold Rank Graphs.
CoRR, November, 2025

The Fundamental Limits of Recovering Planted Subgraphs.
CoRR, March, 2025

Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

The Fundamental Limits of Recovering Planted Subgraphs (extended abstract).
Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024
Fast Mixing in Sparse Random Ising Models.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Sampling from Convex Sets with a Cold Start using Multiscale Decompositions.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023


  Loading...