Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Cited by
All
Since 2019
Citations
30
30
h-index
2
2
i10-index
1
1
0
10
5
2022
2023
2024
8
10
5
Public access
View all
View all
1 article
0 articles
available
not available
Based on funding mandates
Co-authors
Meena Mahajan
The Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India
Verified email at imsc.res.in
Marc Vinyals
University of Auckland
Verified email at auckland.ac.nz
Yuval Filmus
Associate Professor, Technion
Verified email at cs.technion.ac.il
Tomáš Peitl
TU Wien
Verified email at ac.tuwien.ac.at
Olaf Beyersdorff
Professor of Theoretical Computer Science, Friedrich Schiller University Jena, Germany
Verified email at uni-jena.de
Karunakaran Murali Krishnan
Department of Computer Science and Engineering, NIT Calicut
Verified email at nitc.ac.in
Follow
Gaurav Sood
Assistant Professor, Indian Institute of Technology, Mandi
Verified email at campus.haifa.ac.il
Computational Complexity
Proof Complexity
Articles
Cited by
Public access
Co-authors
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
Maxsat resolution and subcube sums
Y Filmus, M Mahajan, G Sood, M Vinyals
ACM Transactions on Computational Logic 24 (1), 1-27
, 2023
22
2023
Hard QBFs for merge resolution
O Beyersdorff, J Blinkhorn, M Mahajan, T Peitl, G Sood
ACM Transactions on Computation Theory 16 (2), 1-24
, 2024
6
2024
QBF Merge Resolution is powerful but unnatural
M Mahajan, G Sood
arXiv preprint arXiv:2205.13428
, 2022
2
2022
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
G Sood, KM Krishnan
Theoretical Computer Science 885, 30-40
, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–4
Show more
Privacy
Terms
Help
About Scholar
Search help