Work Experience
- Assistant Professor
Computer Science and Engineering, Indian Institute of Technology Ropar. (11 June, 2018 – Present)
-
Assistant Professor
Computer Science and Engineering, Indian Institute of Technology Jodhpur. (8 May, 2017 – 21 May, 2018)
-
Project Engineer
Computer Science and Engineering, Indian Institute of Technology Kanpur. (7 November, 2016 – 16 April, 2017)
Mentor: Dr. Raghunath Tewari
Education
Research Interests
Proof complexity, Computational complexity
Journal Publications
-
Understanding Cutting Planes for QBFs
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
Information and Computation, Volume 262 (2018).
-
Are Short Proofs Narrow? QBF Resolution is Not So Simple
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
ACM Transactions on Computational Logic, Volume 19 (2018).
-
Feasible Interpolation for QBF Resolution Calculi
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
Logical Methods in Computer Science, Volume 13 (2017).
-
Level-Ordered Q-Resolution and Tree-Like Q-Resolution are Incomparable
Meena Mahajan, Anil Shukla.
Information Processing Letters, Volume 116 (2016).
Conference Publications
-
Circuits, Proofs and Propositional Model Counting
Sravanthi Chede, Leroy Chew, Anil Shukla.
44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2024.
-
Extending Merge Resolution to a Family of QBF-Proof Systems
Sravanthi Chede, Anil Shukla.
40th International Symposium on Theoretical Aspects of Computer Science (STACS) 2023.
-
Understanding Cutting Planes for QBFs
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2016.
-
Are Short Proofs Narrow? QBF Resolution is not Simple
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
33rd Symposium on Theoretical Aspects of Computer Science (STACS) 2016.
-
Feasible Interpolation for QBF Resolution Calculi
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla.
42nd International Colloquium on Automata, Languages, and Programming (ICALP) 2015.
Technical Reports
Preprints
-
Understanding Nullstellensatz for QBFs
Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla.
Electron. Colloquium Comput. Complex. (ECCC), TR23 (2023).
-
Does QRAT simulate IR-calc? QRAT simulation algorithm for ∀Exp+Res cannot be lifted to IR-calc
Sravanthi Chede, Anil Shukla.
Electron. Colloquium Comput. Complex. (ECCC), TR21 (2021).
-
Relating two width measures for resolution proofs
Andreas Krebs, Meena Mahajan, Anil Shukla.
Electron. Colloquium Comput. Complex. (ECCC), TR16 (2016).
Students
Ph.D. Students
-
Sravanthi Chede (2020–present)
Title: Proof Complexity of Quantified Boolean Formulas and Propositional Model Counting
M.Tech. Students
-
Sushruta Behera (2024–present) — Roll: 2024csm1017
Title: Ongoing
-
Umesh Meena (2022–24) — Roll: 2022csm1016
Title: Optimizing Graph Space Complexity: Harnessing Semi-Streaming Algorithms
-
Hanumat Lal Vishwakarma (2021–23) — Roll: 2021csm1019
Title: Deterministic Graph Sparsification Algorithm of Dynamic Fractional Matching
-
KM Pooja (2021–23) — Roll: 2021csm1011
Title: Connectivity Problem in Dynamic Graph Using Spanning Trees
-
Harpal Singh (2020–22) — Roll: 2020aim1001
Title: Resolution Proof Systems
Teaching
Current teaching
CS302: Design and Analysis of Algorithms, IIT Ropar. (Enrollment: 95)
Past courses
(show)
IIT Ropar
(show)
- CS306: Theory of Computation, January–May, 2025, IIT Ropar. (Enrollment: 93)
- CS201: Data Structures, July–December, 2024, IIT Ropar. (Enrollment: 138)
- CS306: Theory of Computation, January–May, 2024, IIT Ropar. (Enrollment: 92)
- CS536: Graph Theory, January–May, 2024, IIT Ropar. (Enrollment: 17)
- CS201: Data Structures, July–December, 2023, IIT Ropar. (Enrollment: 127)
- CS536: Graph Theory, January–May, 2023, IIT Ropar. (Enrollment: 12)
- CS306: Theory of Computation, January–May, 2023, IIT Ropar. (Enrollment: 96)
- CS201: Data Structures, July–December, 2022, IIT Ropar. (Enrollment: 131)
- CS536: Graph Theory, January–May, 2022, IIT Ropar. (Enrollment: 25)
- CS306: Theory of Computation, January–May, 2022, IIT Ropar. (Enrollment: 83)
- CS201: Data Structures, July–December, 2021, IIT Ropar. (Enrollment: 150)
- CS306: Theory of Computation, January–May, 2021, IIT Ropar. (Enrollment: 74)
- CS536: Graph Theory, July–December, 2020, IIT Ropar. (Enrollment: 05)
- CS506: Data Structures and Algorithm, July–December, 2020, IIT Ropar. (Enrollment: 39)
- GE103: Introduction to Computing and Data Structures, January–July, 2020, IIT Ropar. (Enrollment: 170)
- CS302: Analysis and Design of Algorithms, July–December, 2019, IIT Ropar. (Enrollment: 68)
- CSL355: Logic and Computability, January–July, 2019, IIT Ropar. (Enrollment: 48)
- GE109: Introduction to Engg. Products, January–July, 2019, IIT Ropar. (Enrollment: 25)
- GE109: Introduction to Engg. Products, July–December, 2018, IIT Ropar. (Enrollment: 25)
- GE101: Technology Museum Lab, July–December, 2018, IIT Ropar. (Enrollment: 25)
IIT Jodhpur
(show)
- CS621: Advanced Data Structures and Algorithms, January–December, 2019, IIT Jodhpur. (Enrollment: 5)
- CS655: Computational Complexity, January–May, 2018, IIT Jodhpur. (Enrollment: 5)
- CS202: Theory of Computation, January–May, 2018, IIT Jodhpur. (Enrollment: 43)
- CS212: Object Oriented Analysis and Design, July–December, 2017, IIT Jodhpur. (Enrollment: 42)
- CS314: Algorithm Design and Analysis, July–December, 2017, IIT Jodhpur. (Enrollment: 41)
IIT Jammu
(show)
- CSL022U4E: Advanced Algorithms, July–December, 2022, IIT Jammu. (Enrollment: 7)
NPTEL
(show)
-
noc24_cs92: Discrete Mathematics
(with Dr. Sudarshan Iyengar), July–October, 2024, NPTEL. (Enrollment: 3313, Exam Registration: 389)
-
noc24_cs58: Discrete Mathematics
(with Dr. Sudarshan Iyengar), January–April, 2024, NPTEL. (Enrollment: 5810, Exam Registration: 747)
-
noc23_cs109: Discrete Mathematics
(with Dr. Sudarshan Iyengar), July–October, 2023, NPTEL. (Enrollment: 4958, Exam Registration: 619)
Workshops Attended
- Complexity Theory Update Meeting, IMSc, Chennai, 2025
- Milestones and Motifs in the Theory of Proofs, Algebraic Computation, and Lower Bounds, IIT Gandhinagar, 2024
- Dagstuhl Seminar 20061 on SAT and Interactions, Germany, 2020
- Indian SAT+SMT School, TIFR, Mumbai, 2016
- Dagstuhl Seminar 16381 on SAT and Interactions, Germany, 2016
- Academic Research Summit, Infosys Pune, 2016
- Indo-UK Workshop on Computational Complexity, IMSc, 2015
- Workshop on Algorithms and Complexity, Infosys Mysore, 2012
Talks
-
Complexity Theory Update Meeting at IMSc Chennai on January 23, 2025.
Proof Complexity of Propositional Model Counting. [Slides]
-
Milestones and Motifs in the Theory of Proofs, Algebraic Computation, and Lower Bounds at IIT Gandhinagar on December 15, 2024.
Extending Merge Resolution to a Family of QBF-Proof Systems. [Slides]
-
IRISS at Amity University, Kolkata on January 20, 2017.
Are Short Proofs Narrow? QBF Resolution is not Simple. [Slides]
-
The First Indian SAT+SMT School at Mumbai on December 8, 2016.
Are Short Proofs Narrow? QBF Resolution is not Simple.
-
FSTTCS at CMI, Chennai on December 15, 2016.
Understanding Cutting Planes for QBFs. [Slides]
-
Dagstuhl Seminar 16381 at Warden, Germany on September 20, 2016.
Understanding Cutting Planes for QBFs.
-
STACS at Orléans, France on February 20, 2016.
Are Short Proofs Narrow? QBF Resolution is not Simple. [Slides]
Research Visit
Photo Gallery
View Photo Gallery
