Anil Shukla

Senior Research Fellow
Theoretical Computer Science
The Institute of Mathematical Sciences, Chennai
Email: anilsh AT imsc DOT res DOT in, shukla DOT anil2 AT gmail DOT com

I am a Ph.D student in Theoretical Computer Science at IMSc. My advisor is Prof. Meena Mahajan.

 

Research Interests

Proof complexity, computational complexity.

 

Education

• August, 2011 - September, 2016
  PhD in Theoretical Computer Science, The Institute of Mathematical Sciences, Chennai, India.
  Advisor: Meena Mahajan.
  
• August, 2008 - August, 2010
  M.Tech. in Computer Science and Engineering, Indian Institute of Technology Kanpur, India.
  Advisor: Shashank K. Mehta.
  
• August, 2002 - May, 2006
  B. E. in Computer Science and Engineering, Chouksey Engineering College, Bilaspur, India.
  

 

Publications

• Relating two Width Measures for Resolution Proofs.
  Andreas Krebs, Meena Mahajan, and Anil Shukla.
  ECCC TR 16-164.
• Understanding Cutting Planes for QBFs.
  Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Anil Shukla.
  Proceedings of the 36th Annual International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 13--15 December 2016, (Chennai, India), LIPIcs.
  
• Level-Ordered $Q$-Resolution and Tree-Like $Q$-Resolution are Incomparable.
  Meena Mahajan and Anil Shukla
  Information Processing Letters. 116(3), 256-258, 2016.
  
• Are Short Proofs Narrow? QBF Resolution is not Simple.
  Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Anil Shukla.
  Proceedings of 33rd Symposium on Theoretical Aspects of Computer Science (STACS), LIPIcs series Vol 47, pages 15:1--15:14, 2016.
  DOI: 10.4230/LIPIcs.STACS.2016.15
• Feasible Interpolation for QBF Resolution Calculi.
  Olaf Beyersdorff, Leroy Chew, Meena Mahajan and Anil Shukla.
  Proceedings of 42nd ICALP 2015 (Kyoto, Japan). Springer-Verlag Lecture Notes in Computer Science Vol 9134, pp 180-192.
  

 

Workshops Attended

• The First Indian SAT+SMT School, December 4-10, 2016.
  at Tata Institute of Fundamental Research, Mumbai, India.
  
• Dagstuhl Seminar 16381 SAT and Interactions, September 18-23, 2016.
  at Octavie-Allee, 66687 Warden, Germany
  
• Academic Research Summit, Innovate for Digital India, January 29-30, 2016.
  at Infosys Ltd. Hinjewadi Campus, Phase II, Pune, India
  
• Indo-UK workshop on Computational Complexity Theory , January 5-9, 2015.
  at The Institute of Mathematical Sciences, Chennai, India.
  
• Workshop on Recent Trends in Algorithms and Complexity , August 10-12, 2012.
  at Mysore Park, Infosys campus, Mysore, India.
  

 

Talks

• FSTTCS, December 15, 2016, Chennai, India.
  
• The First Indian SAT+SMT School, December 8, 2016, Mumbai, India.
  
• Dagstuhl Seminar 16381, September 20, 2016, Warden, Germany.
  
• STACS, February 20, 2016, Orléans, France.
  
• IMSc, January 21, 2016, Chennai, India.
  

 

Research visit

• School of Computing, University of Leeds, UK.
  April 25--May 26, 2015.
  Project Name: ``Correctness by Construction".
  Host: Prof. Olaf Beyersdorff .