default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKusha Sareen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[i9]Harman Singh, Xiuyu Li, Kusha Sareen, Monishwaran Maheswaran, Sijun Tan, Xiaoxia Wu, Junxiong Wang, Alpay Ariyak, Qingyang Wu, Samir Khaki, Rishabh Tiwari, Long Lian, Yucheng Lu, Boyi Li, Alane Suhr, Ben Athiwaratkun, Kurt Keutzer:
V1: Unifying Generation and Self-Verification for Parallel Reasoners. CoRR abs/2603.04304 (2026)- [i8]Alexandre Lacoste, Nicolas Gontier, Oleh Shliazhko, Aman Jaiswal, Kusha Sareen, Shailesh Nanisetty, Joan Cabezas, Manuel Del Verme, Omar G. Younis, Simone Baratta, Matteo Avalle, Imene Kerboua, Xing Han Lù, Elron Bandel, Michal Shmueli-Scheuer, Asaf Yehudai, Leshem Choshen, Jonathan Lebensold, Sean Hughes, Massimo Caccia, Alexandre Drouin, Siva Reddy, Tao Yu, Yu Su, Graham Neubig, Dawn Song:
CUBE: A Standard for Unifying Agent Benchmarks. CoRR abs/2603.15798 (2026) - [i7]Kusha Sareen, Mohammad Pedramfar, Sékou-Oumar Kaba, Mehran Shakerinava, Siamak Ravanbakhsh:
The Role of Symmetry in Optimizing Overparameterized Networks. CoRR abs/2604.25150 (2026) - [i6]Rishabh Tiwari, Kusha Sareen, Lakshya A. Agrawal, Joseph E. Gonzalez, Matei Zaharia, Kurt Keutzer, Inderjit S. Dhillon, Rishabh Agarwal, Devvrit Khatri:
Learning, Fast and Slow: Towards LLMs That Adapt Continually. CoRR abs/2605.12484 (2026) - 2025
- [c3]Vineet Jain, Kusha Sareen, Mohammad Pedramfar, Siamak Ravanbakhsh:
Diffusion Tree Sampling: Scalable inference‑time alignment of diffusion models. NeurIPS 2025 - [c2]Oumar Kaba, Kusha Sareen, Daniel Levy, Siamak Ravanbakhsh:
Energy Loss Functions for Physical Systems. NeurIPS 2025 - [i5]Kusha Sareen, Daniel Levy, Arnab Kumar Mondal, Sékou-Oumar Kaba
, Tara Akhound-Sadegh, Siamak Ravanbakhsh:
Symmetry-Aware Generative Modeling through Learned Canonicalization. CoRR abs/2501.07773 (2025) - [i4]Kusha Sareen, Morgane M. Moss, Alessandro Sordoni, Rishabh Agarwal, Arian Hosseini:
Putting the Value Back in RL: Better Test-Time Scaling by Unifying LLM Reasoners With Verifiers. CoRR abs/2505.04842 (2025) - [i3]Vineet Jain, Kusha Sareen, Mohammad Pedramfar, Siamak Ravanbakhsh:
Diffusion Tree Sampling: Scalable inference-time alignment of diffusion models. CoRR abs/2506.20701 (2025) - [i2]Sékou-Oumar Kaba, Kusha Sareen, Daniel Levy, Siamak Ravanbakhsh:
Energy Loss Functions for Physical Systems. CoRR abs/2511.02087 (2025) - 2024
- [c1]Manasseh Ahmed, Tsun-Ming Cheung, Hamed Hatami, Kusha Sareen:
Communication Complexity and Discrepancy of Halfplanes. SoCG 2024: 5:1-5:17 - 2023
- [i1]Manasseh Ahmed, TsunMing Cheung, Hamed Hatami, Kusha Sareen:
Communication complexity of half-plane membership. Electron. Colloquium Comput. Complex. TR23: Article TR23-050 (2023)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-16 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
