default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnil Shukla
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Sravanthi Chede, Leroy Chew, Anil Shukla:
Circuits, Proofs and Propositional Model Counting. FSTTCS 2024: 18:1-18:23- [i14]Sravanthi Chede, Leroy Chew, Anil Shukla:
Circuits, Proofs and Propositional Model Counting. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c4]Sravanthi Chede, Anil Shukla:
Extending Merge Resolution to a Family of QBF-Proof Systems. STACS 2023: 21:1-21:20 - [i13]Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla:
Understanding Nullstellensatz for QBFs. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i12]Sravanthi Chede, Anil Shukla:
Extending Merge Resolution to a Family of Proof Systems. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i11]Anish Mallick, Anil Shukla:
Extending Prolog for Quantified Boolean Horn Formulas. CoRR abs/2103.01046 (2021) - [i10]Sravanthi Chede, Anil Shukla:
Does QRAT simulate IR-calc? QRAT simulation algorithm for ∀Exp+Res cannot be lifted to IR-calc. CoRR abs/2107.04547 (2021) - [i9]Sravanthi Chede, Anil Shukla:
QRAT Polynomially Simulates Merge Resolution. CoRR abs/2107.09320 (2021) - [i8]Sravanthi Chede, Anil Shukla:
Extending Merge Resolution to a Family of Proof Systems. CoRR abs/2112.11044 (2021) - [i7]Sravanthi Chede, Anil Shukla:
Does QRAT simulate IR-calc? QRAT simulation algorithm for $\forall$Exp+Res cannot be lifted to IR-calc. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]Sravanthi Chede, Anil Shukla:
QRAT Polynomially Simulates Merge Resolution. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2018
- [j4]Olaf Beyersdorff
, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding cutting planes for QBFs. Inf. Comput. 262: 141-161 (2018) - [j3]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution Is Not So Simple. ACM Trans. Comput. Log. 19(1): 1:1-1:26 (2018) - 2017
- [j2]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. Log. Methods Comput. Sci. 13(2) (2017) - [i5]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j1]Meena Mahajan, Anil Shukla:
Level-ordered Q-resolution and tree-like Q-resolution are incomparable. Inf. Process. Lett. 116(3): 256-258 (2016) - [c3]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. FSTTCS 2016: 40:1-40:15 - [c2]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. STACS 2016: 15:1-15:14 - [i4]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. CoRR abs/1611.01328 (2016) - [i3]Andreas Krebs, Meena Mahajan, Anil Shukla:
Relating two width measures for resolution proofs. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c1]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. ICALP (1) 2015: 180-192 - [i2]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. Electron. Colloquium Comput. Complex. TR15 (2015) - [i1]Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. Electron. Colloquium Comput. Complex. TR15 (2015)
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 2025-01-09 12:49 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
